The document outlines the Data Structures Lab course offered at R.V.R. & J.C. College of Engineering, detailing its objectives and outcomes. Students will learn to implement various data structures, including lists, stacks, queues, trees, and graphs, and apply searching and sorting techniques. The course includes practical experiments to reinforce these concepts.
The document outlines the Data Structures Lab course offered at R.V.R. & J.C. College of Engineering, detailing its objectives and outcomes. Students will learn to implement various data structures, including lists, stacks, queues, trees, and graphs, and apply searching and sorting techniques. The course includes practical experiments to reinforce these concepts.
The document outlines the Data Structures Lab course offered at R.V.R. & J.C. College of Engineering, detailing its objectives and outcomes. Students will learn to implement various data structures, including lists, stacks, queues, trees, and graphs, and apply searching and sorting techniques. The course includes practical experiments to reinforce these concepts.
The document outlines the Data Structures Lab course offered at R.V.R. & J.C. College of Engineering, detailing its objectives and outcomes. Students will learn to implement various data structures, including lists, stacks, queues, trees, and graphs, and apply searching and sorting techniques. The course includes practical experiments to reinforce these concepts.
R.V.R. & J.C. College of Engineering (Autonomous), Guntur-522019, A.P.
R-24
CS164 DATA STRUCTURES LAB L T P C Int Ext
(Common to branches CSE/CSD/CSM/CSO/IT) - - 3 1.5 30 70 Semester II [First Year] COURSE OBJECTIVES:
1. To illustrate operations of linear and non-linear data structure.
2. To demonstrate computational problems using suitable data structures 3. To familiarize searching and sorting techniques .
COURSE OUTCOMES: After the successful completion of the course,students are able to 1. Develop solutions using the fundamental algorithms for searching, sorting, and hashing to solve computational problems effectively. 2. Implement linked list operations to manage dynamic data structures effectively. 3. Apply stack-k and queue-based data structures to handle applications like expression evaluation, syntax checking, and sequential data processing. 4. Construct tree and graph structures to organize, search, and traverse data inhierarchical and networked representations.
EXPERIMENTS: 1. List ADT. 2. Applications of List. 3. Single Circular List ADT. 4. Doubly LinkedListADT. 5. Stack ADT. 6. Application son Stack. 7. Queue ADT. 8. Applications of Queue. 9. Double Ended Queue ADT. 10. BST ADT. 11. Priority Queue ADT. 12. Searching and Sorting Techniques. 13. Graph traversal techniques. 14. Hashing Techniques.
B.Tech.(CS)/R-24/2024-2025 Printed through web on 12-02-2025 20:12:25 Page 1/ 1
