0% found this document useful (0 votes)
2 views

Question 12 Part 1

The document contains a series of questions related to Boolean expressions, recursion, and programming concepts, including assertions and reasoning. It includes multiple-choice questions, true/false statements, and practical applications involving logic circuits and mathematical principles. Additionally, there are tasks requiring conversions between notations and the analysis of algorithms.

Uploaded by

it2021037
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
2 views

Question 12 Part 1

The document contains a series of questions related to Boolean expressions, recursion, and programming concepts, including assertions and reasoning. It includes multiple-choice questions, true/false statements, and practical applications involving logic circuits and mathematical principles. Additionally, there are tasks requiring conversions between notations and the analysis of algorithms.

Uploaded by

it2021037
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Question 1

(i) The compliment of the Boolean expression Aꞌ • (B • Cꞌ + Bꞌ • C) [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 [1]
statements carefully and choose the correct option.
Assertion: Recursion utilises more memory as compared to iteration.
Reason: Time complexity of recursion is higher due to the overhead of
maintaining the function call stack. (Analysis)
(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 [1]
(Aꞌ + B) • (1 + B) = Aꞌ + B will be equivalent to: (Application)
(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: [1]
(Application)
(a) 1
(b) A•B
(c) 0
(d) Aꞌ + Bꞌ
(vi) Study the given propositions and the statements marked Assertion and Reason that [1]
follow it. Choose the correct option on the basis of 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: Three-sided polygon must be a triangle. (Analysis)
(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 [1]
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)
(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 [1]
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)
(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. [1]
When a full adder is constructed using 2 half adders, it also requires 5 gates. State
the names along with the quantity those gates. (Analysis)

ISC SPECIMEN QUESTION PAPER 2025


3
Question 2
(i) Convert the following infix notation to prefix form. (Create) [2]
(A–B)/C*(D+E)
(ii) A matrix M[-6….10, 4…15] is stored in the memory with each element requiring 4 [2]
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)
(iii) The following function getIt() 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 getIt(x,m+1,l);
else if(arr[m]>x)
return getIt(x,f,m-1);
else
return m;
}
(a) What will the function getIt( ) return if arr[ ] = {10,20,30,40,50} and x=40? [2]
(Analysis)
(b) What is function getIt( ) 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]

ISC SPECIMEN QUESTION PAPER 2025


4
PART II– 50 MARKS
Answer six questions in this part, choosing two questions from
Section A, two from Section B and two from Section C.
SECTION - A
Answer any two questions.

Question 3
(i) A shopping mall announces a special discount on all its products as a festival offer [5]
only to those who satisfy any one of the following conditions.
 If he/she is an employee of the mall and has a service of more than 10 years.
OR
 A regular customer of the mall whose age is less than 65 years and should
not be an employee of the mall.
OR
 If he/she is a senior citizen but not a regular customer of the mall.
The inputs are :
INPUTS
E Employee of the mall
R Regular customer of the mall
S Service of the employee is more than 10 years
C Senior citizen of 65 years or above
(In all the above cases, 1 indicates yes and 0 indicates no.)
Output: X - Denotes eligible for discount [1 indicates YES and 0 indicates NO in
all cases]
Draw the truth table for the inputs and outputs given above and write the
SOP expression for X ( E, R, S, C ). (Application)

(ii) Reduce the above expression X ( E, R, S, C ) by using 4-variable Karnaugh map, [5]
showing the various groups (i.e. octal, quads and pairs).
Draw the logic gate diagram for the reduced expression. Assume that the variables
and their complements are available as inputs. (Create)

Question 4
(i) (a) Reduce the Boolean function F(P,Q,R,S) = (P+Q+R+S) •(P+Q+R+Sꞌ) • [4]
(P+Q+Rꞌ+S)•(P+Qꞌ+R+S) • (P+Qꞌ+R+Sꞌ) • (P+Qꞌ+Rꞌ+S) • (P+Qꞌ+Rꞌ+Sꞌ)
• (Pꞌ+Q+R+S)• (Pꞌ+Q+R+Sꞌ) by using 4-variable Karnaugh map, showing the
various groups (i.e. octal, quads and pairs). (Application)
(b) Draw the logic gate diagram for the reduced expression. Assume that the [1]
variables and their complements are available as inputs. (Create)

ISC SPECIMEN QUESTION PAPER 2025


5
(ii) From the given logic diagram :

(a) Derive Boolean expression and draw the truth table for the derived [4]
expression. (Application)
(b) If A=1, B=0 and C=1 then find the value of X. (Application) [1]

Question 5
(i) Draw the logic circuit to decode the following binary number (0001, 0101, 0111, [5]
1000, 1010, 1100, 1110,1111) to its hexadecimal equivalents. Also state the
Hexadecimal equivalents of the given binary numbers. (Application & Analyse)
(ii) Verify if the following proposition is valid using the truth table: [3]
(X ∧Y) =>Z = (Y =>Z) ∧ (X =>Y) (Application)
(iii) Answer the following questions related to the below image:

(a) What is the output of the above gate if input A=0, B=1? (Analysis) [1]
(b) What are the values of the inputs if output =1? (Application) [1]

ISC SPECIMEN QUESTION PAPER 2025

You might also like