What is Asymptotic Notation? List and explain it.
[5 marks]Write an algorithm for PUSH and POP operations on stack.
[5 marks]List & explain types of data structure.
[5 marks]Explain the difference between Stack and Queue with suitable example.
[5 marks]Explain Recursion with example.
[5 marks]Explain Circular Queue. What are the benefits of circular queue over Queue?
[5 marks]Evaluate the following postfix expression using stack. Show each step. 5 3 + 6 2 / * 3 5 * +
[5 marks]Write and explain an algorithm of singly linked list for delete a node from beginning.
[5 marks]Consider the following queue, where queue is a Circular queue having memory cells. Front=2, Rear=4. Queue: _, A, C, D, _, _ Describe queue as following operation take place: a. Fis added to the queue b. Two letters are deleted c. Ris added to the queue d. Sis added to the queue e. One letter is deleted
[5 marks]What is linked list? Explain types of it.
[5 marks]Create a Binary Search Tree for the following data and do Post-order traversal of the tree. 40, 25, 70, 22, 35, 60, 80, 90, 10, 30
[5 marks]Differentiate between arrays and linked list.
[5 marks]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]Explain Prim’s algorithm with suitable example.
[5 marks]Explain the trace of bubble sort on following data. 42, 23, 74, 11, 65, 58, 94, 36, 99, 87
[5 marks]Explain collision resolution techniques in detail.
[5 marks]Perform Binary Search on following data: 10, 12, 20, 32, 50, 55, 65, 80, 99
[5 marks]