NivaarExam PrepOfficial exam papers ↗

19-Soft-A1 Algorithms & Data Structures: December 2016

Nivaar worked solution (AI-drafted; not reviewed by a licensed engineer)

  1. Question 1 Binary Tree
  2. Question 2 Max Heap
  3. Question 3 Graph Traversal and Spanning Trees
  4. Question 4 Waiting
  5. Question 5 Double Linked List
  6. Question 6 Merge Sort
  7. Question 7 Short Questions

Start with Question 1 →

National Exams — December 2016 — 04-Soft-A1 Algorithms & Data Structures. Three-hour, closed-book exam (Casio or Sharp approved calculator only). Format: seven questions; candidates pick five of their choice, and the first five as they appear in the answer book are marked, each worth 20 marks. All seven questions, and all sub-parts within them, are solved below for completeness. Implementations below use C-style pseudocode, as the exam note permits any of C, C++, Java, Python, or clean pseudocode.

Reference texts: Cormen, Leiserson, Rivest & Stein, Introduction to Algorithms (3rd ed., MIT Press) — asymptotic analysis, heaps, graph algorithms, divide-and-conquer, NP-completeness; Sedgewick & Wayne, Algorithms (4th ed., Addison-Wesley) — linked-list and array data structures, sorting, hashing; Weiss, Data Structures and Algorithm Analysis in C (2nd ed., Pearson) — array-based binary trees and heaps, ADT design.