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.
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
- Data structures and abstract data types· notes coming
- Classification of data structures· notes coming
- Algorithms and design strategies· notes coming
- Time and space complexity, asymptotic notation· notes coming
- Step-count method and analysing loops· notes coming
- Linear and binary search· notes coming
- Bubble, selection and insertion sort· notes coming
- Singly linked list· notes coming
- Doubly and circular linked lists· notes coming
- Stack implementation with arrays and linked lists· notes coming
- Stack applications: recursion and expression conversion· notes coming
- Evaluating postfix and prefix expressions· notes coming
- Queue, circular queue and deque· notes coming
- Binary trees and their representation· notes coming
- Binary tree traversals· notes coming
- Threaded binary trees· notes coming
- Binary search trees· notes coming
- AVL and 2-3 trees· notes coming
- Graph representation, BFS and DFS· notes coming
- Minimum spanning trees: Prim's and Kruskal's· notes coming
- Shortest path algorithms· notes coming
- Heaps and heap sort· notes coming
- Hash functions· notes coming
- Collision handling: chaining and open addressing· notes coming
- Naïve string matching· notes coming
- Rabin–Karp algorithm· notes coming
- Knuth–Morris–Pratt algorithm· notes coming
- Divide and conquer: merge sort and quick sort· notes coming
- Divide and conquer matrix multiplication· notes coming
- Greedy: activity selection and fractional knapsack· notes coming
- Huffman coding· notes coming
- Dynamic programming: 0/1 knapsack· notes coming
- Longest common subsequence· notes coming
- Floyd–Warshall algorithm· notes coming
- Recurrence relations and the master theorem· notes coming
- B-trees and B+ trees· notes coming
- Red-black trees· notes coming
- Tries· notes coming
- Job sequencing with deadlines· notes coming
- Optimal storage on tapes· notes coming
- Backtracking: N-queens and sum of subsets· notes coming
- Graph colouring and Hamiltonian cycles· notes coming
- Flow networks and the Ford-Fulkerson method· notes coming
- Bellman-Ford algorithm· notes coming
- Travelling salesman by dynamic programming· notes coming
- Recursion and the Tower of Hanoi· notes coming
- Priority queues· notes coming
- Finding maximum and minimum by divide and conquer· notes coming
- Optimal merge patterns· notes coming
- Multistage graphs· notes coming
- Topological sort· notes coming
- Branch and bound· notes coming
- P, NP, NP-hard and NP-complete problems· notes coming
- Matrix chain multiplication· notes coming
- Optimal binary search trees· notes coming