Data Structures Laboratory detail syllabus for Computer Science & Engineering (Cse), 2017 regulation is taken from Anna University official website and presented for students of Anna University. The details of the course are: course code (CS8381), Category (PC), Contact Periods/week (4), Teaching hours/week (0), Practical Hours/week (0). The total course credits are 4.
For all other cse 3rd sem syllabus for be 2017 regulation anna univ you can visit Cse 3rd Sem syllabus for BE 2017 regulation Anna Univ Subjects. The detail syllabus for data structures laboratory is as follows.”
Course Objective:
- 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
List of Experiments:
- Array implementation of Stack and Queue ADTs
- Array implementation of List ADT
- Linked list implementation of List, Stack and Queue ADTs
- Applications of List, Stack and Queue ADTs
- Implementation of Binary Trees and operations of Binary Trees
- Implementation of Binary Search Trees
- Implementation of AVL Trees
- Implementation of Heaps using Priority Queues.
- Graph representation and Traversal algorithms
- Applications of Graphs
- Implementation of searching and sorting algorithms
- Hashing – any two collision techniques
Course Outcome:
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
For detail syllabus of all other subjects of BE Cse, 2017 regulation do visit Cse 3rd Sem syllabus for 2017 Regulation.
Dont forget to download iStudy for latest syllabus and results, class timetable and more.