19-Soft-A1 Algorithms & Data Structures
Worked solutions to 2 past sittings (2013–2016), 15 questions. Pick a sitting, or start from a topic below.
Topics across the sittings
Topics that come up in more than one sitting, taken from the headings of our worked solutions. A topic counts once per sitting.
- Spanning Trees (2 sittings): December 2016 Q3 · May 2013 Q4
Questions by sitting
December 2016
- Question 1: Binary Tree
- Question 2: Max Heap
- Question 3: Graph Traversal and Spanning Trees
- Question 4: Waiting
- Question 5: Double Linked List
- Question 6: Merge Sort
- Question 7: Short Questions
May 2013
- Question 1: Linked Lists
- Question 2: Tree Implementation
- Question 3: Heap
- Question 4: Spanning Tree
- Question 5: Sorting
- Question 6: Design an Algorithm — Jerry's Cheapest Flight
- Question 7: Algorithm Concepts
- Question 8: Complexity