I am from Uttar Pradesh.I completed my school from DAV, varanasi. I got 9.2 CGPA in 10th and 78% in 12th.I am now doing btech in mechanical 

Anurag Mishra

This course describes about various search strategies involved in AI

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

Hindi

(Hindi) Search Strategies in A.I

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

This lesson covers breadth first search strategies along with algorithm and examples.

Breadth-First-Search (in Hindi)

This lesson covers about depth first search and depth limited search algorithms along with their examples.

Depth First Search (in Hindi)

This lesson covers about iterative deepening search with a small summary about all the lessons until now.

Iterative Deepening Search (in Hindi)

This lesson covers about Uniform cost search with a example as well.

Uniform Cost Search (in Hindi)

This course involves a question on BFS and DFS .

Summary of BFS, DFS and UCS (in Hindi)

Question on UCS (in hindi)

This lesson sums up about the difference between BFS, DFS and UCS using problem.

Difference between BFS, DFS, UCS (in hindi)

This lesson introduce about informed search and focuses on greedy search algorithms.

Informed Search (in hindi)

In this lesson we look to understand greedy search algorithms using examples.

Greedy search algorithms (in hindi)

This lesson covers about A* search algorithms along with examples.

A* search algorithms (in hindi)

Want to outperform? I am there to help you out! I am a student of NIT Durgapur and an ardent follower of programming and Machine Learning

Abhishek Karn

This course is about Bit Manipulations. In my course Abhishek Karn will be teaching the concepts of bit manipulations and use them to solve some amazing problems with the help of those concepts. The topics learnt in this course will also help students to apply these concepts while solving programming contest's problems and will also prepare them for this topic for software companies' interviews.

Bit Manipulation

Engineer | Computer Science | Keeping things simple - O(1)

Shivangi Garg

Its about different binary trees, there properties, how to traverse them and many operations associated with binary tree.

Binary Tree

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

Nipun Vats

Covering the first topic "Asymptomatic Analysis of Algorithms" of the chapter "algorithms"

(Hindi) Asymptomatic Analysis of Algorithms for GATE/IES

Jyoti Jha

This course is for those students who are preparing for GATE and BSc in computer .

(Hindi) Data Structures and Algorithms: GATE

AWS Cloud Support Associate(Networking); B.Tech-IT from Maharaja Surajmal Institute of Technology.

Payal Gupta

Learning Sorting is a fundamental step in learning Algorithms. Here's your chance to learn how to perform: Introduction to Sorting Linear Search Binary Search Bubble Sort Insertion Sort Selection Sort Heap Sort Bucket Sort Radix Sort Count Sort Quick Sort

Sorting: GATE (CS and IT)

🌟 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

10 lessons • 1h 18m

Invalid Date

NaN

Breadth-First-Search (in Hindi)

Invalid Date

NaN

Depth First Search (in Hindi)

Invalid Date

NaN

Iterative Deepening Search (in Hindi)

Invalid Date

NaN

Uniform Cost Search (in Hindi)

Invalid Date

NaN

Summary of BFS, DFS and UCS (in Hindi)

Invalid Date

NaN

Question on UCS (in hindi)

Invalid Date

NaN

Difference between BFS, DFS, UCS (in hindi)

Invalid Date

NaN

Informed Search (in hindi)

Invalid Date

NaN

Greedy search algorithms (in hindi)

Invalid Date

NaN

A* search algorithms (in hindi)