This document outlines the objectives, list of experiments, reference materials, outcomes, and equipment for an OOPS and Data Structures Laboratory course. The objectives are to learn C++ programming, expose students to various data structures, and make them familiar with applications using different data structures. The list of experiments covers implementing data structures like arrays, linked lists, stacks, queues, and binary search trees. At the end of the course, students should be able to design C++ programs manipulating various data structures, apply good programming practices, and use data structures to solve practical problems. The required lab equipment is 30 standalone desktop PCs with a C++ compiler or a server supporting 30+ terminals with a C++ compiler.
This document outlines the objectives, list of experiments, reference materials, outcomes, and equipment for an OOPS and Data Structures Laboratory course. The objectives are to learn C++ programming, expose students to various data structures, and make them familiar with applications using different data structures. The list of experiments covers implementing data structures like arrays, linked lists, stacks, queues, and binary search trees. At the end of the course, students should be able to design C++ programs manipulating various data structures, apply good programming practices, and use data structures to solve practical problems. The required lab equipment is 30 standalone desktop PCs with a C++ compiler or a server supporting 30+ terminals with a C++ compiler.
Original Description:
Anna University syllabus EC6312- OOPs and Data Structures laboratory
This document outlines the objectives, list of experiments, reference materials, outcomes, and equipment for an OOPS and Data Structures Laboratory course. The objectives are to learn C++ programming, expose students to various data structures, and make them familiar with applications using different data structures. The list of experiments covers implementing data structures like arrays, linked lists, stacks, queues, and binary search trees. At the end of the course, students should be able to design C++ programs manipulating various data structures, apply good programming practices, and use data structures to solve practical problems. The required lab equipment is 30 standalone desktop PCs with a C++ compiler or a server supporting 30+ terminals with a C++ compiler.
This document outlines the objectives, list of experiments, reference materials, outcomes, and equipment for an OOPS and Data Structures Laboratory course. The objectives are to learn C++ programming, expose students to various data structures, and make them familiar with applications using different data structures. The list of experiments covers implementing data structures like arrays, linked lists, stacks, queues, and binary search trees. At the end of the course, students should be able to design C++ programs manipulating various data structures, apply good programming practices, and use data structures to solve practical problems. The required lab equipment is 30 standalone desktop PCs with a C++ compiler or a server supporting 30+ terminals with a C++ compiler.
Download as DOC, PDF, TXT or read online from Scribd
Download as doc, pdf, or txt
You are on page 1of 2
EC6312
OOPS AND DATA STRUCTURES LABORATORY
LTPC 0032 OBJECTIVES: The student should be made to: Learn C++ programming language. Be exposed to the different data structures Be familiar with applications using different data structures LIST OF EXPERIMENTS: 1. Basic Programs for C++ Concepts 2.Array implementation of List Abstract Data Type (ADT) 3.Linked list implementation of List ADT 4.Cursor implementation of List ADT 5.Stack ADT - Array and linked list implementations 6.The next two exercises are to be done by implementing the following source files i. Program source files for Stack Application 1 ii. Array implementation of Stack ADT iii. Linked list implementation of Stack ADT iv. Program source files for Stack Application 2 v. An appropriate header file for the Stack ADT should be included in (i) and (iv) 7.Implement any Stack Application using array implementation of Stack ADT (by implementing files (i) and (ii) given above) and then using linked list 8.Implementation of Stack ADT (by using files (i) and implementing file (iii)) 9.Implement another Stack Application using array and linked list implementations of Stack ADT (by implementing files (iv) and using file (ii), and then by using files (iv) and (iii)) 11. Queue ADT Array and linked list implementations 12. Search Tree ADT - Binary Search Tree 13. Implement an interesting application as separate source files and using any of the searchable ADT files developed earlier. Replace the ADT file alone with other appropriate ADT files. Compare the performance. 14. Quick Sort TOTAL: 45 PERIODS REFERENCE: spoken-tutorial.org. OUTCOMES: At the end of the course, the student should be able to: Design and implement C++ programs for manipulating stacks, queues, linked lists, trees, and graphs. Apply good programming design methods for program development. Apply the different data structures for implementing solutions to practical problems.
LAB EQUIPMENT FOR A BATCH OF 30 STUDENTS:
Standalone desktops with C++ Compiler - 30 Nos. (or) Server with C++ compiler supporting 30 terminals or more.