Mentored 81,000+ Students | My Multiple Students secured AIR Below 100 in GATE | Joined top IISc, IITs & NITs | Joined PSUs | 5+ Years Exp.

Sweta Kumari

This course will cover Searching Algorithms Like Linear , Binary & Interpolation Search for  GATE CS/IT.

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 & ESE

Hindi

(Hindi) Searching Algorithms : Linear , Binary & Interpolation Search - GATE CS/IT

Divide and Conquer

Algorithms

CS & IT

GATE - CSIT, DSAI & Placements

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

This lesson will cover Strategy To Crack Searching Algorithms.

Strategy To Crack Searching Algorithms (in Hindi)

This lesson will cover Linear Search & its  Algorithm, Pseudocode , C Code, Example Problem & Approach.

Linear Search - Algorithm, Pseudocode , C Code, Example Problem & Approach (in Hindi)

This lesson will cover Binary Search & its Algorithm, Pseudocode ,  Example Problem & Approach

Binary Search- Algorithm, Pseudocode , Example Problem & Approach(in Hindi)

This lesson will cover  Binary Search with its Iterative & Recursive Code Implementation.Differences between Linear & Binary Search.

Binary Search - Iterative & Recursive Code Implementation, Differences (in Hindi)

This lesson will cover Interpolation Search with its Psuedocode, Algorithm, Approach. Differences between Interpolation Search & Binary Search.

Interpolation Search - Psuedocode, Algorithm, Approach & Differences (in Hindi)

This is a revision lesson for searching algorithms in 15 minutes.

Revise in 15 Minutes - Searching Algorithms (in Hindi)

This course will cover Algorithm Designing Approaches With Problems and thier Solutions.

(Hindi) Greedy Algorithm Designing Approaches - GATE (CS & IT)

This course will cover 100 Short Tricks To Learn Complexities of Algorithms Easily. This Course is beneficial for  GATE (CS and IT) aspirants.

(Hindi) 100 Short Tricks to Learn Complexities of Algorithms - GATE (CS and IT)

IT Graduate | NITan. Teaching is my hobby and also a way to gain command over the subject by sharing knowledge with others.

Bhushan Mandal

In this course I am discussing previous years gate questions from sorting algorithms. This Course is beneficial for GATE (CS and IT) aspirants.

(Hindi) Sorting Algorithms Previous Years Questions : GATE (CS and IT)

My name is Monika Dubey. M.Tech(CSE).Worked  as Asst. Professor. Currently, working as Research Scholar   

Monika Dubey

(Hindi) Hashing and Hash Function

In this course, the educator discusses the questions that were asked from the sorting section in gate previous years question paper.

(Punjabi) Sorting Algorithms - Previous Year Questions: GATE

This course will cover Asymptotic Analysis Of Algorithms with short notes targeted for GATE Aspirants.

Lessons

6 lessons • 1h 19m