Sunday, July 8, 2012

CS9207-ALGORITHMS LABORATORY-B.E -CSE-COMPUTER SCIENCE AND ENGINEERING THIRD -III SEMESTER 2008 REGULATION ANNA UNIVERSITY SYLLABUS


CSE Computer Science And Engineering III -third Semester Syllabus 2008 Regulation Anna University





AIM:
To understand the running time of algorithms.

OBJECTIVES:
·   To understand the need for analyzing algorithms.
·   To understand that algorithms execution speed cannot be expressed as a fixed time quantity.
·   To know the ways of estimating time speed for different algorithms
·   To study about applications of the different algorithms.
·   To know about the various tools available for analyzing algorithms.

IMPLEMENT THE FOLLOWING

1.  Simple recursive programs like Towers of Hanoi ,Generating Permutations.

2.  Sort algorithms.

3.  Randomized quick sort algorithm.

4.  Merge sort using Divide and Conquer approach.

5.  Generation of Huffman code using Greedy Approach.

6.  Floyd's Algorithm -Dynamic Programming.

7.  Simplex Method.

8.  String matching algorithms.

9.  Study of Benchmarking algorithms.

10.  Study of Algorithms Tools.



TOTAL: 45 PERIODS





7/08/2012 12:44:00 AM

0 comments:

Post a Comment

Related Posts Plugin for WordPress, Blogger...