İçeriğe geç / Skip to content / Zum Inhalt
Ahmet Balaman
All Blog Posts

Algorithms and Data Structures: Guides and Exam Questions

Big-O analysis, sorting algorithms and tree structures, with step-by-step worked exam-style questions. The goal is not memorising formulas but knowing which approach to take when you see a problem.

4 posts

Complexity Analysis

  1. Big O Notation and Time Complexity: A Practical GuideWhat Big O means and how to find the complexity of loops and recursion: O/Ω/Θ, the Master theorem, space complexity and 8 solved exercises.

Sorting and Searching

  1. Sorting Algorithms Exam Questions with Worked SolutionsBubble, selection, insertion, merge and quick sort: one comparison table, pass-by-pass array traces and 8 exam questions solved step by step.
  2. Binary Search Tree Exam Questions: Insert, Delete, TraverseThe BST property, insert, search and delete, inorder/preorder/postorder traversal, height and the degenerate case; 7 exam questions with drawn trees.

More posts

Algorithm Teacher: Data Structures and Algorithm Analysis

How to choose a tutor for data structures and algorithms: what to ask in a trial lesson, exam versus interview prep, and the order to study topics in.