Trending ▼   ResFinder  

ISC Class XII Prelims 2021 : Computer Science (Father Leblond School, Darjeeling)

6 pages, 34 questions, 0 questions with responses, 0 total responses,    2    0
Koustav Chakraborty
Baba Siddhnath College Of Education, Muthra
BACHELOR OF EDUCATION COMPUTER SCIENCE AND APPLICATIONS
+Fave Message
 Home > rudra199140 >   F Also featured on: School Page isc

Formatting page ...

COMPUTER SCIENCE PAPER 1 (Theory) (Maximum marks: 70) (Time allowed: Three hours) (Candidates are allowed additional 15 minutes for only reading the question paper. They must NOT start writing during this time.) --------------------------------------------------------------------------------------------------------------------------------------------Answer all questions in Part I(compulsory)and six questions from Part II, choosing two questions from Section A, two from Section B and two from Section C. All working, including rough work, should be done on the same sheet as the rest of the answer. The intended marks for questions or parts of question are given in brackets [ ]. ---------------------------------------------------------------------------------------------------------------------------------------------Part I (20 Marks) Attempt all questions While answering questions in this Part , indicate briefly your working and reasoning, wherever required. Question 1 a) b) c) d) e) f) Question 2 a) b) c) d) e) f) T21263 State the commutative laws and prove any one of the law using truth table. Convert the following expression into its canonical POS form: F(X,Y,Z) = (X+Y ).(Y +Z) Convert the Boolean expression F(X,Y,Z) = X Y Z + X YZ +XYZ into cardinal form. Verify the following proposition with the help of the truth table: (P Q) (P ~Q) = P If F(A,B,C) = A (BC +B C) then find F If (~P => Q) then write its: i) Converse ii) Inverse Convert the following infix notation to postfix notation: A*(B/C)/E+F Define Interface. How is it different from class? A matrix A[m][m] is stored in the memory with each elements requiring 4 bytes of storage. If the base address at A[1][1] is 1500 and address of A[4][5] is 1608, determine the order of matrix when it is stored in Column Major wise. What is the purpose of front and rear in the queue data structure? Write one difference each between constructor and method? Explain one advantage and one disadvantage of recursion over iteration. THIS PAPER COMPRISES OF 6 PRINTED PAGES AND 0 BLANK PAGE TURN OVER [1] [1/2] [1/2] [1] [1] [1] [2] [2] [2] [2] [1] [1]

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

 

  Print intermediate debugging step

Show debugging info


 

 

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

 

rudra199140 chat