CS8381 Syllabus Data Structures Laboratory
CS8381 Syllabus Data Structures Laboratory Regulation 2017 Anna University free download. Data Structures Laboratory Syllabus CS8381 pdf free download.
OBJECTIVES CS8381 Syllabus Data Structures Laboratory
To implement linear and non-linear data structures
To understand the different operations of search trees
To implement graph traversal algorithms
To get familiarized to sorting and searching algorithms
1. Array implementation of Stack and Queue ADTs
2. Array implementation of List ADT
3. Linked list implementation of List, Stack and Queue ADTs
4. Applications of List, Stack and Queue ADTs
5. Implementation of Binary Trees and operations of Binary Trees
6. Implementation of Binary Search Trees
7. Implementation of AVL Trees
8. Implementation of Heaps using Priority Queues.
9. Graph representation and Traversal algorithms
10. Applications of Graphs
11. Implementation of searching and sorting algorithms
12. Hashing – any two collision techniques
TOTAL: 60 PERIODS
OUTCOMES: CS8381 Syllabus Data Structures Laboratory
At the end of the course, the students will be able to:
Write functions to implement linear and non-linear data structure operations
Suggest appropriate linear / non-linear data structure operations for solving a given problem
Appropriately use the linear / non-linear data structure operations for a given problem
Apply appropriate hash functions that result in a collision free scenario for data storage and retrieval
| Subject name | Data Structures Laboratory |
| Semester | 3 |
| Subject Code | CS8381 |
| Regulation | 2017 regulation |
CS8381 Syllabus Data Structures Laboratory Click here to download
CS8383 Syllabus Object Oriented Programming Laboratory
CS8382 Syllabus Digital Systems Laboratory