Data Structures and Algorithm

List of Assignments :

1.  Write a program to perform Set operations - Union, Intersection, Difference, Symmetric Difference etc.

2.  Write a program to perform various string operations such as Copy, Length,Reversing, Palindrome, Concatenation and to find occurrence substring etc withand without using library functions.

3.      Write a program to perform operations on matrices like addition, multiplication,saddle point, magic square ,inverse & transpose etc using functions & pointers.[Minimum 4 operations]

4.    Write a program to perform following operations on any database: Add, Delete,Modify, Display, Search & Sort etc.

5.      Implement Sorting Methods using functions- Bubble Sort, Selection Sort, Insertion Sort, and Shell Sort.

6.      Implement Sorting Methods using recursion- Quick Sort and Merge Sort.

7.     Implement Searching Methods-Sequential Search, Binary Search.

8.      Represent polynomial using structures and write a menu driven program to perform Addition, Multiplication and Evaluation.

9.      Represent Sparse Matrix using array and perform Matrix Addition, Simple Transpose.

10.  Write a menu driven program to perform following operations on SLL/CDLL : Create, Insert – Start, end, between, Search & delete, Reverse ,Display etc.

11.  Create two Singly Linked lists, sort one after creation and one while creation using Pointer manipulation. Merge these two lists into one list without creating a new node or swapping of the data.

12.  Represent a polynomial using Circular Linked List and write a menu driven program to perform Addition, Multiplication and Evaluation.

13.  Implement Stack as an ADT using Array. Use this ADT to perform expression conversion and evaluation (infix to postfix, infix to prefix, prefix to infix, prefix to postfix, postfix to infix and postfix to prefix).

14.  Represent Circular Queue using Linked List and write a program to perform operations like Insert, Delete, Finding front and rear element.