BSCS2002 · Knowledge Base
Pdsa Notes
25
Concepts
0
Facts
0
Procedures
concept
1m
542 - 01. Python Refresher — Classes, Exceptions, Timing, Recursion
concept
1m
543 - 02. Algorithm Analysis & Big-O Notation
concept
1m
544 - 03. Complexity Analysis — Recurrence Relations & Master Theorem
concept
1m
545 - 04. Searching Algorithms — Linear Search & Binary Search
concept
1m
546 - 05. Selection Sort & Insertion Sort
concept
1m
547 - 06. Merge Sort — The O(n log n) Breakthrough
concept
1m
548 - 07. Quick Sort — The Fastest Practical Sort
concept
1m
549 - 08. Sorting Algorithms Comparison — Heap Sort, Counting Sort, Radix Sort
concept
1m
550 - 09. Linked Lists — Singly, Doubly, Circular
concept
1m
551 - 10. Stacks — LIFO Data Structure
concept
1m
552 - 11. Queues — FIFO Data Structure
concept
1m
553 - 12. Recursion & Backtracking
concept
1m
554 - 13. Dynamic Arrays & Amortized Analysis
concept
1m
555 - 14. Hash Tables — Dictionaries Under the Hood
concept
1m
556 - 15. Binary Trees & Traversals
concept
1m
557 - 16. Binary Search Trees
concept
1m
558 - 17. AVL Trees — Self-Balancing BSTs
concept
1m
559 - 18. Heaps & Priority Queues
concept
1m
560 - 19. Heap Sort
concept
1m
561 - 20. Graph Representations — Adjacency Matrix & List
concept
1m
562 - 21. BFS & DFS — Graph Traversals
concept
1m
563 - 22. Topological Sort & DAG Longest Path
concept
1m
564 - 23. Dijkstra's Shortest Path Algorithm
concept
1m
565 - 24. Bellman-Ford & Floyd-Warshall
concept
1m