Scribd
Upload
138 views2 pages

08MTCS042

This document outlines the course objectives and units of study for an algorithms design and analysis course. The 5 units cover basic algorithm concepts, mathematical analysis techniques, sorting and searching algorithms, algorithmic techniques like dynamic programming and graph algorithms, and algorithm design methods like backtracking, branch and bound, and approximation algorithms. Key algorithms discussed include merge sort, quicksort, binary search trees, heapsort, Dijkstra's algorithm, and the knapsack problem. The course aims to develop students' analytical skills for designing algorithms to solve real-world problems.

Uploaded by

Diponegoro Muhammad Khan
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
138 views2 pages

08MTCS042

This document outlines the course objectives and units of study for an algorithms design and analysis course. The 5 units cover basic algorithm concepts, mathematical analysis techniques, sorting and searching algorithms, algorithmic techniques like dynamic programming and graph algorithms, and algorithm design methods like backtracking, branch and bound, and approximation algorithms. Key algorithms discussed include merge sort, quicksort, binary search trees, heapsort, Dijkstra's algorithm, and the knapsack problem. The course aims to develop students' analytical skills for designing algorithms to solve real-world problems.

Uploaded by

Diponegoro Muhammad Khan
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

08MTCS042 4.

2 DESIGN AND ANALYSIS OF ALGORITHMS 4004 Objective: To create analytical skills, to enable the students to design algorithms for various real time problems UNIT I BASIC CONCEPTS OF ALGORITHMS 10 Introduction Notion of Algorithm Fundamentals of Algorithmic Solving Important Problem types Fundamentals of the Analysis Framework Asymptotic Notations and Basic Efficiency Classes. UNIT II MATHEMATICAL ASPECTS & ANALYSIS OF ALGORITHMS 12 Mathematical Analysis of Non-recursive Algorithm Mathematical Analysis of Recursive Algorithm Example: Fibonacci Numbers Empirical Analysis of Algorithms Algorithm Visualization. UNIT III ANALYSIS OF SORTING & SEARCHING ALGORITHMS 15 Brute Force Selection Sort and Bubble Sort Sequential Search and Brute-force string matching Divide and conquer Merge sort Quick Sort Binary Search Binary treeTraversal and Related Properties Decrease and Conquer Insertion Sort Depth first Search and Breadth First Search. UNIT IV ALGORITHMIC TECHNIQUES 15 Transform and conquer Presorting Balanced Search trees AVL Trees Heaps and Heap sort Dynamic Programming Warshalls and Floyds Algorithm Optimal Binary Search trees Greedy Techniques Prims Algorithm Kruskals Algorithm Dijkstras Algorithm Huffman trees. UNIT V ALGORITHM DESIGN METHODS 12 Backtracking n-Queens Problem Hamiltonian Circuit problem Subset-Sum problem Branch and bound Assignment problem Knapsack problem Traveling salesman problem. Text Books: 1. Introduction to Algorithms, T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, PHI Pvt. Ltd., 2001 2. Introduction to the Design and Analysis of Algorithm, Anany Levitin, Pearson Education Asia, 2003. Reference Boooks: 1. Computer Algorithms Introduction to Design and Analysis, Sara Baase and Allen Van Gelder, Pearson Education Asia, 2003. 2. The Design and Analysis of Computer Algorithms, A.V.Aho, J.E. Hopcroft and J.D.Ullman, Pearson Education Asia, 2003. 3. Design analysis and algorithms, Hari Mohan Pandey, University Science Press, 2008.

You might also like