# 🐍 Python Bronze Curriculum ## Module 1: Python Overview - The Python Interpreter - Preview of a Python Program - Objects in Python - Identifiers, Objects, and the Assignment Statement - Creating and Using Objects - Python’s Built-In Classes - Expressions, Operators, and Precedence - Compound Expressions and Operator Precedence - Control Flow (Conditionals and Loops) - Functions and Information Passing - Python’s Built-In Functions - Simple Console Input and Output ## Module 2: Exception Handling - Raising an Exception - Iterators and Generators - Additional Python Conveniences - Conditional Expressions - Comprehension Syntax - Packing and Unpacking Sequences - Scopes and Namespaces - Modules and the Import Statement - Using Existing Modules ## Module 3: Algorithms - Algorithm Analysis - Experimental Studies - Beyond Experimental Analysis - Comparing Growth Rates - Asymptotic Analysis and Big-O Notation - Comparative Analysis - Examples and Justification Techniques - Induction and Loop Invariants ## Module 4: Recursion - The Factorial Function - Drawing an English Ruler - Binary Search - File Systems - Analyzing Recursive Algorithms - Recursive Pitfalls - Maximum Recursive Depth - Types: Linear, Binary, and Multiple Recursion - Designing Recursive Algorithms - Eliminating Tail Recursion ## Module 5: Arrays - Low-Level Arrays - Referential Arrays - Compact Arrays in Python - Dynamic Arrays and Amortization - Implementing a Dynamic Array - Amortized Analysis ## Module 6: Stacks - Stack Abstract Data Type - Array-Based Stack Implementation - Reversing Data - Matching Parentheses and HTML Tags ## Module 7: Queues - Queue Abstract Data Type - Array-Based Queue Implementation - Double-Ended Queues (Deque ADT) - Implementing Deque with Circular Array - Using Python’s Collections Module ## Module 8: Linked Lists - Singly Linked Lists - Stack/Queue Implementation with Singly Linked List - Circularly Linked Lists and Round-Robin Scheduling - Doubly Linked Lists - Deque Implementation - The Positional List Abstract Data Type ## Module 9: Sorting - Sorting a Positional List - Using Priority Queues - Selection Sort - Insertion Sort - Heap Sort - Adaptable Priority Queues - Merge Sort - Quick Sort - Python’s Built-In Sorting Functions ## Module 10: Searching - Insertions and Deletions - Binary Search Tree Performance - Balanced Search Trees Framework - AVL Trees and Update Operations - Splay Trees - Multiway Search Trees - Red-Black Trees and Their Operations