BSCS2002 · Study OS

Pdsa

0 assignments25 notesLectures
Now

Read: 542 - 01. Python Refresher — Classes, E…

Start with the chapter spine

Next

Open practice dock

Drills and weak-topic replay

Later

Study library

Search all imported chapters

Resume study

Pdsa

Start point
Open the notes hub and pick a path
Fresh session

Continue from the last thing you actually touched, instead of hunting through the registry again.

Continue
Full workspace All chaptersFlashcardsPractice dock
Assignments

No assignments matching your criteria.

Try a broader filter or jump back to the course hub to browse the full assignment set.

Knowledge Mesh
Visualize
concept
Unset

542 - 01. Python Refresher — Classes, Exceptions, Timing, Recursion

Deep dive into patterns and axioms.

concept
Unset

543 - 02. Algorithm Analysis & Big-O Notation

Deep dive into patterns and axioms.

concept
Unset

544 - 03. Complexity Analysis — Recurrence Relations & Master Theorem

Deep dive into patterns and axioms.

concept
Unset

545 - 04. Searching Algorithms — Linear Search & Binary Search

Deep dive into patterns and axioms.

concept
Unset

546 - 05. Selection Sort & Insertion Sort

Deep dive into patterns and axioms.

concept
Unset

547 - 06. Merge Sort — The O(n log n) Breakthrough

Deep dive into patterns and axioms.

concept
Unset

548 - 07. Quick Sort — The Fastest Practical Sort

Deep dive into patterns and axioms.

concept
Unset

549 - 08. Sorting Algorithms Comparison — Heap Sort, Counting Sort, Radix Sort

Deep dive into patterns and axioms.

concept
Unset

550 - 09. Linked Lists — Singly, Doubly, Circular

Deep dive into patterns and axioms.

concept
Unset

551 - 10. Stacks — LIFO Data Structure

Deep dive into patterns and axioms.

concept
Unset

552 - 11. Queues — FIFO Data Structure

Deep dive into patterns and axioms.

concept
Unset

553 - 12. Recursion & Backtracking

Deep dive into patterns and axioms.

concept
Unset

554 - 13. Dynamic Arrays & Amortized Analysis

Deep dive into patterns and axioms.

concept
Unset

555 - 14. Hash Tables — Dictionaries Under the Hood

Deep dive into patterns and axioms.

concept
Unset

556 - 15. Binary Trees & Traversals

Deep dive into patterns and axioms.

concept
Unset

557 - 16. Binary Search Trees

Deep dive into patterns and axioms.

concept
Unset

558 - 17. AVL Trees — Self-Balancing BSTs

Deep dive into patterns and axioms.

concept
Unset

559 - 18. Heaps & Priority Queues

Deep dive into patterns and axioms.

concept
Unset

560 - 19. Heap Sort

Deep dive into patterns and axioms.

concept
Unset

561 - 20. Graph Representations — Adjacency Matrix & List

Deep dive into patterns and axioms.

concept
Unset

562 - 21. BFS & DFS — Graph Traversals

Deep dive into patterns and axioms.

concept
Unset

563 - 22. Topological Sort & DAG Longest Path

Deep dive into patterns and axioms.

concept
Unset

564 - 23. Dijkstra's Shortest Path Algorithm

Deep dive into patterns and axioms.

concept
Unset

565 - 24. Bellman-Ford & Floyd-Warshall

Deep dive into patterns and axioms.

concept
Unset

566 - 25. Minimum Spanning Trees — Prim & Kruskal

Deep dive into patterns and axioms.

Document outline

Keep your place and jump directly to a heading.

Table of contents

No note selected

Open a chapter to see its outline, backlinks, and sources here.