To write a program to check whether a word is palindrome or not.
To create a two dimensional array of numbers and calculate & display the row & column sum and the grand total.
To write a program of matrix multiplication.
To write a program to insert (Push) an element into the sack and delete (Pop) an element from the stack using pointer.
To write a program to convert an infix expression to a postfix expression.
To evaluate a postfix expression.
To write a program to insert an element in the queue and delete an element from the queue using pointer.
To create a circular queue and add an element and delete an element from a circular queue.
To write a program of a structure containing an item name along with the unit price. The user enters the item name and quantity to be purchased. Program print outs total price of item with name using pointer in a structure or array in a structure.
To create a single linked list and ' (a) insert a node in the list (before header node, in between two nodes, end of the list); (b0 delete a node from the list (1st node, last node, in between two nodes); (c) Concatenate two lists.
To create a doubly linked list and ' (a) insert a node in the list (before header node, in between two nodes, end of the list); (b) delete a node from the list (1st node, last node, in between two nodes); (c) Concatenate two lists.
To create a circular linked list and insert & delete an element from the list
Write a program to merge two shorted linked list.
Write a program to reverse a linked list.
To write a program to calculate the binomial co-efficient of n C r of two numbers using recursive function. Also write the same program using function in non-recursive way.
To write a program to generate Fibonacci Series using recursive function. Also write the same program using function in non-recursive way.
To write a program to sort a list of numbers using ' (i) Heap Sort, (b) Quick Sort, (c) Bubble Sort.
To write a program to sort a list of numbers using ' (i) Insertion Sort, (b) Merge Sort, (c) Radix Sort. 19. To write a program to create a binary tree and traverse it in pre-order and post-order form.
To write a program to create a binary search tree and ' (a) insert a new node in the BST, (b) search a node in the BST, (c) delete a node from the BST.