Introduction – History of Python, Assembler, Compiler, Linker & Loder, Execution Process.

various softwares available, IntelliJ Idea, Eclipse.

Introduction to Python, first program in python, Printing in Python, challenges- Printing text, Printing the result of a calculation, Strings in Python, The Escape Character,

• Simple Jukebox – Demonstration

• Simple Jukebox – Importing Data,, Simple Jukebox – The Code

• Constants in Python

   

Dictionary and sets.

Introduction to the Section,

Introduction to the Section, Modules and import,

SQL

Genarators & Dictionary (adding, changing, removing, iterating) , Lambda expression, comprehensions.

smart fridge, what’s for tea, using ‘in’ with dictionary, using, using several dictionaries together.

installation, Binary basics

Reading declaration, controller OS, Pass by value and refference revise, requirements to write a program, Stacks, Queues, Linked List, Trees

LIFO, FIFO, user applications, array vs stacks, push & pop, applications, reverse.

LIFO, FIFO, user aplications, array vs queus, Insert, Delete, application, reverse.

Infix, Postfix, Prefix, Local variables, psudo code, palindrome, paranthesis, conversion, search operation (null, max, min) [psudo code & c code], reverse, application.

Singly, Doubly, Circular.

array vs Linked list,

node creation, Insert front & rear, Delete

Display, pvg for Insertion, Deletion, Front and rear end.

Doubly Linked List – Insertion front & rear end, delete, display

Implementation to stack, queue

Print middle node, kth node, search multiples, max.

concatenation of linked list,

reverse linked list.

Leaf node, Root node

different trees – ordinary, binary, strictly binary, complete binary, binary search tree, building binary tree.

Tree Traversals – Pre-order, In-order, Post order.

Insert node.

Recursion, Sorting, Searching+BFS+DFS, Dynamic Programming, Hashing

• Introduction to Algorithms, Recursion Introduction,  
• Stack Overflow, 
• Anatomy Of Recursion, Exercise: Factorial,

   Fibonacci, Recursive VS Iterative, Recursive VS Iterative, When To Use Recursion, Exercise: Reverse String With Recursion.

• Sorting Introduction 
• The Issue With sort()
• Sorting Algorithms 
• Bubble Sort
• Selection Sort
• Dancing Algorithms
• Insertion Sort
• Merge Sort and O(n log n)
• Stable VS Unstable Algorithms
• Quick Sort
• Which Sort Is Best?
• Heap Sort
• Radix Sort + Counting Sort

• Searching + Traversal Introduction
• Linear Search 
• Binary Search

   

• Graph + Tree Traversals

• BFS Introduction

• DFS Introduction

• BFS vs DFS 

• Resources: BFS vs DFS

• Exercise: BFS vs DFS
• Solution: BFS vs DFS 
• breadthFirstSearch()
• breadthFirstSearchRecursive()
• PreOrder, InOrder, PostOrder
• depthFirstSearch() 
• Optional Exercise: Validate A BST
• Graph Traversals
• BFS in Graphs
• DFS in Graphs
• Dijkstra + Bellman-Ford Algorithms
• Searching + Traversal Review

Hash Tables Introduction

Hash Function, Hash Collision, Hash Tables In Different Languages