If for an algorithm time complexity is given by O(n) then complexity of it is:

• linear

• exponential

• constant

• none of the mentioned

Data in the data structures are processed by operations like insertion, deletion, sorting, merging and ______________

• A. Traversing

• B. Searching

• C. Retrieval

• D. Both A and B

If the insertion and deletion happens from both the ends then the deletion is called a ______

• Deque

• Enqueue

• peek

• full

Process of inserting an element in stack is called

• Insert

• Pop

• Overflow

• Push

If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

• CBA

• ABDC

• ABCD

• DCAB

What does the following function do for a given Linked List with first node as head?

void fun1(struct node* head)

{

if(head == NULL)

return;

fun1(head->next);

printf("%d ", head->data);

}

• Prints all nodes of linked lists

• Prints alternate nodes of Linked List

• Prints all nodes of linked list in reverse order

• Prints alternate nodes in reverse order

. Match the following.

a) Completeness i) How long does it take to find a solution

b) Time Complexity ii) How much memory need to perform the search.

c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in one.

• a-iii, b-i, c-ii

• a-i, b-ii, c-iii

• a-i, b-iii, c-ii

• a-iii, b-ii, c-i

Efficiency of an algorithm is measured by

• Time and Space complexity

• Speed and Capacity complexity

• Speed and Space complexity

• Time and Capacity complexity

Which of the following data structures are mutable?

• Array

• List

• Tuple

• Enum

The algorithm implemented in a stack is?

• FIFO- the first element must come out first from the list

• WIFI - the worst element must be the first to come in to the list

• LIFO - the last element must be the first to come out from the list

• all of the above