Great Learning
Great Learning Logo

Crash Course on Algorithms 

  • Offered byGreat Learning

Crash Course on Algorithms
 at 
Great Learning 
Overview

Duration

10 hours

Total fee

Free

Mode of learning

Online

Difficulty level

Beginner

Official Website

Explore Free Course External Link Icon

Credential

Certificate

Crash Course on Algorithms
 at 
Great Learning 
Highlights

  • Earn a certificate of completion
Details Icon

Crash Course on Algorithms
 at 
Great Learning 
Course details

What are the course deliverables?
  • Performance Analysis
  • Asymptotic Notations
  • Problem Types
  • Divide/Decrease & Conquer
  • Greedy Method
  • Prim?s/Kruskal?s/Dijkstra's Algorithms
  • Huffman Trees & Codes
  • Transform & Conquer
  • Dynamic Programming
  • Backtracking
  • Transitive Closure
  • 0/1 Knapsack problem
  • ...
More about this course
  • This Crash course will cover all the concepts of Algorithms under the Computer Science/IT/IS branch syllabus for 2nd year
  • This course is specially designed to help you understand the concepts you need help in
  • This course will help you in solving numerical, answer questions, understand concepts & help you prepare for internal/exams

Crash Course on Algorithms
 at 
Great Learning 
Curriculum

Syllabus

Array

Faculty Icon

Crash Course on Algorithms
 at 
Great Learning 
Faculty details

Mr. Setu Maheshwari
Designation : Faculty for Computer Science Engineering Description : Setu is currently working with NPIU (M.H.R.D.) and associated with TEQIP-III project. He has been serving in education and teaching for the last 10 years. He has had the experience of teaching in many reputed colleges across the country, having trained thousands of students on different technologies. He has also authored several books for students.

Other courses offered by Great Learning

97 K
4 months
– / –
3.5 L
5 months
– / –
2.75 L
12 months
– / –
2.75 L
12 months
– / –
View Other 1234 CoursesRight Arrow Icon
qna

Crash Course on Algorithms
 at 
Great Learning 

Student Forum

chatAnything you would want to ask experts?
Write here...