Artificial Intelligence & Data Science 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.
Artificial Intelligence & Data Science
Data Structures
Complexity, searching and sorting, hashing, linked lists, stacks and queues, trees, graphs.
Your progress in this subject0 of 3 · 0%
- 1Singly 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.
- 2Binary search treesBinary Search Trees: definitions, properties, operations (search/insert/delete), traversal, complexity, and Python programs that build, query, and modify BSTs.
- 3Graph 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.
Coming next in Data Structures
- Data structures and their types· notes coming
- Time and space complexity· notes coming
- Asymptotic notations· notes coming
- Sequential and binary search· notes coming
- Insertion, bubble and selection sort· notes coming
- Merge sort and quick sort· notes coming
- Radix sort· notes coming
- Hashing and collision resolution· notes coming
- Static and dynamic memory allocation· notes coming
- Circular linked lists· notes coming
- Doubly linked lists· notes coming
- Polynomial addition with linked lists· notes coming
- Generalised linked lists· notes coming
- Stack ADT and operations· notes coming
- Expression conversion and evaluation· notes coming
- Recursion· notes coming
- Queue ADT and operations· notes coming
- Circular queues· notes coming
- Deques and priority queues· notes coming
- Tree terminology and representation· notes coming
- Binary tree traversals· notes coming
- Threaded binary trees· notes coming
- Optimal binary search trees· notes coming
- AVL trees· notes coming
- Heaps· notes coming
- DFS and BFS· notes coming
- Prim's and Kruskal's algorithms· notes coming
- Dijkstra's algorithm· notes coming
- Floyd-Warshall algorithm· notes coming
- Topological sorting· notes coming
- Abstract data types· notes coming
- Arrays and sparse matrices· notes coming
- Open addressing and perfect hashing· notes coming
- Garbage collection· notes coming
- Warshall's algorithm for transitive closure· notes coming
- Skip lists· notes coming
- File handling· notes coming
- Linked stacks and queues· notes coming
- B-trees and B+ trees· notes coming
- Hash functions and their applications· notes coming
- Shell sort· notes coming
- Red–black trees· notes coming
- String processing and pattern matching· notes coming