Computer Science Paper II Past Paper 2018
The Computer Science Paper II Past Paper 2018 covers hardware, databases and images. Q.2 covers CPU registers, buses and pipelining. Q.3 covers hubs against switches, NAT and transport multiplexing. Q.4 covers resource allocation graphs, paging arithmetic and pooling against interrupts. Q.5 covers relational algebra sizes, keys and data independence. Q.6 covers sampling, filters and morphology. Q.7 covers histogram equalization, Sobel gradients and redundancies. Q.8 closes with three-tier architecture, XHTML against XML, and agile against waterfall. 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) Briefly describe the functionality of the following CPU special-purpose registers: Instruction Register (IR), Memory Data Register (MDR) and Program Counter (PC). (8)
(B) Differentiate between Address, Data and Control bus. (6)
(C) Discuss instruction pipelining in the context of fetch-decode-execute cycle. (6) (20)
Q.3 — (A) Differentiate between hub, bridge, switch and router. (8)
(B) Discuss how Network Address Translation (NAT) works and why is it useful? (6)
(C) Elaborate the working of multiplexing/de-multiplexing at the transport layer. (6) (20)
Q.4 — (A) There are three processes P A, P B and P C and three resources R A, R B and R C. Resources R A and R B have one instance each while resource R C has two instances. P A is holding one instance of R C and has requested for R A. Process P B is holding R A and has requested for R B. R B is allocated to P C which has also requested an instance of R C. Represent the scenario with a resource allocation graph. Discuss whether there is a deadlock or not? If yes, which processes are blocked? (8)
(B) In the context of Paging, consider the case where memory addresses are 32 bits i.e. 20 bits Virtual Page Numbers and 12 bits of offset. How many virtual pages are there and what is the size of each page? Given the virtual address 0x7589, find the virtual page number and offset. If the respective page table entry contains 0x900DF, find the physical address. (6)
(C) In the context of I/O management, differentiate between Pooling and Interrupts. (6) (20)
SECTION-B
Q.5 — (A) Given two relations R and S, where R contains M tuples, S contains N tuples, and M > N > 0, give the minimum and maximum possible sizes (in tuples) for the resulting relation produced by each of the following relational algebra expressions.
i. R − S
ii. R ∪ S
iii. R ∩ S
iv. R × S (Cartesian product, as printed by symbol on the sheet)
(B) Elaborate the concepts of super key, candidate key and foreign key with examples. (6)
(C) Discuss the difference between physical data independence and logical data independence. (6) (20)
Q.6 — (A) Differentiate between image sampling and quantization. Discuss how these concepts relate to spatial and intensity resolutions. (8)
(B) In the context of image smoothing, discuss the differences between mean and median filters. (6)
(C) For the image ‘X’ shown in Figure 1, show the result of applying the given morphological operators. Assume zero padding for border pixels.
i. Dilation of X by structuring element [1 1 1].
ii. Erosion of X by structuring element [1 1 1]T
iii. Dilation of X by a 3×3 structuring element containing all ones. (6) (20)
Q.7 — (A) Perform histogram equalization on the 8-bit image shown in Figure 2. (8)
(B) For the 3×3 image shown in the following, apply the horizontal and vertical Sobel operators and compute the magnitude of gradient at the central pixel with intensity value 50.
5 5 5
5 50 5
5 5 5 (6)
(C) In the context of compression, differentiate between coding, spatial and temporal redundancies. (6) (20)
Q.8 — (A) Elaborate the concept of three tier architecture with reference to presentation, business logic and data access layers. (8)
(B) Differentiate between XHTML and XML. (6)
(C) Discuss Agile and Water Fall methodologies in the context of web application development. (6) (20)
Computer Science Paper II Past Paper 2019 · All Computer Science Past Papers · Computer Science Paper II Past Paper 2017
