Scribd
Upload
16 views3 pages

DAA Syllabus

The document outlines the syllabus for the Design & Analysis of Algorithms course, effective from the academic year 2021, detailing course objectives, modules, and outcomes. It covers various algorithm design techniques, efficiency analysis, and includes specific topics such as brute force, divide and conquer, dynamic programming, and greedy techniques. The course aims to equip students with the ability to design algorithms, analyze their efficiency, and understand algorithm complexity.

Uploaded by

gasaja6790
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
16 views3 pages

DAA Syllabus

The document outlines the syllabus for the Design & Analysis of Algorithms course, effective from the academic year 2021, detailing course objectives, modules, and outcomes. It covers various algorithm design techniques, efficiency analysis, and includes specific topics such as brute force, divide and conquer, dynamic programming, and greedy techniques. The course aims to equip students with the ability to design algorithms, analyze their efficiency, and understand algorithm complexity.

Uploaded by

gasaja6790
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/ 3

DESIGN & ANALYSIS OF ALGORITHMS

[ Revised Credit System ]


(Effective from the academic year 2021 onwards )
SEMESTER - IV

Subject Code CSE_ 2252 IA Marks 50


Number of Lecture Hours/Week 04 Exam Marks 50
Total Number of Lecture Hours 48 Exam Hours 03
CREDITS - 04

Course objectives: This course will enable students to

 Analyze the different asymptotic notations


 Apply different design techniques to various problems
 Analyze the efficiency of different algorithmic techniques

Module -1 Teaching
Hours
Introduction: 8 Hours
Introduction, Fundamentals of Algorithmic Problem Solving, Important
Problem Types, Fundamental Data Structures
Fundamentals of the Analysis of Algorithm Efficiency:
Analysis Framework, Asymptotic Notations and Basic Efficiency Classes,
Mathematical Analysis of Nonrecursive and Recursive Algorithms.

Text Book1: Chapter 1: Section1.1 – 1.4


Text Book1: Chapter 2: Sections 2.1 – 2.5

Module -2

Brute Force: 10 Hours


Selection Sort and Bubble Sort, Sequential Search and Brute-Force String
Matching, Exhaustive Search Method, Depth First Search, Breadth First
Search.

Decrease and Conquer:


Insertion Sort, Topological Sorting, Binary Search.

Text Book1: Chapter 3: Section 3.1-3.2, 3.4-3.5


Text Book 1: Chapter 4: Section 4.1-4.2,4.4

Module - 3
Divide and Conquer: 10 Hours
Mergesort, Quicksort, Binary tree traversals and related
properties, Multiplication of large integers and
Strassen’s Matrix Multiplication.

Transform and Conquer:


Presorting, Balanced Search Trees, Heaps and Heapsort, Problem
Reduction

Text Book1: Chapter 5: Section 5.1-5.4


Text Book1: Chapter 6: Section 6.1, 6.3, 6.4, 6.6

Module-4

Space and Time Tradeoffs: 10 Hours


Sorting by Counting, Input Enhancement in String Matching, Hashing.

Dynamic Programming:
The Knapsack Problem and Memory Functions, Warshall’s and Floyd’s
Algorithms,
Text Book 1: Chapter 7: Section 7.1, 7.2, 7.3
Text Book 1: Chapter 8: Section 8.2, 8.4

Module-5
Greedy Technique: 10 Hours
Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra’s Algorithm, Huffman
Trees.

Coping With Limitations of Algorithmic Power:


P, NP, and NP-complete Problems.
Backtracking: n – Queen’s problem, Hamiltonian Circuit Problem, Subset-
Sum Problem,
Branch-and-Bound: Assignment Problem, Knapsack Problem, Traveling
Salesperson Problem.
Text Book 1: Chapter 9
Text Book 1: Chapter 11 Section 11.3
Text Book 1: Chapter 12: Section 12.1, 12.2

Course outcomes:

After studying this course, students will be able to:


1. Apply techniques for designing algorithms to solve problems
2. Analyse the various aspects which contribute to algorithm efficiency
3. Describe the complexity of algorithm using asymptotic notations
4. Classify the complexity of algorithm into different efficiency
classes 5.Comprehend different strategies of algorithm design
technique
Text Book:
1. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, (3e), Pearson
Education, India, 2011.

Reference Books:
1. Ellis Horowitz and Sartaj Sahni, “Computer Algorithms/C++”, (2e), University
Press, India, 2007.
2. Thomas H. Cormen, Charles E. Leiserson, Ronal L, Rivest, Clifford Stein, “Introduction
to Algorithms”, (2e), PHI, India, 2006.

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