Currently pursuing  Btech in CSE from GGSIPU. Love coding, teaching and participating in many coding competitions. 

Nipun Vats

In this course, Nipun has discussed the recurrence relations and applications of divide and conquer. Here we will learn about Recurrence relations, master theorem, application of divide and conquer, binary search, the power of element, merge sort, quick sort, selection procedure and matrix multiplication.

GATE (Graduate Aptitude Test in Engineering) 2020 & 2021 complete preparation with best educators. Know about the detailed syllabus, best books, exam pattern and dates, previous year question papers a

GATE - Iconic Pro

English

Data Structure - Understanding Divide and Conquer

GATE (Graduate Aptitude Test In Engineering) Preparation

C Programming

Programming & Data Structure

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

In this lesson, Nipun has discussed Recurrence relations.

Recurrence Relations

In this lesson, Nipun has discussed the Master Theorem.

Master Theorem

In this lesson, Nipun has discussed the Application of Divide and Conquer.

Application of Divide and Conquer

In this lesson, Nipun has discussed the Binary Search and Power of Element.

Binary Search and Power of Element

In this lesson, Nipun has discussed the Merge Sort and Quick Sort.

Merge Sort and Quick Sort

In this lesson, Nipun has discussed the Selection Procedure and Matrix Multiplication.

Selection Procedure and Matrix Multiplication

Code HELLOSONU01 | 8+ Years Teaching Exp. in GATE CS IT & GATE DS AI on Unacademy | Mentored 2 Lakh+ Students | Produced Rankers Under 500

Sweta Kumari

This course will solve some of the very important problems asked on GATE Exam on Tree Traversals of Data Structures.

(Hindi) Data Structures : Tree Traversals Related Problems for GATE Exam

In this course, I will discuss Arrays in C with some GATE PYQs along with the basic concepts. The course will be beneficial for GATE Aspirants.

(Hindi) Array in C With Concepts and PYQs: GATE (CS and IT)

This course will cover Queue in Data Structures for GATE (CS & IT) Aspirants. In this course, I will be explaining Queue Operations and its implementation using Array & Linked List.

(Hindi) Queue in Data Structures - GATE (CS & IT)

This course will cover total Previous Year Questions From Tree topic of Data structures asked in GATE Exam.

Lessons

6 lessons • 1h 15m

Invalid Date

NaN

Recurrence Relations

Invalid Date

NaN

Master Theorem

Invalid Date

NaN

Application of Divide and Conquer

Invalid Date

NaN

Binary Search and Power of Element

Invalid Date

NaN

Merge Sort and Quick Sort

Invalid Date

NaN

Selection Procedure and Matrix Multiplication