Sail E0 Webinar

MCQs

Total Questions : 57 | Page 5 of 6 pages
Question 41. The in order traversal of tree will yield a sorted listing of elements of tree in
  1.    Binary trees
  2.    Binary search trees
  3.    Heaps
  4.    None of above
 Discuss Question
Answer: Option B. -> Binary search trees
Question 42. When in order traversing a tree resulted E A C K F H D B G; the preorder traversal would return
  1.    FAEKCDBHG
  2.    FAEKCDHGB
  3.    EAFKHDCBG
  4.    FEAKDCHBG
 Discuss Question
Answer: Option B. -> FAEKCDHGB
Question 43. When converting binary tree into extended binary tree, all the original nodes in binary tree are
  1.    internal nodes on extended tree
  2.    external nodes on extended tree
  3.    vanished on extended tree
  4.    None of the above
 Discuss Question
Answer: Option A. -> internal nodes on extended tree
Question 44. This data structure allows deletions at both ends of the list but insertion at only one end.
  1.    Input-restricted deque
  2.    Output-restricted deque
  3.    Priority queues
  4.    None of the above
 Discuss Question
Answer: Option A. -> Input-restricted deque
Question 45. Which of the following is not a limitation of binary search algorithm ?
  1.    binary search algorithm is not efficient when the data elements are more than 1000.
  2.    must use a sorted array
  3.    requirement of sorted array is expensive when a lot of insertion and deletions are needed
  4.    there must be a mechanism to access middle element directly
 Discuss Question
Answer: Option A. -> binary search algorithm is not efficient when the data elements are more than 1000.
Question 46. Each array declaration need not give, implicitly or explicitly, the information about the
  1.    name of array
  2.    data type of array
  3.    first data from the set to be stored
  4.    index set of the array
 Discuss Question
Answer: Option C. -> first data from the set to be stored
Question 47. The operation of processing each element in the list is known as
  1.    Merging
  2.    Inserting
  3.    Traversal
  4.    All the above
 Discuss Question
Answer: Option C. -> Traversal
Question 48. The complexity of Binary search algorithm is
  1.    O(n)
  2.    O(log )
  3.    O(n log n)
  4.    None of the above
 Discuss Question
Answer: Option B. -> O(log )
Question 49. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
  1.    ABFCDE
  2.    ADBFEC
  3.    ABDECF
  4.    None of the above
 Discuss Question
Answer: Option C. -> ABDECF
Question 50. The complexity of merge sort algorithm is
  1.    O(n)
  2.    O(log n)
  3.    O(n log n)
  4.    None of these
 Discuss Question
Answer: Option C. -> O(n log n)

Latest Videos
Chapter 1 - GLOBAL STEEL SCENARIO & INDIAN STEEL INDUSTRY Part 1 : (13-04-2024) INDUSTRY AND COMPANY AWARENESS (ICA)
Direction Sense Test Part 1 Reasoning (Hindi)
Chapter 1 - RMHP / OHP / OB & BP Part 1 : (14-02-2024) GPOE
Cube & Cuboid Part 1 Reasoning (Hindi)
Data Interpretation (DI) Basic Concept Reasoning (Hindi)
Counting Figures Part 1 Counting Of Straight Lines Reasoning (Hindi)
Sail E0 free webinar Webinars
Real Numbers Part 7 Class 10 Maths
Real Numbers Part 1 Class 10 Maths
Polynomials Part 1 Class 10 Maths

Latest Test Papers

Pie Chart - Test Paper 1 Data Interpretation Reasoning & DI
Tabulation - Test Paper 2 Data Interpretation Reasoning & DI
Test Paper 1 Direction Sense Test Reasoning & DI
ICA , RDIC,GFM Free Modal Test Paper - Non - Technical Branch Old Syllabus 2022 - SAIL Junior Officer E0
GFM Combined 1 Free Revision Test SAIL JO E-0