Python
DataStructures & Algorithms

The Python DataStructures & Algorithms Course is specifically designed to introduce a wide range of learners to the fundamentals of Python programming. Focusing on a hands-on, incremental iterative approach, the course centers on the development of mental models, inculcating understanding of essential programming concepts. This includes Structured Programming, Object-Oriented Programming, Functional Programming, and Data Structures & Algorithms. Serving as a stepping stone, this course prepares learners for advanced studies in Data Science, Machine Learning and Aritifical Intelligence, setting the stage for the broader technological landscape including Internet of Things, Animation, Cloud Computing and Scientific Computing. 

1. Structured Programming

1. Introduction to Python

   1. Values

   2. Types

   3. Operators

   4. Expressions

   5. Variables.

2. Conditional Constructs

   1. if

   2. if-else

   3. if-elif-else

3. Iterative Constructs

   1. While

   2. For

4. Functions

   1. Parameters

   2. Return values

   3. Activation Record

   4. global, local, nonlocal

   5. Functional Decomposition

   6. Recursion

2. Object Oriented Programming

1. Objects 

   1. State

   2. Structure

   3. Messages

   4. Behaviour

   5. Composition

2. Class

   1. Constructor

   2. Methods

   3. Attributes

3. Inheritance

   1. MultiLevel Inheritance

   2. Multiple Inheritance

   3. Overriding

4. Exception Handling

   1. try

   2. except

   3. finally

   4. else

   5. custom exceptions

5. Context Manager

3. Functional Programming

1. Closures

2. Lambda

3. Higher Order Functions

4. Map, Filter, Reduce

5. Generator

6. Decorators

4. Modules & Packages

1. Modules

   1. Understanding Modules

   2. Creating Modules

   3. importing modules

2.  Packages

   1. Understanding Packages

   2. Creating Packages

   3. importing packages

5. DataStructures

1. Stack

   1. Array Implementation

   2. List Implementation

   3. Applications

2. Queue

   1. Array Implementation

   2. List Implementation

   3. Applications

3. Lists

   1. Singly Linked List

   2. Doubly Linked List

   3. Circular List

   4. Applications

4. Strings

5. Tables

6. Trees

   1. Tree Terminology

   2. Binary Tree

   3. Threaded Tree

   4. AVL

   5. Applications

7. Heap

8. Graphs

   1. Graph Terminology

   2. Matrix Implementation 

   3. List Implementation

   4. Graph Traversal

      1. Breadth First Traversal

      2. Depth First Traversal

   5. Dijikstra Shortest Path

   6. A* Algorithm

   7. Bellman-Ford Algorithm

   8. Topological Sort

   9. Applications

6. Sorting Algorithms

1. Insertion Sort

2. Selection Sort

3. Heap Sort

4. Merge Sort

5. Bubble Sort

6. Quick Sort

7. Tim Sort

6. Libraries

1. Collections

   1. List

   2. Tuple

   3. Dictionary

   4. String

   5. Set

2.  File Handling

   1. reading

   2. writing 

   3. appending

   4. tell, seek