Question

1.) A class template can be derived from a non-template class

True or False

2.) Inaccessible pointer is a potential problem on simple linked list

True or False

3.) Array based lists are faster in term of acing data

True or False

4.) Simple linked lists use less space than double linked lists

True or False

5.) For large lists "array based lists" are more efficient for insertion and deleting operational

True or False

6.) We can remove data only from front of array based

True or False

7.) Insertion into a linked list takes the same number of operations no matter where the insertion occurs

True or False

8.) Array based lists are not fixed in size

True or False

Answer 1

1.) True
       Exp
       A non-template class can be derived from a class template
       A template class can be derived from a class template
       A class template can be derived from a non-template class.
      

2.) True
       Exp
       Pointer potential problem on simple Linked list problems are really about pointers.
       The simple linked list structure itself is obviously pointer intensive.

3.) True
  
   Exp
   An Array Based List Usually is statically allocated;
   may not use memory efficiently Direct access to data; So faster Acing data
  
4.) True
   Exp
   Simple linked lists use long space as rest of the elements need to be
   shifted to make space for new Element