JAC Class 12 Computer Science Question Paper 2017 with Solution

About this paper

This is the Jharkhand Academic Council (JAC) Class 12 Computer Science paper from the 2017 board examination, with an answer under each question. Group A is 16 multiple-choice parts on loops, inheritance, operators, queues, normalisation and the OSI model. Section B, questions 2 to 10, asks about data hiding, sizes of constants, C++ expressions, stacks and queues, a linked-list search, normal forms, a truth table for XY + YZ + XZ, and a modem. Section C, questions 11 to 21, covers polymorphism, an electricity-bill program, postfix evaluation, Quick sort, SQL on a STUDENT table, a K-map and networking components. The bill uses Rs. 4, Rs. 5 and Rs. 6 per unit block, plus a meter charge of Rs. 70. Marks and time are not printed.

Exam

JAC Class 12

Subject

Computer Science

Year

2017

Questions

21

Pages

3

Answers included

Yes

Paper pattern

• Group A

  Question 1 with 16 multiple-choice parts

• Section B

  Questions 2–10, very short answers

• Section C

  Questions 11–21, long answers: programs, Quick sort, SQL, a K-map and networking

Topics covered

• C++ control statements and operators
• Constructors, inline functions and inheritance
• Data hiding and encapsulation
• Expressions and data types
• Stacks, queues and linked lists
• Quick sort
• Normalisation
• Boolean algebra and K-maps
• SQL
• Networking and the OSI model

Questions from this paper

1. Differentiate between data hiding and encapsulation.
2. What data types would you use for the registration letter of a car, the population of a city, the average marks in a class and the number of students in the class?
3. Describe the similarities and differences between queues and stacks.
4. What is polymorphism? Give an example of its implementation in C++.
5. An electricity board charges Rs. 4 per unit for the first 100 units, Rs. 5 per unit for the next 200 and Rs. 6 per unit beyond 300, plus a meter charge of Rs. 70. Write a C++ program to read the units and print the charges.
6. Write an algorithm for the Quick sort procedure.