CONDUCTION OF FOLLOWING EXPERIMENTS.
VIVA WILL BE ASKED ON ANY TOPIC INCLUDING DEFINITIONS, OPERATIONS, ASYMPTOTIC ANALYSIS.
1. STACKS - C PROGRAM ON BASIC OPERATIONS OF STACK, C PROGRAM ON INFIX TO POSTFIX CONVERSION.
2. QUEUES - C PROGRAM ON LINEAR QUEUE, C PROGRAM ON CIRCULAR QUEUE.
3. LINKED LIST - C PROGRAM ON SINGLY LINKED LIST, C PROGRAM ON DOUBLY LINKED LIST.
4. TREES - C PROGRAM ON CREATION OF BINARY SEARCH TREE (BST) AND BST TRAVERSALS,
C PROGRAM ON CREATION OF BST AND FINDING MIN, MAX VALUES IN BST, HEIGHT OF BST.
5. SORTING - C PROGRAM ON MERGE SORT, C PROGRAM ON QUICK SORT, C PROGRAM ON HEAP SORT.
VIVA WILL BE ASKED ON ANY TOPIC INCLUDING DEFINITIONS, OPERATIONS, ASYMPTOTIC ANALYSIS.
1. STACKS - C PROGRAM ON BASIC OPERATIONS OF STACK, C PROGRAM ON INFIX TO POSTFIX CONVERSION.
2. QUEUES - C PROGRAM ON LINEAR QUEUE, C PROGRAM ON CIRCULAR QUEUE.
3. LINKED LIST - C PROGRAM ON SINGLY LINKED LIST, C PROGRAM ON DOUBLY LINKED LIST.
4. TREES - C PROGRAM ON CREATION OF BINARY SEARCH TREE (BST) AND BST TRAVERSALS,
C PROGRAM ON CREATION OF BST AND FINDING MIN, MAX VALUES IN BST, HEIGHT OF BST.
5. SORTING - C PROGRAM ON MERGE SORT, C PROGRAM ON QUICK SORT, C PROGRAM ON HEAP SORT.
No comments:
Post a Comment