Define Algorithm. Explain it with example.
[5 marks]What do you mean by Data Structure? Give the difference between Primitive and Non-primitive data structures.
[5 marks]Define Queue. What are the benefits of circular queue over Queue?
[5 marks]Consider the stack Sof characters, where Sis allocated 8 memory cells. S: A,C,D, F, K, _, _, _ Perform the following operations on stack. Pop(), Pop() ,Push(L), Push(P), Pop(), Push(R), Push (S), Pop()
[5 marks]Convert following Infix Expression into Postfix expression using stack. A ^ B * C - D + E / F / (G + H)
[5 marks]What is Linked List? Explain types of it.
[5 marks]Write an algorithm to perform enqueue and dequeue operations in a queue.
[5 marks]Differentiate between arrays and linked list.
[5 marks]Write an algorithm to insert a node in a singly linked list.
[5 marks]Define the following terms with respect to tree data structure: 1. Root node 2. Leaf node 3. Siblings 4. Complete binary tree 5. Degree
[5 marks]Find its inorder, preorder and postorder traversal for the following data. 10,3,15,22,6,45,65,23,78,34,5
[5 marks]Explain various representations of graph.
[5 marks]Solve the following graph using Prim’s algorithm for minimum spanning tree .
[5 marks]What is searching? Explain binary search with example.
[5 marks]Explain the trace of bubble sort on following data. 42,23,74,11,65,58,94,36,99,871
[5 marks]Explain collision resolution techniques in detail.
[5 marks]Perform insertion sort on the following data: 6, 7, 0, 9, 1, 2, 8,
[5 marks]