Computer Engineering is coming soon

We're still writing and reviewing the notes for every subject, and we'll open it when every subject is ready. Meanwhile you can practise aptitude, ask Aria about any subject, or see the branches that are ready.

Computer Engineering

Data Structures

Complexity, searching and sorting, stacks, queues, linked lists, hashing, trees and graphs.

Interview questions
Your progress in this subject0 of 25 · 0%
  1. 1Data structures and abstract data typesDefinitions, contrasts, and exam-ready specifications of Data Structures versus Abstract Data Types (ADTs), with axioms, invariants, abstraction functions, and small Python examples.
  2. 2Algorithm analysis: time and space complexityDefinitions, methods and worked examples for analysing algorithm time and space complexity with Big-O/Θ/Ω, worst/average/best case, step-count, recurrences and Master Theorem, plus common pitfalls and exam tips.
  3. 3Asymptotic notation and the step-count methodAsymptotic notation (O, Ω, Θ, little-o, little-ω) and the step-count method for analyzing algorithm running time and space, with formal definitions, properties, and worked analyses.
  4. 4Algorithm design: divide and conquer and greedyDivide and Conquer and Greedy: definitions, design templates, Master Theorem, proofs (exchange argument), and worked Python programs (Merge Sort, Activity Selection) with exam-focused notes.
  5. 5Arrays and their storage representationArrays: definitions, index bounds, base address, element size, row-major/column-major order, stride and offset, address-calculation formulas for 1D/2D/kD arrays, static vs dynamic arrays, alignment, and exam-style derivations and programs.
  6. 6Sparse matricesSparse matrices: definitions, storage formats (triplet/COO, CSR, CSC, diagonal/band/block), operations (transpose, addition, SpMV), algorithms (fast transpose, CSR SpMV), complexities, examples with Python.
  7. 7Searching: linear, binary, Fibonacci and indexed sequential searchSearching: linear, binary, Fibonacci, and indexed sequential search — definitions, assumptions, time complexities, derivations, and Python implementations with sample I/O.
  8. 8Sorting: concepts and stabilitySorting: concepts, orderings, keys, stability (definition, proofs, examples), which classic sorts are stable, why stability matters, and how to enforce or exploit it in practice.
  9. 9Bubble, insertion and selection sortPlain-English, exam-focused notes on Bubble sort, Insertion sort, and Selection sort: ideas, invariants, step-counts, stability, code, and pitfalls.
  10. 10Quick sort and merge sortQuick sort and merge sort: definitions, divide-and-conquer ideas, partitioning/merging, time–space complexity, stability, in-place behavior, recurrences, Python implementations with sample I/O, exam-ready derivations and diagrams in words.
  11. 11Stacks and their operationsPrecise definitions, operations, array/linked implementations, overflow/underflow, algorithms, complexities, and classic applications of stacks with runnable Python examples.
  12. 12Expression conversion and postfix evaluationStacks for converting infix ↔ postfix/prefix, operator precedence and associativity, and evaluating postfix expressions correctly.
  13. 13Queues, circular queues and priority queuesDefinitions, array and linked representations, algorithms and complexity of queues, circular queues (with modulo wrap-around), and priority queues (via heaps), with Python implementations and exam-focused notes.
  14. 14Singly linked listsSingly linked lists: definition, node structure, operations (create, traverse, search, insert, delete, reverse), complexity, diagrams to draw, Python syntax, and three complete programs with sample I/O.
  15. 15Circular and doubly linked listsDefinitions, invariants, operations, complexities, pointer-update steps, and Python examples for circular singly, doubly, and circular doubly linked lists.
  16. 16Stacks and queues using linked listsImplement and analyze stacks and queues using singly linked lists: node design, push/pop, enqueue/dequeue, invariants, complexities, and complete Python programs with I/O.
  17. 17Hash tables and hash functionsBuild, analyze and use hash tables with well-designed hash functions; define load factor, uniform hashing, and evaluate average-case search/insert/delete costs with chaining.
  18. 18Collision resolution: open addressing and chainingCollision resolution in hash tables using open addressing (linear/quadratic probing, double hashing) and separate chaining: definitions, assumptions, formulas for expected probes, worked insert/search examples, and Python implementations.
  19. 19Rehashing and extendible hashingRehashing resizes in-memory hash tables when load grows; extendible hashing grows a disk-friendly directory and splits buckets using hash-bit prefixes.
  20. 20Graph representationGraph representation: adjacency matrix, adjacency list, incidence matrix, edge list; directed/undirected, weighted, multigraphs, self-loops, memory and time trade-offs, conversions and implementation in Python.
  21. 21Graph traversal: DFS and BFSDepth-First Search (DFS) and Breadth-First Search (BFS): definitions, algorithms, properties, complexities, edge classification, and Python implementations with sample I/O.
  22. 22Trees and binary treesDefinitions, properties, representations, and basic algorithms for trees and binary trees, with proofs, index formulas, and traversal code.
  23. 23Binary tree traversals: recursive and non-recursiveDefinitions, algorithms, and Python implementations for recursive and non-recursive traversals of binary trees (preorder, inorder, postorder, level-order), with examples, complexities, and exam tips.
  24. 24Binary search treesBinary Search Trees: definitions, properties, operations (search/insert/delete), traversal, complexity, and Python programs that build, query, and modify BSTs.
  25. 25Huffman codingHuffman coding: optimal variable-length prefix codes, tree construction with a min-priority queue, average code length, entropy bounds, canonical codes, and encode/decode procedures.

Coming next in Data Structures

  1. Minimum spanning trees: Prim's and Kruskal's algorithms· notes coming
  2. Perfect hashing· notes coming
  3. Recursion and the stack· notes coming
  4. Dynamic memory management and garbage collection· notes coming
  5. Threaded binary trees· notes coming
  6. Heaps and balanced trees· notes coming
  7. Warshall's algorithm for path matrices· notes coming
  8. Skip lists and dictionaries· notes coming
  9. Radix sort· notes coming
  10. File handling and file organisation· notes coming
  11. Dijkstra's shortest path and topological sorting· notes coming
  12. Shell sort· notes coming
  13. Double-ended queues· notes coming
  14. Polynomial manipulation with linked lists· notes coming
  15. AVL trees and rotations· notes coming
  16. Red–black trees· notes coming
  17. B-trees and B+ trees· notes coming
  18. Structures and unions· notes coming
  19. Pointers· notes coming
  20. Disjoint sets and union-find· notes coming
  21. Tries· notes coming
  22. Segment trees and binary indexed trees· notes coming