Trending ▼   ResFinder

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

5 pages, 31 questions, 0 questions with responses, 0 total responses,    3    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 ...

father leblond school 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) State Associative law and prove it with the help of truth table. (b) Draw the truth table to prove the following propositional logic expression. (c) Find the dual of the Boolean equation: AB + BC + 1 = 1 (d) Find the complement of F(P,Q,R) = PQ R + Q(P R +PR ) (e) Minimize: F = XY + (XZ) + XY Z using Boolean laws. [1] [1] [1] [1] [1] Question 2 (a) Explain the insertion and deletion technique in the queue data structure. (You can also use algorithm to illustrate your point) (b) Convert the given infix expression to postfix expression: a+b*c%d/e+f (c) Each element of an array X[ -5 15, 10 35] requires 8 bytes of storage. If the array is stored in Row major wise and the beginning location 2500, then determine the address of X[15,30]. (d) What do you understand by interface? Explain its differences with the class. (e) Consider a set of numbers 8,9,10,11,12,7,8. Explain the concept of push and pop in the data structure. [2] [2] [2] [2] [2] --------------------------------------------------------------------------------------------------------------------------------------------XII/SELECTION THIS PAPER CONSISTS OF 5 PRINTED PAGES AND 1 BLANK PAGE TURN OVER

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...