Scribd
Upload
61 views1 page

Scsa1403 PDF

This document outlines a course on the design and analysis of algorithms. The course objectives are to analyze algorithm performance under different scenarios, learn mathematical foundations for analyzing algorithms, and understand various algorithm design techniques. The course covers topics like asymptotic analysis, sorting algorithms, algorithms using brute force and divide-and-conquer approaches, greedy algorithms, dynamic programming, backtracking, and branch and bound methods. On completing the course, students will be able to determine suitable algorithm designs, analyze efficiency, and understand fundamental concepts in algorithm problem solving. The course will be evaluated through exams testing students on short questions and longer questions from each unit.

Uploaded by

EJS KIRAN GAMING
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
61 views1 page

Scsa1403 PDF

This document outlines a course on the design and analysis of algorithms. The course objectives are to analyze algorithm performance under different scenarios, learn mathematical foundations for analyzing algorithms, and understand various algorithm design techniques. The course covers topics like asymptotic analysis, sorting algorithms, algorithms using brute force and divide-and-conquer approaches, greedy algorithms, dynamic programming, backtracking, and branch and bound methods. On completing the course, students will be able to determine suitable algorithm designs, analyze efficiency, and understand fundamental concepts in algorithm problem solving. The course will be evaluated through exams testing students on short questions and longer questions from each unit.

Uploaded by

EJS KIRAN GAMING
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/ 1

SATHYABAMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P Credits Total Marks


SCSA1403 DESIGN AND ANALYSIS OF ALGORITHMS
3 * 0 3 100

COURSE OBJECTIVES
➢ To analyze the performance of algorithms under various scenarios.
➢ To learn mathematical background for algorithm analysis & solving the recurrence equations.
➢ To learn various algorithm design techniques.
➢ To understand and apply the algorithms.

UNIT 1 INTRODUCTION 9 Hrs.


Fundamentals of Algorithmic Problem Solving - Time Complexity - Space complexity with examples - Growth of Functions -
Asymptotic Notations: Need, Types - Big Oh, Little Oh, Omega, Theta - Properties - Complexity Analysis Examples -
Performance measurement - Instance Size, Test Data, Experimental setup.

UNIT 2 MATHEMATICAL FOUNDATIONS 9 Hrs.


Solving Recurrence Equations - Substitution Method - Recursion Tree Method - Master Method - Best Case - Worst Case -
Average Case Analysis - Sorting in Linear Time - Lower bounds for Sorting: - Counting Sort - Radix Sort - Bucket Sort.

UNIT 3 BRUTE FORCE AND DIVIDE-AND-CONQUER 9 Hrs.


Brute Force:- Travelling Salesman Problem - Knapsack Problem - Assignment Problem - Closest Pair and Convex Hull
Problems - Divide and Conquer Approach:- Binary Search - Quick Sort - Merge Sort - Strassen’s Matrix Multiplication.

UNIT 4 GREEDY APPROACH AND DYNAMIC PROGRAMMING 9 Hrs.


Greedy Approach:- Optimal Merge Patterns- Huffman Code - Job Sequencing problem- -- Tree Vertex Splitting Dynamic
Programming:– Dice Throw-- Optimal Binary Search Algorithms.

UNIT 5 BACKTRACKING AND BRANCH AND BOUND 9 Hrs.


Backtracking:- 8 Queens - Hamiltonian Circuit Problem - Branch and Bound - Assignment Problem - Knapsack Problem:-
Travelling Salesman Problem - NP Complete Problems - Clique Problem - Vertex Cover Problem .
Max. 45 Hrs.
COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Determine the suitable algorithmic design technique for a given problem.
CO2 - Identify the limitations of algorithms in problem solving.
CO3 - Analyze the efficiency of the algorithm based on time and space complexity.
CO4 - Implement asymptotic notations to analyze worst-case and average case running times of algorithms.
CO5 - Interpret the fundamental needs of algorithms in problem solving.
CO6 - Describe the various algorithmic techniques and its real time applications.

TEXT/REFERENCE BOOKS
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to Algorithms”, 3rd Edition,
PHI Learning Private Limited, 2012.
2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and Algorithms David E. Goldberg, “Genetic
Algorithm In Search Optimization And Machine Learning” Pearson Education India, 2013.
3. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, 3rd Edition, Pearson Education, 2012.
4. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Fundamentals of Computer Algorithms, 2nd Edition,
Universities Press, 2007.

END SEMESTER EXAMINATION QUESTION PAPER PATTERN

Max. Marks : 100 Exam Duration : 3 Hrs.


PART A : 10 Questions of 2 marks each-No choice 20 Marks
PART B : 2 Questions from each unit with internal choice, each carrying 16 marks 80 Marks

B.E. / B.Tech. - Regular 36 REGULATIONS 2019

You might also like