Multiple-choice Questions 01 Which notation provides a tight lower bound for f(n)? (a) Omega notation (b) Big O notation (c) Small o notation (d) Theta Notation 02 An "algorithm" is a formally define design to write a program to solve a particular problem (a) True (b) False 03 The size of a union is equal to (a) size of the largest element in the union (b) size of the smallest element in the union (d) combination of all the element of union (d) none of the above 04 Which of the following is a User-defined data type? (a) int (b) float (c) pointer (d) Array 05 Which data structure is used to represent relationships between the nodes (a) Arrays (b) Linked lists (c) Trees (d) Graphs 06 Which of the following declaration is not supported by C? (a) char name (c) char name[20] 07 struct node (b) char *string (d) Boolean int i; float struct node *s[10]: The above C declaration define 's' to be (a) An array, each element of which is a structure of type node (b) A structure of 2 fields, each field being a pointer to an array of 10 elements (c) A structure of 3 fields: an integer, a float, and an array of 10 elements (d) An array, each element of which is a pointer to a structure of type node 08 Which of the following is a valid variable name (a) 1name (b) char (c)_grade (d) %number 09 Which data structure is defined as a collection of similar data elements? (a) Arrays (b) Linked lists (c) Trees (d) Graphs