Back

README

← Previous

DSC-07 Data Structures

Course

Welcome to the collection of practical assignments for the Data Structures course.

📅 List of Practical

  1. Write a program to implement singly linked list as an ADT(Abstract Data Type) that supports the following operations:

1. Insert an element x at the beginning of the singly linked list

2. Insert an element x at ith position in the singly linked list

3. Remove an element from the beginning of the singly linked list

4. Remove an element from ith position in the singly linked list.

5. Search for an element x in the singly linked list and return its pointer

6. Concatenate two singly linked lists.

  1. Write a program to implement doubly linked list as an ADT that supports the following operations:

1. Insert an element x at the beginning of the doubly linked list

2. Insert an element x at ith position in the doubly linked list

3. Insert an element x at the end of the doubly linked list

4. Remove an element from the beginning of the doubly linked list

5. Remove an element from ith position in the doubly linked list.

6. Remove an element from the end of the doubly linked list

7. Search for an element x in the doubly linked list.

8. Concatenate two doubly linked lists.

  1. Write a program to implement circular linked list as an ADT which supports the following operations:

- a) Using Singly Linked List

- b) Using Doubly Linked List

- c) Operations

1. Insert an element x at the front of the circularly linked list

2. Insert an element x after an element y in the circularly linked list

3. Insert an element x at the back of the circularly linked list

4. Remove an element from the back of the circularly linked list

5. Remove an element from the front of the circularly linked list

6. Remove an element x from the circularly linked list

7. Search for an element x in the circularly linked list and return its pointer

8. Concatenate two circularly linked lists.

  1. Implement a stack as an ADT using Arrays.
  1. Implement a stack as an ADT using the Linked list ADT.
  1. Write a program to evaluate a prefix/postfix expression using stack.

1. Using Array Prefix Expression Evaluation

2. Using Array Postfix Expression Evaluation

3. Using Linked List Prefix Expression Evaluation

4. Using Linked List Postfix Expression Evaluation

  1. Implement Queue as an ADT using the circular Arrays.
  1. Implement Queue as an ADT using the circular linked list ADT.
  1. Write a program to implement Binary Search Tree as an ADT which supports the following operations:

1. Insert an element x

2. Delete an element x

3. Search for an element x in the BST and change its value to y and then place the node with value y at its appropriate position in the BST

4. Display the elements of the BST in preorder, inorder, and postorder traversal

5. Display the elements of the BST in level by level traversal.

6. Display the height of the BST

  1. Write a program to implement a balanced search tree (AVL) as an ADT.

<p align="right">

<i>Developed with ❤️ by <a href="https://github.com/16ratneshkumar">16ratneshkumar</a></i>

</p>

← Previous