Amity School of Engineering& Technology: B.TECH. - (CSE) Semester-VII

This document provides an overview of the Analysis and Design of Algorithms course offered at Amity School of Engineering & Technology. The course aims to teach students techniques for evaluating the efficiency of algorithms and designing efficient algorithms for programs. The course covers algorithm design paradigms like divide-and-conquer, greedy methods, dynamic programming, graph searching and traversal, and backtracking. It also covers computational complexity measures like polynomial time vs non-polynomial time and complexity classes like NP-hard and NP-complete problems. The examination scheme includes components like class tests, home assignments, seminars/vivas/quizzes, and an end semester examination. Recommended textbooks are provided.

Uploaded by

Sourav Sharma

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

0% found this document useful (0 votes)

80 views2 pages

Amity School of Engineering& Technology: B.TECH. - (CSE) Semester-VII

Uploaded by

Sourav Sharma

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

AMITY SCHOOL OF ENGINEERING& TECHNOLOGY

B.TECH.-(CSE) Semester-VII
ANALYSIS AND DESIGN OF ALGORITHM
Course Code: Course Objective:
The designing of algorithm is an important component of computer science. The objective of this course is to make students aware of various techniques used to evaluate the efficiency of a particular algorithm. Students eventually should learn to design efficient algorithm for a particular program

BTC 702

Credit Units: 03

Course Contents:
Module I: Introduction Algorithm Design paradigms - motivation, concept of algorithmic efficiency, run time analysis of algorithms, Asymptotic Notations. Recurrences- substitution method, recursion tree method, master method

Module II: Divide and conquer Structure of divide-and-conquer algorithms: examples; Binary search, quick sort, Merge sort , Strassen Multiplication; Analysis of divide and conquer run time recurrence relations. Greedy Method Overview of the greedy paradigm examples of exact optimization solution (minimum cost spanning tree), Approximate solution (Knapsack problem), Single source shortest paths, traveling salesman Module III: Dynamic programming Overview, difference between dynamic programming and divide and conquer, Applications: Shortest path in graph, chain Matrix multiplication, Traveling salesman Problem, longest Common sequence, knapsack problem Module IV: Graph searching and Traversal Overview, Representation of graphs, strongly connected components, Traversal methods (depth first and breadth first search) Back tracking Overview, 8-queen problem, and Knapsack problem Brach and bound LC searching Bounding, FIFO branch and bound, LC branch and bound application: 0/1 Knapsack problem, Traveling Salesman Problem Module V: Computational Complexity Complexity measures, Polynomial Vs non-polynomial time complexity; NP-hard and NP-complete classes, examples.

Examination Scheme:
Components A CT S/V/Q HA EE 5 10 8 7 70 Weightage (%) CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester Examination; Att: Attendance

Text & References:

Text: E. Horowitz, S. Sahni, and S. Rajsekaran, Funadmentals of Computer Algorithms, Galgotia Publication