Scribd
Upload
24 views1 page

Cs816: Design and Analysis of Algorithms (Daa) : (Professional Elective-I For M.Tech CSE)

This document provides information about the CS816 Design and Analysis of Algorithms course offered at the university. The course is a 3 credit hour professional elective course evaluated through 30% internal assessment and 70% end exam. The course objectives are to analyze and design algorithms and appreciate their impact. The course outcomes are for students to prove correctness and analyze algorithms for classic problems. Topics covered include divide and conquer, greedy methods, traversal techniques, dynamic programming, backtracking, and branch and bound.

Uploaded by

Rajesh Kanna
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
24 views1 page

Cs816: Design and Analysis of Algorithms (Daa) : (Professional Elective-I For M.Tech CSE)

This document provides information about the CS816 Design and Analysis of Algorithms course offered at the university. The course is a 3 credit hour professional elective course evaluated through 30% internal assessment and 70% end exam. The course objectives are to analyze and design algorithms and appreciate their impact. The course outcomes are for students to prove correctness and analyze algorithms for classic problems. Topics covered include divide and conquer, greedy methods, traversal techniques, dynamic programming, backtracking, and branch and bound.

Uploaded by

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

CS816: DESIGN AND ANALYSIS OF ALGORITHMS (DAA)

(Professional Elective-I for M.Tech CSE)

Scheme : 2013 L T/D P C


Internal Assessment : 30
End Exam : 70 3 - - 3
End Exam Duration : 3 Hrs

Course Objectives:
To study paradigms and approaches used to analyze and design algorithms and to appreciate the impact of algorithm
design in practice.
To understand how a number of algorithms for fundamental problems in computer science and engineering work and
compare with one another, and to make the students design efficient algorithms
Course Outcomes:
Students will be able to prove the correctness and analyze the running time of the algorithms for the classic problems in
various domains.
Students can apply these algorithms and design techniques to solve problems.

Introduction: What is an Algorithm? Analysis, Asymptotic notation.


Divide and Conquer :- General method, Binary search, Finding Maximum and Minimum, Merge sort, Quick sort, Strassens
Matrix Multiplication.

Greedy Method : The General Method, Knapsack Problem,Job Sequencing with Deadlines, Minimum-Cost Spanning Tree,
Optimal Storage on Tapes, Optimal Merge Patterns, Single Source Shortest Path.
Basic Traversal and Search Techniques :- Techniques for Binary Trees, Techniques for Graphs, Biconnected Components and
DFS.

Dynamic Programming : The General Method, Multistage Graphs, All Pairs Shortest Paths, Optimal Binary Search Trees, 0/1-
Knapsack, Reliability Design, The Travelling Salesperson Problem .

Backtracking : The General Method, The 8-Queens Problem, Sum of Subsets, Graph Coloring, Hamiltonian cycles.

Branch and Bound : The Method, Travelling Salesperson, 15 Puzzle problem


Lower Bound Theory : Comparison Trees, Oracles and Adversary arguments, Techniques for Algebraic problems.

Text Books:
1. Ellis Horowitz, Sartaz Sahni & Sanguthevar Rajasekaran, Fundamentals of Computer Algorithms, Galgotia Publications.

Reference Books:
1. Jon Kleinberg, Eva Tardos, Algorithm Design, Pearson Education.

NOTE: The question paper shall consist of Eight questions out of which the student shall answer any Five questions.

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