Computer Science Paper II Past Paper 2022

The Computer Science Paper II Past Paper 2022 covers scheduling, pipelines and the web. Q.2 covers round robin scheduling, C-SCAN seeks and concurrency issues. Q.3 covers Banker’s algorithm, logical file systems and threads. Q.4 covers pipeline diagrams, set associative cache and DMA priority. Q.5 covers routing algorithms, campus design and the TCP handshake flaw. Q.6 covers morphological reflections, RGB profiles and image processing. Q.7 covers three-tier architecture, jQuery effects and web promotion. Q.8 closes with web testing, DOM with XML and RSS, and JSP database access. 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) The following processes are being scheduled using a preemptive, round robin scheduling algorithm. Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. In addition to the processes listed below, the system also has an idle task (which consumes no CPU resources and is identified as Pidle). This task has priority 0 and is scheduled whenever the system has no other available processes to run. The length of a time quantum is 10 units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue.
Process — Priority — Burst — Arrival
P1 — 40 — 20 — 0
P2 — 30 — 25 — 25
P3 — 30 — 25 — 30
P4 — 35 — 15 — 60
P5 — 5 — 10 — 100
P6 — 10 — 10 — 105
Show the scheduling order of the processes using a Gantt chart. What is the turnaround time and waiting time for each process? (10)
(b) Suppose the disk head is initially located at track 20, set to move in order of increasing tracks. Assume a disk with 100 tracks and that the disk request queue has random requests in it. The requested tracks, in the order received by the disk scheduler, are 18, 25, 73, 46, 9, 92. Using C-SCAN algorithm, find the performance in terms of average seek time. (6)
(c) What design and management issues are raised by the existence of concurrency? (4) (20)

Q.3 — (a) Consider the following snapshot of the system.
(Snapshot table as printed on the sheet.)
Using banker’s algorithm, determine whether the state is safe or unsafe. If the state is safe, illustrate the order in which the processes may complete. Otherwise, illustrate why the state is unsafe. (12)
(b) Give an account of different functions of Logical File System. (4)
(c) What resources are used when a thread is created? How do they differ from those used when a process is created? (4) (20)

Q.4 — (a) Assume a pipeline with four stages: fetch instruction (FI), decode instruction and calculate addresses (DA), fetch operand (FO), and execute (EX). Draw a diagram for a sequence of 7 instructions, in which the third instruction is a branch that is taken and in which there are no data dependencies. (8)
(b) A set associative cache consists of 64 lines, or slots, divided into 4-slot sets. Main memory contains 4K blocks of 128 words each. Show the format of main memory addresses. (6)
(c) Why is DMA access to main memory given higher priority than CPU access to main memory? (6) (20)

Q.5 — (a) Describe any one of the routing algorithms in detail, which is used to resolve the conflict between path selections. (8)
(b) A company occupies four buildings on a campus. Each of these building has a 100 base T network running to all the floors. The buildings form a square 100 meter on each side. The network must support 100 Mbps data transfer rate. What will be the proposed design solution under the given condition? (6)
(c) What is the main fault in TCP 3-way handshake which makes it a boon for attackers? Many operating systems generally associate a “Backlog” parameter with a listening socket that sets cap on the number of TCBs simultaneously in SYN-RECEIVED state. Does this parameter solve the problem in TCP 3-way handshake? (6) (20)

SECTION-B

Q.6 — (a) Find the reflection,, of each of the following Structuring Elements (SE). The dot indicates the origin of the SE.
(SE figures as printed on the sheet.) (8)
(b) The R, G, and B component images of an RGB image have the horizontal intensity profiles shown in the following diagram. Show your working to identify color that a person would see in the middle column of this image? (8)
(c) How Digital Image Processing and Computer Vision are related? Discuss. (4) (20)

Q.7 — (a) Explain 3-tier web application architecture. (8)
(b) Write the jQuery code to slide elements up and down. Also write the code to fade the elements in and out of visibility. Use HTML, CSS, and jQuery. (6)
(c) What is web application promotion? Discuss some of the common webvertising methods. (6) (20)

Q.8 — (a) Explain process of Web Application Testing. (8)
(b) Explain in detail the Document Object Model (DOM). Also discuss XML and RSS. (6)
(c) Explain how can you access a database from a JSP page? Give the database connectivity issues in details. (6) (20)

Download Computer Science Paper II Past Paper 2022 (PDF)

Computer Science Paper II Past Paper 2023 · All Computer Science Past Papers · Computer Science Paper II Past Paper 2021