Scribd
Upload
11 views2 pages

422cit02 Daa

The document outlines the Regulations 2022 for the Department of Information Technology's BE/B.Tech program, specifically focusing on the course 'Design and Analysis of Algorithms'. It details the course objectives, units covering various algorithmic techniques, course outcomes, and recommended textbooks and references. The course aims to equip students with the ability to analyze and implement different algorithms, understand their limitations, and apply optimization techniques.

Uploaded by

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

422cit02 Daa

The document outlines the Regulations 2022 for the Department of Information Technology's BE/B.Tech program, specifically focusing on the course 'Design and Analysis of Algorithms'. It details the course objectives, units covering various algorithmic techniques, course outcomes, and recommended textbooks and references. The course aims to equip students with the ability to analyze and implement different algorithms, understand their limitations, and apply optimization techniques.

Uploaded by

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

BE /B.

Tech
Regulations 2022

Regulations 2022
Department of Information Technology

Course Hours / Weeks Credits Maximum Marks


Course Title
Code L T P C CA EA Total
DESIGN AND ANALYSIS OF
422CIT02 3 0 0 3 40 60 100
ALGORITHMS
OBJECTIVE(S):
● To critically analyze the efficiency of alternative algorithmic solutions for the same problem
● To illustrate brute force and divide and conquer design techniques.
● To explain dynamic programming and greedy techniques for solving various problems.
● To apply iterative improvement technique to solve optimization problems
● To examine the limitations of algorithmic power and handling it in different problems.

Prerequisite: Nil

UNIT - I INTRODUCTION 9
Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving – Important Problem Types–
Fundamentals of the Analysis of Algorithm Efficiency – Analysis Framework - Asymptotic Notations and their
properties –Mathematical analysis of Recursive and Non- recursive algorithms

UNIT-II BRUTE FORCE AND DIVIDE AND CONQUER 9

Brute Force – String Matching - Exhaustive Search - Traveling Salesman Problem - Knapsack
Problem - Assignment problem. Divide and Conquer Methodology – Multiplication of Large Integers
and Strassen’s Matrix Multiplication – Closest-Pair and Convex - Hull Problems. - Topological
Sorting –– Heaps and Heap Sort.

UNIT III DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE 9


Dynamic programming – Principle of optimality - Coin changing problem – Warshall’s and Floyd ‘s
algorithms – Optimal Binary Search Trees - Multi stage graph - Knapsack Problem and Memory
functions. Greedy Technique – Dijkstra’s algorithm - Huffman Trees and codes - 0/1 Knapsack
problem.

UNIT IV ITERATIVE IMPROVEMENT 9

The Simplex Method-Ford Fulkerson algorithm for Maximum-Flow Problem – Maximum


Matching in Bipartite Graphs- The Stable marriage Problem-Analysis of Gale Shaply algorithms-
Graph coloring problem-Job Scheduling Problem.

UNIT V LIMITATIONS OF ALGORITHM POWER 9


Backtracking – N- Queen problem - Hamiltonian Circuit Problem – Subset Sum Problem. Branch and
Bound – LIFO Search and FIFO search - Assignment problem – Knapsack Problem – Traveling
Salesman Problem – Limitation of Algorithm Power-P, NP, NP Complete Problems-Approximation
Algorithms for NP-Hard Problems.
BE /B.Tech
Regulations 2022

Total Hours: 45

COURSE OUTCOMES:
Upon completion of the course, students will be able to
CO1: Analyze the efficiency of recursive and non-recursive algorithms mathematically

CO2: Analyze the efficiency of brute force, divide and conquer algorithmic techniques

CO3: Implement and analyze the problems using dynamic programming and greedy algorithmic
techniques.

CO4: Solve the problems using iterative improvement techniques for optimization.

CO5: Compute the limitations of algorithmic power and solve the problems using backtracking and branch and
bound techniques
TOTAL: 45
CO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PS
1 2 3 4 5 6 7 8 9 10 11 12 1 2 O3

CO1 3 3 3 1 1 - - - 1 1 2 2 3 2 1

CO2 2 2 1 3 2 - - - 2 2 1 2 2 2 2

CO3 3 2 1 2 2 - - - 2 1 1 2 1 3 3

CO4 3 2 3 2 3 - - - 3 3 3 2 2 1 2

CO5 3 1 2 3 3 - - - 2 2 2 2 3 1 3

AVG 3 2 2 2 2 - - - 2 2 2 2 2 2 2

TEXT BOOKS:
1.Anany Levitin, Introduction to the Design and Analysis of Algorithms, Third Edition, Pearson Education,
Published by Pearson (July 14, 2021) © 2012

REFERENCE BOOKS:
1. Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms,
Third Edition, PHI Learning Private Limited, 2022.
2. S. Sridhar, Design and Analysis of Algorithms, Oxford university press, 2022.
3. Ellis Horowitz, SartajSahni and SanguthevarRajasekaran, Computer Algorithms/ C++, Second Edition,
Universities Press, 2019.
4. Alfred V. Aho, John E. Hop croft and Jeffrey D. Ullman, Data Structures and Algorithms, Pearson Education,
Reprint 2006.

You might also like