CS8381-DATA STRUCTURES LABORATORY Syllabus 2017 Regulation

2
4989

CS8381-DATA STRUCTURES LABORATORY Syllabus 2017 Regulation

CS8381-DATA STRUCTURES LABORATORY Syllabus 2017 Regulation

CS8381 DATA STRUCTURES LABORATORY                                                        L T P C
                                                                                                                            0 0 4 2

OBJECTIVES

  • 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:

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

2 COMMENTS

LEAVE A REPLY

Please enter your comment!
Please enter your name here