Scribd
Upload
38 views2 pages

EC6312 Oops and Data Structures Laboratory LTP C 0 0 3 2 List of Experiments

This document outlines 14 experiments for an OOPS and Data Structures Laboratory course. The experiments cover implementing various data structures like lists, stacks, queues, and binary search trees using arrays and linked lists. Students will code programs and applications using these different abstract data type implementations, including stack applications, searching trees, and quick sort. They will also compare the performance of different abstract data type implementations.

Uploaded by

Britto Ebrington Ajay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
38 views2 pages

EC6312 Oops and Data Structures Laboratory LTP C 0 0 3 2 List of Experiments

This document outlines 14 experiments for an OOPS and Data Structures Laboratory course. The experiments cover implementing various data structures like lists, stacks, queues, and binary search trees using arrays and linked lists. Students will code programs and applications using these different abstract data type implementations, including stack applications, searching trees, and quick sort. They will also compare the performance of different abstract data type implementations.

Uploaded by

Britto Ebrington Ajay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

EC6312

OOPS AND DATA STRUCTURES LABORATORY

L T P
0 0 3

2
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

You might also like