CP5161 DATA STRUCTURES LABORATORY SYLLABUS - ANNA UNIVERSITY PG REGULATION 2017 - Anna University Internal marks 2018

CP5161 DATA STRUCTURES LABORATORY SYLLABUS - ANNA UNIVERSITY PG REGULATION 2017

OBJECTIVES:
  • To acquire the knowledge of using advanced tree structures.
  • To learn the usage of heap structures.
  • To understand the usage of graph structures and spanning trees.

LIST OF EXPERIMENTS:
Each student has to work individually on assigned lab exercises. Lab sessions could be scheduled as one contiguous four-hour session per week or two two-hour sessions per week. There will be about 15 exercises in a semester. It is recommended that all implementations are carried out in Java. If C or C++ has to be used, then the threads library will be required for
concurrency. Exercises should be designed to cover the following topics:

EXPERIMENTS:
  1. Implementation of Merge Sort and Quick Sort-Analysis
  2. Implementation of a Binary Search Tree
  3. Red-Black Tree Implementation
  4. Heap Implementation
  5. Fibonacci Heap Implementation
  6. Graph Traversals
  7. Spanning Tree Implementation
  8. Shortest Path Algorithms (Dijkstra's algorithm, Bellmann Ford Algorithm)
  9. Implementation of Matrix Chain Multiplication
  10. Activity Selection and Huffman Coding Implementation.

TOTAL: 60 PERIODS

OUTCOMES:
Upon Completion of this course, the students will be able to:
  • Design and implement basic and advanced data structures extensively.
  • Design algorithms using graph structures
  • Design and develop efficient algorithms with minimum complexity using design techniques.

No comments:

Post a Comment