ISC 2012 Computer Science Paper 1 Theory
ISC 2012 Computer Science Paper 1 Theory
Paper-1
(THEORY)
Three /tOllrs
(Candidates are allowed additional 15 minutes/or only reading the paper.
They must NOT start writing during this time.)
Answer all questions in Part 1 (compulsory) and seven questions from Part 11, choosing three
questions from Section-A, two questionsfrom Section-B and two questions ji'om Section-C.
All working, including rough work, should be done on the same sheer as the rest oIthe anSHler.
The intended marks for questions or parts of questions are given in brackels [ ].
PART I
Answer all questions.
While answering questions in this Part, indicate briefly your working and reasoning.
wherever required.
Question t
(a) Using a truth table. verify the following expression: 121
X + (Y+Z)=(X + Y) + Z
(c) Draw the truth table and logic circuit for a 2-input XNOR gate. [21
(d) Find the complement of the following expression: 12J
X' + XY'
(i) Converse
© www.javaforschool.com
Question 2
(a) Oi rrerentiate between the keywords ex/ends and implements. [2 J
(b) State how a binary tree is a recursive data structure . (2]
(e) A matri x B[ I 0][7] is stored in the memory with each element requiring 2 bytes of 121
storage . If the base address at B [x] [1] is 10] 2 and the address at B [7][3 J is 1060,
determine the value 'x' where the matrix is stored in Column Major wise.
(d) Convert the following infix notation to its postfix form: 121
!\ + ( (B+C) + (O+E) *F)/G
(e) What is. a constructor? State one di fference between a constructor and an y other 121
member function of a class.
Question 3
(a) The following function is a part of some class \,vhich computes and sorts an array
arr[ ] in ascending order using the bubble sort technique . There are so me pbces
in the code marked by ?l '!, ?2?, ?3?, ?4?, ?S? which must be replaced by a
statement / expression so that the function works properly :
void bubblesort( i nt arr[ ])
2
1212-868A
© www.javaforschool.com
(b) The foll o\Ving fu nct ion witty( ) is a part of some class . What will be the 151
outp ut of the function witty() when the val ue ofn is " SCIENCE" a nd the value
orp is 5. Show the dry run I working: <> ' \ '-~ '> l
PART - II
Answer seven questions in this parr, choosing t!tree questions/i'om
Section A, two ./i·om Section Band two/i'om Sec/ion C
SECTION - A
Answer any three questions.
Question 4
(i) Reduce the above expression by using 4 - variable K-Map, showing th e various 141
groups (i.e. octa l, quads and pairs).
(ii) Draw the IOf;ic gate diagram of the reduced ex press ion . Assume that th e 111
variables and th eir complemen ts are available as inputs.
(i) Reduce the above expression by using 4 - variable K-Map, showing the various 141
groups (i.e. octal , quads and pairs).
(i i ) Draw th e logic gate diagram of the reduced express ion . Ass ume that th e 111
variables and th eir complements are available as inputs.
3
1212-868A Turn over
© www.javaforschool.com
Question 5
The Principal of a school intends to select students for admission to class XI on. the
following criteria:
• Student is of the same school and has passed the class X Board Examination with
more than 60% marks.
OR
• Student is of the same school, has passed the class X Board Examination with less
than 60% marks but has taken active part in co-curricular activities.
OR
• Student is not from the same school but has either passed the class X Board
Examination with more than 60% marks or has participated in sports at the National
level.
The inputs are :
INPUTS
S Student of the same school.
P Has passed the class X Board Examination with more than 60% marks.
C Has taken active part in co-curricular activities.
T Has participated in sports at the National level.
Output: X - Denotes admission status [I indicates granted and 0 indicates refused in all
the cases.]
,
(a) Draw the truth table for the inputs and outputs given above and write the SOP [51:
expreSSiOn.
(b) Reduce X ( S, P, C, T ) using Karnaugh's Map. [5]
Draw the logic gate diagram for the reduced SOP expression for X ( S, p, C, T) using
AND and OR gate. You may use gates with two or more inputs. Assume that the
variable and their complements are available as inputs.
Question 6
(a) Verify algebraically if, [2]
X'Y'Z' + X'Y'Z + X'YZ + X'YZ' + XY'Z' + XY'Z = X'+Y'
(b) Represent the Boolean expression X+YZ' with the help of NOR gates only. (2)
(c) Define the terms Contingency, Contradiction and Tautology. [31
(d) Consider tbe following truth table where A and B are two inputs and X is the output:
A B X
o 0 0
o 1
o 1
o
(i) Name and draw the logic gate for the given truth table. [2)
(ii) Write the POS of X(A,B). 11)
4
1212-868A © www.javaforschool.com
Question 7
(a) Define Multiplexer and state one of its uses. Draw the logic diagram for a 4: 1 [41
Multiplexer.
(b) State how a Half Adder is different from a Full Adder. Also give their respective uses. [3J
(c) Minimize the following expression using Boolean laws: [31
Q . ( Q' + P ) . R . ( Q + R )
Also draw the logic gate for the reduced expression.
SECTION -8
Answer any two questions.
Each program should be written in such a way that it clearly depicts the logic of the problem.
This can be achieved by using mnemonic names and comments in the program.
(Flowcharts and Algorithms are not required.)
The programs must be written in Java.
Question 8
A class Combine contains an array of integers which combines two arrays into a single [101
array including the duplicate elements, if any, and sorts the combined array. Some of the
members of the class are given below:
Class name Combine
5
1212-868A Turn over
© www.javaforschool.com
Question 9
Design a class VowelWord to accept a sentence and calculate the frequency of words that (101
begin with a vowel. The words in the input string are separated by a single blank space
and tenninated by a full stop. The description of the class is given below:
Member functions:
Specify the class VowelWord giving details of the constructor(), void readstr(),
void freq_vowel( ) and void display( ). Also define the maine ) function to create an
object and call the methods accordingly to enable the task.
© www.javaforschool.com
Question] 0
A happy number is a number in which the eventual sum of the square of the digits of the (101
number is equal to 1. .
Example: 28 = ( 2 ) 2 + ( 8 ) 2 = 4 + 64 = 68
68 = ( 6 ) 2 + ( 8 ) 2 = 36 + 64 = 100
100 = ( 1 ) 2 + ( 0 ) 2 + ( 0 ) 2 = 1 + 0 + 0 = 1
Example: 12 = ( 1 ) 2 + ( 2 ) 2 = 1 + 4 = 5
Design a.c1ass Happy to check if a given number is a happy number. Some of the members
of the class are given below:
Specify the class Happy gIvmg details of the constructor( ), void getnum(int),
int sum_sq_digits(int) and void ishappy( ). Also define a maine ) function to create an
object and call the methods to check for happy number.
7
1212-868A Turn over
© www.javaforschool.com
SECTION -C
Answer any two questions.
Each Program / Algorithm should be written in such a way Ihal it dearly depicts the logic of
the problem step vvise. This can also be achieved by using pseudo codes.
(F lowcharts are not required).
The programs must be written in Java.
The Algorithm must be written in general/standard form, whel'ever required.
Question II
Link is an entity which can hold a maximum of 100 integers. Link enables the user to
add elements from the rear end and remove integers from the front end of the entity.
Define a class Link with the following details:
Class name Link
(a) Specify the class Link giving details of the constructor(int), void addlink(int), 191
int dellink( ) and void display( ).
THE MAIN fUNCTION AND ALGORITHM NEED NOT BE WRITTEN .
8
1212-868A
© www.javaforschool.com
Question 12
A super class Detail has been defined to store the details of a customer. Define a ItO]
sub class Bill to compute the monthl y telephone charge of the customer as per the chart
given below:
9
1212-868A Turn over
© www.javaforschool.com
Question 13
class node
{
int p;
String n;
node next;
}
Write an Algorithm OR a Method to search for a name and display the contents of
that node. The method declaration is given below:
(b) What is the role of constants in complexity? Explain briefly with an example. [2J
(c) Answer the following from the diagram of a Binary Tree given below:
10
1212-868A
© www.javaforschool.com