Trending ▼  

ISC Specimen 2016 Computer Science Paper 1

8 pages, 30 questions, 4 questions with responses, 4 total responses
Isc
Indian School Certificate Examination (ISC), New Delhi
+Fave Message
 Home > isc >

Formatting page ...
 

COMPUTER SCIENCE Paper 1 (THEORY) (Three hours) Maximum Marks: 70 (Candidates are allowed additional 15 minutes for only reading the 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 questions are given in brackets [ ]. ----------------------------------------------------------------------------------------------------------------------PART I Answer 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 a truth table. [1] (b) Draw the truth table to prove the proportional logic expression. [1] (x => y) (y => x) = x <=> y (c) Find the dual for the Boolean equation: AB + BC + 1 = 1. [1] (d) Convert the Boolean expression F(X,Y,Z) = X Y Z + X YZ + XYZ into its cardinal form. [1] (e) Minimize F = XY + (XZ) +XY Z using Boolean laws. [1] Question 2 (a) Differentiate between Stack data structure and Queue data structure. [2] (b) Convert the following infix notation to postfix: [2] A*(B/C)/E+F (c) Define Interface. How is it different from a Class? [2] ---------------------------------------------------------------------------------------------------------------------------1 ISC SPECIMEN QUESTION PAPER 2016

Formatting page ...
 

(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. [2] (e) Define Big O notation. State the two factors which determine the complexity of an algorithm. [2] Question 3 The following is a function of some class. What will be the output of the function test ( ) when [5] the value of count is equal to 4 ? Show the dry run / working. void test (int count ) { if ( count = = 0) System.out.println( ); else { System.out.println( Bye + count); test( --count ); System.out.println( + count); } } ---------------------------------------------------------------------------------------------------------------------------2 ISC SPECIMEN QUESTION PAPER 2016

Top Contributors
to this ResPaper
(answers/comments)


Darius Stone

(2)

Aquib Khan

(1)

Sdfg Sdfg

(1)

Formatting page ...
 

PART II Answer six questions in this part, choosing two questions from Section A, two from Section B and two from Section C. SECTION - A Answer any two questions. Question 4 (a) Given F(A,B,C,D) = ( 0, 2, 3, 6, 8, 10, 11, 14, 15 ) (i) [4] (ii) Draw the logic gate diagram for the reduced expression. Assume that the variables and their complements are available as inputs. (b) Reduce the above expression by using 4-variable Karnaugh map, showing the various groups (i.e. octal, quads and pairs). [1] Given F(P,Q,R,S) = ( 5, 7, 8, 10, 12, 14, 15 ) (i) Reduce the above expression by using 4-variable Karnaugh map, showing the various groups (i.e. octal, quads and pairs). (ii) Draw the logic gate diagram for the reduced expression. Assume that the variables and their complements are available as inputs. [4] [1] Question 5 (a) (b) (c) Draw the logic diagram and truth table to encode the decimal numbers ( 2, 3, 5, 7, 8 ) and briefly explain its working. [5] Simplify the following Boolean expression and draw the gate for the reduced expression. F= A B + AB C + A [2] Define Universal gates. Give one example and show how it works as an OR gate. [3] Question 6 (a) Draw a truth table with a 3 input combination which outputs 1 if there are odd number of 0 s. Also derive an SOP expression for the output. Reduce the expression using Karnaugh Map. [5] (b) Define Proposition. How does tautology differ from contradiction? [2] (c) Briefly explain the working of a 4:1 multiplexer. Also draw the logic diagram of 4:1 multiplexer. [3] ---------------------------------------------------------------------------------------------------------------------------3 ISC SPECIMEN QUESTION PAPER 2016

Formatting page ...
 

SECTION B 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 7 [10] A class Composite contains a two dimensional array of order [m x n]. The maximum values possible for both m and n is 20. Design a class Composite to fill the array with the first (m x n) composite numbers in column wise. The details of the members of the class are given below: Class name : Composite Data members /instance variables : arr[ ][ ] : stores the composite numbers column wise m : integer to store the number of rows n : integer to store the number of columns Member functions : Composite(int mm, int nn ) : to initialize the size of the matrix m=mm and n=nn int isComposite( int p ) : returns 1 if number is composite otherwise returns 0. void fill ( ) : to fill the elements of the array with the first (m n) composite numbers in column wise void display( ) : displays the array in a matrix form. Specify the class Composite giving details of the constructor(int,int), int isComposite(int), void fill( ) and void display( ). Define a main( ) function to create an object and call the functions accordingly to enable the task. ---------------------------------------------------------------------------------------------------------------------------4 ISC SPECIMEN QUESTION PAPER 2016

Formatting page ...
 

Question 8 [10] Design a class Sort which enables a word to be arranged in alphabetical order. The details of the members of the class are given below : Class name : Sort Data members /instance variables: Str : stores a word len : to store the length of the word Member functions : Sort( ) : default constructor void readword( ) : to accept the word void arrange ( ) : to arrange the word in alphabetical order using any standard sorting technique. void display( ) : displays the original word along with the sorted word Specify the class Sort giving details of the constructor, void readword( ), void arrange( ), and void display( ). Define the main( ) function to create an object and call the functions accordingly to enable the task. Question 9 A Special number is a number in which the sum of the factorial of its digits is equal to the number. Example: 145 ( 1! + 4! + 5! = 145 ). Thus, 145 is a special number. Design a class Special to check if the given number is a Special number or not. Some of the members of the class are given below: Class name : [10] Special Data members /instance variables : n : integer to store the number Member functions : Special( ) : default constructor void read( ) : to accept the number int factorial(int x) : return the factorial of a number using recursion technique. boolean isSpecial( ) : checks for the special number by invoking the function factorial( ) and returns true if Special, otherwise returns false void display( ) : to show the result with an appropriate message. Specify the class Special, giving details of the Constructor, void read( ), int factorial(int), boolean isSpecial( ) and void display( ). Define the main() function to create an object and call the member function according to enable the task. ---------------------------------------------------------------------------------------------------------------------------5 ISC SPECIMEN QUESTION PAPER 2016

Formatting page ...
 

SECTION C Answer any two questions Each Program should be written in such a way that it clearly depicts the logic of the problem step wise. This can also be achieved by using comments in the program and mnemonic names or pseudo codes for algorithms. The program must be written in Java and the algorithms must be written in general / standard form, wherever required / specified. (Flowcharts are not required.) Question 10 [5] A super class Account contains employee details and a sub class Simple calculates the employee s simple interest. The details of the two classes are given below: Class name : Account Data Members: Name Pan Principal acc_no : : : : stores the employee name stores the employee PAN number stores the Principal amount (in decimals) stores the employee bank account number Account( . ) : void display( ) : parameterized constructor to assign value to data members to display the employee details Member functions: Class name Data Members: time rate interest : Simple : : : stores the time duration stores the rate of interest stores the simple interest Simple( . ) : void calculate( ) : parameterized constructor to assign value to data members of both the classes. calculates the simple interest as (Principal time rate) / 100 void display( ) : Member functions: displays the employee details along with the rate, time and interest. Assume that the super class Account has been defined. Using the concept of inheritance, specify the class Simple giving details of constructor, void calculate( ) and void display( ). The super class and the main function need not be written. ---------------------------------------------------------------------------------------------------------------------------6 ISC SPECIMEN QUESTION PAPER 2016

Formatting page ...
 

Question 11 [5] A dequeue enables the user to add and remove integers from both the ends i.e. front and rear. Define a class DeQueue with the following details: Class name : DeQueue Data Members: ele[ ] : array to hold the integer elements. cap : stores the maximum capacity of the array. front : to point the index of the front. rear : to point the index of the rear. DeQueue(int max) : constructor to initialize the data member cap = max, front = rear = 0 and create the integer array void pushfront(int v) : to add integers from the front index if possible else display the message( full from front ). int popfront( ) : to remove the return elements from front. If array is empty then return-999. void pushrear(int v) : to add integers from the front index if possible else display the message( full from rear ). int poprear( ) : to remove and return elements from rear. If the array is empty then return-999. Member functions: Specify the class DeQueue giving the details of ONLY the constructor(int), pushfront(int) and int poprear ( ). Assume that the other functions have been defined. void The main( ) function need not be written. Question 12 (a) A linked list is formed from the objects of the class: class Node { int num; Node next; } Write an Algorithm OR a Method to insert a node at the beginning of an existing linked list. The method declaration is as follows: void InsertNode( Nodes starPtr, int n ) [4] [2] ---------------------------------------------------------------------------------------------------------------------------7 ISC SPECIMEN QUESTION PAPER 2016

Formatting page ...
 

(b) Answer the following questions from the diagram of a Binary Tree given below: (i) Name the Root and the leaves of the tree. [1] (ii) Write the post order traversal of the tree. [1] (iii) Separate the Internal nodes and the External nodes of the tree. [1] PLEASE NOTE: The total weightage of questions in the Question Paper will be as indicated in the Specimen Paper. However, breakup of subparts in questions may vary from one year to another. ---------------------------------------------------------------------------------------------------------------------------8 ISC SPECIMEN QUESTION PAPER 2016

 

  Print intermediate debugging step

Show debugging info


 


Tags : ISC Board, Council for the Indian School Certificate Examinations, ISC 2016 - 2017 Examination, 2017, 2016, 2015, 2014, 2013, 2012, 2011, ISC Solved Specimen Question Papers 2016 - 2017, ISC Solved Mock Guess Exam Papers, ISC Board Model Paper with Answers, Detailed Solutions & Explanations, isc sample question bank, past / old / last year online test papers, syllabus, online coaching.  

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

 

NEW: Save page on Android App
isc chat