Define Flow Chart. Explain various symbols used in Flow Chart.
[5 marks]What is top of stack? Why stack is called LIFO list?
[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]Convert Infix Expression A ^ B * C - D + E / F / (G + H) into Postfix expression using stack.
[5 marks]Convert following infix expressions into postfix (reverse polish) format showing stack status after every step in tabular form. (a+b^c^d)*(e+f/d).
[5 marks]Explain applications of linked list with suitable example.
[5 marks]Write an algorithm for following operations on a circular linked list.
[5 marks]Insert a node at beginning
[ marks]Insert a node at the end
[ marks]Delete a node from beginning
[ marks]Delete a node from the end
[ marks]Differentiate between arrays and linked list.
[5 marks]Write an algorithm for following operations on a doubly linked list.
[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]Explain Prim’s algorithm with suitable example.1
[5 marks]What is AVL tree? State the different rotations in AVL tree with examples.
[5 marks]Explain different representations of graph.
[5 marks]What do you mean by Hashing? List and explain hashing techniques with example.
[5 marks]Perform Binary Search on following data: 10, 12, 20, 32, 50, 55, 65, 80, 99
[5 marks]Explain Insertion Sort Algorithm with suitable example.
[5 marks]Perform selection sort on the following data: 50, 30, 70, 40, 80,
[10 marks]Insert a node at beginning
Insert a node at the end
[ marks]Delete a node from beginning
[ marks]Delete a node from the end
[ marks]