Answer the following questions. 1. Define data structure. 2. Is Queue a priority queue? Justify? 3. Mention variations of the queue data structure. 4. Give two applications of graphs? 5. List operations performed on a stack. 6. What is the complexity of binary search algorithm? 7. Write two simple hash functions?
[7 marks]Discuss various methods to resolve hash collision with suitable examples.
[7 marks]Explain the data structure classification.
[7 marks]Explain Selection sort with algorithm.
[7 marks]Different between Linear Data Structures vs Linear Data Structures.
[7 marks]What is Tree Node? List the BST Basic Operations and discuss it.
[7 marks]Explain Operations on data structure with operation.
[7 marks]07 Describe the concept of Linear Data Structures with array Basic Operations.
[ marks]Explain Doubly Linked List with basic operations.
[7 marks]Explain Load Factor and Rehashing in Hashing works.
[7 marks]Discuss between Bubble sort and Insertion sort in details.
[7 marks]Enlist and briefly explain various application of stack.
[7 marks]Discuss various rehashing techniques.
[7 marks]Write an algorithm to perform various operations (insert, delete and display) for simple queue.
[7 marks]Differentiate between Stack and Queue.
[7 marks]What is binary tree traversal? What are the various traversal methods? Explain any two with suitable example.
[7 marks]List advantages and disadvantages of Breadth First Search and Depth First Search.
[7 marks]