Algorithm Final-Term Marathon -Part 1: BFS, DFS, Kruskal, Prims, Fibonacci | Full Syllabus| AIUB-CSE

Welcome to the Algorithm Final-Term Marathon (Part 1)! ⚡

In this one-shot video, we cover the most important topics for the final term, focusing on Graph Algorithms and Greedy Approaches. Designed specifically for AIUB students, this video will help you understand complex algorithms through simple, story-like explanations.

📖 Topics Covered:
Topic 01: BFS (Breadth-First Search) - Concept & Simulation
Topic 02: DFS (Depth-First Search) - Concept & Simulation
Topic 03: Kruskal's Algorithm (MST)
Topic 04: Prim's Algorithm (MST)
Topic 05: LCM
Topic 06: Fibonacci (Recursive & Dynamic Programming approach)

🕒 Video Timestamps & Topic Details:

0:00 - Introduction & BFS (Breadth-First Search)
(BFS-er basic concept, Queue implementation ebong step-by-step simulation.)

15:36 - DFS (Depth-First Search)
(DFS-er working principle, Stack implementation ebong graph traversal rules.)

29:45 - Kruskal's Algorithm (MST)
(Minimum Spanning Tree ber korar jonno Kruskal-er logic ebong sorting-er babohar.)

45:40 - Prim's Algorithm (MST)
(Prim's algorithm-er algorithm visualization ebong Kruskal-er sathe er parthokkyo.)

57:05 - LCM (Least Common Multiple)
(LCM basic logic ar algorithm implementation.)

1:22:37 - Fibonacci Algorithm (Recursive & DP)
(Fibonacci-r recursive approach ebong kivabe Dynamic Programming use kore efficiency barano jay.)
🔗 Watch My Previous Marathons:

TOC Final-Term Part 1: https://youtu.be/jHs6xOr7J1Y?si=aZnuVOzEEJWDmX4h

TOC Mid-Term Part 1: https://youtu.be/aUGJJbzyIPE?si=ZPOZuDnBS5fL2ncv
TOC Mid-Term Part 2: https://youtu.be/6QpYIzXS56I?si=cMdXixecPmpxfY7v

DLC Mid-Term Marathon: https://youtu.be/thLU1HolqIo?si=weCTDrsuZBN1pWnn

EDC Final-Term Marathon: https://youtu.be/s1KHK_Ep75Q?si=XzYTHhYM2jWhU3GZ

Видео Algorithm Final-Term Marathon -Part 1: BFS, DFS, Kruskal, Prims, Fibonacci | Full Syllabus| AIUB-CSE канала Meumiki kitchen 😻 মিউমিকি রান্নাঘর 🥰