SkillSage | A Digital Platform For Engineering Video Courses & Lectures

Product Details

Design and Analysis of Algorithms | Sem V | Computer Science And Engineering | Gondwana University

Cost :     

Delivery Method :
Validity :
Quantity :

Note ! "Exciting rewards for loyal customers. Refer ur friends and earn Cashbacks. For more details call on 9075150035"

Links ! N/A
  • Product Info
  • Description
  • Demo Videos
  • Reviews
  • Index
  • About the Faculty

Product Info

Kit ContentsIndex Sheet, Google Drive Link, Video Lectures Guide, Installation Guide
Lecture Duration28 Hours
Validity Period1 months & 12 Months
Total Views3
ModeGoogle drive
Runs OnDesktop & Laptop
System RequirementWindows 7 & above | Ram: 2 GB | Processor: 2.0 GHz and above
Video LanguageHindi
Study Material LanguageEnglish
Applicable CourseEngineering
Dispatch Time48 Hours
Delivery Time3 - 5 Days


The SkillSage Kit includes

1. Google Drive Link - which Includes lectures
2. Installation Guide
3. Video Lectures Guide

Demo Videos


Rate your learning experience :-

(Reviews can be posted on buying this product)

Write a review-

User Reviews :-

No reviews found..



Chapter Name

No. of Videos



Chapter I:




Introduction: Analyzing and Designing algorithm, Asymptotic notations: Big Oh, Omega, Theta notation, Average, Best and Worst case analysis of algorithms for Time and Space complexity, Amortized Analysis, Solving Recurrence Equations using Substitution method, Recursion-Tree Method and Master method.


4 Hr 22 mins 


Chapter II:




Divide-and-Conquer and Greedy Strategy: Binary Search, Merge and Quick Sort, The maximum-subarray problem, Strassen’s algorithm for matrix multiplication. Greedy MethodGeneral Strategy, Knapsack problem, Job sequencing with deadlines problem, minimum cost
spanning trees : Prim’s algorithm, Kruskal’s algorithm, Single source shortest path: BellmanFord algorithm, Dijkstra’s algorithm, Difference constraints and shortest paths, Huffman Coding etc.

17 5 Hr 5 mins


Chapter III: 




 Dynamic Programming: Basic strategy, all pair shortest path: Shortest paths and matrix multiplication, Floyd-Warshall algorithm, Single source shortest paths, optimal binary search trees, Matrix-chain Multiplication, Elements of dynamic programming, traveling salesman problem

19 7 Hr 56 mins


Chapter IV: 




Backtracking and Hash tables: The general method, 8-Queen’s problem, Sum of subsets, Graph Coloring, Hamiltonian Cycle , Graph Coloring , Hash tables, Hash functions, Open addressing.

25  9 Hr 22 mins


Chapter V:




NP-Hard And NP-Complete Problems: Basic concepts, Non-Deterministic algorithm, The Classes NP-Hard and NP-complete. NP-Complete problems-Satisfiability problem, vertex cover problem. NP-Hard graph problem, scheduling problem, code generation problems, Simplified NP Hard Problems

7  1 Hr 17 mins
  Total 89 28 Hr 2 mins

About the Faculty

The line which describe him best ''Engineer by Profession & Professor by PASSION!!!'' Punish Sir is one of the best faculty for Computer Science & Engineering and Information Technology in Central India. He continously travels to different places such as Indore, Bhopal, Jabalpur, Bhilai, Raipur, Amravati to impart his technical knowledge to students. He has more than 14 years of teaching experience in subjects related to CSE and IT like Computer Graphics, Operating System, DDA, Data Structure, Machine Learning, Artificial Intelligence etc. Through continuous teaching he has developed deep understanding of technical concepts. His smooth way of teaching and digging deep into the concept of topic helps students to grasp the concepts taught by him at once and are able to recall and reproduce whatever they learn in his class. 

He is currently pursuing PhD in Machine Learning. He holds master degree MTech in Computer Science & Engineering and has graduation degree in Information Technology from YCCE, Nagpur. Currently he is associated with prestigious institute in Nagpur. He is also associated with GATE FORUM and helping students to clear GATE one of the most tough competitive exam.

Other Courses by Faculty