🎯 Want to Upskill in IT? Try Our FREE 2026 Learning Kits!
SPOTO gives you free, instant access to high-quality, updated resources that help you study smarter and pass exams faster.
✅ Latest Exam Materials:
Covering #Python, #Cisco, #PMI, #Fortinet, #AWS, #Azure, #AI, #Excel, #comptia, #ITIL, #cloud & more!
✅ 100% Free, No Sign-up:
All materials are instantly downloadable
✅ What’s Inside:
・📘IT Certs E-book: https://bit.ly/3MfPwO3
・📝IT Exams Skill Test: https://bit.ly/3ZlqKPB
・🎓Free IT courses: https://bit.ly/4tfd8TH
・🤖Free PMP Study Guide: https://bit.ly/4khXJ0Q
・☁️Free Cloud Study Guide: https://bit.ly/3MnP5RY
👉 Become Part of Our IT Learning Circle! resources and support:
https://chat.whatsapp.com/FlG2rOYVySLEHLKXF3nKGB
💬 Want exam help? Chat with an admin now!
wa.link/xbrry5
SPOTO gives you free, instant access to high-quality, updated resources that help you study smarter and pass exams faster.
✅ Latest Exam Materials:
Covering #Python, #Cisco, #PMI, #Fortinet, #AWS, #Azure, #AI, #Excel, #comptia, #ITIL, #cloud & more!
✅ 100% Free, No Sign-up:
All materials are instantly downloadable
✅ What’s Inside:
・📘IT Certs E-book: https://bit.ly/3MfPwO3
・📝IT Exams Skill Test: https://bit.ly/3ZlqKPB
・🎓Free IT courses: https://bit.ly/4tfd8TH
・🤖Free PMP Study Guide: https://bit.ly/4khXJ0Q
・☁️Free Cloud Study Guide: https://bit.ly/3MnP5RY
👉 Become Part of Our IT Learning Circle! resources and support:
https://chat.whatsapp.com/FlG2rOYVySLEHLKXF3nKGB
💬 Want exam help? Chat with an admin now!
wa.link/xbrry5
❤6
Complete roadmap to learn Python and Data Structures & Algorithms (DSA) in 2 months
### Week 1: Introduction to Python
Day 1-2: Basics of Python
- Python setup (installation and IDE setup)
- Basic syntax, variables, and data types
- Operators and expressions
Day 3-4: Control Structures
- Conditional statements (if, elif, else)
- Loops (for, while)
Day 5-6: Functions and Modules
- Function definitions, parameters, and return values
- Built-in functions and importing modules
Day 7: Practice Day
- Solve basic problems on platforms like HackerRank or LeetCode
### Week 2: Advanced Python Concepts
Day 8-9: Data Structures in Python
- Lists, tuples, sets, and dictionaries
- List comprehensions and generator expressions
Day 10-11: Strings and File I/O
- String manipulation and methods
- Reading from and writing to files
Day 12-13: Object-Oriented Programming (OOP)
- Classes and objects
- Inheritance, polymorphism, encapsulation
Day 14: Practice Day
- Solve intermediate problems on coding platforms
### Week 3: Introduction to Data Structures
Day 15-16: Arrays and Linked Lists
- Understanding arrays and their operations
- Singly and doubly linked lists
Day 17-18: Stacks and Queues
- Implementation and applications of stacks
- Implementation and applications of queues
Day 19-20: Recursion
- Basics of recursion and solving problems using recursion
- Recursive vs iterative solutions
Day 21: Practice Day
- Solve problems related to arrays, linked lists, stacks, and queues
### Week 4: Fundamental Algorithms
Day 22-23: Sorting Algorithms
- Bubble sort, selection sort, insertion sort
- Merge sort and quicksort
Day 24-25: Searching Algorithms
- Linear search and binary search
- Applications and complexity analysis
Day 26-27: Hashing
- Hash tables and hash functions
- Collision resolution techniques
Day 28: Practice Day
- Solve problems on sorting, searching, and hashing
### Week 5: Advanced Data Structures
Day 29-30: Trees
- Binary trees, binary search trees (BST)
- Tree traversals (in-order, pre-order, post-order)
Day 31-32: Heaps and Priority Queues
- Understanding heaps (min-heap, max-heap)
- Implementing priority queues using heaps
Day 33-34: Graphs
- Representation of graphs (adjacency matrix, adjacency list)
- Depth-first search (DFS) and breadth-first search (BFS)
Day 35: Practice Day
- Solve problems on trees, heaps, and graphs
### Week 6: Advanced Algorithms
Day 36-37: Dynamic Programming
- Introduction to dynamic programming
- Solving common DP problems (e.g., Fibonacci, knapsack)
Day 38-39: Greedy Algorithms
- Understanding greedy strategy
- Solving problems using greedy algorithms
Day 40-41: Graph Algorithms
- Dijkstra’s algorithm for shortest path
- Kruskal’s and Prim’s algorithms for minimum spanning tree
Day 42: Practice Day
- Solve problems on dynamic programming, greedy algorithms, and advanced graph algorithms
### Week 7: Problem Solving and Optimization
Day 43-44: Problem-Solving Techniques
- Backtracking, bit manipulation, and combinatorial problems
Day 45-46: Practice Competitive Programming
- Participate in contests on platforms like Codeforces or CodeChef
Day 47-48: Mock Interviews and Coding Challenges
- Simulate technical interviews
- Focus on time management and optimization
Day 49: Review and Revise
- Go through notes and previously solved problems
- Identify weak areas and work on them
### Week 8: Final Stretch and Project
Day 50-52: Build a Project
- Use your knowledge to build a substantial project in Python involving DSA concepts
Day 53-54: Code Review and Testing
- Refactor your project code
- Write tests for your project
Day 55-56: Final Practice
- Solve problems from previous contests or new challenging problems
Day 57-58: Documentation and Presentation
- Document your project and prepare a presentation or a detailed report
Day 59-60: Reflection and Future Plan
- Reflect on what you've learned
- Plan your next steps (advanced topics, more projects, etc.)
Best DSA RESOURCES: https://topmate.io/coding/886874
Credits: https://xn--r1a.website/free4unow_backup
ENJOY LEARNING 👍👍
### Week 1: Introduction to Python
Day 1-2: Basics of Python
- Python setup (installation and IDE setup)
- Basic syntax, variables, and data types
- Operators and expressions
Day 3-4: Control Structures
- Conditional statements (if, elif, else)
- Loops (for, while)
Day 5-6: Functions and Modules
- Function definitions, parameters, and return values
- Built-in functions and importing modules
Day 7: Practice Day
- Solve basic problems on platforms like HackerRank or LeetCode
### Week 2: Advanced Python Concepts
Day 8-9: Data Structures in Python
- Lists, tuples, sets, and dictionaries
- List comprehensions and generator expressions
Day 10-11: Strings and File I/O
- String manipulation and methods
- Reading from and writing to files
Day 12-13: Object-Oriented Programming (OOP)
- Classes and objects
- Inheritance, polymorphism, encapsulation
Day 14: Practice Day
- Solve intermediate problems on coding platforms
### Week 3: Introduction to Data Structures
Day 15-16: Arrays and Linked Lists
- Understanding arrays and their operations
- Singly and doubly linked lists
Day 17-18: Stacks and Queues
- Implementation and applications of stacks
- Implementation and applications of queues
Day 19-20: Recursion
- Basics of recursion and solving problems using recursion
- Recursive vs iterative solutions
Day 21: Practice Day
- Solve problems related to arrays, linked lists, stacks, and queues
### Week 4: Fundamental Algorithms
Day 22-23: Sorting Algorithms
- Bubble sort, selection sort, insertion sort
- Merge sort and quicksort
Day 24-25: Searching Algorithms
- Linear search and binary search
- Applications and complexity analysis
Day 26-27: Hashing
- Hash tables and hash functions
- Collision resolution techniques
Day 28: Practice Day
- Solve problems on sorting, searching, and hashing
### Week 5: Advanced Data Structures
Day 29-30: Trees
- Binary trees, binary search trees (BST)
- Tree traversals (in-order, pre-order, post-order)
Day 31-32: Heaps and Priority Queues
- Understanding heaps (min-heap, max-heap)
- Implementing priority queues using heaps
Day 33-34: Graphs
- Representation of graphs (adjacency matrix, adjacency list)
- Depth-first search (DFS) and breadth-first search (BFS)
Day 35: Practice Day
- Solve problems on trees, heaps, and graphs
### Week 6: Advanced Algorithms
Day 36-37: Dynamic Programming
- Introduction to dynamic programming
- Solving common DP problems (e.g., Fibonacci, knapsack)
Day 38-39: Greedy Algorithms
- Understanding greedy strategy
- Solving problems using greedy algorithms
Day 40-41: Graph Algorithms
- Dijkstra’s algorithm for shortest path
- Kruskal’s and Prim’s algorithms for minimum spanning tree
Day 42: Practice Day
- Solve problems on dynamic programming, greedy algorithms, and advanced graph algorithms
### Week 7: Problem Solving and Optimization
Day 43-44: Problem-Solving Techniques
- Backtracking, bit manipulation, and combinatorial problems
Day 45-46: Practice Competitive Programming
- Participate in contests on platforms like Codeforces or CodeChef
Day 47-48: Mock Interviews and Coding Challenges
- Simulate technical interviews
- Focus on time management and optimization
Day 49: Review and Revise
- Go through notes and previously solved problems
- Identify weak areas and work on them
### Week 8: Final Stretch and Project
Day 50-52: Build a Project
- Use your knowledge to build a substantial project in Python involving DSA concepts
Day 53-54: Code Review and Testing
- Refactor your project code
- Write tests for your project
Day 55-56: Final Practice
- Solve problems from previous contests or new challenging problems
Day 57-58: Documentation and Presentation
- Document your project and prepare a presentation or a detailed report
Day 59-60: Reflection and Future Plan
- Reflect on what you've learned
- Plan your next steps (advanced topics, more projects, etc.)
Best DSA RESOURCES: https://topmate.io/coding/886874
Credits: https://xn--r1a.website/free4unow_backup
ENJOY LEARNING 👍👍
❤9
Which of the following data structures is mutable (can be changed)?
Anonymous Quiz
17%
A) Tuple
16%
B) String
62%
C) List
5%
D) Set
❤5
❤2
Which method adds an element at the end of a list?
Anonymous Quiz
9%
A) add()
77%
B) append()
9%
C) insert()
5%
D) push()
❤2
Which data structure stores values in key–value pairs?
Anonymous Quiz
7%
A) List
9%
B) Tuple
79%
C) Dictionary
6%
D) Set
❤2
What will be the output?
nums = {1, 2, 2, 3} print(nums)
nums = {1, 2, 2, 3} print(nums)
Anonymous Quiz
44%
A) {1, 2, 2, 3}
38%
B) {1, 2, 3}
13%
C) Error
5%
D) [1, 2, 3]
🤔5❤2
Amazon Interview Process for Data Scientist position
📍Round 1- Phone Screen round
This was a preliminary round to check my capability, projects to coding, Stats, ML, etc.
After clearing this round the technical Interview rounds started. There were 5-6 rounds (Multiple rounds in one day).
📍 𝗥𝗼𝘂𝗻𝗱 𝟮- 𝗗𝗮𝘁𝗮 𝗦𝗰𝗶𝗲𝗻𝗰𝗲 𝗕𝗿𝗲𝗮𝗱𝘁𝗵:
In this round the interviewer tested my knowledge on different kinds of topics.
📍𝗥𝗼𝘂𝗻𝗱 𝟯- 𝗗𝗲𝗽𝘁𝗵 𝗥𝗼𝘂𝗻𝗱:
In this round the interviewers grilled deeper into 1-2 topics. I was asked questions around:
Standard ML tech, Linear Equation, Techniques, etc.
📍𝗥𝗼𝘂𝗻𝗱 𝟰- 𝗖𝗼𝗱𝗶𝗻𝗴 𝗥𝗼𝘂𝗻𝗱-
This was a Python coding round, which I cleared successfully.
📍𝗥𝗼𝘂𝗻𝗱 𝟱- This was 𝗛𝗶𝗿𝗶𝗻𝗴 𝗠𝗮𝗻𝗮𝗴𝗲𝗿 where my fitment for the team got assessed.
📍𝗟𝗮𝘀𝘁 𝗥𝗼𝘂𝗻𝗱- 𝗕𝗮𝗿 𝗥𝗮𝗶𝘀𝗲𝗿- Very important round, I was asked heavily around Leadership principles & Employee dignity questions.
So, here are my Tips if you’re targeting any Data Science role:
-> Never make up stuff & don’t lie in your Resume.
-> Projects thoroughly study.
-> Practice SQL, DSA, Coding problem on Leetcode/Hackerank.
-> Download data from Kaggle & build EDA (Data manipulation questions are asked)
Best Data Science & Machine Learning Resources: https://topmate.io/coding/914624
ENJOY LEARNING 👍👍
📍Round 1- Phone Screen round
This was a preliminary round to check my capability, projects to coding, Stats, ML, etc.
After clearing this round the technical Interview rounds started. There were 5-6 rounds (Multiple rounds in one day).
📍 𝗥𝗼𝘂𝗻𝗱 𝟮- 𝗗𝗮𝘁𝗮 𝗦𝗰𝗶𝗲𝗻𝗰𝗲 𝗕𝗿𝗲𝗮𝗱𝘁𝗵:
In this round the interviewer tested my knowledge on different kinds of topics.
📍𝗥𝗼𝘂𝗻𝗱 𝟯- 𝗗𝗲𝗽𝘁𝗵 𝗥𝗼𝘂𝗻𝗱:
In this round the interviewers grilled deeper into 1-2 topics. I was asked questions around:
Standard ML tech, Linear Equation, Techniques, etc.
📍𝗥𝗼𝘂𝗻𝗱 𝟰- 𝗖𝗼𝗱𝗶𝗻𝗴 𝗥𝗼𝘂𝗻𝗱-
This was a Python coding round, which I cleared successfully.
📍𝗥𝗼𝘂𝗻𝗱 𝟱- This was 𝗛𝗶𝗿𝗶𝗻𝗴 𝗠𝗮𝗻𝗮𝗴𝗲𝗿 where my fitment for the team got assessed.
📍𝗟𝗮𝘀𝘁 𝗥𝗼𝘂𝗻𝗱- 𝗕𝗮𝗿 𝗥𝗮𝗶𝘀𝗲𝗿- Very important round, I was asked heavily around Leadership principles & Employee dignity questions.
So, here are my Tips if you’re targeting any Data Science role:
-> Never make up stuff & don’t lie in your Resume.
-> Projects thoroughly study.
-> Practice SQL, DSA, Coding problem on Leetcode/Hackerank.
-> Download data from Kaggle & build EDA (Data manipulation questions are asked)
Best Data Science & Machine Learning Resources: https://topmate.io/coding/914624
ENJOY LEARNING 👍👍
❤8
✅ Python Loops (for & while)
Loops help repeat tasks automatically — very important for data processing and automation.
🔹 1. What are Loops?
Loops repeat a block of code multiple times.
👉 Used in:
✅ Data cleaning
✅ Data analysis
✅ Machine learning
✅ Automation
🔥 2. for Loop (Most Used) ⭐
Used to iterate over a sequence (list, string, range).
✅ Basic Syntax
👉 range(5) → generates numbers from 0 to 4.
✅ Loop Through List (Very Important)
🔥 3. while Loop
Runs until condition becomes False.
✅ Syntax
👉 Important: Update condition to avoid infinite loop.
🔹 4. Loop Control Statements (Very Important)
✅ break → stop loop
✅ continue → skip current iteration
🎯 Today’s Goal
✅ Use for loop
✅ Use while loop
✅ Understand break & continue
Double Tap ♥️ For More
Loops help repeat tasks automatically — very important for data processing and automation.
🔹 1. What are Loops?
Loops repeat a block of code multiple times.
👉 Used in:
✅ Data cleaning
✅ Data analysis
✅ Machine learning
✅ Automation
🔥 2. for Loop (Most Used) ⭐
Used to iterate over a sequence (list, string, range).
✅ Basic Syntax
for variable in sequence:✅ Example — Print Numbers
# code
for i in range(5):Output: 0 1 2 3 4
print(i)
👉 range(5) → generates numbers from 0 to 4.
✅ Loop Through List (Very Important)
numbers = [10, 20, 30]👉 Used heavily in data science.
for num in numbers:
print(num)
🔥 3. while Loop
Runs until condition becomes False.
✅ Syntax
while condition:✅ Example
# code
x = 1Output: 1 2 3 4 5
while x <= 5:
print(x)
x += 1
👉 Important: Update condition to avoid infinite loop.
🔹 4. Loop Control Statements (Very Important)
✅ break → stop loop
for i in range(5):Output: 0 1 2
if i == 3:
break
print(i)
✅ continue → skip current iteration
for i in range(5):Output: 0 1 2 4
if i == 3:
continue
print(i)
🎯 Today’s Goal
✅ Use for loop
✅ Use while loop
✅ Understand break & continue
Double Tap ♥️ For More
❤16👍1
Which loop is mostly used to iterate over a list or sequence in Python?
Anonymous Quiz
18%
A) while loop
13%
B) do-while loop
66%
C) for loop
2%
D) repeat loop
❤3
Which statement stops a loop immediately?
Anonymous Quiz
4%
A) stop
9%
B) exit
86%
C) break
2%
D) continue
❤2
What does continue do in a loop?
Anonymous Quiz
7%
A) Stops the loop completely
78%
B) Skips current iteration
15%
C) Restarts program
1%
D) Ends program
❤5
What happens if we don’t update the condition inside a while loop?
Anonymous Quiz
10%
A) Syntax error
17%
B) Program stops automatically
68%
C) Infinite loop
4%
D) Nothing happens
❤2
Which function generates a sequence of numbers for looping?
Anonymous Quiz
19%
A) loop()
55%
B) range()
11%
C) generate()
15%
D) sequence()
❤2
✅ Python Functions 🐍⚙️
Functions are very important in data science. They help you write reusable, clean, and modular code.
🔹 1. What is a Function?
A function is a block of code that performs a specific task.
👉 Instead of writing the same code again and again, we create a function.
🔥 2. Creating a Function
✅ Basic Syntax
✅ Example
Output: Hello Deepak
🔹 3. Function with Parameters
Parameters allow input to functions.
# Output: Hello Rahul
🔹 4. Function with Return Value (Very Important ⭐)
Instead of printing, functions can return values.
# Output: 8
👉 return sends value back.
🔹 5. Default Parameters
🔹 6. Why Functions Matter in Data Science?
✅ Data cleaning functions
✅ Feature engineering functions
✅ Reusable ML pipelines
✅ Code organization
🎯 Today’s Goal
✔ Understand def
✔ Use parameters
✔ Use return
✔ Call functions properly
Double Tap ♥️ For More
Functions are very important in data science. They help you write reusable, clean, and modular code.
🔹 1. What is a Function?
A function is a block of code that performs a specific task.
👉 Instead of writing the same code again and again, we create a function.
🔥 2. Creating a Function
✅ Basic Syntax
def function_name():
# code
✅ Example
def greet():
print("Hello Deepak")
greet()
Output: Hello Deepak
🔹 3. Function with Parameters
Parameters allow input to functions.
def greet(name):
print("Hello", name)
greet("Rahul")
# Output: Hello Rahul
🔹 4. Function with Return Value (Very Important ⭐)
Instead of printing, functions can return values.
def add(a, b):
return a + b
result = add(5, 3)
print(result)
# Output: 8
👉 return sends value back.
🔹 5. Default Parameters
def greet(name="Guest"):
print("Hello", name)
greet()
greet("Amit")
🔹 6. Why Functions Matter in Data Science?
✅ Data cleaning functions
✅ Feature engineering functions
✅ Reusable ML pipelines
✅ Code organization
🎯 Today’s Goal
✔ Understand def
✔ Use parameters
✔ Use return
✔ Call functions properly
Double Tap ♥️ For More
❤25👏1
🔍 Machine Learning Cheat Sheet 🔍
1. Key Concepts:
- Supervised Learning: Learn from labeled data (e.g., classification, regression).
- Unsupervised Learning: Discover patterns in unlabeled data (e.g., clustering, dimensionality reduction).
- Reinforcement Learning: Learn by interacting with an environment to maximize reward.
2. Common Algorithms:
- Linear Regression: Predict continuous values.
- Logistic Regression: Binary classification.
- Decision Trees: Simple, interpretable model for classification and regression.
- Random Forests: Ensemble method for improved accuracy.
- Support Vector Machines: Effective for high-dimensional spaces.
- K-Nearest Neighbors: Instance-based learning for classification/regression.
- K-Means: Clustering algorithm.
- Principal Component Analysis(PCA)
3. Performance Metrics:
- Classification: Accuracy, Precision, Recall, F1-Score, ROC-AUC.
- Regression: Mean Absolute Error (MAE), Mean Squared Error (MSE), R^2 Score.
4. Data Preprocessing:
- Normalization: Scale features to a standard range.
- Standardization: Transform features to have zero mean and unit variance.
- Imputation: Handle missing data.
- Encoding: Convert categorical data into numerical format.
5. Model Evaluation:
- Cross-Validation: Ensure model generalization.
- Train-Test Split: Divide data to evaluate model performance.
6. Libraries:
- Python: Scikit-Learn, TensorFlow, Keras, PyTorch, Pandas, Numpy, Matplotlib.
- R: caret, randomForest, e1071, ggplot2.
7. Tips for Success:
- Feature Engineering: Enhance data quality and relevance.
- Hyperparameter Tuning: Optimize model parameters (Grid Search, Random Search).
- Model Interpretability: Use tools like SHAP and LIME.
- Continuous Learning: Stay updated with the latest research and trends.
🚀 Dive into Machine Learning and transform data into insights! 🚀
Best Data Science & Machine Learning Resources: https://topmate.io/coding/914624
All the best 👍👍
1. Key Concepts:
- Supervised Learning: Learn from labeled data (e.g., classification, regression).
- Unsupervised Learning: Discover patterns in unlabeled data (e.g., clustering, dimensionality reduction).
- Reinforcement Learning: Learn by interacting with an environment to maximize reward.
2. Common Algorithms:
- Linear Regression: Predict continuous values.
- Logistic Regression: Binary classification.
- Decision Trees: Simple, interpretable model for classification and regression.
- Random Forests: Ensemble method for improved accuracy.
- Support Vector Machines: Effective for high-dimensional spaces.
- K-Nearest Neighbors: Instance-based learning for classification/regression.
- K-Means: Clustering algorithm.
- Principal Component Analysis(PCA)
3. Performance Metrics:
- Classification: Accuracy, Precision, Recall, F1-Score, ROC-AUC.
- Regression: Mean Absolute Error (MAE), Mean Squared Error (MSE), R^2 Score.
4. Data Preprocessing:
- Normalization: Scale features to a standard range.
- Standardization: Transform features to have zero mean and unit variance.
- Imputation: Handle missing data.
- Encoding: Convert categorical data into numerical format.
5. Model Evaluation:
- Cross-Validation: Ensure model generalization.
- Train-Test Split: Divide data to evaluate model performance.
6. Libraries:
- Python: Scikit-Learn, TensorFlow, Keras, PyTorch, Pandas, Numpy, Matplotlib.
- R: caret, randomForest, e1071, ggplot2.
7. Tips for Success:
- Feature Engineering: Enhance data quality and relevance.
- Hyperparameter Tuning: Optimize model parameters (Grid Search, Random Search).
- Model Interpretability: Use tools like SHAP and LIME.
- Continuous Learning: Stay updated with the latest research and trends.
🚀 Dive into Machine Learning and transform data into insights! 🚀
Best Data Science & Machine Learning Resources: https://topmate.io/coding/914624
All the best 👍👍
❤9
✅ Conditional Statements (if–else) 🐍⚡
Conditional statements allow programs to make decisions based on conditions.
👉 Used heavily in:
✔ Data filtering
✔ Business rules
✔ Machine learning logic
🔹 1. if Statement
Used to execute code when a condition is True.
✅ Syntax
Example
# Output: You can vote
🔹 2. if–else Statement
Used when there are two possible outcomes.
Syntax
Example
🔹 3. if–elif–else Statement
Used when there are multiple conditions.
Syntax
Example
🔹 4. Nested if Statement
An if statement inside another if.
🔹 5. Short if (Ternary Operator)
🎯 Today’s Goal
✔ Understand if
✔ Use if–else
✔ Use elif for multiple conditions
✔ Learn nested conditions
👉 Conditional logic is used in data filtering and decision models.
Double Tap ♥️ For More
Conditional statements allow programs to make decisions based on conditions.
👉 Used heavily in:
✔ Data filtering
✔ Business rules
✔ Machine learning logic
🔹 1. if Statement
Used to execute code when a condition is True.
✅ Syntax
if condition:
# code
Example
age = 20
if age >= 18:
print("You can vote")
# Output: You can vote
🔹 2. if–else Statement
Used when there are two possible outcomes.
Syntax
if condition:
# code if true
else:
# code if false
Example
age = 16
if age >= 18:
print("Eligible to vote")
else:
print("Not eligible")
🔹 3. if–elif–else Statement
Used when there are multiple conditions.
Syntax
if condition1:
# code
elif condition2:
# code
else:
# code
Example
marks = 75
if marks >= 90:
print("Grade A")
elif marks >= 60:
print("Grade B")
else:
print("Grade C")
🔹 4. Nested if Statement
An if statement inside another if.
age = 20
citizen = True
if age >= 18:
if citizen:
print("Eligible to vote")
🔹 5. Short if (Ternary Operator)
age = 20
print("Adult") if age >= 18 else print("Minor")
🎯 Today’s Goal
✔ Understand if
✔ Use if–else
✔ Use elif for multiple conditions
✔ Learn nested conditions
👉 Conditional logic is used in data filtering and decision models.
Double Tap ♥️ For More
❤16👏1
Which keyword is used to check a condition in Python?
Anonymous Quiz
9%
A) check
82%
B) if
4%
C) when
4%
D) condition
❤3
What will be the output?
x = 10 if x > 5: print("Yes") else: print("No")
x = 10 if x > 5: print("Yes") else: print("No")
Anonymous Quiz
88%
Yes
12%
No
❤3
Which keyword is used to check multiple conditions?
Anonymous Quiz
14%
A) elseif
59%
B) elif
23%
C) else if
4%
D) multiple
❤4