Scribd
Upload
173 views1 page

Data Structures Lab: Algorithms & Implementation

The CS3311 Data Structures Laboratory course focuses on implementing various linear data structure algorithms, including stacks, linked lists, binary search trees, and graph algorithms such as Dijkstra's and Prim's. The course includes practical exercises such as array implementations, polynomial manipulation, and various sorting and searching techniques. By the end of the course, students will be proficient in implementing and analyzing these data structures and algorithms.

Uploaded by

prakashchellam21
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
173 views1 page

Data Structures Lab: Algorithms & Implementation

The CS3311 Data Structures Laboratory course focuses on implementing various linear data structure algorithms, including stacks, linked lists, binary search trees, and graph algorithms such as Dijkstra's and Prim's. The course includes practical exercises such as array implementations, polynomial manipulation, and various sorting and searching techniques. By the end of the course, students will be proficient in implementing and analyzing these data structures and algorithms.

Uploaded by

prakashchellam21
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

CS3311 -DATA STRUCTURES LABORATORY L T P C

0 0 3 1.5

COURSE OBJECTIVES:

 To demonstrate array implementation of linear data structure algorithms.


 To implement the applications using Stack.
 To implement the applications using Linked list
 To implement Binary search tree and AVL tree algorithms.
 To implement the Heap algorithm.
 To implement Dijkstra’s algorithm.
 To implement Prim’s algorithm
 To implement Sorting, Searching and Hashing algorithms.
LIST OF EXERCISES:
1. Array implementation of Stack, Queue and Circular Queue ADTs
2. Implementation of Singly Linked List
3. Linked list implementation of Stack and Linear Queue ADTs
4. Implementation of Polynomial Manipulation using Linked list
5. Implementation of Evaluating Postfix Expressions, Infix to Postfix conversion
6. Implementation of Binary Search Trees
7. Implementation of AVL Trees
8. Implementation of Heaps using Priority Queues
9. Implementation of Dijkstra’s Algorithm
10. Implementation of Prim’s Algorithm
11. Implementation of Linear Search and Binary Search
12. Implementation of Insertion Sort and Selection Sort
13. Implementation of Merge Sort
14. Implementation of Open Addressing (Linear Probing and Quadratic Probing)
TOTAL:45 PERIODS
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Implement Linear data structure algorithms.
CO2: Implement applications using Stacks and Linked lists
CO3: Implement Binary Search tree and AVL tree operations.
CO4: Implement graph algorithms.
CO5: Analyze the various searching and sorting algorithms.

You might also like