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

Monika Dubey

In this course, the educator will be teaching about Huffman Encoding- concept+Algorithm+Practice Question+GATE Previous Year 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

Hindi

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

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

Introduction Huffman Coding (in Hindi)

Huffman Coding - Algorithm (in Hindi)

Practice Question Huffman Coding (in Hindi)

GATE Previous Year Question (in Hindi)

GATE Previous Year Question- Huffman Coding (in Hindi)

GATE Previous Year Question- Huffman Coding

Working Professional | Computer Science Engineer | Developer | Programmer | Cleared GATE Examination

Jaspreet Kaur

This course is about Dynamic programming. It introduce you to what the dynamic programming is, its uses, its various problems and their analysis.

Dynamic Programming: GATE

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

(Hindi) Matrix Chain Multiplication (Dynamic Programming)

 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

Searching and Hashing for GATE

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

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)

🌟 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

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

4.8

Monika Dubey

Lessons

6 lessons • 49m

Invalid Date

NaN

Introduction Huffman Coding (in Hindi)

Invalid Date

NaN

Huffman Coding - Algorithm (in Hindi)

Invalid Date

NaN

Practice Question Huffman Coding (in Hindi)

Invalid Date

NaN

GATE Previous Year Question (in Hindi)

Invalid Date

NaN

GATE Previous Year Question- Huffman Coding (in Hindi)

Invalid Date

NaN

GATE Previous Year Question- Huffman Coding (in Hindi)

Similar courses

Dynamic Programming: GATE

4.9

(Hindi) Matrix Chain Multiplication (Dynamic Programming)

5

Searching and Hashing for GATE

4.5

(Hindi) Analysis of Algorithms

5

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

4

Sorting Techniques : GATE (CS and IT)

5

No internet connection