SUMATHI REDDY INSTITUTE OF TECHNOLOGY FOR WOMEN c) Circular queue

II B.Tech. I Sem I Mid-Term Examinations, JAN-2023 d) Priority queue

DATA STRUCTURES 8. The postfix form of the expression (A+ B)*(C*D- E)*F / G is? [ ]
Objective Exam
SET-I
a) AB+ CD*E – FG /**
Name: _________________________ H.T. No. ______________________________ b) AB + CD* E – F **G /
c) AB + CD* E – *F *G /
I. Choose the correct answers d) AB + CDE * – * F *G /
9. The data structure required to check whether an expression contains a
1. A queue follows __________ [ ] balanced parenthesis is? [ ]
a) FIFO (First In First Out) principle b) LIFO (Last In First Out) a) Stack b) Queue c) Array d) Tree
principle c) Ordered array d) Linear tree
2. Circular Queue is also known as ________ [ ] 10. What data structure would you most likely see in non recursive
a) Ring Buffer b) Square Buffer c) Rectangle Buffer implementation of a recursive algorithm? [ ]
d) Curve Buffer a) Linked List b) Stack c) Queue d) Tree

3. If the elements “A”, “B”, “C” and “D” are placed in a queue and II.Fill in the blanks
are deleted one at a time, in what order will they be removed?
a) ABCD b) DCBA c) DCAB d) ABDC [ ] 1.stack follows the concept of____________ .
4. A data structure in which elements can be inserted or deleted 2. queue follows the concept of ____________
at/from both ends but not in the middle is? [ ] 3. stack operations are_________________
a) Queue b) Circular queue c) Dequeue d) Priority queue 4.queue operations are_____________
5. The data structure required to check whether an expression contains a
5. A normal queue, if implemented using an array of size MAX_SIZE, balanced parenthesis is_________________
gets full when? [ ] 6.What data structure would you most likely see in non recursive
implementation of a recursive algorithm?__________.
a) Rear = MAX_SIZE – 1 b) Front = (rear + 1)mod MAX_SIZE
7. The postfix form of A*B+C/D is__________.
c) Front = rear + 1 d) Rear = front
8. What is the bestcase time complexity of deleting a node in a Singly
6. Queues serve major role in ______________ [ ] Linked list? __________.
9.What is the hash function used in thedivision
a) Simulation of recursion method________________
b) Simulation of arbitrary linked list 10. Using division method, in a given hash table of size 157, the key of
c) Simulation of limited resource allocation value 172 be placed at position ____________
d) Simulation of heap sort

7. Which of the following is not the type of queue? [ ] -o0o-

a) Ordinary queue
b) Single ended queue SUMATHI REDDY INSTITUTE OF TECHNOLOGY FOR WOMEN
II B.Tech. I Sem I Mid-Term Examinations, JAN-2023
DATA STRUCTURES
 Objective Exam 10. What is the hash function used in Double Hashing? [ ]
SET-II
a) (h1(k) – i*h2(k))mod m b) h1(k) + h2(k)
c) (h1(k) + i*h2(k))mod m d) (h1(k) + h2(k))mod m
Name: _________________________ H.T. No. ______________________________

I. Choose the correct answers II .Fill in the blanks

1. In a Queue, if a user tries to remove an element from empty Queue it is called [ ]
a) Underflow b)B. Empty collection c) Overflow d) Garbage Collection 1. What are the values of h1(k) and h2(k) in the double hash function?
___________
2. Pushing an element into stack already having five elements and stack size of [ ] 2. The optimal data structure used to solve Tower of Hanoi is _________
5, then stack becomes ___________
a) Overflow b) Crash c) Underflow d) User flow 3. Which data structure can be used to test a palindrome___________

3. What is the value of the postfix expression 6 3 2 4 + – *? [ ] 4. The postfix expression abc+de/*- is equivalent to which of the following infix
a) 1 b) 40 c) 74 d) -18
expression? ___________
4. . How many steps are involved in creating a hash function using a multiplication 5. . A linear collection of data elements where the linear node is given by means of
method? [ ] pointer is called? ___________
a) 1 b) 4 c) 3 d) 2 6. What is a hash table? ___________
7. What is the problem occur due to quadratic probing? ___________
5. What is the time complexity of searching for an element in a circular linked list? 8. Is a skip list like balanced tree? ___________
a) O(n) b) O(nlogn) c) O(1) d) O(n2) [ ] 9. How many stacks are required for applying evaluation of infix expression
algorithm?
10. What is the time complexity of searching for an element in a circular linked
6. What would be the Prefix notation for the given equation? [ ] list?

a) +A*CB b) *B+AC c) +A*BC d) *A+CB

7. . What data structure is used when converting an infix notation to prefix notation? -o0o-
a) Stack b) Queue c) B-Trees d) Linked-list [ ]

8.What is the advantage of the hash table over a linked list? [ ]

a) faster access of data b) easy to implement
c) very efficient for less number of entries d) exhibit good locality of reference

9. What is the time complexity of insert function in a hash table using list head?
a) O(1) b) O(n) c) O(log n) d) O(n log n) [ ]
SUMATHI REDDY INSTITUTE OF TECHNOLOGY FOR WOMEN
II B.Tech. I Sem I Mid-Term Examinations, JAN-2023
DATA STRUCTURES
 Objective Exam a) FILO B) LIFO C) FIFO LIFO
SET-III
9. In hashing if search element is found for the first time, the time complexity is [ ]
Name: _________________________ H.T. No. ______________________________ a) O(1) b) O(n) c) O(log n) d) O(n log n)

II. Choose the correct answers 10. which is faster search technique [ ]
1. A linear collection of data elements where linear node is given by means of a) Dictionary b) Linked List c) skip list d) none
pointer is called [
]
a) linked list b) Node list c) Primitive list d) None II. Fill in the blanks

2. process of inserting an element into a stack is called [ ] 11. Which data structure is used for recursion ___________
12. In hashing ________ called examining the every memory locations
a) pop b) push c) create d) evaluate
13. A node consists________________ fields in single linked list
3. If a user tries to remove an element from a stack when it is empty causes___ [ ]
14. The error message displayed when an element is try to pop form an empty stack
a) overflow b) underflow c) garbage collection d) empty collectin
____________
4. . which of the following will allocate the memory for the new node? [ ]
15. . A linear collection of data elements where the linear node is given by means of
A) Pointer-variable= malloc(sizeof(*struct-name))
pointer is called? ___________
B) Pointer-variable= malloc(sizeof( struct struct-name)) 16. What is a hash table? ___________
17. What is the problem occur due to quadratic probing? ___________
C) Pointer-variable= alloc(sizeof( struct struct-name)) 18. Is a skip list like balanced tree? ___________
19. How many stacks are required for applying evaluation of infix expression
D) Pointer-variable= alloc(sizeof(*struct-name)) (*struct-name))
algorithm?
5. The five elements A ,B,C D,E and E pushed in Stack one after the other the stack 20. Deletion is done _____ end and insertion is done ______ end in queue
is poped four items and each element is inserted in queue . Then two elements are
delete from the queue and pushed back on the stack .Now one item is poped from
the stack . The poped item is [ ]

a) A b) B c) C d) D

6. Find one collision resolution technique given below [ ] -o0o-

a) division method b) folding method c) extendible hashing d) mid-square

7. . Dictionary consists of [ ]
a) Data only b) Key only c) Data and Key pair d)none
SUMATHI REDDY INSTITUTE OF TECHNOLOGY FOR WOMEN
8.Queeu principle____ [ ] II B.Tech. I Sem I Mid-Term Examinations, JAN-2023
 DATA STRUCTURES 8. What is the value of the postfix expression 6 3 2 4 + – *? [ ]
Objective Exam a) 1 b) 40 c) 74 d) -18
SET-IV

Name: _________________________ H.T. No. ______________________________ 9. What data structure would you most likely see in non-recursive implementation
I. Choose the correct answers of a recursive algorithm? [ ]
a) Linked List b) Stack c) Queue d) Tree
1. In a Queue, if a user tries to remove an element from empty Queue it is called [ ]
10. What is the value of the postfix expression 6 3 2 4 + – *? [ ]
a). Underflow b). Empty collection c). Overflow d). Garbage Collection a) 1 b) 40 c) 74 d) -18

2.In linked list implementation of a queue, where does a new element be inserted?[ ]
a) At the head of link list b) At the centre position in the link list
c) At the tail of the link list d) At any position in the linked list II .Fill in the blanks

3. Which function places a node at the end of the Single Linked List [ ] 21. What are the values of h1(k) and h2(k) in the double hash function?
___________
a) Struct Node b) Append c) Display d) Addnode 22. The optimal data structure used to solve Tower of Hanoi is _________

4. Which of the following will correctly allocate the memory space for the new 23. The postfix expression abc+de/*- is equivalent to which of the following infix
node__ [ ] expression? ___________
24. What is a hash table? ___________
a) Pointer-variable= malloc(sizeof(*struct-name)) 25. What is the problem occur due to quadratic probing? ___________
b) Pointer-variable= malloc(sizeof( struct struct-name)) 26. Is a skip list like balanced tree? ___________
27. 17.Reverse polish notation is also called___________
c) Pointer-variable= alloc(sizeof( struct struct-name)) 28. Deletion is done _____ end and insertion is done ______ end in queue
d) Pointer-variable= alloc(sizeof(*struct-name)) 29. A node consists ______________ in single linked list.
30. Which data structure used for recursion is____________
5. Find the one collision resolution technique give below

a)division method b) folding method c)extendible hashing d) mid-square

6. A normal queue, if implemented using an array of size MAX_SIZE, gets full

when? [ ]
a) Rear = MAX_SIZE – 1 b) Front = (rear + 1)mod MAX_SIZE
c) Front = rear + 1 d) Rear = front

7. Circular Queue is also known as ________ [ ]

a) Ring Buffer b) Square Buffer c) Rectangle Buffer d) Curve Buffer
 SUMATHI REDDY INSTITUTE OF TECHNOLOGY FOR WOMEN 8. What is the value of the postfix expression 6 3 2 4 + – *? [ ]
II B.Tech. I Sem I Mid-Term Examinations, JAN-2023 a) 1 b) 40 c) 74 d) -18
DATA STRUCTURES
Objective Exam
9.The data structure required to check whether an expression contains a balanced
SET-V
parenthesis is? [ ]
Name: _________________________ H.T. No. ______________________________ a) Stack b) Queue c) Array d) Tree
I. Choose the correct answers

1. In a Queue, if a user tries to remove an element from empty Queue it is called [ ] 10. What is the value of the postfix expression 6 3 2 4 + – *? [ ]
a) 1 b) 40 c) 74 d) -18

a). Underflow b). Empty collection c). Overflow d). Garbage Collection

2. Circular Queue is also known as ________ [ ] II .Fill in the blanks

a) Ring Buffer b) Square Buffer c) Rectangle Buffer 31. What are the values of h1(k) and h2(k) in the double hash function?
d) Curve Buffer ___________
32. The optimal data structure used to solve Tower of Hanoi is _________

3. Which function places a node at the end of the Single Linked List [ ] 33. The postfix expression abc+de/*- is equivalent to which of the following infix
expression? ___________
34. What is a hash table? ___________
a) Struct Node b)Append c) Display d) Addnode 35. What is the problem occur due to quadratic probing? ___________
36. Is a skip list like balanced tree? ___________
4. What would be the Prefix notation for the given equation? [ ]
37. 17.Reverse polish notation is also called___________
38. Expression evaluations is ______ data structure application
a) +A*CB b) *B+AC c) +A*BC d) *A+CB 39. What is the next field of the structure node in SLL______
40. Deletion is done _____ end and insertion is done ______ end in queue
5. Find the one collision resolution technique give below [ ]

a)division method b) folding method c)extendible hashing d) mid-square

6. A normal queue, if implemented using an array of size MAX_SIZE, gets full [ ]

when?
a) Rear = MAX_SIZE – 1 b) Front = (rear + 1)mod MAX_SIZE
c) Front = rear + 1 d) Rear = front

7. Circular Queue is also known as ________ [ ]

a) Ring Buffer b) Square Buffer c) Rectangle Buffer d) Curve Buffer