Multiple Choice Questions On Data Structure | UGC NET Exam 2012 Sample

Monday, 23 April 2012

1)What is Data Structure ?
  1. Way to organize data
  2. Accessing of data elements in specified manner
  3. Organization of mathematical and logical concepts
  4. All of Above
Show/Hide Answer
Answer = D 
Explanation:A Data Structure may be organized in different ways : The logical or mathematical model of a particular organization of data is called Data Structure.

2) Which operation is not possible on Data Structure ?
  1. Traversing
  2. Insertion
  3. Reading
  4. Deletion
Show/Hide Answer
Answer = C 
Explanation:Possible operations on the Data Structure are Traversing, Insertion, Searching and Deletion.

3) The memory address of the first element is called ?
  1. Floor Address
  2. Foundation Address
  3. First Address
  4. Base Address
Show/Hide Answer
Answer = D 
Explanation:The memory address of the first element is often called base address in Data Structure.

4) The value of first linked list address is ?
  1. 0
  2. -1
  3. 1
  4. None of Above
Show/Hide Answer
Answer = 0 
Explanation: No explanation for this question.

5) Two dimensional arrays are also called ?
  1. Matrix Array
  2. Table Array
  3. Both a and b
  4. None of the Above
Show/Hide Answer
Answer = C 
Explanation:Two dimensional arrays are called as matrix array and table arrays because they contains rows and columns.

6) The situation in linked list START=NULL is called ?
  1. Overflow
  2. Underflow
  3. Both of above
  4. None of Above
Show/Hide Answer
Answer = B 
Explanation:It is the situation when we are trying to delete an item from the empty linked list.

7) Length of the linear array can be found by using the formula ?
  1. UB - LB + 1
  2. LB + UB
  3. LB - UB
  4. LB - UB + 1
Show/Hide Answer
Answer = A 
Explanation:The length of linear array can be found by using UB - LB + 1 Where UB is upper Bound, LB is Lower Bound of the array.
8) The restriction while using the binary search is ?
  1. List should be small in number
  2. List should be large in number
  3. List should be sorted
  4. No restriction
Show/Hide Answer
Answer = C 
Explanation: Binary search can be applied to a list only if the list is  either in ascending or descending order.

9) The terms PUSH and POP are related to ?
  1. Arrays
  2. Stacks
  3. Linked List
  4. None
Show/Hide Answer
Answer = B 
Explanation:PUSH is used for inserting an element into the stack and POP is used for deleting an elements from the stack.

10) The operation of processing element is called ?
  1. Traversing
  2. Inserting
  3. Deleting
  4. Searching
Show/Hide Answer
Answer = A
Explanation:Traversing means visiting or processing each element exactly once.

Do You Like This? Please take 5 seconds to share with your firends.