GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and SSC JE

Ace the toughest competitive and government exams in India 

Test Preparation

This course will cover Algorithm Designing Approaches with concepts, problems, and their Solutions.

(Hindi) Dijkstra's and Bellman-Ford Algorithm (Single Source Shortest Path Algorithm)

In this course, the educator discusses the dynamic approach and applications concept and practice questions. The course will be beneficial for GATE (CS and IT).

(Hindi) Dynamic Approach and its Applications: GATE (CS and IT)

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

(Hindi) Greedy Approach : GATE

All about Algorithms from introduction to problem solving for Gate covering all the important topics on algorithm for Gate.

(Hindi) Design and Analysis of Algorithms for GATE

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

(Hindi) Matrix Chain Multiplication (Dynamic Programming)

This course includes the basic concepts like solving time complexity, asymptotic notations, and sorting and searching techniques. The course will be beneficial for GATE (CS and IT).

Introduction to Design and Analysis of Algorithms

This course will discuss Graph Algorithms in detail with concepts first and then previous year questions on this topic. So, this is a complete course in Graph Algorithms that have a Weightage of 2 marks.

(Hindi) Graph Algorithms Concepts and PYQs : GATE (CS/IT)

This course will cover Shortest Path Algorithms like Djikstra, Bellman-Ford and Floyd Warshall Algorithm. The course will be beneficial for GATE Aspirants.

(Hindi) Shortest Path Algorithms Practice Questions: GATE (CS and IT)

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

In this course, the educator will be teaching about Huffman Encoding- concept+Algorithm+Practice Question+GATE Previous Year Questions

(Hindi) Huffman Encoding (Greedy Approach) - GATE (CS and IT)

English

All questions