CSS Computer Science Past Paper 2023

Instructions specific to this paper

• Attempt ONLY FOUR questions from PART-II, by selecting TWO questions from EACH
• Attempt ONLY FOUR questions from PART-II by selecting TWO questions from EACH SECTION.

Questions

1. Q. 28 marks

   (a) Write a detailed note on any 03 Super Computing Technologies being used in the world. List key characteristics in each case. (b) What performance metrics are used to analyze the capacity of Super Computers? (6) Discuss. (c) Discuss the role of Web Crawling, Indexing & Searching operations for a Search (6) Engine.

2. Q. 38 marks

   (a) How does dynamic memory allocation is managed programmatically in a C++ program? Clarify yours understanding through a viable program. (b) Write a note on the use of overloaded operators. Discuss with examples. (6) (c) What is bit twiddling? Give brief description. (6) Q. No. . (a) What is Polymorphism? Explain Ad-Hoc Polymorphism, Parametric Polymorphism (8) & Subtyping with suitable coding examples. (b) Discuss Late Binding with a short program. (6) (c) Differentiate between Abstraction & Encapsulation. (6)

3. Q. 412 marks

   (a) A 32-bit computer has two selector channels and one multiplexor channel. Each selector channel supports two magnetic disk and two magnetic tape units. The multiplexor channel has two line printers, two card readers, and ten VDTs terminals connected to it. Assume the following transfer rates. Disk drive 800 Kbytes/s Magnetic tape drive 200 Kbytes Line printer 6.6 Kbytes/s Card Reader 1.2 Kbytes/s VDT 1 Kbytes/s Estimate the maximum aggregate I/O transfer rate in this system. (b) Consider a program that access a single I/O device and compare un- buffered I/O (8) (20) to the use of a buffer. Show that the use of buffer can reduce the running time by at most a factor of two.

4. Q. 58 marks

   (a) For analyzing an Algorithm theoretically & asymptotically, give a detailed note on Input size, unit of time & order of growth. Support your answer with appropriate mathematical equations. (b) Briefly describe the four types of analysis we may perform to evaluate the (6) asymptotic behavior of an algorithm. (c) Evaluate order of growth of the functions given below. Compare & write down (6) which one has higher, same or lower order of growth than the other one: I. n(n+1) and 2000n2 II. 100n2 and 0.01n3 III. Log2 n and ln n IV. 2n-1 and 2n V. (n-1)! and n!

5. Q. 68 marks

   (a) Discuss the architecture of aspect-oriented system. (b) Briefly discuss the motivation for aspect-oriented programming. (6) (c) Briefly describe 05 agile software development frameworks. (6)

6. Q. 76 marks

   (a) Design and draw a finite automaton to recognize the regular language of all strings (8) that contain the string ‘001’ as a substring. (b) Consider the following state diagram and extract the standard information, i.e., Q, Σ, q 0 , F and δ. (c) How would you optimize a loop? Describe the techniques briefly. (6)

7. Q. 88 marks

   (a) Discuss the role of Syntax Tree in representing formal text structure. Develop a Syntax Tree structure for the following piece of code: while b ≠ 0 if a > b a = a - b; else b = b - a; return a; (b) Describe your understanding on Constant Folding using a brief pseudo code. (6) (c) What is an Optimization problem? What are its 02 general categories? Write down (6) mathematical representation of a standard optimization problem.

Standard FPSC instructions

Printed on this and every CSS paper.

• Part-II is to be attempted on the separate Answer Book.
• All the parts (if any) of each question must be attempted at one place instead of at different places.
• Write Q. No. in the Answer Book in accordance with Q. No. in the question paper.
• No page/space be left blank between the answers. All the blank pages of the Answer Book must be crossed.
• Extra attempt of any question or any part of the attempted question will not be considered.