Trending ▼   ResFinder  

ComputerTheorySpecimen 2016

6 pages, 30 questions, 6 questions with responses, 6 total responses,    0    0
Megha Sharma
Zydus School for Excellence (ZSE), Vejalpur, Ahmedabad
+Fave Message
 Home > mememe >

Formatting page ...

Computer Science Specimen Paper 2016 Part I Answer all questions Question 1. a) State the Associative Law and prove it with a truth table. b) Draw the truth table to prove a propositional expression. (x y) ^ (y x) = (x y) c) Find the dual for the Boolean equation : AB + BC +1 =1 d) Convert the Boolean expression F(X,Y,Z) = X Y Z + X YZ + XYZ into its cardinal form. e) Minimise F= XY + (XZ) + XY Z using Boolean laws. [ 1 x 5 = 5] Question 2. a) Differentiate between Stack data structure and Queue data structure. b) Convert the following infix notation to postfix: A * ( B / C) / E + F c) Define Interface. How is it different from a class? d) Each element of an array arr[15][20] requires W bytes of storage. If the address of arr[6][8] is 4440 and the base address at arr[1][1] is 4000, find the width W of each cell in the array arr[][] when the array is stored as Column major wise. e) Define Big O notation. State the 2 factors which determine the complexity of an algorithm. [ 2 x 5 =10] Question 3. The following is a function of some class. What will be the output of the function test( ) when the value of count is equal to 4?Show the dry run / working. class Sample { public void test( int count) { if(count == 0) System.out.println(" "); else { System.out.println("Bye " +count); test(--count); System.out.println(" "+ count); } } } [5] 1

Formatting page ...

Top Contributors
to this ResPaper
(answers/comments)


Megha Sharma

(6)

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

 

  Print intermediate debugging step

Show debugging info


 

 

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

 

mememe chat