Scribd
Upload
2 views2 pages

Design & Analysis of Algorithms Content Pool Team

The document outlines the syllabus for a course on Design and Analysis of Algorithms, covering six units with a total of 45 contact hours. Each unit focuses on different algorithm design paradigms, including introduction to algorithms, divide and conquer, greedy methods, dynamic programming, backtracking, and flow networks. The course involves various algorithm analysis techniques and problem-solving strategies, taught by different faculty members.

Uploaded by

shresthgupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views2 pages

Design & Analysis of Algorithms Content Pool Team

The document outlines the syllabus for a course on Design and Analysis of Algorithms, covering six units with a total of 45 contact hours. Each unit focuses on different algorithm design paradigms, including introduction to algorithms, divide and conquer, greedy methods, dynamic programming, backtracking, and flow networks. The course involves various algorithm analysis techniques and problem-solving strategies, taught by different faculty members.

Uploaded by

shresthgupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Content pool creation for Design and Analysis of Algorithms

Course Code Course name L T P C


Design and Analysis of Algorithms 3 0 0 3
Total Units to be Covered: 6 Total Contact Hours: 45
Prerequisite(s): Data structures and algorithms Syllabus version: 1.0

Content Pool creation


Sr No Unit No. Topics Name of Faculty
1 Unit I: Introduction to Dr. Rahul Kumar Singh
Algorithms Algorithm, Characteristics of algorithm, Distinct area Dr. Shahina Anwarul
(9 Lecture Hour) of study of algorithm, Different algorithm design
techniques, Algorithm analysis, Growth of an
algorithm, Asymptotic notations, Recurrence relation,
Solving recurrence relation by iteration, substitution,
recursion tree, master theorem method.

2 Unit II: Algorithm design The divide and conquer paradigm, Analysis of Dr. Vidyanand Mishra
paradigm: Divide and Binary search, Merge sort, Quick sort, Strassen Dr. Archana Kumari
Conquer Method of Matrix Multiplication, Maximum
(7 Lecture Hours)
subarray problem, Powering number, Celebrity
problem.

3 Unit III: Algorithm design Greedy approach design paradigm, Knapsack Dr. Shresth Gupta
paradigm: Greedy Method problem, Activity selection problem, Huffman Mr. Amrendra Tripathi
(7 Lecture Hours) encoding, Interval partitioning problem, Dijkstra
algorithm for single source shortest path problem,
Prim’s and Kruskal algorithm for finding minimum
cost spanning tree.

4 Unit IV: Algorithm design Dynamic programming design paradigm, 0/1 Dr. Amar Jindal
paradigm: Dynamic Knapsack problem, Matrix chain multiplication Dr. Nayantara Kotoky
Programming problem, longest common subsequence problem, Mr. Gaurav Bhardwaj
(7 Lecture Hours) Optimal binary search problem, Bellman ford
algorithm for single source shortest path problem,
Travelling salesman problem, Difference between
divide and conquer, greedy and dynamic
programming algorithm design approach, Floyd
warshall algorithm for all pair shortest path problem

5 Unit V: Algorithm design Introduction to backtracking and branch & bound Dr. Rohit Tanwar
paradigm: Backtracking approach, backtracking based problems: N Queen Dr. Virender Kadyan
and Branch & Bound\ problem, Sum of Subset problem, 0/1 Knapsack Dr. Hanumat Sastry G
(7 Lecture Hours) problem, Branch & Bound based problems: FIFO,
LIFO, & LC branch & bound, 0/1 Knapsack problem,
Travelling salesperson problem.
6 Unit VI: Maximum Flow and Flow networks: Ford- Fulkerson method, Maximum Dr. Pawan Singh Koranga
String-Matching Problems bipartite matching, Modulo Representation of Dr. Mohammad Ahsan
integers/polynomials: Chinese Remainder Theorem,
(8 Lecture Hours)
String Matching: The naive string-matching
algorithm, The Rabin-Karp algorithm, String
matching with finite automata, The Knuth-Morris-
Pratt algorithm, Different classes of problems: P,
NP, NP Complete, NP Hard, reducibility property

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy