Open navigation menu
Close suggestions
Search
Search
en
Change Language
Upload
Sign in
Sign in
Download free for days
0 ratings
0% found this document useful (0 votes)
79 views
9 pages
ISC 2016 Computer Science Theory Class XII
Computer science therory paper
Uploaded by
Kushagra Saxena
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here
.
Available Formats
Download as PDF or read online on Scribd
Download
Save
Save ISC 2016 Computer Science Theory Class XII For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
0 ratings
0% found this document useful (0 votes)
79 views
9 pages
ISC 2016 Computer Science Theory Class XII
Computer science therory paper
Uploaded by
Kushagra Saxena
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here
.
Available Formats
Download as PDF or read online on Scribd
Carousel Previous
Carousel Next
Download
Save
Save ISC 2016 Computer Science Theory Class XII For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
Download now
Download
You are on page 1
/ 9
Search
Fullscreen
COMPUTER SCIENCE PAPER 1 (THEORY) (Maximum Marks: 70) (Time allowed: Three hours) (Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writ is ti “Answer all questions in Part I (compulsory) and six questions from Part-I, 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 brackes PART I (20 Marks) Answer all questions. While answering questions in this Part, indicate briefly your working and reasoning, wherever required, Question 1 (a) State Involution law and prove it with the help of a truth table. (1) (b) Show that X V ~(Y AX) is a tautology. (1) (©) Find the dual of: ti YX+X41=1 @ Write the maxterm and minterm, when the inputs are A=0, B=1, C=1 and D=0, (1) (©) Draw the logic circuit of a NAND gate using NOR gates only. tl Question 2 (a) Define the term fall through condition with reference to switch( ) case. 21 (b) Convert the following infix expression to postfix form: Ry} A+B/C*(D/E*F) (© A matrix A{m}[n] is stored with each element requiring 4 bytes of storage. ‘If the [2] base address at A[I][1] is 1500 and the address at A[4][5] is 1608, determine the number of rows of the matrix when the matrix is stored in Column Major Wise. ‘This Paper consists of 9 printed pages and 1 blank page, 1 1216-868 A © Copyright reserved. YEARS QUESTION PAPER.COM(4) _ From the class declaration given below, state the nature of the identifiers A,B,C [2] and D: class A extends B implements C, D (©) State one advantage and one disadvantage of using recursion over iteration. (2) Question 3 The following function Check( ) is a part of some class. What will the function Cheek() [5] - retum when the values of both ‘m’ and ‘n’ are equal to 5? Show the dry run / working. int Check (int m, int n) return ++m + Check (m, ——n); } PART - II (50 Marks) 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 {@) Given the Boolean function F(A, B, C, D) = E (1,3,5,7,8,9,10,11,14,15). (i) Reduce the above expression by using 4-variable Kamaugh map, showing [4] the various groups (i.e. octal, quads and pairs). (ii) Draw the logic gate diagram for the reduced expression. Assume that the [1] variables and their complements are available as inputs. (b) _ Given the Boolean function: F(A, B, C, D) = 2(4,6,7,10,11,12,14,15). (@ Reduce the above expression by using 4-variable Kamaugh map, showing [4] the various groups (i.e. octal, quads and pairs). Gi) Draw the logic gate diagram for the reduced expression. Assume that the [1] variables and their complements are available as inputs. YEARS 1216-868A, QUESTION PAPER.COMQuestion 5 (@) What is adecoder? Draw the logic diagram for a binary to octal (3 to 8) decoder. [3] (®) How is a half adder different from a full adder? Draw the truth table and derive [4] the SUM and CARRY expression for a full adder. Also, draw the logic diagram for a full adder. (©) State whether the following expression is a Tautology, Contradiction or a {3} Contingency, with the help of a truth table: (XZ) V ~ [(K=Y) A (Y=>2)] Question 6 : (@) A passenger is allotted a window seat in an aircraft, if he/she satisfies the criteria [5] given below: © The passenger is below 15 years and is accompanied by an adult. OR © The passenger isa lady and is not accompanied by an adult, OR . The passenger is not below 15 years, but is travelling for the first time. The inputs are: INPUTS A The passenger is below 15 years age. C__| The passenger is accompanied by an adult, ; L The passenger is a lady, F The passenger is travelling for the first time. (Inall the above cases | indicates yes and 0 indicates no). Output: ~W — Denotes the passenger is allotted a window seat (1 indicates yes and 0 indicates no) Draw the truth table for the inputs and outputs given above and write the SOP expression for W(A,C,L,F), (b) State the complement properties. Find the complement of the following Boolean [3] expression using De Morgan’s law: AB'+ A'+BC (©) _ Differentiate between Canonical form and Cardinal form of expression. 2 3 YEARS. 1216-868A QUESTION PAPER.COMSECTION -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 A disarium number is a number in which the sum of the digits to the power of their [10] respective position is equal to the number itself. Example: 135=1'+37+5? Hence, 135 is a disarium number. Design a class Disarium to check if a given number is a disarium number or not. Some of the members of the class are given below: Class name Disarium Data members/instance variables: int num : stores the number int size + stores the size of the number Methods/Member functions: Disarium(int nn) : parameterized constructor to initialize the data members n= nn and size = 0 void countDigit() : counts the total number of digits and assigns it to size int sumofDigits(int n, intp) : returns the sum of the digits of the number(n) to the power of their respective positions(p) using recursive technique void check( ) : checks whether the number is a disarium number and displays the result with an appropriate message Specify the class Disarium giving the details of the constructor( ), void countDigit( ), int sumofDigits(int, int) and void check(). Define the main( ) function to create an object and cail the functions accordingly to enable the task. a YEARS. 1216-868 QUESTION PAPER.COMQuestion 8 A class Shift contains a two dimensional integer array of order (mxn) where the maximum [10] values of both m and n is 5. Design the class Shift to shuffle the matrix (i.e. the first row becomes the last, the second row becomes the first and so on). The details of the members of the class are given below: Class name Data member/instance variable: mat{ JE] m a Member functions/methods: Shift(int mm, int nn ) void input( ) void cyclic(Shift P) void display( ) Shift stores the array element integer to. store the number of rows integer to store the number of columns parameterized constructor to initialize the data members m= mm and n = nn enters the elements of the array enables the matrix of the object(P) to shift each row upwards in a cyclic manner and store the resultant matrix in the current object displays the matrix elements Specify the class Shift giving details of the constructor( ), void input( ), void cyelic(Shift) and void display( ). Define the main( ) function to create an object and call the methods accordingly to enable the task of shifting the array elements. 1216-8684 10 YEARS QUESTION PAPER.COMQuestion 9 A class ConsChange has been defined with the following details: {10] Class name : ConsChange Data members/instance variables: . word : stores the word Jen : stores the length of the word Member functions/methods: . ConsChange( ) : default constructor void readword( ) : accepts the word in lowercase void shiftcons( ) : shifts all the consonants of the word at the beginning followed by the vowels (e.g. spoon becomes spnoo) changes the case of all occurring consonants of the shifted word to uppercase, for e.g. (spnoo becomes SPNoo) void show( ) : displays the original word, shifted word and the changed word void changeword( ) Specify the class ConsChange giving the details of the constructor( ), void readword( ), void shifteons( ), void changeword( ) and void show( ). Define the main( ) function to create an object and call the functions accordingly to enable the task. 10 YEARS 1216-868A QUESTION PAPER.COMSECTION-C Answer any two questions. Each program should be written in such a way that it clearly depicts the logic of the problem stepwise. This can be achieved by using comments in the program and mnemonic names or pseudo codes for algorithms. The programs must be written in Java and the algorithms must be written in general / standard form, wherever required / specified. (Flowcharts are not required.) Question 10 A super class Bank has been defined to store the details of a customer. Define a sub-class Account that enables transactions for the customer with the bank. The details of both the classes are given below: Class name Bank Data member/instance variable: name stores the name of the customer aceno stores the account number P stores the principal amount in decimals Member functions/methods: Bank(...) parameterized constructor to assign values to the instance variables void display( ) displays the details of the customer Class name: Account Data member/instance variable: amt stores the transaction amount in decimals Member functions/methods: Account(...) parameterized constructor to assign values to the instance variables of both the classes void deposit( ) accepts the amount and updates the principal as void withdraw( ) void display() p=p+amt accepts the amount and updates the principal as p=p-amt If the withdrawal amount is more than the principal amount, then display the message “INSUFFICIENT BALANCE”. If the principal amount after withdrawal is less than 500, then a penalty is imposed by using the formula p=p-(500-py/10 displays the details of the customer Assume that the super class Bank has been defined. Using the concept of Inheritance, specify the class Account giving details of the constructor(...), void deposit( ), void withdraw( ) and void display(). The super class and the main function need not be written. 1216-868A 10 YEARS QUESTION PAPER.COMQuestion 11 A bookshelf is designed to store the books in a stack with LIFO(Last In First Out) 65) operation. Define a class Book with the following specifications: Class name < Book Data members/instance variables: namef ] : stores the names of the books point : stores the index of the topmost book max : stores'the maximum capacity of the bookshelf Methods/Member functions: Book(int cap) : constructor to initialise the data members max = cap and point = —1 void tell( ) : displays the name of the book which was last . entered in the shelf. If there is no book left in the shelf, displays the message “SHELF EMPTY” void add(String v) : adds the name of the book to the shelf if possible, otherwise displays the message “SHELF FULL” void display( ) : displays all the names of the books availablé in the shelf Specify the class Book giving the details of ONLY the functions void tell( ) and void add(String), Assume that the other functions have been defined. The main function need not be written. Question 12 . (@) A linked list is formed from the objects of the class Node. The class structure of [2] the Node is given below: class Node £ String name; Node next; } Write an Algorithm OR a Method to search for a given name in the linked list, The method of declaration is given below: boolean searchName(Node start, String v) YEARS 1216-8684 QUESTION PAPER.COM(b) Answer the following questions from the diagram of a Binary Tree given below: G) Write the inorder traversal of the above tree structure. fy) (ii) Name the parent of the nodes B and G. Tl (iii) Name the leaves of the right sub-tree. rea 9 YEARS 1216-868A QUESTION PAPER.COM
You might also like
CLASS 11 Computer Science Term - 4 2021-22
PDF
No ratings yet
CLASS 11 Computer Science Term - 4 2021-22
4 pages
Comp Theory Paper Class 11 - Final - 2023-24
PDF
No ratings yet
Comp Theory Paper Class 11 - Final - 2023-24
9 pages
Semester 2: Class XII (ISC) COMPUTER SCIENCE Paper 1 (Theory)
PDF
No ratings yet
Semester 2: Class XII (ISC) COMPUTER SCIENCE Paper 1 (Theory)
5 pages
Target ISC 2012 Computer Science
PDF
50% (2)
Target ISC 2012 Computer Science
11 pages
ISC 2016 Computer Science Theory Paper 1 Solved Paper
PDF
0% (1)
ISC 2016 Computer Science Theory Paper 1 Solved Paper
27 pages
ISC 2018 Computer Science Theory Solved Paper
PDF
80% (5)
ISC 2018 Computer Science Theory Solved Paper
24 pages
ClassX1 Annual
PDF
No ratings yet
ClassX1 Annual
4 pages
Computer Science Paper
PDF
No ratings yet
Computer Science Paper
8 pages
ISC 2007 Computer Science Paper 1 Theory
PDF
100% (1)
ISC 2007 Computer Science Paper 1 Theory
6 pages
Annual Exam COMPUTER SC Class XI
PDF
No ratings yet
Annual Exam COMPUTER SC Class XI
8 pages
2007 IscTheory Repeat
PDF
No ratings yet
2007 IscTheory Repeat
7 pages
Computer Science Sample Paper
PDF
No ratings yet
Computer Science Sample Paper
5 pages
ISC 2009 Computer Science Paper 1 Theory
PDF
No ratings yet
ISC 2009 Computer Science Paper 1 Theory
8 pages
ISC 2011 Computer Science Theory Paper
PDF
100% (2)
ISC 2011 Computer Science Theory Paper
9 pages
Cts 1 Specimen 2010
PDF
No ratings yet
Cts 1 Specimen 2010
9 pages
Acme Public Schoo1 Xii
PDF
No ratings yet
Acme Public Schoo1 Xii
9 pages
Asg202406050946164687 1 17
PDF
No ratings yet
Asg202406050946164687 1 17
19 pages
Soz 0 U FIh YObg HDTD JBT B
PDF
No ratings yet
Soz 0 U FIh YObg HDTD JBT B
22 pages
Computer GP 1
PDF
No ratings yet
Computer GP 1
10 pages
Set 3
PDF
No ratings yet
Set 3
8 pages
ISC Class 12 Computer Science Paper 1 (Theory) Question Paper - 2019
PDF
No ratings yet
ISC Class 12 Computer Science Paper 1 (Theory) Question Paper - 2019
10 pages
Class XII Practice Paperdda
PDF
No ratings yet
Class XII Practice Paperdda
7 pages
Death
PDF
No ratings yet
Death
19 pages
CBSCOMPPAPER1
PDF
No ratings yet
CBSCOMPPAPER1
10 pages
Adobe Scan Mar 16, 2024
PDF
No ratings yet
Adobe Scan Mar 16, 2024
12 pages
Ics Xii 2023 Pre Test Mhms
PDF
No ratings yet
Ics Xii 2023 Pre Test Mhms
11 pages
1 GD005 H 0 CH N7 LX Huf HQG
PDF
No ratings yet
1 GD005 H 0 CH N7 LX Huf HQG
9 pages
BCDV E88 BD9 KV Nep 6 KX88
PDF
No ratings yet
BCDV E88 BD9 KV Nep 6 KX88
10 pages
Set 2
PDF
No ratings yet
Set 2
10 pages
QP-Computer Science - 2024
PDF
No ratings yet
QP-Computer Science - 2024
11 pages
Class 11 Annual 2020 (Comp SC P.ed)
PDF
No ratings yet
Class 11 Annual 2020 (Comp SC P.ed)
9 pages
2010 Isctheory PDF
PDF
No ratings yet
2010 Isctheory PDF
8 pages
Adobe Scan 23-Sept-2023
PDF
No ratings yet
Adobe Scan 23-Sept-2023
5 pages
Computer Prelims-1yijhiokjj
PDF
No ratings yet
Computer Prelims-1yijhiokjj
6 pages
Isc 2024
PDF
No ratings yet
Isc 2024
6 pages
Computer Mock 2024
PDF
No ratings yet
Computer Mock 2024
8 pages
LMB Comp 2
PDF
No ratings yet
LMB Comp 2
8 pages
Class XI - Worksheet
PDF
No ratings yet
Class XI - Worksheet
5 pages
Paper 1 Sample Paper 2022-2023
PDF
No ratings yet
Paper 1 Sample Paper 2022-2023
7 pages
Preprelims 2022
PDF
No ratings yet
Preprelims 2022
7 pages
ISC 2012 Computer Science Paper 1 Theory
PDF
No ratings yet
ISC 2012 Computer Science Paper 1 Theory
10 pages
CMS FIRSTComparative 2020-2021
PDF
No ratings yet
CMS FIRSTComparative 2020-2021
6 pages
Unsolved CTS 2024
PDF
No ratings yet
Unsolved CTS 2024
6 pages
Class12selection2022 23
PDF
No ratings yet
Class12selection2022 23
5 pages
Computer Science 2022-23
PDF
No ratings yet
Computer Science 2022-23
6 pages
XII Cs
PDF
No ratings yet
XII Cs
6 pages
CSC Answer Key - XII
PDF
No ratings yet
CSC Answer Key - XII
13 pages
Sample Paper - Computer-Xii
PDF
No ratings yet
Sample Paper - Computer-Xii
5 pages
2016 iscTheorySpecimen
PDF
No ratings yet
2016 iscTheorySpecimen
6 pages
868A Computer Science-1
PDF
No ratings yet
868A Computer Science-1
9 pages
ISC 2010 Computer Science Paper 1 Theory
PDF
No ratings yet
ISC 2010 Computer Science Paper 1 Theory
8 pages
Computer Science Paper 1 Theory Year 2013
PDF
No ratings yet
Computer Science Paper 1 Theory Year 2013
8 pages
Half Yearly Exam: 2021-22
PDF
No ratings yet
Half Yearly Exam: 2021-22
4 pages
Isc Specimen Paper Computer Science Paper 1 (Theory)
PDF
No ratings yet
Isc Specimen Paper Computer Science Paper 1 (Theory)
7 pages
ISC 2011 Computer Science Paper 1 Theory
PDF
No ratings yet
ISC 2011 Computer Science Paper 1 Theory
7 pages
ISC 2016 Class 12 Computer Science Paper
PDF
No ratings yet
ISC 2016 Class 12 Computer Science Paper
8 pages
Computer Science
PDF
No ratings yet
Computer Science
6 pages