1. The main advantage of the array data structure is ..................

Elements of an array cannot be sorted
Easier to access the elements in an array
Elements of mixed data types can be stored
2. A linked list is made up of a set of objects known as
 nodes
arrays
entities
3. A complete directed graph of 5 nodes has..
4. A double linked list contains reference to _____

previous node
next node
current node
5. The minimum number of edges in a connected cyclic graph on n vertices is

n1
n
n+1
6. A vertex with degree one in a graph is called

leaf
pendant vertex
end vertex
7.…………… is not the component of data structure.

operations
storage structures
algorithms
8. Which of the following data structure can’t store the nonhomogeneous data elements?

arrays
records
pointers
9. When the push operation is performed on stack the value of TOS will be ______

decrement
increment
one
10. A machine took 200 sec to sort 200 names, using bubble sort. In 800 sec, it can approximately sort

400 names
800 names
750 names
11. The number of binary trees with 3 nodes which when traversed in postorder gives the sequence A,B,C is
12. A queue where all elements have equal priority is a

ILFO data structure
LILO data structure
FIFO data structure
13.A file that is only read by a program is known as ____

Input file
Temporary file
Work file
14. Which of the following is not an entity?

Book
Student
Employee
15. A purpose in algorithm needs to describe___.

Program Execution
Processing
Requirements
16. Memory allocation at the compile time is known as

Static memory allocation
Dynamic memory allocation
Paging
17. If a binary tree satisfies shape and order property, it is known as

Rooted tree
Heap
Sequential search tree
18. Which of the following is not the part of ADT description ?

data
operations
both of the above
19. Which of the following is nonliner data structure?

stacks
list
strings
20. The total number of elements in a stack at a given point of time can be calculated from the value of______.

overflow
top
queues
21. Stack is useful for implementing

recursion
breadth first search
depth first search
22. The average number of comparisons performed by the merge sort algorithm, in merging two sorted lists of length 2 is

8/3
8/5
11/7
23. Which of the following sorting algorithm is the slowest ?

Bubble sort
Heap sort
Shell sort
24. Worst space complexity of stack data structure is

o(log(n))
o(1)
n/a
25.An enqueue operation adds an element

At any position in the queue
To the front of the queue
To the rear of the queue
26. Memory allocation at the runtime is known as

Static memory allocation
Dynamic memory allocation
Paging
27. With an arraybased stack, the algorithm for push is

Increment top and add item to the new top location
Add item to the top location and then increment top
Return the top item and increment top
28. What happens when the stack is full and there is no space for a new element, and an attempt is made to push a new element?

overflow
underflow
top
29. The maximum degree of any vertex in a simple graph with n vertices is

n
n1
n+1
30. Which f the following need not be a binary tree ?

Search tree
Heap
AVLTree
Post a Comment
0 Comments