Choose the correct option.
- (a)Associative Law
- (b)Distributive Law
- (c)Commutative Law
- (d)Absorption Law
Show answer
Answer
Correct option: (c)
The ISC 2022 Computer Science - Specimen paper (Semester 1), Paper 1 for Class 12: all 52 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: (c)
Choose the correct option.
Answer
Correct option: (b)
Choose the correct option.
Answer
Correct option: (d)
Choose the correct option.
Answer
Correct option: (a)
Choose the correct option.
Answer
Correct option: (b)
Choose the correct option.
Answer
Correct option: (b)
Choose the correct option.
Answer
Correct option: (d)
Choose the correct option.
Answer
Correct option: (c)
Choose the correct option.
Answer
Correct option: (d)
Choose the correct option.
Answer
Correct option: (a)
Choose the correct option.
Answer
Correct option: (c)
Choose the correct option.
MAT[10][15] is stored in the memory in Row Major Wise with each element requiring 2 bytes of storage. If the base address at MAT[1][2] is 2215, then the address of MAT[3][7] will be:Answer
Correct option: (a)
Choose the correct option.
Answer
Correct option: (ii)
Choose the correct option.
Answer
Correct option: (iii)
Choose the correct option.
Answer
Correct option: (b)
Choose the correct option.
int i, j;
for(i = 1; i <= 5; i++);
for(j = i + 1; j < 1; j++);
System.out.print(i + "+" + j);Answer
Correct option: (c)
Choose the correct option.
System.out.print(Integer.parseInt("234") + 'A');Answer
Correct option: (c)
Choose the correct option.
System.out.print('A' + '1' + 'C');Answer
Correct option: (c)
Choose the correct option.
Answer
Correct option: (c)
Choose the correct option.
Answer
Correct option: (c)
Choose the correct option.
Answer
Correct option: (c)
Choose the correct option.
Answer
Correct option: (iv)
Choose the correct option.
Answer
Correct option: (iii)
Choose the correct option.
| Inputs | |
|---|---|
| A | Participated in a competition earlier |
| B | Is very creative |
| C | Won prize in an inter house competition |
| D | Has excellent general awareness |
Answer
Correct option: (iii)
Choose the correct option.
Answer
Correct option: (ii)
Choose the correct option.
Answer
Correct option: (ii)
Choose the correct option.
Answer
Correct option: (iv)
Choose the correct option.

Answer
Correct option: (iv)
Choose the correct option.

Answer
Correct option: (iii)
Choose the correct option.

Answer
Correct option: (iii)
Choose the correct option.
Answer
Correct option: (i)
Choose the correct option.
Answer
Correct option: (ii)
Choose the correct option.
fun() when the value of n=4?void fun(int n)
{
int i, f;
for(i = 1, f = 1; i <= n; i++, f *= i);
System.out.print(f);
}Answer
Correct option: (iii)
Choose the correct option.
fun() performing?Answer
Correct option: (iv)
Choose the correct option.
test() return when the value of n=9?int test(int n)
{
if(n == 1) return 0;
for (int i = 2; i <= (int)(Math.sqrt(n)); i++)
if(n % i == 0)
return 0;
return 1;
}Answer
Correct option: (iii)
Choose the correct option.
test() performing?Answer
Correct option: (i)
Choose the correct option.
dimen() when the value of n[][] = {{2,3,7},{1,5,9},{10,-3,8}}?void dimen(int n[][])
{
int p = 0;
for (int i = 0; i < n.length; i++)
for(int j = 0; j < n[0].length; j++)
{
if(i == 0 || i == n.length - 1 || j == 0 || j == n[0].length - 1)
p = p + n[i][j];
}
System.out.print(p);
}Answer
Correct option: (iv)
Choose the correct option.
dimen() performing?Answer
Correct option: (iii)
Choose the correct option.
single() when the value of x[] = {10,2,9,-6,5,6}?void single(int x[])
{
int w = 1;
for(int y = 0; y < x.length; y++)
{
if(x[y] % 2 == 0 && x[y] > 0)
w = w * x[y];
}
System.out.print(w);
}Answer
Correct option: (i)
Choose the correct option.
single() performing?Answer
Correct option: (iii)
Choose the correct option.
solve() when the value of a=8 and b=12?int solve(int a, int b)
{
int i, l = 0;
for(i = 1; i <= a * b; i++)
{
if(i % a == 0 && i % b == 0)
{
l = i;
break;
}
}
return l;
}Answer
Correct option: (iv)
Choose the correct option.
solve() performing?Answer
Correct option: (iii)
Choose the correct option.
boolean Palindrome(int N)
{
int rev = ?1?;
int num = N;
while (num > 0)
{
int f = num / 10;
int s = ?2?;
int digit = num - ?3?;
rev = ?4? + digit;
num /= ?5?;
}
if(rev == N)
return true;
else
return false;
}Answer
Correct option: (ii)
Choose the correct option.
Answer
Correct option: (iv)
Choose the correct option.
Answer
Correct option: (i)
Choose the correct option.
Answer
Correct option: (ii)
Choose the correct option.
Answer
Correct option: (iii)
Choose the correct option.
void insertionSort(int array[])
{
int n = ?1?;
for (int j = 1; j < n; j++)
{
int key = ?2?;
int i = j - 1;
while ((i > -1) && (array[i] > ?3?))
{
array[i + 1] = ?4?;
i--;
}
?5? = key;
}
}Answer
Correct option: (ii)
Choose the correct option.
Answer
Correct option: (iii)
Choose the correct option.
Answer
Correct option: (i)
Choose the correct option.
Answer
Correct option: (iv)
Choose the correct option.
Answer
Correct option: (i)
The ISC 2022 Computer Science - Specimen paper (Semester 1), Paper 1 is a specimen paper for Class 12: 52 questions in printed order, 70 marks in all, asked from 7 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* |
|---|---|---|
| MCQ | 52 | 70 |
| Chapter | Questions | Marks printed* |
|---|---|---|
| Boolean Algebra | 20 | 27 |
| Implementation of algorithms to solve problems | 10 | 10 |
| Arrays, Strings | 6 | 10 |
| Methods | 6 | 9 |
| Computer Hardware | 7 | 8 |
| Primitive values, Wrapper classes, Types and casting | 2 | 4 |
| Statements, Scope | 1 | 2 |
* 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.
52 questions, 70 marks in all, shown in full and in printed order on this page.
By number of questions: Boolean Algebra (20), Implementation of algorithms to solve problems (10), Computer Hardware (7) and Arrays, Strings (6).
Tap “Show answer” under a question to see its answer. The download button saves the paper as a PDF, with or without the answers.