Scribd
Upload
81 views2 pages

Department of Computer Engineering Indus University, Ahmedabad

This document lists 12 experiments for a data structures course. The experiments cover implementing common searching and sorting algorithms, stack and queue operations, infix to postfix conversion, and operations on singly and doubly linked lists including insertion and deletion. The experiments are intended to be completed during the 2020-21 academic year. The lab instructor is listed as Ms. Khushbu Maurya.

Uploaded by

Khushbu Maurya
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
81 views2 pages

Department of Computer Engineering Indus University, Ahmedabad

This document lists 12 experiments for a data structures course. The experiments cover implementing common searching and sorting algorithms, stack and queue operations, infix to postfix conversion, and operations on singly and doubly linked lists including insertion and deletion. The experiments are intended to be completed during the 2020-21 academic year. The lab instructor is listed as Ms. Khushbu Maurya.

Uploaded by

Khushbu Maurya
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

Department of Computer Engineering

Indus University, Ahmedabad


SUBJECT:-Data Structure SEM:-IV SUBJECT CODE:CE0317

LIST OF EXPERIMENTS

(Academic Year:2020-21)

SR. TITLE OF PRACTICAL


NO.
1 Write a program to implement following searching algorithms.

2 Write a program to implement following sorting algorithms.

3 Write a program to implement following STACK operations.

4 Write a program to convert infix expression to postfix expression.

5 Write a program to implement following QUEUE operations.

6 Write a program to implement following CQUEUE operations.

7 Write a program to implement following operations of the singly linked list


(SLL). (1) Insert a node at the front of the linked list.
8 Write a program to implement following operations of the singly linked list
(SLL). (1) Delete a first node of the linked list.
9 Write a program to implement following operations of the doubly linked list
(DLL). (1) Insert a node at the front of the linked list.
10. Write a program to implement following operations of the doubly linked list
(DLL). (1) Delete a last node of the linked list.
11. Write a program to implement stack using linked list.

12. Write a program to implement queue using linked list.

Practical Beyond Syllabus


1.

2.
Lab In charge:- Ms. Khushbu Maurya

You might also like