What is Asymptotic Notation? List and explain it. Differentiate between arrays and linked list.
[ marks]What is Array? How to declare and initialize 1D array? Explain with example.
[5 marks]Write an algorithm to perform enqueue and dequeue operations in a simple queue.
[ marks]Evaluate the following postfix expression in tabular form showing stack after every step. 7 6 + 4 * 4 10 + - 5 +
[5 marks]Consider the following queue, where queue is a Circular queue having 6 memory cells. Front=2, Rear=4. Queue: _, H, I, J, _, _ Describe queue as following operation take place: a. Kis added to the queue b. Two letters are deleted c. Gis added to the queue d. Sis added to the queue e. One letter is deleted
[5 marks]Write an algorithm for Insert a node at beginning in a singly linked list.
[5 marks]Create a Binary Search Tree for the following data and do in-order, Preorder and Post-order traversal of the tree. 40, 60, 15, 4, 30, 70, 65, 10, 95, 25
[5 marks]What is AVL tree? State the different rotations in AVL tree with examples.
[5 marks]Define Binary Tree. Construct a binary tree from the traversals given below: In-order: E, A, C, K, F, H, D, B, G Pre-order: F, A, E, K, C, D, H, G, B
[5 marks]What is searching? Explain binary search with example.
[ marks]Solve the following graph using Prim’s algorithm for minimum spanning tree.05
[ marks]Explain collision resolution techniques in detail.
[5 marks]Solve the following graph using Kruskal’s algorithm for minimum spanning tree.05
[ marks]Explain different representations of graph.
[5 marks]Perform selection sort on the following data:05 50, 30, 70, 40, 80,
[10 marks]Explain BFS and DFS traversal methods for Graph with suitable example.
[5 marks]Write the algorithm for quick sort and sort the following numbers according to it.05 25, 85, 60, 10, 58, 47, 35, 16, 72, 50
[ marks]