Sail E0 Webinar

MCQs

Total Questions : 57 | Page 4 of 6 pages
Question 31. Arrays are best data structures for
  1.    relatively permanent collections of data
  2.    the size of the structure and the data in the structure are constantly changing
  3.    both of above situation
  4.    none of above situation
 Discuss Question
Answer: Option A. -> relatively permanent collections of data
Question 32. The term “push” and “pop” is related to the
  1.    Array
  2.    Lists
  3.    stacks
  4.    all of above
 Discuss Question
Answer: Option C. -> stacks
Question 33. A binary tree whose every node has either zero or two children is called
  1.    Complete binary tree
  2.    Binary search tree
  3.    Extended binary tree
  4.    None of above
 Discuss Question
Answer: Option C. -> Extended binary tree
Question 34. The complexity of the average case of an algorithm is
  1.    Much more complicated to analyze than that of worst case
  2.    Much more simpler to analyze than that of worst case
  3.    Sometimes more complicated and some other times simpler than that of worst case
  4.    None of the above
 Discuss Question
Answer: Option A. -> Much more complicated to analyze than that of worst case
Question 35. The complexity of Bubble sort algorithm is
  1.    O(n)
  2.    O (n 2 )
  3.    O(n log n)
  4.    None of the above
 Discuss Question
Answer: Option B. -> O (n 2 )
Question 36. The Worst case occur in linear search algorithm when
  1.    Item is not in the array at all
  2.    Item is the last element in the array
  3.    Item is the last element in the array or is not there at all
  4.    None of above
 Discuss Question
Answer: Option C. -> Item is the last element in the array or is not there at all
Question 37. The following data structure allows deleting data elements from front and inserting at rear
  1.    Stacks
  2.    Queues
  3.    Deques
  4.    Binary search tree
 Discuss Question
Answer: Option B. -> Queues
Question 38. The following sorting algorithm is of divideand-conquer type
  1.    Bubble sort
  2.    Insertion sort
  3.    Quick sort
  4.    None of the above
 Discuss Question
Answer: Option B. -> Insertion sort
Question 39. Which of the following data structure is not linear data structure?
  1.    Arrays
  2.    Linked lists
  3.    A and B are true
  4.    None is true
 Discuss Question
Answer: Option C. -> A and B are true
Question 40. The following data structure is linear type
  1.    Strings
  2.    Lists
  3.    Queues
  4.    All of the above
 Discuss Question
Answer: Option D. -> All of the above

Latest Videos

Latest Test Papers