Scribd
Upload
48 views

Vel Tech: Approved by AICTE, New Delhi & Affiliated To Anna University

This document contains: 1. The title page of a lab manual for the course "Data Structures and Object Oriented Programming Lab" from Vel Tech university. 2. A list of 13 experiments covering fundamental C++ and data structures concepts like arrays, linked lists, stacks, queues, trees, sorting etc. 3. Requirements for the lab listing the equipment needed like computers and compilers for 30 users.

Uploaded by

anon_510855877
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
48 views

Vel Tech: Approved by AICTE, New Delhi & Affiliated To Anna University

This document contains: 1. The title page of a lab manual for the course "Data Structures and Object Oriented Programming Lab" from Vel Tech university. 2. A list of 13 experiments covering fundamental C++ and data structures concepts like arrays, linked lists, stacks, queues, trees, sorting etc. 3. Requirements for the lab listing the equipment needed like computers and compilers for 30 users.

Uploaded by

anon_510855877
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

VEL TECH

(Owned by R.S.Trust)
Approved by AICTE, New Delhi & Affiliated to Anna University
No 42, Alamathi Road, Near Avadi Chennai – 600 062

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

LAB MANUAL

EC2209 –DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING LAB

SEMESTER – III

Prepared by

Mr V.NEHRU .,

VTS028

Asst.Prof,

CSE.
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 Implementation

The next two exercises are to be done by implementing the following source files

(a) program Source Files for Stack application1

(b) Array Implementation of Stack ADT

(c) Linked List Implementation of Stack ADT

(d) Program Source Files for Stack Application 2

An Appropriate header file for the Stack ADT should be included in (a)

and (d).

6. Implement any Stack Application using the array implementation of Stack ADT(by

implementing files (a) and (b) given above) and then using Linked List implementation

of Stack ADT ( by using files (a) and implementing file (c))

7. Queue ADT – Array and Linked List Implementation

8. Search Tree ADT – Binary Search Tree

9. Heap Sort

10. Quick Sort


REQUIREMENTS

S.No Name of the Equipments /Components Quantity Required


1 P IV Computer Variable DC Power Supply 30 Users
2 C and C++ Compiler 30 Users
INDEX

S.NO EXPERIMENT NAME PAGE NO


1.(a) Basic Programs For C++ Concepts Using Simple Class 1
1.(b) Function Overloading 4
1.(c) Constructors 8
1.(d) Friend Function 14
1.(e) Virtual Function 18
1.(f) Dynamic Constructors 22
1.(g) Single Inheritance 26
1.(h) Multilevel Inheritance 30
1.(i) Multiple Inheritance 34
1.(j) Hierarchical Inheritance 38
2 Array implementation of List Abstract Data Type(ADT) 43
3 Linked List Implementation of List ADT 48
4 Cursor implementation of List ADT 59
5 Array implementation of Stack ADT 65
6 Linked List implementation of Stack ADT 70
7 Evaluation of Postfix expressions 78
8 Array Implementation of Queue ADT 86
9 Linked List Implementation of Queue ADT 91
10 Implementation of Binary Search Tree ADT 96
11 Implementation of Binary Search 102
12 Implementation of Heap Sort 105
13 Implementation of Quick Sort 109

You might also like