CSC203 – Computer Science Professional
Practice Examination (2026 Edition) | Latest
2026 Curriculum | High-Difficulty Multiple-
Choice Questions | Verified Answers with
Detailed Rationales | Comprehensive
University Exam Preparation
Date: 16-07-2026
Duration: 3 Hours
Total Marks: 100
Instructions:
Answer ALL questions.
Each question carries 2 marks.
Choose the ONE BEST answer (A–D).
This examination follows the latest 2026 university
Computer Science curriculum and emphasizes problem-
solving, algorithms, programming, operating systems,
databases, networking, software engineering,
cybersecurity, and emerging computing technologies.
Question 1
, Which data structure follows the Last-In, First-Out (LIFO)
principle?
A. Queue
B. Stack
C. Linked List
D. Tree
Answer: B. Stack
Rationale: A stack removes the most recently inserted element
first, making it LIFO.
Question 2
The worst-case time complexity of Binary Search is:
A. O(n²)
B. O(log n)
C. O(n)
D. O(1)
Answer: B. O(log n)
Rationale: Binary Search repeatedly divides the search interval
into two halves.
Practice Examination (2026 Edition) | Latest
2026 Curriculum | High-Difficulty Multiple-
Choice Questions | Verified Answers with
Detailed Rationales | Comprehensive
University Exam Preparation
Date: 16-07-2026
Duration: 3 Hours
Total Marks: 100
Instructions:
Answer ALL questions.
Each question carries 2 marks.
Choose the ONE BEST answer (A–D).
This examination follows the latest 2026 university
Computer Science curriculum and emphasizes problem-
solving, algorithms, programming, operating systems,
databases, networking, software engineering,
cybersecurity, and emerging computing technologies.
Question 1
, Which data structure follows the Last-In, First-Out (LIFO)
principle?
A. Queue
B. Stack
C. Linked List
D. Tree
Answer: B. Stack
Rationale: A stack removes the most recently inserted element
first, making it LIFO.
Question 2
The worst-case time complexity of Binary Search is:
A. O(n²)
B. O(log n)
C. O(n)
D. O(1)
Answer: B. O(log n)
Rationale: Binary Search repeatedly divides the search interval
into two halves.
