# Placement papers on Data Structure - Set 3

## Placement papers on Data Structure - Set 3

1. The complexity of Bubble sort algorithm is

O(n)
O(log n)
O(n2)
O(n log n)

2. The data structure required to evaluate a postfix expression is

queue
stack
array

3. The indirect change of the values of a variable in one module by another module is called

internal change
inter-module change
side effect
side-module update

4. The process of accessing data stored in a serial access memory is similar to manipulating data on a

heap
queue
stack
binary tree

5. Which of the following data structure is linear data structure?

Trees
Graphs
Arrays
None of above

6. The operation of processing each element in the list is known as

Sorting
Merging
Inserting
Traversal

7. Finding the location of the element with a given value is:

Traversal
Search
Sort
None of above

8. A BST is traversed in the following order recursively: Right, root, left
The output sequence will be in

Ascending order
Descending order
Bitomic sequence
No specific order

9. Linked lists are best suited

for relatively permanent collections of data
for the size of the structure and the data in the structure are constantly changing
for both of above situation
for none of above situation

ANSWER: for the size of the structure and the data in the structure are constantly changing

10. Each array declaration need not give, implicitly or explicitly, the information about

the name of array
the data type of array
the first data from the set to be stored
the index set of the array

ANSWER: the data type of array

11. A binary tree of depth “d” is an almost complete binary tree if

Each leaf in the tree is either at level “d” or at level “d–1”
For any node “n” in the tree with a right descendent at level “d” all the left descendents of “n” that are leaves, are also at level “d”
Both (A) and (B)
None of the above

12. Which of the following is not a limitation of binary search algorithm?

must use a sorted array
requirement of sorted array is expensive when a lot of insertion and deletions are needed
there must be a mechanism to access middle element directly
binary search algorithm is not efficient when the data elements are more than 1000.

ANSWER: binary search algorithm is not efficient when the data elements are more than 1000.

13. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

Input-restricted deque
Output-restricted deque
Priority queues
None of above

14. Which of the following data structure is non-linear type?

Strings
Lists
Stacks
None of above

15. Which of the following data structure is linear type?

Strings
Lists
Queues
All of above

#### Discussion

• RE: Placement papers on Data Structure - Set 3 -Shruti Jain (08/02/19)
• 7. Finding the location of the element with a given value is:
Search
• RE: Placement papers on Data Structure - Set 3 -shruti jain (08/02/19)
• The data structure required to evaluate postfix expression is-
Ans:-Stack
• RE: Placement papers on Data Structure - Set 3 -Dheeraj kumar (07/02/15)
• 1. The complexity of Bubble sort algorithm is
o(n2) in avg case
• RE: Placement papers on Data Structure - Set 3 -Dheeraj kumar (07/02/15)
• q.6 The operation of processing each element in the list is known as
traversal