Scribd
Upload
7 views2 pages

DAA

The document outlines the course structure for 'Design and Analysis of Algorithm' for B. Tech. (Computer Engineering) Semester V, including objectives, outcomes, and a detailed syllabus covering various algorithmic strategies. It emphasizes problem-solving abilities, performance analysis, and the development of efficient algorithms. The evaluation scheme consists of internal and external assessments totaling 100 marks.

Uploaded by

SYCOC143 Shivraj Lawhare
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
7 views2 pages

DAA

The document outlines the course structure for 'Design and Analysis of Algorithm' for B. Tech. (Computer Engineering) Semester V, including objectives, outcomes, and a detailed syllabus covering various algorithmic strategies. It emphasizes problem-solving abilities, performance analysis, and the development of efficient algorithms. The evaluation scheme consists of internal and external assessments totaling 100 marks.

Uploaded by

SYCOC143 Shivraj Lawhare
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

Program: B. Tech.

(Computer Engineering) Semester: V

Course: Design and Analysis of Algorithm Code: BCE5411

Teaching Scheme Evaluation Scheme

Lecture Tutorial Credit Hours IE MTE ETE Total


03 - 03 03 20 30 50 100
Prior knowledge of
Data Structure and Algorithms, Advance Data Structure
is essential.

Course Objectives:

1. To develop problem solving abilities using mathematical theories


2. To analyze the performance of algorithms
3. To apply algorithmic strategies while solving problems
4. To develop time and space efficient algorithms
5. To study algorithmic examples in concurrent and parallel environments
Course Outcomes:

After learning the course, the students will be able to:


1. Compare the performance of various algorithms using time and space complexity.
2. Illustrate the performance of algorithms using amortized analysis.
3. Apply different problem-solving strategies to solve computational problems.
4. Determine the optimal solutions for various problems.
5. Design solution for a complex optimization problem using suitable mathematical techniques.
6. Classify the various problems through the analysis of programming constructs.

Detailed Syllabus
Duration
Unit Description
(H)
Problem solving and Algorithmic Analysis

I Asymptotic notations, lower bound and upper bound: Best case, worst case, 08
average case analysis, classification of time complexities (linear, logarithmic etc),
Recurrences: Formulation and solving recurrence equations using Master
Theorem, Proving correctness of algorithms.
Divide and Conquer Strategy

Problem subdivision – Divide and Conquer: Binary search, Quick sort, Merge sort,
II Integer Arithmetic, Maximum sub-array, Master’s theorem and its uses. 08
Greedy Strategy
Greedy strategy: Principle, control abstraction, time analysis of control abstraction,
knapsack problem, Job scheduling algorithm, Single Source Shortest Path
Dijkstra’s.
Dynamic Programming Strategy
III 08
Dynamic Programming: Principle, control abstraction, time analysis of control
abstraction, binomial coefficients, multistage graphs, 0/1 knapsack, All Pair
Shortest Path - Floyd- Warshall, OBST,Bellman-Ford, sum of subset.

TY BTech (Computer Engineering), PCCoE Pune Page 14


Backtracking Strategy
IV 08
Principle, control abstraction, time analysis of control abstraction, 8-queen
problem, graph coloring problem, sum of subsets problem and Hamiltonian cycle.
Branch and Bound Strategy
V 07
Principle, control abstraction, time analysis of control abstraction, strategies –
FIFO, LIFO and LC approaches, knapsack problem, Branch and Bound using TSP
Complexity Theory

VI Polynomial and non-polynomial problems, deterministic and non-deterministic 06


algorithms, P-class problems, NP-class of problems, Polynomial problem
reduction NP complete problems- vertex cover, Maximum Clique and 3-SAT.
Total 45
Text Books:

1. Thomas H Cormen and Charles E.L Leiserson, “Introduction to Algorithms”, The MIT Press; 4th
edition, April 5, 2022, ISBN-13: 978-0262046305
2. Jon Kleinberg, Eva Tardos, “Algorithm Design”, Pearson, 2nd edition, 2013, ISBN-13:
978-1292023946.
3. Horowitz, Sahani, “Fund amentals of computer Algorithms”, Galgotia. 2Nd Edition,
1998.ISBN 81-7515-257- 5

Reference Books:
1. Michael T. Goodrich, Roberto Tamassia, “Algorithm Design: Foundations, Analysis and Internet
Examples”, Wiley, ISBN 978-81-265-0986-7
2. Gilles Brassard, Paul Bratley, “Fundamentals of Algorithmics”, PHI, ISBN 978-81-203-1131-2

TY BTech (Computer Engineering), PCCoE Pune Page 15

You might also like