DATA STRUCTURES, ALGORITHMS, AND COMPLEXITY |
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
, Data Answer: The actual value or information stored within a data structure.
Linked List Answer: A linear sequence of nodes where each node points to the next.
Node Answer: An individual element in a linked list containing data and a pointer.
Head Answer: The first node in a linked list, serving as the traversal starting point.
Tail Answer: The last node in a linked list, pointing to null.
Singly Linked List Answer: A linked list where each node has only one pointer to the next.
Doubly Linked List Answer: A linked list where each node has pointers to both next and
previous nodes.
Pointer Answer: A reference that points to another node in memory.
Search Method (Linked List) Answer: Traverses a linked list and returns true if a specific value
is found.
Insertion Methods Answer: Methods that add nodes to a linked list, such as at the
beginning/end.
Big O Notation Answer: Measures the worst-case time or space complexity of an algorithm.
Constant Time (O(1)) Answer: Algorithm complexity where the operation count remains
constant regardless of input size.
Linear Time (O(n)) Answer: Complexity where operations grow proportionally with the input
size.
Quadratic Time (O(n²)) Answer: Complexity proportional to the square of input size, typically
involving nested loops.
Cubic Time (O(n³)) Answer: Complexity where operations increase cubically, often involving
three nested loops.
Logarithmic Time (O(log n)) Answer: Complexity where operations increase logarithmically,
common in divide-and-conquer algorithms.
Space Complexity Answer: Measures the memory space an algorithm requires relative to input
size.
Time Complexity Answer: Measures the execution time of an algorithm relative to input size.
Worst-Case Complexity Answer: The maximum time or space an algorithm requires for any
input size.
Stack Answer: A linear data structure that follows the Last-In-First-Out (LIFO) principle.
Push Answer: A stack operation that adds a new element to the top.
APPHIA – Crafted with Care and Precision for Academic Excellence.
2
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
, Data Answer: The actual value or information stored within a data structure.
Linked List Answer: A linear sequence of nodes where each node points to the next.
Node Answer: An individual element in a linked list containing data and a pointer.
Head Answer: The first node in a linked list, serving as the traversal starting point.
Tail Answer: The last node in a linked list, pointing to null.
Singly Linked List Answer: A linked list where each node has only one pointer to the next.
Doubly Linked List Answer: A linked list where each node has pointers to both next and
previous nodes.
Pointer Answer: A reference that points to another node in memory.
Search Method (Linked List) Answer: Traverses a linked list and returns true if a specific value
is found.
Insertion Methods Answer: Methods that add nodes to a linked list, such as at the
beginning/end.
Big O Notation Answer: Measures the worst-case time or space complexity of an algorithm.
Constant Time (O(1)) Answer: Algorithm complexity where the operation count remains
constant regardless of input size.
Linear Time (O(n)) Answer: Complexity where operations grow proportionally with the input
size.
Quadratic Time (O(n²)) Answer: Complexity proportional to the square of input size, typically
involving nested loops.
Cubic Time (O(n³)) Answer: Complexity where operations increase cubically, often involving
three nested loops.
Logarithmic Time (O(log n)) Answer: Complexity where operations increase logarithmically,
common in divide-and-conquer algorithms.
Space Complexity Answer: Measures the memory space an algorithm requires relative to input
size.
Time Complexity Answer: Measures the execution time of an algorithm relative to input size.
Worst-Case Complexity Answer: The maximum time or space an algorithm requires for any
input size.
Stack Answer: A linear data structure that follows the Last-In-First-Out (LIFO) principle.
Push Answer: A stack operation that adds a new element to the top.
APPHIA – Crafted with Care and Precision for Academic Excellence.
2
