Trending ▼   ResFinder  

ISC Class XII Prelims 2025 : Computer Science (Don Bosco School, Liluah, Howrah)

3 pages, 0 questions, 0 questions with responses, 0 total responses,    0    0
Havan Gupta
  
+Fave Message
 Home > havangupta >   F Also featured on: School Page

Formatting page ...

, r . : Don Bosco S.chool Liluah Unit Test-.J_ (~025-26) . Class XII Computer Science . Tim e: 40m ins FM: 30 (Question 1 is compulsory and any two from Question 2, Question 3 arld Question 4) : J / . Question 1 . Choose the correct answers to the MCQ questions from the gtven options for questions (a) to (e), and answer briefly the restofthe (101 questions (I) to (j): ; (Do not copy the questions, write the c~rrect answer only)- - @ne ~umber of swapping that takes place b~tween-coilS~cutive elements of an array arr={86, 72, 69-, 56,. 45,. 38,_ 24 , 14} w4en bubble sorting technique is use~ to 3:Uange th~ ~e_l,ements. Ul ascendi~g order. ~ (iv) 10 (iii) 36 . .(ii) 49 (i) 64 (b) The number ofoutputs present in a decimal to binary 6~~der circuit is : . (iv) J . (iii) 10 (ii) 4 (i) 8 Ji) The keyword which is to make- a variable behave as a constant . 1s: (iii) finalize . (iv) constant (ii) final . _(i) const (d) The p~rameters which are written in a function definition are: (iv) virutal (iii} real (ii) formal (i) a~tual (e) The _contrapositive of the compound propositio~ _, P -4 Q is: (i)-, Q -4 P (ii)-, Q ~ -, P (iii) P ~-. Q. (iv) -,p_~-, Q (f) Th~ ~utput of the logic gate is I when th~re are odd number of l's present in the inputs of the gate. Identify the gate . . . V, 1) _ _ __ _ _ _ _ _..,...,_ _ _ _ _ _ _ \ . ' . . .. . \ . . ~ .Sta~e whether the following proposition is a tautology, contradictiOn or a contingency, using algebraic method. The proposition is : [(p ~ q) /\ (q ~ r)] 4 (p ~ r) C@i) Define Modus Ponens rule of propositional logic. (i) What is the dual of AB'+ A'C'+ 0? G) What is the output of the following.java statement: String sam="australia"; Sys_tem.out. print(sam.lastlndexOf(' a' ,3 )+sam.indexOf(' s')); Question 2 ' (a) Wh_at is a Full Adder? Write the truth table and Boolean expression of the _outputs of a Full Adder. Draw the logic gate circuit diagram o a Full Adder. [I+ I+ 1+2] (b) What is a t\l\ .. DraW the logic gate circuit diagram of !}Il Octal11.Painary D@~der.~.lSXieA.. [1+4] ~ Que~tion 3 named "WordMagic"" having the following data members and member functions: ll01 Design a class . . . Data Mem-bers: Strings : accepts any sentence from the user. Member Functions : WordMagic(String ss) : a parameterized constructor to- initialize the data member with the user specified values i~ String object 'ss'. int getASCIISum(String w) : returns the sum of the ASCII value of the letters of the word using recursion. boolean isMagic(int n) : returns true if 'n' is a Magic number otherwise returns false. [A number is said to be a magic number if the sum ofdigits_ 01the . ely equa z s to 1. For examp l 172 is a magzc number. As number recurszv e, - the suin ofdigits 1+ 7+ 2 = 10 and again 1+O == 1. J . . nt of number of words in the sentence a cou . . dsO: return . f the wor d 1s a Ma gic int countWor. sel l valu e of the lett ers 0 - ofth eA . who se sun \a recursion. number, usi ,, . . d disp the cou nt of suc h . . . 0. : displays the original sentence an . lay , . void d1sp . . . . : . ds as .ment1oned_ above.. . . . . wot' . h abo \le clas s and mvoke te an obJect oft e . . Also define a mai.n,)'J to crea _ . _. . . the functions accordingly. .5 . \ . 4Question -~ d "N . . . . b rPlau" having the foll owi ng dat a Defme a class name um e J _ . members and member functions: Data Members-: . . _ . . , int UU arr : a two d1mens1onal array hav ing n, , row s an [10 ] d , , n columns : stores the nuD?-~!-~.SJ-f rows and co_lumns of the m~ trix Member Functions: . -_ . .: NumberPlay(intx, inty ) : _it'par~~eterized con stru ctor to fill the ll?atrix with random numb~rs lying betw een x and y, bot h inc lusi ve. . . . -- -- .. . . . . . . . . . ' . : '. . .. . . ;- . int diagonalSum() : returns the ~um of all -~4e dia gon al ele me nts of the matrix. - . . int sumOJHighest() - returns the sum of th e hig hes t elem ent s from each row of the matrix intperipheriSum() - returns the sum of all the per iph era l elements of the ma trix . . ;: . . ,. . . . Also define. a main() to create a~ object of the above. the functions accordi,:igly. class and invoke - '- _

Formatting page ...

Related ResPapers
ISC Class XII Prelims 2020 : Computer Science (St. Paul's School, Rourkela)
by amitdhar 
ISC Class XII Prelims 2020 : Computer Science (St. Xavier's Sr. Sec School, Khera-Pilkhuwa)
by prateekgurjar 
ISC Class XII Prelims 2021 : Computer Science (Father Leblond School, Darjeeling)
by rudra199140 
ISC Class XII Prelims 2020 : Computer Science (St. Xavier's Sr. Sec School, Khera-Pilkhuwa)
by prateekgurjar 

Formatting page ...

 

  Print intermediate debugging step

Show debugging info


 

 


© 2010 - 2025 ResPaper. Terms of ServiceContact Us Advertise with us

 

havangupta chat