Design & Analysis of Algorithms (BCI402) crash course, Online BCA, Semester 4:
This subject covers how to analyse algorithms using asymptotic notation and recurrences, and how to design them using divide and conquer, dynamic programming…
- 19 video lessons
- 6h 1m
- Study notes
- 95 quiz questions
- Assignment
19 lessons in Design & Analysis of Algorithms
Each lesson pairs one topic with a hand-picked video, trimmed to the part that teaches it.
About this subject
This subject covers how to analyse algorithms using asymptotic notation and recurrences, and how to design them using divide and conquer, dynamic programming and greedy methods, along with sorting, data structures, graph algorithms, string matching and NP-completeness. After it you will be able to analyse the running time of an algorithm, choose a suitable design technique for a problem, and recognise problems that are NP-complete and need approximation.
- 1
Introduction to Algorithms: Analysis and Design
Module I, Introduction: Algorithms, Analyzing algorithms, Designing algorithms
1. Introduction to Algorithms· Abdul Bari· 12 min
Study notes 5 quiz questionsWatch lesson - 2
Asymptotic Notation (Big O, Omega, Theta)
Module I, Introduction: Mathematical Foundations: Growth of Functions - Asymptotic notation
1.8.1 Asymptotic Notations Big Oh - Omega - Theta #1· Abdul Bari· 16 min
Study notes 5 quiz questionsWatch lesson - 3
Solving Recurrences: Substitution and Recursion Tree
Module I, Introduction: Recurrence: The substitution Method, Recursion tree method
Substitution Method to Solve Recurrence Relation of Time· Neso Academy· 15 min
Study notes 5 quiz questionsWatch lesson - 4
Master Method for Recurrences
Module I, Introduction: Master Method
2.4.1 Masters Theorem in Algorithms for Dividing Function #1· Abdul Bari· 17 min
Study notes 5 quiz questionsWatch lesson - 5
Divide and Conquer and Strassen's Matrix Multiplication
Module II, Sorting and Order statistics: Divide & Conquer Strategy, V. Strassen Matrix Multiplication
2.9 Strassens Matrix Multiplication· Abdul Bari· 24 min
Study notes 5 quiz questionsWatch lesson - 6
Heap Sort and Quick Sort
Module II, Sorting and Order statistics: Heap Sort, Quick Sort
L-3.18: Heap sort with Example | Heapify Method· Gate Smashers· 14 min
Study notes 5 quiz questionsWatch lesson - 7
Sorting in Linear Time (Counting, Radix, Bucket Sort)
Module II, Sorting and Order statistics: Sorting in Linear time
L-3.10: Counting Sort | Easiest explanation with example· Gate Smashers· 8 min
Study notes 5 quiz questionsWatch lesson - 8
Elementary Data Structures, Hash Tables and Binary Search Trees
Module II, Sorting and Order statistics: Data Structures: Elementary data structures, Hash tables, Binary search trees
Lec-53: Binary Search Tree in Data Structure | Insertion and Traversal in BST· Gate Smashers· 11 min
Study notes 5 quiz questionsWatch lesson - 9
Dynamic Programming and Matrix Chain Multiplication
Module III, Advanced Design and Analysis Techniques: Dynamic programming - Elements of dynamic programming, Chain-matrix multiplication
4.3 Matrix Chain Multiplication - Dynamic Programming· Abdul Bari· 23 min
Study notes 5 quiz questionsWatch lesson - 10
Floyd-Warshall Algorithm and Optimal Binary Search Tree
Module III, Advanced Design and Analysis Techniques: All pair shortest path (Floyd algorithm), Optimal Binary Search Tree
4.2 All Pairs Shortest Path (Floyd-Warshall) - Dynamic Programming· Abdul Bari· 14 min
Study notes 5 quiz questionsWatch lesson - 11
Greedy Algorithms and Huffman Coding
Module III, Advanced Design and Analysis Techniques: Greedy algorithms - Elements of the greedy strategy, Huffman codes
3.4 Huffman Coding - Greedy Method· Abdul Bari· 18 min
Study notes 5 quiz questionsWatch lesson - 12
Dijkstra's Shortest Path and Knapsack Problem
Module III, Advanced Design and Analysis Techniques: Single-source shortest path in a directed graph, Knapsack problem
3.6 Dijkstra Algorithm - Single Source Shortest Path - Greedy Method· Abdul Bari· 19 min
Study notes 5 quiz questionsWatch lesson - 13
Kruskal's and Prim's Minimum Spanning Tree
Module III, Advanced Design and Analysis Techniques: Minimum Spanning trees - The Algorithm of Kruskals and Prims
3.5 Prims and Kruskals Algorithms - Greedy Method· Abdul Bari· 20 min
Study notes 5 quiz questionsWatch lesson - 14
BFS, DFS and Elementary Graph Algorithms
Module IV, Graph Algorithms: Elementary graphs Algorithms
L-4.15: BFS & DFS | Breadth First Search | Depth First Search | Graph Traversing | DAA· Gate Smashers· 11 min
Study notes 5 quiz questionsWatch lesson - 15
Minimum Spanning Trees and Shortest Paths in Graphs
Module IV, Graph Algorithms: Minimum spanning Trees, Single source Shortest paths, All Pair Shortest Paths
Complete DAA Design and Analysis of Algorithm in one shot | Semester Exam | Hindi· KnowledgeGATE by Sanchit Sir· 49 min
Study notes 5 quiz questionsWatch lesson - 16
Sorting Networks and Parallel Algorithms
Module IV, Graph Algorithms: Selected Topics: Sorting Networks, Algorithms for Parallel Computers
Sorting Networks with example in Hindi | Parallel Algorithm | DAA ADA DS | Sorting on Linear Array· The Insight Coders· 11 min
Study notes 5 quiz questionsWatch lesson - 17
Polynomials and the Fast Fourier Transform (FFT)
Module V, : Polynomials and the FFT
The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?· Reducible· 28 min
Study notes 5 quiz questionsWatch lesson - 18
String Matching Algorithms
Module V, : String Matching
9.1 Knuth-Morris-Pratt KMP String Matching Algorithm· Abdul Bari· 19 min
Study notes 5 quiz questionsWatch lesson - 19
NP-Completeness and Approximation Algorithms
Module V, : NP-Completeness, Approximation Algorithms
8. NP-Hard and NP-Complete Problems· Abdul Bari· 32 min
Study notes 5 quiz questionsWatch lesson
Assignment
Algorithm Analysis Problem Set: From Recurrences to Graphs and Strings
Less scrolling. More passing.
- Free
Hand-picked video lessons
19 short lessons, each with the best YouTube explanation we could find, trimmed to the part that matters.
- Free login
Study notes
19 lessons come with a summary, key points, key terms and takeaways for quick revision.
- Free login
Quizzes
95 questions across the course, with the right answer and why, the moment you pick.
- Free login
Assignments
1 subject assignments with clear tasks, so you practise what each subject actually asks of you.
- Free login
Notebook
Write notes beside the video, stamped with the exact time, and jump back to that moment later.
- Free login
Progress that follows you
Completed lessons, quiz scores and where you stopped, saved to your account on every device.
- Live chat pass
Live chat
A members-only live chat beside every lesson: doubts, tips, stickers and GIFs with your batch. One ₹19 pass opens every live chat.
The Online BCA live chat. Study together, live.
A live chat right beside the video, shared by everyone studying Online BCA. Ask a Design & Analysis of Algorithms doubt mid-lesson, share a shortcut, celebrate a finished semester.
- Live chat beside every lesson
- One live chat for all of Online BCA
- Members-only stickers & GIFs
- One ₹19 pass opens every live chat
Online BCA live chat
Anyone else finding Design & Analysis of Algorithms tricky? 😅
Lesson 2 cleared it up for me. Watch it before the quiz
Doing it now, thanks!
Starting Big Data Analytics tonight if anyone wants to go together
More from Online BCA Semester 4
All subjects- Sem 4
BCA435
Big Data Analytics
This subject covers big data concepts, MapReduce algorithms, the Hadoop architecture with HDFS and YARN, and ecosystem tools such as Hive, HBase, Pig and…
- 17 lessons
- 4h 4m
- Notes
- Quiz
- Sem 4
BCA434
Cloud Computing
This subject covers cloud architecture and service models, virtualization, cloud infrastructure design, cloud programming models such as MapReduce and Hadoop,…
- 18 lessons
- 3h 48m
- Notes
- Quiz
- Sem 4
BCI401
Computer Graphics
This subject covers how computer graphics systems work, from display hardware such as raster and random scan devices to the algorithms that draw lines, circles…
- 16 lessons
- 3h 49m
- Notes
- Quiz
- Sem 4
BCA404
Computer Oriented Numerical Methods
This subject covers computer arithmetic and errors, root-finding for nonlinear equations, solving systems of linear equations, polynomial interpolation,…
- 17 lessons
- 6h 7m
- Notes
- Quiz
- Sem 4
BCI433
Introducing Routing & Switching in the Enterprise
This subject covers how enterprise networks are built and run, including switching with VLANs and loop prevention, hierarchical IP addressing with VLSM, CIDR…
- 26 lessons
- 7h 3m
- Notes
- Quiz
- Sem 4
BCI431
Introduction to .NET Technologies
This subject introduces the .NET Framework and C# programming, then covers building web applications with ASP.NET controls, validation, ADO.NET data access,…
- 23 lessons
- 8h 21m
- Notes
- Quiz
Design & Analysis of Algorithms: common questions
This subject covers how to analyse algorithms using asymptotic notation and recurrences, and how to design them using divide and conquer, dynamic programming and greedy methods, along with sorting, data structures, graph algorithms, string matching and NP-completeness. After it you will be able to analyse the running time of an algorithm, choose a suitable design technique for a problem, and recognise problems that are NP-complete and need approximation. It's the Design & Analysis of Algorithms subject of Online BCA, Semester 4, in 19 lessons: Introduction to Algorithms: Analysis and Design; Asymptotic Notation (Big O, Omega, Theta); Solving Recurrences: Substitution and Recursion Tree; Master Method for Recurrences; Divide and Conquer and Strassen's Matrix Multiplication; Heap Sort and Quick Sort; Sorting in Linear Time (Counting, Radix, Bucket Sort); Elementary Data Structures, Hash Tables and Binary Search Trees; Dynamic Programming and Matrix Chain Multiplication; Floyd-Warshall Algorithm and Optimal Binary Search Tree; Greedy Algorithms and Huffman Coding; Dijkstra's Shortest Path and Knapsack Problem; Kruskal's and Prim's Minimum Spanning Tree; BFS, DFS and Elementary Graph Algorithms; Minimum Spanning Trees and Shortest Paths in Graphs; Sorting Networks and Parallel Algorithms; Polynomials and the Fast Fourier Transform (FFT); String Matching Algorithms; NP-Completeness and Approximation Algorithms.
Yes. Every video lesson is free to watch without an account. A free login unlocks study notes, quizzes, the assignment, a notebook and progress that syncs across devices.
About 6h 1m of video across 19 lessons, plus time for notes and quizzes. Go at your own pace; your place is saved.
Yes: “Algorithm Analysis Problem Set: From Recurrences to Graphs and Strings”. It comes after the last lesson, with a brief, clear tasks and how the work is judged.
A members-only live chat beside the video, shared by everyone studying Online BCA, where learners ask doubts, share tips and react with stickers and GIFs. One ₹19 pass, paid once from your InsideEdge wallet, opens the live chat for every degree.
No. It's a crash course to help you understand and revise the subject quickly. Use it alongside your official study material and assignments.