Page 63 - Microsoft Word - B.Tech. Course Structure (R20) WITH 163 CREDITS
P. 63

JNTUA College of Engineering (Autonomous),Ananthapuramu
                                 Department of Computer Science & Engineering
                                                DATA STRUCTURES LAB
               Course Code:                             Semester III(R20)                   L T P C : 0 0 3 1.5
            Course Objectives:
               •  The course is designed to develop skills to design and analyze simple linear and non linear data
                   structures.
               •  It strengthen the ability to the students to identify and apply the suitable data structure for the given
                   real world problem.
               •  It enables them to gain knowledge in practical applications of data structures.

            Course Outcomes:
                CO1: Able to design and analyze the time and space efficiency of the data structure.
                CO2: Be capable to identity the appropriate data structure for given problem.
                CO3: Have practical knowledge on the applications of data structures.


           List of Experiments:
              1. Implement Linear and Binary search techniques with recursive and non-recursive functions.
              2. Implement Insertion and Merge sort techniques.
              3. Implement Complex numbers addition and multiplication using structures.
              4. Implement single linked list operations (Insert front, Insert rear, Delete front, Delete rear, and
                 Traversal0.
              5. Implement Sorted linked list and Delete a node by search.
              6. Implement Double linked list operations (Insert front, Insert rear, Delete front, Delete rear, and
                 Traversal).
              7. Implement Stack operations using arrays and linked list.
              8. Implement convert an infix expression into post fix expression
              9. Implement evaluation of post fix expression.
              10.  Implement Queue operations using arrays and linked list
              11.  Implement Circular and DeQueue using arrays
              12.  Implement Priority Queue using arrays
              13.  Implement Binary Search Tree Operations (Insertion, Deletion, Traversal)
              14.  Implement AVL Tree Operations.


























                                                         Mdv
                                                          Mdv
   58   59   60   61   62   63   64   65   66   67   68