Computer Science Past Paper 2015

The Computer Science Past Paper 2015 closes the single-paper era. Q.2 covers CPU registers, deadlock prevention and IPv6. Q.3 covers the OSI layers, the instruction execution cycle, and paging and segmentation. Q.4 covers hash tables, function overloading and overriding, and diagram types. Q.5 covers data hiding, binary search trees and the incremental model. Q.6 covers display devices, CSS linking and normal forms. Q.7 closes with joins, web architectures and a line-drawing algorithm. This file holds the Part-II sheet only.

What this paper contains

  • This file carries Part-II (the descriptive part) of the paper.
  • Part-II — attempt ONLY FOUR questions, at least ONE from EACH of three sections; each question carries 20 marks (Part-I holds the 20 MCQs, per the printed header)

Note: the Part-I MCQ sheet for this year was not found in PDF form. The circulated paper holds Part-II only, so this page covers the Part-II sheet.

Part-II questions

SECTION-A

Q.2 — (a) Why Registers are used in CPU operations? Define the purposes of MAR, IR and Program Counter. (08)
(b) Give scheme for Deadlock Prevention. (06)
(c) Elaborate the concept of IPV6. Explain its advantages over IPV4. (06) (20)

Q.3 — (a) Explain the functionality of seven layers of OSI reference model and map with TCP/IP protocol suite. (08)
(b) Discuss Instruction Execution Cycle. (06)
(c) Briefly explain Paging and Segmentation with diagrams. (06) (20)

SECTION-B

Q.4 — (a) Explain the functionality of Hash Table. By supposing that table size is 100, give steps to insert data 112, 2023, 3001 into Hash Table and then to search 2023 from Hash Table. (08)
(b) What is the difference between Function Overloading and Function Overriding? Explain your answer by giving example syntax for each one. (06)
(c) Write short notes on the following: (06)
I. USECASE Diagram II. Activity Diagram (20)

Q.5 — (a) Write down difference between: (08)
I. Data Hiding and Encapsulation II. Constructor and Copy Constructor
(b) Build and draw a Binary Search Tree for the following input data 25, 11, 75, 69, 115, 50, 72, 17, 200, 60, 35. (06)
(c) Explain Incremental Model of Software Engineering by giving its advantages over other models. (06) (20)

SECTION-C

Q.6 — (a) Write down notes on the following: (08)
I. CRT Display Devices II. LCD Display Devices
(b) What is CSS? How many ways are there to link CSS and XHTML? (06)
(c) Write note on the followings: (06)
I. 3NF II. BCNF (20)

Q.7 — (a) Differentiate between the following by giving their respective definitions and concepts (08)
I. Equvi Join II. Outer Join III. Natural Join
(b) What are different web Architectures? Explain their Advantages and Disadvantages. (06)
(c) Write down Incremental Algorithm for Line drawing from p0(x0,y0) → p1(x1,y1) where x1>x0 and |dx|>|dy| (06) (20)

Download Computer Science Past Paper 2015 (PDF)

Computer Science Past Paper 2014 · All Computer Science Past Papers