Information Technology 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.

Information Technology

Data Structures & Algorithms

Complexity, linked lists, stacks and queues, trees, graphs and heaps, hashing and string matching, greedy and DP.

Interview questions
Notes for Data Structures & Algorithms are being written and reviewed. Until they're up, Aria teaches every topic — ask for any part of the syllabus, with worked numericals.

Coming next in Data Structures & Algorithms

  1. Data structures and abstract data types· notes coming
  2. Classification of data structures· notes coming
  3. Algorithms and design strategies· notes coming
  4. Time and space complexity, asymptotic notation· notes coming
  5. Step-count method and analysing loops· notes coming
  6. Linear and binary search· notes coming
  7. Bubble, selection and insertion sort· notes coming
  8. Singly linked list· notes coming
  9. Doubly and circular linked lists· notes coming
  10. Stack implementation with arrays and linked lists· notes coming
  11. Stack applications: recursion and expression conversion· notes coming
  12. Evaluating postfix and prefix expressions· notes coming
  13. Queue, circular queue and deque· notes coming
  14. Binary trees and their representation· notes coming
  15. Binary tree traversals· notes coming
  16. Threaded binary trees· notes coming
  17. Binary search trees· notes coming
  18. AVL and 2-3 trees· notes coming
  19. Graph representation, BFS and DFS· notes coming
  20. Minimum spanning trees: Prim's and Kruskal's· notes coming
  21. Shortest path algorithms· notes coming
  22. Heaps and heap sort· notes coming
  23. Hash functions· notes coming
  24. Collision handling: chaining and open addressing· notes coming
  25. Naïve string matching· notes coming
  26. Rabin–Karp algorithm· notes coming
  27. Knuth–Morris–Pratt algorithm· notes coming
  28. Divide and conquer: merge sort and quick sort· notes coming
  29. Divide and conquer matrix multiplication· notes coming
  30. Greedy: activity selection and fractional knapsack· notes coming
  31. Huffman coding· notes coming
  32. Dynamic programming: 0/1 knapsack· notes coming
  33. Longest common subsequence· notes coming
  34. Floyd–Warshall algorithm· notes coming
  35. Recurrence relations and the master theorem· notes coming
  36. B-trees and B+ trees· notes coming
  37. Red-black trees· notes coming
  38. Tries· notes coming
  39. Job sequencing with deadlines· notes coming
  40. Optimal storage on tapes· notes coming
  41. Backtracking: N-queens and sum of subsets· notes coming
  42. Graph colouring and Hamiltonian cycles· notes coming
  43. Flow networks and the Ford-Fulkerson method· notes coming
  44. Bellman-Ford algorithm· notes coming
  45. Travelling salesman by dynamic programming· notes coming
  46. Recursion and the Tower of Hanoi· notes coming
  47. Priority queues· notes coming
  48. Finding maximum and minimum by divide and conquer· notes coming
  49. Optimal merge patterns· notes coming
  50. Multistage graphs· notes coming
  51. Topological sort· notes coming
  52. Branch and bound· notes coming
  53. P, NP, NP-hard and NP-complete problems· notes coming
  54. Matrix chain multiplication· notes coming
  55. Optimal binary search trees· notes coming