ISC (Commerce)
ISC (Science)
Academic Year: 2025-2026
Date & Time: 27th March 2026, 2:00 pm
Duration: 3h
Advertisements
Instructions to Candidates
- You are allowed an additional fifteen minutes for only reading the question paper.
- You must NOT start writing during the reading time.
- This question paper has 12 printed pages.
- It is divided into two parts: Part I and Part II.
- It has eleven questions in all.
- Part I is compulsory and has two questions.
- While attempting Multiple Choice Questions in Part I, you are required to write only ONE option as the answer.
- Part II is divided into three sections: A, B and C.
- Each section in Part II has three questions. Any two questions have to be attempted from each section.
- The intended marks for questions are given in brackets [].
According to the Principle of Duality, the Boolean equation Q'•0+P'•Q'+P'• Q = P' will be equivalent to:
Q•0 + P•Q + P•Q' = P
Q'•1 + P•Q' + P•Q' = P'
(Q' + 1)•(P' + Q')•(P' + Q) = P'
(Q' + 0)•(P' + Q')•(P' + Q) = P'
Chapter:
Consider the following statement written in class Student where school_Name is its data member.
static final String school_Name = "Co-Ed School";
Which of the following statements are valid for school_Name?
- All objects of class Student share the same value of school_Name.
- The value of school_Name cannot be changed during program execution.
- The keywords static and final cannot be used together for a variable.
Only I and II
Only II and III
Only I and III
Only III
Chapter:
Study the given propositions and the statements marked Assertion and Reason that follow. Choose the correct option based on your analysis.
P = You practise regularly
Q = You become skilled
S1 = P => Q
S2 = ~PVQ
Assertion: S1 and S2 are logically equivalent.
Reason: A conditional statement P => Q can be expressed as ~ PVQ.
Both Assertion and Reason are true and Reason is the correct explanation for Assertion.
Both Assertion and Reason are true but Reason is not the correct explanation for Assertion.
Assertion is true and Reason is false.
Both Assertion and Reason are false.
Chapter:
The Boolean equations a + 1 = a and a • 0 = 0 correspond to ______.
Involution Law
Law of Identity
Distributive Law
Law of Complements
Chapter:
The worst case complexity for following code segment is:
for(int i=1;i<=n;i++)
{
for(int j=1;j<=)
{
statement;
}
}O(n+i)
O(n×i)
O(n)
O(n2)
Chapter:
Assertion: An interface in Java contains abstract and non-abstract methods.
Reason: All methods in an interface must be implemented by any class that extends this interface.
Both Assertion and Reason are true and Reason is the correct explanation for Assertion.
Both Assertion and Reason are true but Reason is not the correct explanation for Assertion.
Assertion is true and Reason is false.
Both Assertion and Reason are false.
Chapter:
The complement of the Boolean expression a • b' + a' + a' • b is ______.
a + b' • a • a' + b
(a' + b) • a • (a + b')
(a + b') • a' • (a + b')
a' • b + a + a • b
Chapter:
Assertion: The return statement enables the exit of the program control from the current method.
Reason: If a method’s return type is void, it can still contain return 0 statement to return nothing.
Both Assertion and Reason are true and Reason is the correct explanation for Assertion.
Both Assertion and Reason are true but Reason is not the correct explanation for Assertion.
Assertion is true and Reason is false.
Both Assertion and Reason are false.
Chapter:
Consider the two propositions given below:
A = You use ecofriendly methods.
B = Pollution is reduced.
If A implies to B, then write its Contrapositive statement.
Chapter:
Convert the following infix notation to prefix form.
P/Q + (S * F + X/R)
Chapter:
Advertisements
A matrix G[3...7, 2...5] is stored in the memory, with each element requiring 4 bytes of storage. If the address of G[5][4] is 6000, find the base address when the matrix is stored column-major-wise.
Chapter:
The following function workOut() is a part of some class. Assume 'n' is a positive integer.
String workOut (int n)
{ if (n == 0)
return"";
int rem = n% 16;
char cr = (rem < 10)? (char) (rem + '0'): (char) (rem - 10+'A');
return workOut (n/16) + cr;
}
Answer the questions given below with the dry run / working.
- What will the function workOut(220) return? [2]
- What is the function workOut() performing apart from recursion? [1]
Chapter:
The following function is Tech() is a part of some class which is used to check if a given number is a Tech number or not. There are some places in the code marked by ?1?, ?2?, ?3? which may be replaced by a statement / expression so that the function works properly.
A number is Tech number if the count of digits is even and the square of the sum of its two equal halves is equal to the number itself.
Example: 2025 = 20 + 25 = (45)2 = 2025
boolean isTech(int n)
{
String s = String.valueOf(n);
int len = ?1?;
if (len %2!= 0)
return ?2?:
intfirst = Integer.parselnt(s.substring(0, len/2));
int second = Integer.parseInt(s.substring(len/2));
int sum =first + second;
return ?3? == n;
}
What are the expressions or statements at?1?, ?2? and ?3?
Chapter:
Draw the logic gate diagram for decoding the binary numbers {0011, 0100, 0101, 0111, 1011, 1110} to hexa-decimal numbers.
Chapter:
The Chain rule states that [(a=>b) • (b=>e)] => (a=>c). Prove this rule using Boolean laws.
Chapter:
Given that P = 0, Q = 1, R = 0, S = 0, write its:
Maxterm
Chapter:
Given that P = 0, Q = 1, R = 0, S = 0, write its:
Minterm
Chapter:
According to the ancient laws of the Valley of Peace, a candidate can become the Dragon Warrior only if they satisfy any one of the following conditions:
- The candidate belongs to the Panda Clan and has been trained for more than 5 years under the Grand Master
- The candidate possesses the Secret Chi Power but does not belong to the Panda
- The Panda candidate is recommended by the Grand Master, but neither belongs to the Clan nor has been trained for more than 5 years
The inputs are:
| INPUTS | |
| C | Belongs to the Panda Clan |
| T | Trained for more than 5 years |
| P | Possesses Secret Chi Power |
| R | Recommended by the Grand Master |
(In all the above cases, 1 indicates YES and 0 indicates NO)
Output: X − Denotes eligibility to become the Dragon Warrior
(1 = eligible and 0 = not eligible)
Draw the truth table for the inputs and outputs given above. Write the for X(C, T, P, R).
Chapter:
Construct the logic gate diagram for a Full Adder using two Half Adders.
Chapter:
Advertisements
Draw a truth table to verify if the following proposition is a Tautology, a contradiction, or a Contingency.
(A∧∼B)=>(~A∨B)
Chapter:
Reduce the Boolean function F(A,B,C,D) = π (0,1,2,3,7,8,9,10,11,12,13,15) by using 4-variable Karnaugh map, showing the various groups (i.e., octal, quads and pairs).
Chapter:
Draw the logic gate diagram for the reduced expression. Assume that the variables and their complements are available as inputs.
Chapter: [2] Computer Hardware
From the logic gate diagram given below, derive the Boolean expression for (1), (2), and Q. Reduce the derived expression.

Chapter:
Draw the logic gate diagram for 2-input AND gate using NOR gates only. Show the expression at each step.
Chapter:
A class TimeOp has been defined to add any two accepted time periods.
Example: Time A = 6 hours 35 minutes 40 seconds
Time B = 7 hours 45 minutes 30 seconds
Time A + Time B = 14 hours 21minutes 10 seconds
(where 60 minutes = 1 hour and 60 seconds = 1 minute)
The details of the members of the class are given below:
| Data member/instance variable: | |
| arr[] | : integer array to hold three elements (hours, minutes and seconds) |
| Methods/Member functions: | |
| TimeOp() | : default constructor |
| void readTime() | : to accept the elements of the array |
| TimeOp addTime(TimeOp tt) | : to add the time of the parameterised object tt and the current object, to store it in a local object and return it |
| void dispTime() : |
to display the array elements in hours:minutes:seconds format
|
Specify the class TimeOp giving the details of the constructor(), void readTime(), TimeOp addTime(TimeOp) and void dispTime(). Define the main() function to create objects and call the functions accordingly to enable the task.
Chapter:
A class Trimorphic has been defined to accept a positive integer from the user and display if it is a Trimorphic number or not.
[A number is said to be Trimorphic if the cube of the number ends with the number itself.]
Example 1: 243 = 13824 ends with 24
Example 2: 53 = 125 ends with 5
The details of the members of the class are given below:
| Class name | : Trimorphic |
|
Data members/instance variables:
|
|
| n | : to store the number |
| cube |
: to store the cube of the number |
| Methods/Member functions: | |
| Trimorphic() | : constructor to initialise the data members with legal initial values |
| void accept() | : to accept a number |
| boolean check(int num, long c) | : to compare num with the ending digits of c using the recursive technique |
| void result() |
: to check whether the given number is a trimorphic number by invoking the function check(), and to display an appropriate message |
Specify the class Trimorphic, giving the details of the constructor(), void accept(), boolean check() and void result(). Define the main() function to create an object and call the functions accordingly to enable the task.
Chapter:
State any two differences between iteration and recursion.
Chapter:
Design a class PendulumS to perform an operation on a word containing alphabets in upper case only. Rearrange the word by putting the lowest ASCII value character at the centre and the second lowest ASCII value character to its right and the third to its left and so on.
Example 1: Input: COMPUTER
Output: TPMCEORU
Example 2: Input: SCIENCE
Output: SIECCEN
The details of the members of the class are given below:
| Class name | : PendulumS |
| Data members/instance variables: | |
| wrd | : to store the original word |
| newwrd | : to store the rearranged word |
| Methods/Member functions: | |
| PendulumS(String k) | : parameterised constructor to initialise wrd = k and newwrd = "" |
| int minCharIndex(String str) | : to find the index of the minimum ASCII value character in str and return it |
| void arrange() | : to rearrange the characters of wrd as per the given instructions and store it in newwrd by invoking minCharIndeх() |
| void display() | : to display the original word and the rearranged word |
Specify the class PendulumS giving the details of the constructor( ), int minCharIndex(String), void arrange() and void display(). Define the main( ) function to create an object and call the functions accordingly to enable the task.
Chapter:
In any internet Each browser, new webpage a user can visit new webpages and go back to previously visited URL is stored in browser’s memory such that when the user clicks ‘Back’ button, the previous webpage gets displayed. The details of the members of the class are given below:
| Class name | : Browser |
| Data members/instance variables: | |
| pages[ ] | : an array to hold the URLs of visited webpages |
| max | : to store the maximum capacity of the array |
| top | : to point to the index of the last visited webpage |
| Methods/Member functions: | |
| Browser(int cap) | constructor to assign max = cap and top = −1 |
| void visit(String url) | to add URL of a new webpage if possible, else display the message “Browser history full” |
| String back( ) |
to remove and return the last visited webpage URL, if present, else to return the message “No previous browser history” |
- Specify the class Browser, giving details of the functions void visit(String) and String back(). Assume that the other functions have been defined.
- Name the entity described above and state its principle.
Chapter:
A superclass Hotel has been defined to store the details of a hotel. Define a subclass Customer to calculate the total bill for a customer as per the following criteria:
| Room type | Additional Amount |
| Executive | 10% of room rent |
| Suite | 20% of room rent |
The details of the members of both the classes are given below:
| Class name | : Hotel |
| Data members/instance variables: | |
| hname | : to store hotel name |
| roomrent | : to store the rent per day |
| Methods/Member functions: | |
| Hotel(...) | : parameterised constructor to assign values to its data members |
| void show() | : to display hotel details |
| Class name | : Customer |
| Data members/instance variables: | |
| cname | : to store customer name |
| days | : to store the number of days of stay |
| type | : to store the room type |
| surcharge | : to store the additional amount |
| amt | : to store the total amount |
| Methods/Member functions: | |
| Customer(...) | : parameterised constructor to assign values to data members of both the classes |
| void compute() | : to calculate the surcharge based on the room type as given above. Also, to calculate the total amount as: (room rent + surcharge) x days |
| void show() | : to display hotel and customer details |
Assume that the superclass Hotel has been defined. Using the concept of Inheritance, specify the class Customer, giving details of constructor(...), void compute() and void show()
The super class, main function and algorithm need NOT be written.
Chapter:
A linked list is formed from the objects of the class Word. The structure of the class Word is given below:
class Word
{
String value;
Word next;
}
Write an Algorithm OR a Method to count and display the number of nodes whose value starts with a consonant.
The method declaration is as follows:
void countConsonant(Word first)
Chapter:
Answer the following questions based on the diagram of a Binary Tree given below:

- Write the pre-order traversal of the above tree.
- State the level of Node Q when the root is at level 0.
- State the size of the left subtree and the right subtree.
Chapter:
Other Solutions
Submit Question Paper
Help us maintain new question papers on Shaalaa.com, so we can continue to help studentsonly jpg, png and pdf files
CISCE previous year question papers Class 12 Computer Science (Theory) with solutions 2025 - 2026
Previous year Question paper for CISCE Class 12 -2026 is solved by experts. Solved question papers gives you the chance to check yourself after your mock test.
By referring the question paper Solutions for Computer Science (Theory), you can scale your preparation level and work on your weak areas. It will also help the candidates in developing the time-management skills. Practice makes perfect, and there is no better way to practice than to attempt previous year question paper solutions of CISCE Class 12.
How CISCE Class 12 Question Paper solutions Help Students ?
• Question paper solutions for Computer Science (Theory) will helps students to prepare for exam.
• Question paper with answer will boost students confidence in exam time and also give you an idea About the important questions and topics to be prepared for the board exam.
• For finding solution of question papers no need to refer so multiple sources like textbook or guides.
