-(1).webp)
ISC Board Class 12 Computer Science Sample Paper 2024-25: Are you also a CISCE board student looking for sample papers of the latest subjects? Well, don't worry as we got you covered. Get here the detailed PDF of the sample paper and the total weightage of marks. Computer Science sample paper has been made available for the academic year 2024-25. Students and teachers can also download the PDF from the website.
Instructions to Candidates
- You are allowed an additional 15 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 and has 11 questions in all.
- Part I is compulsory and has two questions. Answer all questions.
- Part II is divided into three sections: A, B and C.
- While attempting Multiple Choice Questions in Part I, you are required to write only ONE option as the answer.
- 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 [ ].
CHECK: ISC Physical Education Specimen Paper 2024 (PDF)- CISCE Class 12 Physical Education Sample Paper
ISC Board Class 12 Computer Science Sample Paper 2024-25
Part-1- 20 Marks
| Question 1 | |||||
| (i) | The complement of the Boolean expression Aꞌ • (B • Cꞌ + Bꞌ • | C) | (Application) | [1] | |
| (a) | Aꞌ • (B+C+Bꞌ +C) | ||||
| (b) | A+ (B+Cꞌ) •(B+Cꞌ) | ||||
| (c) | A+(Bꞌ +C) • (B+Cꞌ) | ||||
| (d) | Aꞌ • (Bꞌ +Cꞌ +Bꞌ •C) | ||||
| (ii) | Given below are two statements marked Assertion and Reason. Read the two statements carefully and choose the correct option. Assertion: Recursion utilises more memory as compared to iteration. Reason: The time complexity of recursion is higher due to the overhead of maintaining the function call stack. (Analysis) | [1] | |||
| (a) | Both Assertion and Reason are true and Reason is the correct explanation for Assertion. | ||||
| (b) | Both Assertion and Reason are true but Reason is not the correct explanation for Assertion. | ||||
| (c) | Assertion is true and Reason is false. | ||||
| (d) | Assertion is false and Reason is true. | ||||
| (iii) | According to the Principle of duality, the Boolean equation (Aꞌ + B) • (1 + B) = Aꞌ + B will be equivalent to: | (Application) | [1] | ||
| (a) | (A + Bꞌ) • (0 + B) = A + Bꞌ | ||||
| (b) | (Aꞌ • B) + (0 • B) = Aꞌ • B | ||||
| (c) | (Aꞌ • B) + (0 • B) = Aꞌ + B | ||||
| (d) | (Aꞌ + B) • (0 + B) = Aꞌ + B | ||||
| (iv) | Distributive law states that: | (Recall) | [1] | ||
| (a) | A + B • C = (A + B) • (A +C) | ||||
| (b) | A + ( A • B) = A | ||||
| (c) | A • (B + C) = (A • B) + (B • C) | ||||
| (d) | A + B • C = A • B + A • C | ||||
| (v) | The complement of the reduced expression of F(A,B) = Σ (0,1,2,3) is: (Application) | [1] | |||
| (a) | 1 | ||||
| (b) | A • B | ||||
| (c) | 0 | ||||
| (d) | Aꞌ + B | ||||
| (vi) | Study the given propositions and the statements marked Assertion and Reason that follow it. Choose the correct option based on your analysis. p = I am a triangle q = I am a three-sided polygon s1 = p ® q s2 = q ® p Assertion: s2 is converse of s1 Reason: A three-sided polygon must be a triangle. (Analysis) | [1] | ||
| (a) | Both Assertion and Reason are true and Reason is the correct explanation for Assertion. | |||
| (b) | Both Assertion and Reason are true but Reason is not the correct explanation for Assertion. | |||
| (c) | Assertion is true and Reason is false. | |||
| (d) | Assertion is false and Reason is true. | |||
| (vii) | Given below are two statements marked Assertion and Reason. Read the two statements carefully and choose the correct option. Assertion: In Java, the String class is used to create and manipulate strings, and it is immutable. Reason: Immutability ensures that once a String object is created, its value cannot be changed. (Analysis) | [1] | ||
| (a) | Both Assertion and Reason are true and Reason is the correct explanation for Assertion. | |||
| (b) | Both Assertion and Reason are true but Reason is not the correct explanation for Assertion. | |||
| (c) | Assertion is true and Reason is false. | |||
| (d) | Assertion is false and Reason is true. | |||
| (viii) | Consider the following statement written in class Circle where pi is its data member. static final double pi = 3.142; Which of the following statements are valid for pi? I. It contains a common value for all objects class Circle. II. Its value is non-changeable. III. At a time two access modifiers, static and final, cannot be applied to a single data member pi. (Application) | [1] | ||
| (a) | I and II | |||
| (b) | II and III | |||
| (c) | I and III | |||
| (d) | Only III | |||
| (ix) | For Big O notation, state the difference between O(n) and O(n2). (Analysis) | [1] | ||
| (x) | A full adder needs five gates and those are 3 AND gates, 1 OR gate and 1 XOR gate. When a full adder is constructed using 2 half adders, it also requires 5 gates. State the names along with the quantity of those gates. (Analysis) | [1] | ||
| Question 2 | ||||
| (i) | Convert the following infix notation to prefix form. ( A – B ) / C * ( D + E ) | (Create) | [2] | |
| (ii) | A matrix M[-6….10, 4…15] is stored in the memory with each element requiring 4 bytes of storage. If the base address is 1025, find the address of M[4][8] when the matrix is stored in column major-wise. (Application) | [2] | ||
| (iii) | The following function get () is a part of some class. Assume x is a positive integer, f is the lower bound of arr[ ] and l is the upper bound of the arr[ ]. Answer the questions given below along with dry run/working. public int getIt(int x,intarr[],int f,int l) {if(f>l) return -1; int m=(f+l)/2; if(arr[m]<x) return get(x,m+1,l); else if(arr[m]>x) return get(x,f,m-1); else return m;} | |||
| (a) | What will the function get ( ) return if arr[ ] = {10,20,30,40,50} and x=40? (Analysis) | [2] | ||
| (b) | What is function get It( ) performing apart from recursion? | (Analysis) | [1] | |
| (iv) | The following is a function of class Armstrong. This recursive function calculates and returns the sum of the cubes of all the digits of num, where num is an integer data member of the class Armstrong. [A number is said to be Armstrong if the sum of the cubes of all its digits is equal to the original number]. 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. public int sumOfPowers(int num) {if (num == 0) return ?1?; int digit = ?2?; return (int) Math.pow(digit, 3) + ?3?;} | |||
| (a) | What is the expression or statement at ?1? | (Analysis) | [1] | |
| (b) | What is the expression or statement at ?2? | (Analysis) | [1] | |
| (c) | What is the expression or statement at ?3? | (Analysis) | [1] | |
This is the complete section of the sample paper. To get the other sections, we are providing the PDF that you can download for free from the link provided below.
CHECK: ISC Board Class 12 Computer Science Sample Paper 2024-25 Free PDF Download
Other Related Links