CSS 2023 Computer Science Paper I
7 questions from this paper.
-
Q1
Differentiate between Encapsulation and Abstraction. How are these concepts implemented in C++ or Java? Provide code snippets to support your answer.
-
Q2
Define a Binary Search Tree (BST). Explain the process of deleting a node with two children from a BST. Also, calculate the time complexity for search and insertion operations.
-
Q3
What is the Critical Section Problem? Explain the requirements for a solution to the critical section problem (Mutual Exclusion, Progress, Bounded Waiting). How do Semaphores solve this?
-
Q4
Compare the Waterfall model with the Agile development methodology. Under what circumstances would you recommend the Waterfall model over Agile?
-
Q5
Design a 4-bit synchronous up-counter using J-K Flip Flops. Show the state transition table and the K-maps for the design.
-
Q6
Explain the Memory Hierarchy. Why is Cache memory used, and what are the different mapping techniques (Direct, Associative, and Set-Associative)?
-
Q7
Discuss the Bresenham Line Drawing Algorithm. What are its advantages over the DDA algorithm? Illustrate with a numerical example for a line starting at (2,3) and ending at (8,7).
Want AI feedback on your own answer?
Create a free account to send any question into Answer Lab for a full AI evaluation.