Inlcudes syllabus questions and some try outs.
-
Implement a queue using linked lists with the following operations (1) Enqueue (2) Dequeue (3) Display the contents of the queue
-
Implement a stack using a linked list with the operations: (1) Push (2) Pop (3) Display the contents of the stack
-
Create a binary search tree with the following operations: (1) Insert a new node (2) Inorder traversal (3) Preorder traversal (4) Postorder traversal (5) Delete a node
-
Searching an element from a binary search tree.
-
Implementation of binary trees using linked lists and arrays- creations, insertion, deletion and traversal.
-
Implementation of bubble sort algorith using pointers.
-
Implementation of bubble sort.
-
Implement a circular queue using arrays with the operations: (1) Insert an element to the queue. (2) Delete an elements from the queue. (3) Display the contents of the queue after each operation.
-
Implement a Double-Ended Queue (DEQUEUE) with the operations: (1) Insert elements to the Front of the queue. (2) Insert elements to the Rear of the queue (3) Delete elements from the Front of the queue. (4) Delete elements from the Rear of the queue. (5) Display the queue after each operation.
-
Implemenation of doubly linked list and their operations.
-
Implementation of Heap sort.
-
Conversion of infix to postfix.
-
Implement a Queue using arrays with the operations: (1) Insert elements to the Queue. (2) Delete elements from the Queue. (3) Display the contents of the Queue after each operation.
-
Implemenation of insetion sort.
-
Implememt a simgle linkedlist operation.
-
Implememt a simgle linkedlist operation with a limit value.
-
Implement a linked list and find the number of nodes in the list.Also find the prime numbers in the list.
-
Write a menu driven program for performing the following operations on a Linked List: (1) Display (2) Insert at Beginning (3) Insert at End (4) Insert at a specified Position (5) Delete from Beginning (6) Delete from End (7) Delete from a specified Position
-
Implement a mersge sort opeartion.
-
Implement polynoimial multiplication.
-
Implement Polynomial addition.
-
Implement a Stack using arrays with the operations: (1) Pushing elements to the Stack. (2) Popping elements from the Stack (3) Display the contents of the Stack after each operation.
-
Implement quick sort operation.
-
Implement selection sort operation.
-
Find the smallest number in an array using pointers.
-
Implement sparse matrix representation.
-
Find the substring of a string and find its length.