Arthimetic Operators
Values
Variables
Building Blocks
Functions
Libraries
List
Tuple
In Built Data Structures
Dict
For Getting Hands-on/Building Blocks
Set
Print/Output Operations
For Loop
Loops
While Loop
If Statement
Conditional Statements If-else Statement
If-elif Statement
To perform customised tasks
User Defined Functions To create logic to perform customised task
Regular Expression
Escape Sequences
Lambda Expressions
String Manipulation
Pandas Library To perform excel related operations in python
Numpy To perform matrix operations
Matplotlib & Seaborn To perform visualization in python
For Data Science/ML Scikit-Learn To perform ML Operation
Tensorflow & Keras To perform Deep Learning Operations
NLTK To perform Text related analytics
Streamlit for Deployment To create web applications
OOPS Concept
Advanced Data Structures that can be used for
more complex data organization, accessing and
manipulation
Google, YouTube, Dropbox, Zope Corporation, A linked list is a data structure consisting of a
Industrial Light & Magic, Walt Disney Feature sequence of nodes, where each node contains a
Companies using Python
Animation, Blender 3D, Pixar, NASA, the NSA, data element and a reference (link) to the next
Red Hat, Nokia, IBM, Netflix node in the sequence
Why Programming? To perform Task Python Programming 1. Linked List
System Programming, Web and API
A tree is a hierarchical data structure consisting
Programming, GUI Applications, Gaming and
of nodes connected by edges
robotics, rapid prototyping, system integration, Various Uses of Python 2. Trees
data science, database applications, real-time
A graph is a data structure consisting of a set of
communication, and much more
vertices (nodes) connected by edges. Graphs are
used to represent complex networks such as
Advanced Data Structures social networks
3. Graphs
A queue is a data structure that follows the First-
In-First-Out (FIFO) principle. Elements are added
to the back of the queue and removed from the
front. Queues are used for scheduling, task
processing
4 Queues
A stack is a data structure that follows the Last-
In-First-Out (LIFO) principle. Elements are added
to the top of the stack and removed from the top.
Stacks are used for operations such as undo/
redo, function call management, and expression
evaluation
5. Stacks
Sorting algorithms are used to sort a collection of
items in ascending or descending order
1. Bubble Sort
2. Insertion Sort Customized Way of Programming
1. Soting Algorithms 3. Selection Sort
4. Merge Sort
5. Quick Sort
6. Heap Sort
Search algorithms are used to find a specific item
or value in a collection of data.
2. Search Algorithms 1. Linear Search
Advnaced Data Structures & Algorithms 2. Binary Search
For getting advanced knowledge Graph algorithms are used to solve problems
related to graphs such as finding the shortest path
1. Depth First Search
Advanced Algorithms
2. Breadth First Search
3. Graph Algorithms 3. Dijkstra's Algorithm
4. Bellman-Ford Algorithm
5. Kruskal's Algorithm
6. Prim's Algorithm
Dynamic Problem: In Dynamic Problem we solve
complex problems by breaking them down in
smaller sub problems and solve them in recursive
way.
1. Fibonacci Series
4. Dynamic Programming 2. Longest Common subsequence
3. Knapsack Problem
4. Coin Change Problem
5. Matrix Chain Multiplication
Linear Regression
Logistic Regression
Decision Tree
Random Forest
Machine Learning Algorithms Gradient Boosting
KNN Algorithm
Naive Bayes Algorithm
Support Vector Machines
Neural Networks/Deep Learning
Iterators & Decorates
Exception Handling
Flask
Web Development
Django
Beautifulsoup
WebScarping Scrapy
Requests
UnitTest
Testing Selenium
Pytest
Main Topic
Main Idea Main Topic
Main Topic
