Scribd
Upload
217 views

Data Structure Slab

This document outlines the objectives and exercises for a data structures lab course in C programming. The course aims to teach good programming practice and writing efficient C programs. It will cover implementing common data structures like lists, stacks, queues, and trees as abstract data types. Students will complete exercises to create various implementations of these data structures and use them to solve problems like evaluating postfix expressions and checking balanced parentheses. The equipment needed for a batch of 30 students is also listed.

Uploaded by

anon-456687
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
217 views

Data Structure Slab

This document outlines the objectives and exercises for a data structures lab course in C programming. The course aims to teach good programming practice and writing efficient C programs. It will cover implementing common data structures like lists, stacks, queues, and trees as abstract data types. Students will complete exercises to create various implementations of these data structures and use them to solve problems like evaluating postfix expressions and checking balanced parentheses. The equipment needed for a batch of 30 students is also listed.

Uploaded by

anon-456687
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

CS1152 DATA STRUCTURES LAB

AIM:
To teach the principles of good programming practice and to give a practical training in writing
efficient programs in C
OBJECTIVES:
• To teach the students to write programs in C
• To implement the various data structures as Abstract Data Types
• To write programs to solve problems using the ADTs

Implement the following exercises using C:


1. Array implementation of List Abstract Data Type (ADT)
2. Linked list implementation of List ADT
3. Cursor implementation of List ADT
4. Array implementations of Stack ADT
5. Linked list implementations of Stack ADT

The following three exercises are to be done by implementing the following source files
a. Program for ‘Balanced Paranthesis’
b. Array implementation of Stack ADT
c. Linked list implementation of Stack ADT
d. Program for ‘Evaluating Postfix Expressions’

An appropriate header file for the Stack ADT should be #included in (a) and (d)
6. Implement the application for checking ‘Balanced Paranthesis’ using array implementation of Stack
ADT (by implementing files (a) and (b) given above)
7. Implement the application for checking ‘Balanced Paranthesis’ using linked list implementation of
Stack ADT (by using file (a) from experiment 6 and implementing file (c))
8. Implement the application for ‘Evaluating Postfix Expressions’ using array and linked list
implementations of Stack ADT (by implementing file (d) and using file (b), and then by using
files (d) and (c))
9. Queue ADT
10. Search Tree ADT - Binary Search Tree
11. Heap Sort
12. Quick Sort

List of Equipments for a batch of 30


1. Pentium III machines - 30
2. Borland or Turbo C software – 30 Users

You might also like