EE

EEL507: Design and Analysis of Algorithms Syllabus for EE 5th Sem 2018-19 DBATU (Elective-V)

Design and Analysis of Algorithms detailed syllabus scheme for Electrical Engineering (EE), 2018-19 onwards has been taken from the DBATU official website and presented for the Bachelor of Technology students. For Subject Code, Course Title, Lecutres, Tutorials, Practice, Credits, and other information, do visit full semester subjects post given below.

For 5th Sem Scheme of Electrical Engineering (EE), 2018-19 Onwards, do visit EE 5th Sem Scheme, 2018-19 Onwards. For the Elective-V scheme of 5th Sem 2018-19 onwards, refer to EE 5th Sem Elective-V Scheme 2018-19 Onwards. The detail syllabus for design and analysis of algorithms is as follows.

Design and Analysis of Algorithms Syllabus for Electrical Engineering (EE) 3rd Year 5th Sem 2018-19 DBATU

Design and Analysis of Algorithms

Pre-requisite:

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
Get it on Google Play.

Course Outcomes:

  • To know fundamental characteristic of an algorithm
  • To understand strategy of algorithm formation, To develop different algorithm.

Unit 1

Introduction- Fundamental characteristics of an algorithm. Basic algorithm analysis -Asymptotic analysis of complexity bounds – best, average and worst-case behaviour, standard notations for expressing algorithmic complexity. Empirical measurements of performance, time and space trade-offs in algorithms. Using recurrence relations to analyze recursive algorithms – illustrations using recursive algorithms.

Unit 2

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
Get it on Google Play.

Unit 3

Graph and Tree Algorithms: Depth- and Breadth- First traversals. Shortest path algorithms, Transitive closure, Minimum Spanning Tree, Topological sort, Network Flow problems

Unit 4

Tractable and Intractable Problems: Computability.The Halting problem. Computability classes – P, NP, NP-complete and NP-hard. Cook”s theorem. Standard NP-complete problems Reduction techniques.

Unit 5

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
Get it on Google Play.

Unit 6

Reference Book:

:

  1. Algorithm Design – Jon Kleinberg and Eva Tardos
  2. Introduction to Algorithms – T.H. Corman et. al.
  3. Fundamentals of Algorithms – E. Horowitz et al.
  4. Combinatorial Optimization: Algorithms and Complexity – C.H. Papadimitriou et al

For detail syllabus of all subjects of Electrical Engineering (EE) 5th Sem 2018-19 onwards, visit EE 5th Sem Subjects of 2018-19 Onwards.

Leave a Reply

Your email address will not be published. Required fields are marked *

*

This site uses Akismet to reduce spam. Learn how your comment data is processed.