1.

A data structure where elements can be added or removed at either end but not in the middle
DEQUE

QUEUE

STACK

LINKED LIST

2.Which of the following case does not exist in complexity theory

NULL CASE

WORST CASE

BEST CASE

AVERAGE CASE

3.Two main measures for the efficiency of an algorithm are

PROCESSOR & MEMORY

TIME & SPACE COMPLEXITY & CAPACITY DATA & SPACE

4.The Worst case occur in linear search algorithm when:

Item is somewhere in the middle of the array
Item is the last element in the array or is not there at all

Item is not in the array at all

Item is the last element in the array

5.The Average case occur in linear search algorithm

When Item is not in the array at all
When Item is the last element in the array or is not there at all
When Item is the last element in the array
When Item is somewhere in the middle of the array
6.The situation when START=NULL in linked list is
UNDERFLOW
HOUSEFULL

SATURATED

OVERFLOW

7.The complexity of linear search algorithm is

a. O(n)

b. O(log n)

c. O(n2)

8.The complexity of Binary search algorithm is

a. O(n)
b. O(log )
c. O(n2)
9.The complexity of Bubble sort algorithm is
a. O(n)
b. O(log n)
c. O(n2)
10. The complexity of merge sort algorithm is
a. O(n)
b. O(log n)
c. O(n2)

d. O(n log n)

d. O(n log n)

d. O(n log n)

d. O(n log n)

11.Identify the data structure which allows deletions at both ends of the list but insertion
at only one end.
Output-restricted deque

Inputed restricted Queue

Priority Queue

NONE

12.What is Data Structure ?

Way to organize data
Accessing of data elements in specified manner
Organization of mathematical and logical concepts
All of Above
13.Which operation is not possible on Data Structure ?
Traversing
Insertion
Deletion

Reading

14.Which of the following sorting algorithm is of divide-and-conquer type?

a. Bubble sort
Insertion sort
Quick sort
All of above
15. The space factor when determining the efficiency of algorithm is measured by
a. Counting the maximum memory needed by the algorithm
b. Counting the minimum memory needed by the algorithm
c. Counting the average memory needed by the algorithm
d. Counting the maximum disk space needed by the algorithm

15. Which of the following data structure store the homogeneous data elements?
a. Arrays
b. Records
c. Pointers
d. None
16.A data structure where elements can be added or removed at either end but not in the middlea.
Linked lists
b. Stacks
c. Queues
d. Deque
17algorithm that calls itself directly or indirectly is known as
a. Sub algorithm
b. Recursion c. Polish notation d. Traversal algorithm
18.What is Data Structure ?
a. Way to organize data
c. Accessing of data elements in specified manner
b. Organization of mathematical and logical concepts
d.
All of Above
19.To represent hierarchical relationship between elements, which data structure is suitable?
a. Deque
b. Priority
c. Tree
d. All of above
20.The end of linked list is pointed by
start end NULL top
21.The memory address of the first element is called ?
a. Floor Address Foundation Addres First Address

Base Address

22.Length of the linear array can be found by using the formula ?

a. UB - LB + 1
LB + UB
LB UB
LB - UB + 1
23.. The restriction while using the binary search is ?
a. List should be small in number
b.List should be large in number
c. List should be sorted
d.No restriction
24. The terms PUSH and POP are related to ?
a. Arrays
Stacks
Linked List
26.. The operation of processing element is called ?
a. Traversing
Inserting
Deleting
27.The pre-order traversal of a tree is:

a.root-left child-right child

b. left child-root-right child

c. left child-right child-root

d.none

None
Searching