Python Bronze

• Python Overview
• Exception Handling
• Algorithm
• Recursion.
• Arrays.
• Stacks
• Queues
• Linked Lists
• Sorting
• Searching

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.
• Loops
• Functions
• Information Passing
• Python’s Built-In Functions
• Simple Input and Output
• Console Input and Output

Exception Handling

• Raising an Exception
• Iterators and Generators
• Additional Python Conveniences
• Conditional Expressions
• Comprehension Syntax
• Packing and Unpacking of Sequences
• Scopes and Namespaces
• Modules and the Import Statement
• Existing Modules

Algorithm

• Algorithm Analysis
• Experimental Studies
• Moving Beyond Experimental Analysis
• Comparing Growth Rates
• Asymptotic Analysis
• The “Big-Oh” Notation
• Comparative Analysis
• Examples of Algorithm Analysis
• Simple Justification Techniques
• The “Contra” Attack
• Induction and Loop Invariants

Recursion.

• The Factorial Function
• Drawing an English Ruler
• Binary Search
• File Systems
• Analysing Recursive Algorithms
• Recursion Run Amok
• Maximum Recursive Depth in Python
• Further Examples of Recursion
• Linear Recursion
• Binary Recursion
• Multiple Recursion
• Designing Recursive Algorithms
• Eliminating Tail Recursion

Arrays.

• Low-Level Arrays
• Referential Arrays
• Compact Arrays in Python
• Dynamic Arrays and Amortization
• Implementing a Dynamic Array
• Amortized Analysis of Dynamic Arrays

Stacks

• The Stack Abstract Data Type
• Simple Array-Based Stack Implementation
• Reversing Data Using a Stack
• Matching Parentheses and HTML Tags

Queues

• The Queue Abstract Data Type
• Array-Based Queue Implementation
• Double-Ended Queues
• The Deque Abstract Data Type
• Implementing a Deque with a Circular Array
• Deques in the Python Collections Module

Linked Lists

• Singly Linked Lists
• Implementing a Stack with a Singly Linked List
• Implementing a Queue with a Singly Linked List
• Circularly Linked Lists
• Round-Robin Schedulers
• Implementing a Queue with a Circularly Linked List
• Doubly Linked Lists
• Basic Implementation of a Doubly Linked List
• Implementing a Deque with a Doubly Linked List
• The Positional List ADT
• The Positional List Abstract Data Type
• Doubly Linked List Implementation

Sorting

• Sorting a Positional List
• Sorting with a Priority Queue
• Selection-Sort
• Insertion-Sort
• Heap-Sort
• Adaptable Priority Queues
• Merge-Sort
• Quick-Sort
• Python’s Built-In Sorting Functions

Searching

• Insertions and Deletions Python
• Performance of a Binary Search Tree
• Balanced Search Trees
• Python Framework for Balancing Search Trees
• AVL Trees
• Update Operations
• Splay Trees
• Multiway Search Trees
• Tree Operations
• Red-Black Trees
• Red-Black Tree Operations