 Btech in CSE and  Mtech in Intelligent Systems and Robotics . GATE Qualified. Currently working as an associate Software Developer at Globa

Akansha Aggarwal

This course discusses searching algorithms and hashing and its different collision resolution techniques with previous year gate questions

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

Searching and Hashing for GATE

Greedy Techniques

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

Searching algorithms are used to search a particular data in huge dataset.Linear search and Binary search are the most important searching algorithms

Searching Algorithms

Hashing is a searching technique which gives constant searching time.It uses a hash function to find locations of elements

Hashing

Linear Probing is discussed in this video.It is a collision resolution technique where collisions are resolved by moving linearly to the subsequent locations.

Collision Resolution Techniques in Hashing

In Quadratic Probing data is searched in Quadratic manner.If L is the location where collision occurs,then we'll search at L+1*1,L+2*2,...back to L in circular fashion.

Quadratic Probing

In chaining,each cell of hash table is made to point a linked list in case of a collision.

Chaining

(i) Gate Qualified 2016
(ii) Mtech (Cyber Security) from NIT Kurukshetra.
(iii) UGC-Net Qualified 
(iv) Cyber security analyst at Honeywell

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 Methods: GATE (CS and IT)

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

Monika Dubey

This course covers Matrix Chain Multiplication- Concept+Practice Question +GATE Previous Year Questions

(Hindi) Matrix Chain Multiplication (Dynamic Programming)

An algorithm is a step by step procedure to solve a problem.A problem can have multiple algorithms.Every algorithm is analysed for its performance on parameters like space and time and then the best one is selected to solve the problem.

(Hindi) Analysis of Algorithms

Greedy Algorithms is not an algorithm but an algorithmic paradigm where we are greedy about the current best and hope that current best will lead to global best.This course discusses greedy algorithms as an algorithmic paradigm and some problems that are solved using greedy algorithms

(Hindi) Greedy Algorithms

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

(Hindi) Greedy Approach : GATE

🌟 Bachelor’s degree in Computer engineering 🌟 CGPA 9.14 🌟 GATE qualified 🌟 Unacademy Verified Educator 🌟 Software engineer 🌟 CS Passionate 🌟

Nisha Sajnani

Understand Sorting algorithms using examples, find it's worst and best case complexity. Additionally we'll cover PYQs on Sorting

Lessons

5 lessons • 56m

Invalid Date

NaN

Searching Algorithms

Invalid Date

NaN

Hashing

Invalid Date

NaN

Collision Resolution Techniques in Hashing

Invalid Date

NaN

Quadratic Probing

Invalid Date

NaN

Chaining