Scribd
Upload
25 views32 pages

DS Lab Manual

This lab manual for the Information Technology Department at Government Engineering College, Modasa, outlines various practical exercises related to data structures. It includes tasks such as implementing stacks, queues, linked lists, and sorting algorithms, along with memory allocation functions and tree traversal methods. Each practical section provides space for students to write their programs and outputs.

Uploaded by

dp10012003
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
25 views32 pages

DS Lab Manual

This lab manual for the Information Technology Department at Government Engineering College, Modasa, outlines various practical exercises related to data structures. It includes tasks such as implementing stacks, queues, linked lists, and sorting algorithms, along with memory allocation functions and tree traversal methods. Each practical section provides space for students to write their programs and outputs.

Uploaded by

dp10012003
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

Government Engineering College,

Modasa.

Information Technology Department.

Subject: Data Structure.


Lab manual

Student name:
Enrollment number:
Branch:
Practical 1

–Introduction to pointers. Call by Value and Call by Reference.

a) Call by Value: b)Call by reference:

Output: Output:
Practical 2

–Introduction to dynamic memory allocation functions malloc(),calloc(),


free(),etc.

a)malloc() : b)calloc() :

Output: Output:
Practical 3

–Implement a program for stack that performs following operations


using array. a)Push. b)Pop. c)Peep. d)Display.

Program:
Output
Practical 4
–Implement a program to convert infix notation to postfix notation
using stack.

Program:
Practical 5
– Write a program to implement Queue using array that perform
following operations. a)Insert. b)Delete. c)Display.

Program:
Output:
Practical 6
–Write a program to implement Circular Queue using array that
performs following operations. a)Insert. c)Delete. b)Display.

Program:

Output:
Practical 7
–Write a menu driven program to implement following operations on
the singly linked list.

Main Program:

a)Insert a node at front. b)Insert a node at end.


c)Delete first node.
d)Delete node before position. e)Delete node after position.

Output:
Create a)

b) c)

d) e)

Practical 8
–Write a program to implement stack using linked list.

Program:

Output:
Practical 9
–Write a program to implement queue using linked list.

Program:

Output:
Practical 10
–Write a program to implement following operations on the doubly
linked list.
a)Insert node at front. b)Insert node at end.

c)Delete last node. d)Delete node before specific


position.

Output:
Create a)

b) c)

d)

Practical 11
–Write a program to implement following operations on the circular
linked list.
a)Insert node at end. b)Insert node before position.

c)Delete first node. d)Delete node after position.


Output:
Create a)

b) c)

d)

Practical 12
–Write a program which create binary search tree.
Program:
Practical 13
–Implement Breakers you treat our Singh methods inorder, preorder
and postorder traversal.
Program:

Practical 14
–Write a program to implement Quick sort.
Program:

Practical 15
–Write a program to implement Merge sort.
Program:

Practical 16
–Write a program to implement Bubble sort.
Program:

Practical 17
–Write a program to implement Binary search.
Program:

You might also like