Define Flow Chart. Explain various symbols used in Flow Chart.
[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 the circular queue over Queue?
[5 marks]Write a pseudocode for the PUSH and POP operations of the stack.
[5 marks]What is Recursion? Write a pseudocode in ‘C’ language to find the multiplication of two natural numbers.
[5 marks]What is linked list? Explain types of it.
[5 marks]Write an algorithm to perform insertion at first position in a linear linked list.
[5 marks]Write an algorithm for following operations
[5 marks]Delete a node from beginning b) Delete a node from the end c) Delete a node after a given node.
[ marks]State the advantages of circular and doubly linked lists over a singly linked list.
[5 marks]Explain application of Binary Tree.
[5 marks]Define the following terms: (a) Directed Graph (b) Undirected Graph (c) Weighted Graph (d) Self loop (e) Adjacent Vertices
[5 marks]Explain Dijkstra’s algorithm with suitable example.
[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 do you mean by Hashing? Explain any two hashing techniques.
[5 marks]Explain the trace of Selection Sort with a suitable example.
[5 marks]Write an algorithm that performs a search using binary search method.
[5 marks]Explain collision resolution techniques in detail.
[5 marks]