DATA STRUCTURE FOR STUDENTS

1. When there is no more memory space left to insert a new data item in a list, the situation is known as –
a. AVAIL
b. NULL
c. FULL
d. OVERFLOW
2. In case of LINKED LIST data structure, the essential field of a node is –
a. Data
b. Item
c. Address
d. Link
3. Array is a non – linear data structure used to store polynomials. The above statement is –
a. TRUE
b. FALSE
c. NONE
4. Let A be an M×N matrix and B be a Q×R matrix. Then when multiply two matrices if and only if –
a. M = N
b. M = P
c. N = Q
d. R = N
5. When we insert a new data item in a QUEUE data structure, the operation is referred as –
a. Insert
b. Push
c. Enqueue
d. Dequeue
6. Let A be a linear array and its upper bound = 1984 and lower bound = 1930. Then the length of the array is –
a. 51
b. 52
c. 54
d. 55
7. In case of declaration of an ARRAY data structure, the information that must be provided are –
a. The name of the ARRAY
b. The data type of the ARRAY
c. The index set
d. The storage type
8. In BUBBLE SORT algorithm, the number of the comparison required in Kth numbered step is –
a. K
b. K – 1
c. N – 1
d. N – K
Where N is the number of elements.
9. Binary search cannot be applied to LINKED LIST, because –
a. Linked list is not stored
b. No way to determine the middle element
c. Each node contains a pointer field
d. Nodes are not stored in sequential number
10. A row in a two – dimensional array is –
a. Vertical list of elements
b. Linear list of elements
c. Horizontal list of elements
d. Subset of the array
11. Two – dimensional ARRAY can be represented in the memory by using –
a. Row – major representation
b. Column – major representation
c. Row divided by Column
d. Non – linear representation
12. The major differences between RECORDS and ARRAY is –
a. Records require more memory space than Array
b. Records contain less data items than Array
c. Array contains homogenous data item whereas Records contains non – homogenous
d. Array is stored sequentially but Records are stored randomly.
13. In STACK we use a special pointer to access the data elements. This is called –
a. FRONT
b. REAR
c. TOP
d. AVAIL
14. Let Lower bound if an ARRAY is defined as 300 and the ARRAY has 62 elements. Then the Upper bound of the array will be –
a. 362
b. 363
c. 361
d. 364
15. In LINKED LIST, a NODE allocates memory space by using a special function. The function is –
a. Calloc ()
b. Malloc ()
c. Alloc ()
d. Cmalloc ()
16. Together with the linked list in memory, a special is maintained which consists of unused memory cells. This list is called –
a. List of available space
b. Free storage list
c. Free pool
d. Garbage collection
17. If any data s attempted to delete from an empty list, then it is known as –
a. Free pool
b. Underflow
c. Overflow
d. Deletion