Choose the correct option.
- (a)$A \cdot ( A' + B) = A$
- (b)$A + ( A \cdot B) = A$
- (c)Both (a) and (b)
- (d)$A \cdot ( B + C ) = A \cdot B + A \cdot C$
Show answer
Answer
Correct option: (b)
The ISC Computer Science 2024 Specimen Paper for Class 12: all 28 questions, 70 marks in all, in printed order and in full. It is free to download: tap "Show answer" under a question to see its answer, or use the download button to save the questions as a PDF, with or without answers; "Print this paper" below prints it as it was set.
Choose the correct option.
Answer
Correct option: (b)
Study the Assertion and Reason and choose the correct option.
Assertion: $A=0\quad B=1\quad C=0$ and $D=1$ and minterm is $A' \cdot B \cdot C' \cdot D$
Reason: The final sum term must be $0$ so $A$ and $C$ are complemented.
Answer
Correct option: (c)
Choose the correct option.
Answer
Correct option: (b)
Choose the correct option.
Answer
Correct option: (b)
Choose the correct option.
Answer
Correct option: (b)
Study the Assertion and Reason and choose the correct option.
Assertion: Boolean algebra and Binary number system are different from each other.
Reason: There are some basic operations like AND, OR and NOT which are performed only in Boolean algebra.
Answer
Correct option: (a)
Answer the following.
Answer
static, when used with a data member of a class, makes it a class variable instead of an instance variable: only a single copy of that data member is created and it is shared by all objects of the class (rather than a separate copy for each object). Its value persists across all objects and can be accessed directly using the class name, even without creating an object.Answer the following.
Answer
Answer the following.
Answer
Answer the following.
Answer
Convert the following.
Answer
Solve the following.
Answer
Final answer: 3952
Answer the following questions on the given code.
void Try(char ch[],int x)
{ System.out.println(ch); char temp;
if ( x<ch.length/2)
{ temp=ch[x];
ch[x]= ch[ch.length-x-1];
ch[ch.length-x-1] = temp;
Try(ch,x+1);
} }
void Try1(String n)
{ char c[]=new char[n.length()];
for(int i=0;i<c.length;i++)
c[i] = n.charAt(i);
Try(c,0);
}Answer (a)
Answer (b)
Fill in the blanks marked ?1?, ?2? ... so that the code works.
double power ( double p , int q )
{ double r = ?1? ;
int c = ( q<0 ) ? -q : q ;
if ( q == 0)
return 1 ;
else
{ for (int i = 1; i <= c ;?2?, i++);
return (q>0)? r : ?3?;
}
}Answer (a)
Blanks: 1
Answer (b)
Blanks: r = r * p
Answer (c)
Blanks: 1 / r
Answer the following using a truth table and a Karnaugh map.
| INPUTS | |
|---|---|
| C | Centre players perform well |
| D | Defenders perform well |
| F | Forward players perform well |
| G | Goalkeeper perform well |
Draw: logic gate diagram for the reduced expression
Answer
| C | D | F | G | X |
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 1 | 0 |
| 0 | 0 | 1 | 0 | 0 |
| 0 | 0 | 1 | 1 | 0 |
| 0 | 1 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 | 1 |
| 0 | 1 | 1 | 0 | 0 |
| 0 | 1 | 1 | 1 | 1 |
| 1 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 1 | 0 | 1 |
| 1 | 0 | 1 | 1 | 1 |
| 1 | 1 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 | 0 |
| 1 | 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 | 1 |
Reduce the following using a Karnaugh map.
Draw: logic gate diagram for the reduced expression
Answer (a)
Groups: (9, 13) → (A' + C + D'); (0, 2, 4, 6) → (A + D); (1, 3, 9, 11) → (B + D')
Reduced expression: F = (A' + C + D').(A + D).(B + D')
Answer (b)

Answer the following.

Answer
Answer the following.
Answer
Final answer: 0
Draw the following.
Draw: logic circuit to encode the hexadecimal numbers 1, 3, 5, 6, 9, A, C, E to their binary equivalents
Answer

Answer the following using a truth table.
Answer
| A | B | C | B.C | A => B.C | A => B | B => C | (A => B).(B => C) | A => B.C <=> (A => B).(B => C) |
| 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 |
| 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 0 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 0 |
| 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 1 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 |
| 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 1 |
| 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
Answer the following.
Answer
Write the program described below.
Answer
import java.util.Scanner;
class Evil
{
int num;
String bin;
Evil()
{
num = 0;
bin = "";
}
void acceptNum()
{
Scanner sc = new Scanner(System.in);
System.out.print("Enter a positive integer: ");
num = sc.nextInt();
}
void rec_bin(int x)
{
if (x > 0)
{
rec_bin(x / 2);
bin = bin + (x % 2);
}
}
void check()
{
rec_bin(num);
int count = 0;
for (int i = 0; i < bin.length(); i++)
{
if (bin.charAt(i) == '1')
count++;
}
if (count % 2 == 0)
System.out.println(num + " is an Evil Number.");
else
System.out.println(num + " is not an Evil Number.");
}
public static void main(String args[])
{
Evil obj = new Evil();
obj.acceptNum();
obj.check();
}
}Explanation: rec_bin(x) recursively divides x by 2, and after the recursive call returns (i.e. once x becomes 0), it appends each remainder (x%2) to the string bin on the way back up the call stack, which builds the binary equivalent in the correct (MSB to LSB) order. check() calls rec_bin(num), counts the number of '1' characters in bin, and reports the number as Evil if that count is even. Tested (run for real): for num=10, rec_bin builds bin="1010" (two 1's, even), and the program correctly printed "10 is an Evil Number."Write the program described below.
Answer
class Composite
{
int arr[][];
int m, n;
Composite(int mm, int nn)
{
m = mm;
n = nn;
arr = new int[m][n];
}
int isComposite(int p)
{
if (p < 4)
return 0;
int count = 0;
for (int i = 1; i <= p; i++)
if (p % i == 0)
count++;
return (count > 2) ? 1 : 0;
}
void fill()
{
int num = 3;
for (int j = 0; j < n; j++)
{
for (int i = 0; i < m; i++)
{
num++;
while (isComposite(num) == 0)
num++;
arr[i][j] = num;
}
}
}
void display()
{
for (int i = 0; i < m; i++)
{
for (int j = 0; j < n; j++)
System.out.print(arr[i][j] + "\t");
System.out.println();
}
}
public static void main(String args[])
{
Composite obj = new Composite(3, 3);
obj.fill();
obj.display();
}
}Explanation: isComposite(p) counts all factors of p from 1 to p; a count greater than 2 means p is composite. fill() searches upward from 4 for successive composite numbers and stores them column by column (outer loop over columns j, inner loop over rows i), so the array is filled with the first m*n composite numbers in column-major order. Tested (run for real) with m=n=3: the first 9 composite numbers 4,6,8,9,10,12,14,15,16 were placed column-wise, and display() printed:
4 9 14
6 10 15
8 12 16Write the program described below.
Answer
import java.util.Scanner;
class Encode
{
String word, new_word;
int length;
Encode()
{
word = "";
new_word = "";
length = 0;
}
void acceptWord()
{
Scanner sc = new Scanner(System.in);
System.out.print("Enter a word: ");
word = sc.nextLine();
length = word.length();
}
void nextVowel()
{
for (int i = 0; i < length; i++)
{
char ch = word.charAt(i);
switch (ch)
{
case 'A': new_word += 'E'; break;
case 'E': new_word += 'I'; break;
case 'I': new_word += 'O'; break;
case 'O': new_word += 'U'; break;
case 'U': new_word += 'A'; break;
case 'a': new_word += 'e'; break;
case 'e': new_word += 'i'; break;
case 'i': new_word += 'o'; break;
case 'o': new_word += 'u'; break;
case 'u': new_word += 'a'; break;
default: new_word += ch;
}
}
}
void display()
{
System.out.println("Original word : " + word);
System.out.println("Encoded word : " + new_word);
}
public static void main(String args[])
{
Encode obj = new Encode();
obj.acceptWord();
obj.nextVowel();
obj.display();
}
}Explanation: nextVowel() scans each character of word; if it is one of the 10 vowels (upper- or lower-case), it is replaced by the next vowel in the cycle A->E->I->O->U->A (and a->e->i->o->u->a) using a switch statement, while all other (consonant) characters are copied unchanged into new_word. Tested (run for real): for word="Institution", the program correctly produced new_word="Onstotatoun", matching the example given in the question.Answer the following on the class described.
Answer (i)
void pushVal(double v)
{
if (rear == lim)
System.out.println("SHELF IS FULL");
else
{
ele[rear] = v;
rear++;
}
}
double popVal()
{
if (front == rear)
return -999.99;
else
{
double v = ele[front];
front++;
return v;
}
}Explanation: pushVal() checks whether rear has reached the limit lim (shelf full) before inserting v at the rear index and advancing rear. popVal() checks whether the shelf is empty (front==rear), returning -999.99 in that case; otherwise it returns the element at front and advances front. Tested (run for real) with lim=3: pushing 1.5, 2.5, 3.5 succeeded, a fourth pushVal correctly printed "SHELF IS FULL", and popVal() correctly returned 1.5 then 2.5 in that order, leaving 3.5 in the shelf.Answer (ii)
Write the program described below.
Answer
class Volume extends Circle
{
double height, volume;
Volume(double r, double h)
{
super(r);
height = h;
}
double calculate()
{
cal_area();
volume = area * height;
return volume;
}
void display()
{
super.display();
System.out.println("Volume of Cylinder = " + volume);
}
}Explanation: The parameterised constructor Volume(r,h) passes the radius up to the superclass Circle's constructor using super(r), and stores height in the subclass. calculate() invokes the inherited cal_area() (which computes and stores area = pi * radius^2 in the superclass), then multiplies this area by height to get the volume of the cylinder (pi * r^2 * h), storing it in volume and returning it. display() calls super.display() to reuse the superclass's printing of the area, then prints the volume, demonstrating inheritance (reusing radius/area/cal_area from Circle) and method overriding of display(). Tested (run for real) with a stub Circle class matching the given specification: for radius=3, height=5, the program correctly computed area = 28.274... and volume = 141.371...Answer the following.
Answer
Answer the following questions from the binary tree.
Answer (a)
Answer (b)
Answer (c)
The ISC Computer Science 2024 Specimen Paper is a specimen paper for Class 12: 28 questions in printed order, 70 marks in all, asked from 10 chapters. A specimen paper is the sample question paper CISCE publishes before the exam to show the layout and style of that year’s paper. It is a good guide to the pattern you will meet.
The layout of the current Computer Science paper (sections, marks, choices) is in the paper pattern guide.
| Kind | Questions | Marks printed* |
|---|---|---|
| Program | 4 | 35 |
| Case based | 6 | 29 |
| Short answer | 6 | 8 |
| Drawing | 1 | 5 |
| MCQ | 4 | 4 |
| Derivation | 1 | 4 |
| Numerical | 2 | 3 |
| Truth table | 1 | 3 |
| Assertion-reason | 2 | 2 |
| Conversion | 1 | 2 |
| Chapter | Questions | Marks printed* |
|---|---|---|
| Boolean Algebra | 12 | 30 |
| Objects | 3 | 30 |
| Data structures | 3 | 10 |
| Computer Hardware | 3 | 8 |
| Inheritance, Interfaces and Polymorphism | 2 | 6 |
| Implementation of algorithms to solve problems | 1 | 3 |
| Recursion | 1 | 3 |
| Arrays, Strings | 1 | 2 |
| Complexity and Big O notation | 1 | 2 |
| Methods | 1 | 1 |
* Marks are those printed on each question; where a question offers an either-or choice, both options are counted, so the totals can come to more than the paper’s own total.
28 questions, 70 marks in all, shown in full and in printed order on this page.
By number of questions: Boolean Algebra (12), Objects (3), Data structures (3) and Computer Hardware (3).
Tap “Show answer” under a question to see its answer. The download button saves the paper as a PDF, with or without the answers.