Computer Science Paper I Past Paper 2023

The Computer Science Paper I Past Paper 2023 opens with supercomputing and search. Q.2 covers supercomputing technologies, performance metrics and search engines. Q.3 covers dynamic memory, overloaded operators and bit twiddling. Q.4 covers polymorphism, late binding and abstraction. Q.5 covers algorithm analysis and order of growth. Q.6 covers aspect-oriented systems and agile frameworks. Q.7 covers finite automata, state diagrams and loop optimization. Q.8 closes with syntax trees, constant folding and optimization problems. 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) Write a detailed note on any 03 Super Computing Technologies being used in the world. List key characteristics in each case. (8)
(b) What performance metrics are used to analyze the capacity of Super Computers? Discuss. (6)
(c) Discuss the role of Web Crawling, Indexing & Searching operations for a Search Engine. (6) (20)

Q.3 — (a) How does dynamic memory allocation is managed programmatically in a C++ program? Clarify yours understanding through a viable program. (8)
(b) Write a note on the use of overloaded operators. Discuss with examples. (6)
(c) What is bit twiddling? Give brief description. (6) (20)

Q.4 — (a) What is Polymorphism? Explain Ad-Hoc Polymorphism, Parametric Polymorphism & Subtyping with suitable coding examples. (8)
(b) Discuss Late Binding with a short program. (6)
(c) Differentiate between Abstraction & Encapsulation. (6) (20)

SECTION-B

Q.5 — (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. (8)
(b) Briefly describe the four types of analysis we may perform to evaluate the asymptotic behavior of an algorithm. (6)
(c) Evaluate order of growth of the functions given below. Compare & write down which one has higher, same or lower order of growth than the other one: (6)

I. n(n+1) and 2000n^2 II. 100n^2 and 0.01n^3
III. Log2 n and ln n IV. 2^(n-1) and 2^n
V. (n-1)! and n! (20)

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

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

Q.8 — (a) Discuss the role of Syntax Tree in representing formal text structure. Develop a Syntax Tree structure for the following piece of code: (8)
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 mathematical representation of a standard optimization problem. (6) (20)

Download Computer Science Paper I Past Paper 2023 (PDF)

Computer Science Paper I Past Paper 2024 · All Computer Science Past Papers · Computer Science Paper I Past Paper 2022