Product Details

Design and Analysis of Algorithms | Sem V| Computer Science Engineering | Shri Ramdeobaba College of Engineering And Management Nagpur

SkillSage

Cost :     

Delivery Method :
Validity :
Months
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 Duration25 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
Dispatched BySkillSage.in
Dispatch Time48 Hours
Delivery Time3 - 5 Days

Description

The SkillSage Kit includes

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

Demo Videos

Reviews

Rate your learning experience :-

(Reviews can be posted on buying this product)

Write a review-


User Reviews :-

No reviews found..

Index

No.

Chapter Name

No. of Videos

Duration

 

Chapter I:

 

 

1

Mathematical foundations, summation of arithmetic and geometric series, n, n2, bounding summations using integration, recurrence relations, solutions of recurrence relations using technique of characteristic equation and generating functions, Complexity calculation of various standard functions, principles of designing algorithms

18

4 Hr 22 mins 

 

Chapter II:

 

 

1

Asymptotic notations of analysis of algorithms, analyzing control structures, worst case and average case analysis, amortized analysis, application of amortized analysis, Sorting networks, comparison networks, biotonic sorting network. 

7 2 Hr 2 mins

 

Chapter III: 

 

 

1

 Divide and conquer basic strategy, binary search, quick sort, merge sort, matrix operations, Greedy method - basic strategy, application to job sequencing with deadlines problem, minimum cost spanning trees, single source shortest path etc.

10 3  Hr 3 mins

 

Chapter IV: 

 

 

1

Dynamic Programming basic strategy, multistage graphs, all pairs shortest path, single source shortest paths, optimal binary search trees, traveling salesman problem, String Editing, Longest Common Subsequence problem and its variations.

19  7 Hr 56 mins

 

Chapter V:

 

 

1

Basic Traversal and Search Techniques, breadth first search and depth first search, connected components. Backtracking basic strategy, 8-Queen's problem, graph coloring, Hamiltonian cycles etc, Introduction to Approximation algorithm.

12  6 Hr

 

Chapter VI:

 

 

1

NP-hard and NP-complete problems, basic concepts, non-deterministic algorithms, NP-hard and NPcomplete, decision and optimization problems, graph based problems on NP Principle.

7  1 Hr 12 mins
  Total 73 24 Hr 40 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.