Q.1
A linear collection of data elements where the linear node is given by means of pointer is called?
  • linked list
  • node list
  • primitive list
  • none
Q.2
A variant of the linked list in which none of the node contains NULL pointer is?
  • singly linked list
  • doubly linked list
  • circular linked list
  • none
Q.3
Two main measures for the efficiency of an algorithm are
  • processor and memory
  • complexity and capacity
  • time and space
  • data and space
Q.4
In linked list,the logical order of elements
  • is same as their physical arrangement
  • is not necessarily equivalent to their physical arrangement
  • is determined by their physical arrangement
  • none of the above
Q.5
The complexity of linear search algorithm is
  • o(n)
  • o(log n)
  • o(n2)
  • o(n log n)
Q.6
A data structure where elements can be added or removed at either end but not in the middle is referred as
  • Linked lists
  • Stacks
  • Queues
  • Deque
Q.7
The indirect change of the values of a vari- able in one module by another module is called
  • internal change
  • inter-module change
  • side effect
  • all the above
Q.8
In C, if you pass an array as an argument to a function, what actually gets passed?
  • value of elements in array
  • first element of the array
  • base address of the array
  • address of the last element of array
Q.9
The keyword used to transfer control from a function back to the calling function is
  • switch
  • goto
  • go back
  • return
Q.10
The space factor when determining the efficiency of algorithm is measured by
  • counting the maximum memory needed by the algorithm
  • counting the minimum memory needed by the algorithm
  • counting the average memory needed by the algorithm
  • counting the maximum disk space needed by the algorithm
Q.11
Which of the following is not the required condition for binary search algorithm
  • there must be mechanism to delete and/ or insert elements in list
  • the list must be sorted
  • there should be the direct access to the middle element in any sublist
  • none of the above
Q.12
In a Heap tree values in a node is greater than
  • every value in left sub tree and smaller than right sub tree
  • every value in children of it
  • Both of above conditions are true
  • None of above conditions are true
Q.13
A binary tree whose every node has either zero or two children is called
  • Complete binary tree
  • Binary search tree
  • Extended binary tree
  • None of above
Q.14
A node of doubly linked contains
  • pointer to predecessor
  • pointer to sucessor
  • both (a)and(b)
  • only(a)
Q.15
Select the set of operations to delete the first node from a linked list
  • p=head;head=head->next;free(p);
  • free(head)
  • head=head->next;p=head;free(p)
  • none of these
Q.16
Select the set of operations to insert a node pointed by q at the beginning of the linked list
  • q->next=head; head=q;
  • head=q;q ->next=head;
  • both (a)and(b)
  • none of these
Q.17
Select the set of instructions to insert a node pointed by q after a node pointed by p
  • q->next=p->next; p->next=q;
  • p->next=q; q->next=p->next
  • both (a)and(b)
  • none of these
Q.18
Which nodes contains a null pointer in a linked list?
  • first node
  • middle node
  • last node
  • both (a) and (b)
Q.19
A node in a linked list must contain at least
  • three fields
  • two fields
  • four fields
  • one field
Q.20
Uncompressed video requires a ________ data rate.
  • high
  • low
  • medium
  • very high
0 h : 0 m : 1 s