Graph Algorithms | BFS and DFS | Class 11 Computer | Punjab Board 2025
Автор: CS with Sir Iqbal
Загружено: 2025-10-21
Просмотров: 566
Описание:
https://drive.google.com/drive/folder...
Class 11 Computer Science – Chapter 03: Algorithms and Problem Solving
Lecture 15: Graph Algorithms – BFS & DFS (Breadth-First and Depth-First Search)
Assalamu Alaikum dear students!
In today’s lecture, we’ll explore two of the most powerful and interesting graph algorithms — Breadth-First Search (BFS) and Depth-First Search (DFS).
These algorithms are widely used in network analysis, social media apps, route finding, and computer games.
In this lecture, you will learn:
What is a Graph (Nodes and Edges)
What are Graph Algorithms
How BFS works (Level-by-level search using Queue)
How DFS works (Deep search using Stack)
Examples of both algorithms with diagrams
Comparison: BFS vs DFS
Time Complexity: O(V + E) explained
This lecture is explained in simple Urdu + English, following the Punjab Board 2025 syllabus.
Taught by: Sir Muhammad Iqbal
Subject: 1st Year Computer Science (ICS Part 1)
Board: Punjab Board (New Syllabus 2025)
Don’t forget to:
👍 Like 💬 Comment 📤 Share 🔔 Subscribe to CS with Sir Iqbal for complete 1st Year Computer Science video lectures.
#1stYearComputerScience #GraphAlgorithms #BFS #DFS #AlgorithmsAndProblemSolving #Class11ComputerScience #PunjabBoard2025 #CSwithSirIqbal
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
