Practise -Quiz Data Structures

1. Representation of data structure in memory is known as:
a). Recursion   b). File Structure  c). ADT   d). asymptotic-notation

2.What is the time complexity of creating a new node of a linked list?
a). O(1)  b).O(n)   c). O(n^2)    d). depends on size of linked list

3.An ADT is defined to be a mathematical model of a user-defined type along
with the collection of all ____________ operations on that model.
a)cardinality  b) primitive  c)structured  d)assignment

4. A dynamic data structure allocates the memory for elements dynamically at
runtime.   True / False

5. Choose the correct statement about the characteristics of ADT?
  i) It exports a type.  ii) It exports a set of operations.
a)i only  b) ii only  c)i & ii both   d)None

6. Finding the location of the element with a given value is:
a)searching  b)sorting   c)recursion   d)indexing

7. Sequential search algorithm would make N/2 number of comparisons for a list
of size N? TRUE /FALSE

8.Binary search divides the array size to half at each iteration, it means it
 would make N/2 number of comparisons for a list of size N? TRUE /FALSE


ANSWERS
1.c    2.a  3.b  4.T  5.c   6.a  7.F   8.F