CBSE 2016 Computer Science Question Paper for Class 12

About this paper

This is the CBSE Class 12 Computer Science paper from the 2016 board examination, code 91 (Series SSO, Set 4). It carries 70 marks over three hours and has 7 questions across three sections. Students answer either Section A, written for C++, or Section B, written for Python; each has four questions on programming, object-oriented concepts, data structures and file handling. Section C is compulsory for all and covers keys and SQL queries on DEPT and EMPLOYEE tables, Boolean algebra with a canonical POS form and a K-map reduction, and networking, ending with a case study on connecting the Hyderabad campus and Delhi head office of an education company. This copy has the questions only, without solutions.

Exam

CBSE Class 12

Subject

Computer Science

Year

2016

Paper code

91

Maximum marks

70

Time allowed

3 hours

Questions

7

Pages

21

Answers included

No, questions only

Paper pattern

• Section A

  Questions 1–4 for C++ candidates: C++ basics and output questions, classes, constructors and inheritance, arrays and stacks, and data file handling

• Section B

  Questions 1–4 for Python candidates: Python basics and output questions, classes and exceptions, sorting, searching and stacks, and file handling

• Section C

  Questions 5–7, compulsory for all: SQL and keys, Boolean algebra, and communication and network concepts

Topics covered

• C++ programming and output questions
• Classes, constructors and destructors
• Inheritance
• Arrays and address calculation
• Stacks and postfix expressions
• Data file handling
• Python classes and exception handling
• Sorting and binary search
• Database concepts and SQL
• Boolean algebra and K-maps
• Networking and cyber security

Questions from this paper

1. A two-dimensional array ARR[50][20] is stored in memory along the row, with each element occupying 4 bytes. Find the address of the element ARR[30][10] if the element ARR[10][5] is stored at memory location 15000.
2. Convert the infix expression U * V + R / (S − T) to its equivalent postfix expression, showing the stack contents for each step of conversion.
3. Write a method in Python to find and display the composite numbers between 2 and N, passing N as an argument to the method.
4. Evaluate the postfix expression 34, 23, +, 4, 5, *, − and show the status of the stack after every operation.
5. What kind of data gets stored in cookies and how is it useful?
6. What is a Trojan Horse?