Please Login To Continue
Course Overview
Lesson 1 of 25 • 3 upvotes • 9:50mins
Sourav Newatia
Divide and conquer is an algorithm design paradigm based on multi-branched recursion. In this course, the educator will cover all the D & C methods like linear search, Binary search, Merge sort, Quick sort, Matrix multiplication, Integer multiplication, Min-Max Algorithm, set Algorithms, Tree representation, Priority Queue, and Heap.
Divide and Conquer Algorithms (Gate CS and IT)
25 lessons • 3h 39m
1
Course Overview
9:50mins
2
Mark Distribution (Gate CS and IT)
7:03mins
3
Linear Search and Binary Search (Gate CS and IT )
14:56mins
4
Merge Sort (Gate CS and IT)
15:00mins
5
Quick Sort (Gate CS snd IT)
12:28mins
6
Integer Multiplication (Gate CS and IT)
10:29mins
7
Matrix multiplication and Min-Max Algorithm (Gate CS and IT)
7:38mins
8
Tree Representation (Gate CS and IT)
9:07mins
9
Heap Sort and Priority Queue
10:03mins
10
Shell Sort (Gate CS and IT)
7:15mins
11
Radix sort (Gate CS & IT)
7:32mins
12
Analysis of different sorting techniques (Gate Cs and IT)
7:01mins
13
Previous year question - I
8:25mins
14
Previous year Question - II
7:40mins
15
Previous year Question -III
7:07mins
16
Previous year Question -IV
7:19mins
17
Previous Year Question - V
7:03mins
18
Previous year Question - VI
8:10mins
19
Previous year Question - VII
8:22mins
20
Previous Year Question - VIII
7:32mins
21
Previous Year Question -IX
7:39mins
22
Previous year Question - X
8:01mins
23
Previous year Question -XI
7:11mins
24
Previous year Question - XII
7:01mins
25
Previous year Question: XIII
9:12mins
Crack GATE - Iconic Pro with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
