Data Structure

Practical 1:
Array & Linked List

Implementation of Stacks, Queues (using both arrays and linked lists) .




Execute →

Practical 2:
Array & Queue

Implementation of a circular queue using arrays.





Execute →

Practical 3: Search

Implementation of recursive and non-recursive functions to perform the following searching operations for a key value in a given list of integers: i. Linear search ii. Binary search.

Execute →

Practical 4: Stack

Implement a program to evaluate a given postfix expression using stacks.





Execute →

Practical 5:Stack

Implement a program to convert a given infix expression to postfix form using stacks.





Execute →

Practical 6: Singly linked list

Implement the following operations on a singly linked list: i. Creation ii. Insertion iii. Deletion iv. Traversal.




Execute →

Practical 7:Linked List

Implementation of Polynomial arithmetic using linked list.






Execute →

Practical 8: Circular Linked List

Implement the following operations on a circular linked list: i Creation ii Insertion iii Deletion iv Traversal.




Execute →

Practical 9: Binary Tree

Implementation of recursive and iterative traversals on binary tree






Execute →

Practical 10: Binary Search Tree

Implementation of the following operations on binary search tree (BST): (a) Minimum key (b) Maximum key (c) Search for a given key

Execute →

Practical 11:Graph

Implementation of graph traversals by applying: (a) BFS (b) DFS.






Execute →

Practical 12: Sort

Implement the following sorting algorithms: (a) Bubble sort (b) Insertion sort (c) Quick sort (d) Selection sort.



Execute →