Computer Science Paper II Past Paper 2017

The Computer Science Paper II Past Paper 2017 covers storage, networks and databases. Q.2 covers storage access, clock-speed limits and interrupt state diagrams. Q.3 covers HTTP with SIP, TCP with UDP, packet time and subnet addresses. Q.4 covers Optimal against LRU paging, deadlock conditions and round robin times. Q.5 covers CPU registers, Ethernet LAN and small jobs and pages. Q.6 covers normalization, database notes and centralized against distributed databases. Q.7 covers histograms, RGB storage and geometric transforms. Q.8 closes with web storage, SVG and non-breaking spaces. 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, TWO from EACH of two sections; each question carries 20 marks (Part-I holds the 20 MCQs, per the printed header)

Part-II questions

SECTION-A

Q.2 — (a) Discuss the following methods of storage systems: (8)
(i) Direct Access (ii) Random Access
(b) If clock speed reaches its maximum then what are the two methods to increase the performance of a computer? Briefly explain. (6)
(c) Draw and explain instruction execution state diagram with interrupt. (6) (20)

Q.3 — (a) Explain the following network protocols: (8)
(i) HTTP and SIP (ii) TCP and UDP
(b) What is the transmission time of a packet sent by a station if the length of the packet is 1 million bytes and the bandwidth of the channel is 200 Kbps? (6)
(c) Given the IP address 10.5.118.3 and the network mask 255.255.240.0, what are the assignable IP addresses and broadcast in this subnet? (6) (20)

Q.4 — (a) What are differences between Optimal & LRU (Least Recently Used) page Replacement Policies? (8)
(b) Discuss the four necessary conditions for deadlock to occur. How can we deny any two of these conditions? (6)
(c) Consider three processes given in the table. Find average waiting time and average turnaround (completion) time when these processes are scheduled using Round-Robin scheduling using time quantum (TQ) = 4.
Process — CPU Burst
P1 — 24
P2 — 7
P3 — 10 (6) (20)

Q.5 — (a) Explain the functionality and purposes of following registers with diagrams:
(i) Memory Address Register (MAR)
(ii) Memory Buffer Register (MBR)
(iii) Instruction Register (IR) (8)
(b) Discuss the functionality of Ethernet LAN and its types. (6)
(c) What happens in the following cases?
(i) If the job size is kept very low in time sharing systems.
(ii) If the page size is kept very small in paged memory management. (6) (20)

SECTION-B

Q.6 — (a) What is Normalization? Discuss 1NF, 2NF and 3NF with example(s). (8)
(b) Write short notes on the following: (6)
(i) Data (ii) Database (iii) Database Management System
(c) Differentiate between Centralized Database and Distributed Database. (6) (20)

Q.7 — (a) Define image histogram. What is meant by histogram equalization? Explain their applications in image processing. (8)
(b) Find the storage in bytes required to store a 256 x 200 colored image using RGB color model with 24 bit color depth. (6)
(c) Briefly explain Geometric Transformations. (6) (20)

Q.8 — (a) Explain the following web concepts: (8)
(i) localStorage and sessionStorage objects
(ii) Application cache in HTML5
(iii) Manifest file
(iv) Web Worker
(b) What is SVG? What are the advantages of SVG over JPEG or GIF? (6)
(c) Explain Non Breaking space in HTML with example. (6) (20)

Download Computer Science Paper II Past Paper 2017 (PDF)

Computer Science Paper II Past Paper 2018 · All Computer Science Past Papers · Computer Science Paper II Past Paper 2016