[go: up one dir, main page]
Scribd
Upload
26 views3 pages

Tutorial Questions For Mid 2

The document outlines various data structures and algorithms, including stacks and queues implemented using linked lists and arrays, as well as expression evaluation and binary search trees. It covers operations such as push, pop, enqueue, and dequeue, along with their applications and properties. Additionally, it discusses collision resolution techniques in hashing and tree traversal methods.

Uploaded by

Venkatesh Thumati
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
26 views3 pages

Tutorial Questions For Mid 2

The document outlines various data structures and algorithms, including stacks and queues implemented using linked lists and arrays, as well as expression evaluation and binary search trees. It covers operations such as push, pop, enqueue, and dequeue, along with their applications and properties. Additionally, it discusses collision resolution techniques in hashing and tree traversal methods.

Uploaded by

Venkatesh Thumati
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

1.

Explain and write algorithm for Stacks operations (Push, Display) using
linked lists.

2. Perform expression evaluation for the prefix form

-+*23*549

3. Explain and write algorithm for Stacks operations (Pop, isempty, peek)
using linked lists.

4. Define Stack? Explain the properties and Applications of Stack?

5. Explain how a stack can be implemented using a singly linked list. What
are the advantages of this approach over using arrays?

6. Convert the following infix expression into its prefix form by u sing a
stack.
A + B * (C ^ D - E) ^ (F + G * H) - I

7. Write algorithm for the Queues operations (enqueue, dequeue, Display)


using Arrays

8. Write a queue function for isempty, peek, isfull using array

9. How can you detect and handle overflow and underflow conditions in a
circular queue implemented using an array?

10. How does the dequeue operation differ in an array-based queue vs. a
linked-list-based queue?

11. Explain Queues operations (enqueue, dequeue, Display) using linked


lists

12. Differentiate between a queue and a stack in terms of their operations


and use cases.

13. Illustrate the BFS traversal for the given graph in, following Fig.

14. Explain the working and algorithm of a circular queue using an array
for isempty, isfull, peek?

15. Explain the operations of double ended queue (enqueue, dequeue)


using Arrays
16. Define Queue? Explain the properties and Applications of queue?
Explain the draw backs of queue?

17. Write a queue function for isempty, peek, isfull usinglinked list

18. Explain the operations of circular queue (enqueue, dequeue) using


Arrays

19. What is a Binary Search Tree? Draw a binary search tree when the
following keys are inserted in order 43, 75, 19, 36, 8, 62, 49, 84, 12, 18,
29. How can a binary search done for searching a key?

20. Write Inorder, Preorder and Postorder for the below Tree.

21. Define Hashing. Explain different types of collision resolution


techniques

22. Define a binary search tree? Explain the properties of BST? And
explain different types of traversing techniques?

23. Write the algorithm for Recursive Preorder, post order traversal. with
example

24. Explain linear probing Hashing with following data.

Input keys: 89,18,49,58,69,77,36

Table size: 10.

25. Explain Double Hashing with following data.

Input keys: 89,18,49,58,69,77,36

Table size: 10.

26. Explain all the three cases for deleting an element in a binary search
tree with any example?

27. Formation of a Binary Tree from its Traversals

Inorder: D,B,H,E,I,A,F,C,G

Postorder: D,H,I,E,B,F,G,C,A
28. Discuss various Hashing Techniques with suitable examples?

29. Explain Quadratic Probing with following data.

Input keys: 89,18,49,58,69,77,36

Table size: 10.

30. Explain the Binary Search Tree representation using Linked List.

You might also like