List of Experiments: 

Exercise1:Array Manipulation 

i) Write a program to reverse an array. 

ii) C Programs to implement the Searching Techniques–Linear & Binary Search 

iii) C Programs to implement Sorting Techniques–Bubble, Selection and Insertion sort 

Exercise 2: Linked List Implementation 

i) Implement a singly linkedlist and perform insertion and deletion operations. 

ii) Develop a program to reverse a linked list iteratively and recursively. 

iii) Solve problems involving linked list traversal and manipulation. 

Exercise 3: Linked List Applications 

i) Create a program to detect and remove duplicates from a linkedlist. 

ii) Implement a linked list to represent polynomials and perform addition. 

iii) Implement a double-ended queue (deque)with essentialoperations. 

Exercise 4:Double Linked List Implementation 

i) Implement a doubly linked list and perform various operations to understand its properties and applications. 

ii) Implement a circular linked list and perform insertion, deletion, and traversal. 

Exercise 5: Stack Operations 

i) Implement a stack using arrays and linked lists. 

ii) Write a program to evaluate a postfix expression using a stack. 

iii) Implement a program to check for balanced parentheses using a stack. 

Exercise 6: Queue Operations 

i) Implement a queue using arrays and linked lists. 

ii) Develop a program to simulate a simple printer queue system. 

iii) Solve problems involving circular queues. 

Exercise 7: Stack and Queue Applications 

i) Use a stack to evaluate an infix expression and convert it to postfix. 

ii) Create a program to determine whether a given string is a palindrome or not. 

iii) Implement a stack or queue to perform comparison and check for symmetry. 

Exercise 8: Binary Search Tree 

i) Implementing a BST using Linked List. 

ii) Traversing of BST. 

Exercise 9: Hashing 

i) Implement a hash table with collision resolution techniques. 

ii) Write a program to implement a simple cache using hashing.