MID ALGORITHMS AND DATA STRUCTURES | FROM
QUESTION TO PERFECTION| STUDY WITH CONFIDENCE!
Course Code:
Course Title:
Programme:
Academic Year: 2026/2027
Duration: 2 Hours
Total Marks: 70%
Candidate Instructions:
1) Write your Registration Number on every answer booklet used.
2) Answer ALL questions in Section A and ANY TWO (2) questions in Section B.
3) Read each question carefully before answering.
4) Begin each question on a new page.
5) The marks for each question are indicated in brackets.
6) This paper consists of several printed pages, including this page.
7) Ensure your copy is complete before the examination begins.
8) Unauthorized materials and communication with other candidates are not permitted.
Turn Over.
APPHIA – Crafted with Care and Precision for Academic Excellence.
1
, 1. What is the main focus of the Algorithms and Data Structures course? Answer: ,Solving
computational problems that involve collections of data
2. Which statement best defines a data structure? Answer: ,A specialized format for organizing
and storing data that also considers relationships between elements
3. Which ability is listed as a course learning outcome? Answer: ,Choosing appropriate
algorithms and data structures for storing, searching, and sorting data
4. Runtime performance should be analyzed mainly in terms of what? Answer: ,Input size,
average case, best case, and worst case
5. What happens to a calling function when it calls another function? Answer: ,It is paused in a
partially completed state
6. What does the computer create when a program starts running? Answer: ,A call stack
7. Which principle does the call stack follow? Answer: ,LIFO - Last In, First Out
8. What happens each time a function is invoked? Answer: ,The function call is placed on the
stack
9. What can an excessively long chain of recursive calls cause? Answer: ,Stack overflow
10. What is recursion? Answer: ,A programming technique in which a function calls itself on
part of the task
11. Recursion is also described as repeating items in what way? Answer: ,In a self-similar way
12. Recursion can describe a problem independently of what? Answer: ,How the problem will
be implemented
13. Which design approach is directly connected with recursion in the lecture? Answer:
,Divide-and-Conquer
14. What is a base case? Answer: ,A case simple enough to be solved directly
15. Which sequence correctly describes a recursive case? Answer: ,Divide the problem, invoke
the function recursively, and combine the solutions
16. What does every function call create inside the stack? Answer: ,A new frame or block
17. What are active calls? Answer: ,Function calls that have started but have not finished yet
18. A recursive function must contain which two main parts? Answer: ,A base case and a
recursive case
19. What is the usual result of missing the base case? Answer: ,Infinite recursion followed by
stack overflow
APPHIA – Crafted with Care and Precision for Academic Excellence.
2
QUESTION TO PERFECTION| STUDY WITH CONFIDENCE!
Course Code:
Course Title:
Programme:
Academic Year: 2026/2027
Duration: 2 Hours
Total Marks: 70%
Candidate Instructions:
1) Write your Registration Number on every answer booklet used.
2) Answer ALL questions in Section A and ANY TWO (2) questions in Section B.
3) Read each question carefully before answering.
4) Begin each question on a new page.
5) The marks for each question are indicated in brackets.
6) This paper consists of several printed pages, including this page.
7) Ensure your copy is complete before the examination begins.
8) Unauthorized materials and communication with other candidates are not permitted.
Turn Over.
APPHIA – Crafted with Care and Precision for Academic Excellence.
1
, 1. What is the main focus of the Algorithms and Data Structures course? Answer: ,Solving
computational problems that involve collections of data
2. Which statement best defines a data structure? Answer: ,A specialized format for organizing
and storing data that also considers relationships between elements
3. Which ability is listed as a course learning outcome? Answer: ,Choosing appropriate
algorithms and data structures for storing, searching, and sorting data
4. Runtime performance should be analyzed mainly in terms of what? Answer: ,Input size,
average case, best case, and worst case
5. What happens to a calling function when it calls another function? Answer: ,It is paused in a
partially completed state
6. What does the computer create when a program starts running? Answer: ,A call stack
7. Which principle does the call stack follow? Answer: ,LIFO - Last In, First Out
8. What happens each time a function is invoked? Answer: ,The function call is placed on the
stack
9. What can an excessively long chain of recursive calls cause? Answer: ,Stack overflow
10. What is recursion? Answer: ,A programming technique in which a function calls itself on
part of the task
11. Recursion is also described as repeating items in what way? Answer: ,In a self-similar way
12. Recursion can describe a problem independently of what? Answer: ,How the problem will
be implemented
13. Which design approach is directly connected with recursion in the lecture? Answer:
,Divide-and-Conquer
14. What is a base case? Answer: ,A case simple enough to be solved directly
15. Which sequence correctly describes a recursive case? Answer: ,Divide the problem, invoke
the function recursively, and combine the solutions
16. What does every function call create inside the stack? Answer: ,A new frame or block
17. What are active calls? Answer: ,Function calls that have started but have not finished yet
18. A recursive function must contain which two main parts? Answer: ,A base case and a
recursive case
19. What is the usual result of missing the base case? Answer: ,Infinite recursion followed by
stack overflow
APPHIA – Crafted with Care and Precision for Academic Excellence.
2
