CS3363 Data Structures and OOPS Laboratory
Anna University – CS3363 Data Structures and OOPS Laboratory Regulation 2021 Syllabus, Notes, Lab Manual Important Questions, Question Paper with Answers, Previous Year Question Paper.
COURSE OBJECTIVES: CS3363 Data Structures and OOPS 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
LIST OF EXPERIMENTS CS3363 Data Structures and OOPS Laboratory
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
| Syllabus | Click Here |
| Lab Manual | Click Here |
| Important Questions | Click Here |
| Previous Year Question Paper | Click Here |
| Question Bank | Click Here |
COURSE OUTCOMES: CS3363 Data Structures and OOPS Laboratory
At the end of the course, the students will be able to:
CO1 Write functions to implement linear and non-linear data structure operations
CO2 Suggest appropriate linear / non-linear data structure operations for solving a given problem
CO3 Appropriately use the linear / non-linear data structure operations for a given problem
CO4 Apply appropriate hash functions that result in a collision free scenario for data storage and
Retrieval
CO5 Ability to apply Sorting and searching Algorithms for give application
Related Links
Anna University Syllabus Regulation 2021
Anna University Regulation 2021 Study Materials