Scribd
Upload
55 views2 pages

Original 1676265125 DAA Syllabus

This document outlines a course on the design and analysis of algorithms. The course aims to teach algorithm complexity analysis, the design of searching, sorting, and indexing algorithms, and the design of new algorithms. The course outcomes are for students to be able to analyze algorithm complexity, use appropriate algorithms, design new algorithms, and learn about NP-complete problems. The course is divided into five units covering topics like algorithm analysis, advanced data structures, greedy algorithms, dynamic programming, and NP-hard and NP-complete problems. Student performance is evaluated through assignments, quizzes, seminars, and a written examination.

Uploaded by

Vignesh Devamulla
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
55 views2 pages

Original 1676265125 DAA Syllabus

This document outlines a course on the design and analysis of algorithms. The course aims to teach algorithm complexity analysis, the design of searching, sorting, and indexing algorithms, and the design of new algorithms. The course outcomes are for students to be able to analyze algorithm complexity, use appropriate algorithms, design new algorithms, and learn about NP-complete problems. The course is divided into five units covering topics like algorithm analysis, advanced data structures, greedy algorithms, dynamic programming, and NP-hard and NP-complete problems. Student performance is evaluated through assignments, quizzes, seminars, and a written examination.

Uploaded by

Vignesh Devamulla
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

CSE412 Design & Analysis of Algorithms L T P C

Version 1.0 3 0 1 4
Pre-requisites/Exposure
Co-requisites

OBJECTIVE:
This course aims to provide the knowledge and understanding the complexity issues of
algorithms:
1. To introduce algorithms analysis and design techniques
2. To understand and design of algorithms used for searching, sorting, indexing operation

Course outcomes:

On completion of this course, the students will be able to:

CO1. Analysing complexity issues of algorithms


CO2. Ability in using the appropriate algorithm for searching, sorting, indexing operations
CO3. Designing of new algorithms
CO4. Student will be able to learn NP Class problems.

Unit-I 6 Lecture hours


Introduction: Algorithms, Performance Analysis: Space and Time Complexity, Asymptotic
Notations- Big Oh, Omega, theta notations, finding complexity of the algorithm, Linear Sorting:
Insertion sort, Bubble sort, selection sort.

Unit –II. 8 Lecture hours


Advanced Data structures: B-Tree, Binomial Heaps, Fibonacci Heaps, Red & Black Tree.
Divide and Conquer: General method, binary search, quick sort, merge sort, heap sort.

Unit –III 8 Lecture hours


Greedy Method: General method, Activity Selection, job scheduling with deadlines, fractional
knapsack problem, Minimum cost spanning tree: Kruskal’s and Prim’s, single source shortest
path, Huffman tree.

Unit – IV 8 Lecture hours


Dynamic Programming: General Method, 0-1 Knapsack, Matrix chain multiplication, longest
subsequence, all pair shortest paths.
Backtracking- Travelling Salesman Problem, Graph Coloring, n-Queen Problem, Hamiltonian
Cycles and Sum of subsets.

Unit –V. 6 Lecture hours

B. Tech Computer Science & Engineering Page 77


Branch and Bound: Travelling Salesman Problem, Graph Coloring, n-Queen Problem,
Hamiltonian Cycles and Sum of subsets.
NP-Hard and NP-Complete problems: Basic Concepts, non-deterministic algorithms, NP-Hard
and NP-Complete classes, Cooks Theorem.
Text Books:
1. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, “Introduction to Algorithms”, PHI Pvt.
Ltd., 2012.
2. Anany Levitin, “Introduction to the Design and Analysis of Algorithm”, Pearson Education
Asia, 2003.
3. M.T.Goodrich and R.Tomassia, Algorithm Design: Foundations, Analysis and Internet
examples, Johnwiley and sons.

Reference Books:
1. R.C.T.Lee, S.S.Tseng, R.C.Chang and T.Tsai, Introduction to Design and Analysis of Algorithms
A strategic approach, McGraw-Hill Education (Asia) ,2005
2. Aho, Ullman and Hopcroft ,Design and Analysis of algorithms, Pearson Education India; 1st
edition 2002
3. Ellis Horowitz, Satraj Sahni and Rajasekharam, Fundamentals of Computer Algorithms,
Galgotia publications pvt. Ltd.

Modes of Evaluation: Assignment/ Quiz / Seminar / Written Examination Examination Scheme:

Components Internal End Semester Examination Total


Weightage (%) 60% 40% 100%

B. Tech Computer Science & Engineering Page 78

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