- 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:
- Implementation of Merge Sort and Quick Sort-Analysis
- Implementation of a Binary Search Tree
- Red-Black Tree Implementation
- Heap Implementation
- Fibonacci Heap Implementation
- Graph Traversals
- Spanning Tree Implementation
- Shortest Path Algorithms (Dijkstra's algorithm, Bellmann Ford Algorithm)
- Implementation of Matrix Chain Multiplication
- 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.
In addition to these topics, if you need assistance with any academic tasks, such as research papers or essays, you can also order essay services from reputable sources to help you succeed in your coursework.
ReplyDeleteThe list of experiments appears comprehensive and covers a wide range of topics in data structures and algorithms. It provides students with hands-on experience in implementing and analyzing these fundamental concepts. The desired outcomes suggest that the course aims to equip students with a strong foundation in data structures and algorithm design, which is essential for computer science and programming.