Sail E0 Webinar

MCQs

Total Questions : 57 | Page 6 of 6 pages
Question 51. In a graph if e=(u, v) means
  1.    e begins at u and ends at v
  2.    u is processor and v is successor
  3.    both B and C are true
  4.    none is true
 Discuss Question
Answer: Option C. -> both B and C are true
Question 52. The depth of a complete binary tree is given by
  1.    D n = n log 2 n
  2.    Dn = n log 2 n+1
  3.    D n = log 2 n
  4.    D n = log 2 n+1
 Discuss Question
Answer: Option D. -> D n = log 2 n+1
Question 53. Which of the following is not the required condition for binary search algorithm
  1.    there must be mechanism to delete and/ or insert elements in list
  2.    the list must be sorted
  3.    there should be the direct access to the middle element in any sublist
  4.    none of the above
 Discuss Question
Answer: Option A. -> there must be mechanism to delete and/ or insert elements in list
Question 54. The memory address of fifth element of an array can be calculated by the formula
  1.    LOC(Array[5])=Base(Array[5])+(5-lower boun(D), where w is the number of words per memory cell for the array
  2.    LOC(Array[5])=Base(Array[4])+(5-Upper boun(D), where w is the number of words per memory cell for the array
  3.    LOC(Array[5]=Base(Array)+w(5-lower boun(D), where w is the number of words per memory cell for the array
  4.    None of the above
 Discuss Question
Answer: Option C. -> LOC(Array[5]=Base(Array)+w(5-lower boun(D), where w is the number of words per memory cell for the array
Question 55. When representing any algebraic expression E the following uses only binary operations in a 2-tree
  1.    the variable in E will appear as external nodes and operations in internal nodes
  2.    the operations in E will appear as external nodes and variables in internal nodes
  3.    the variables and operations in E will appear only in internal nodes
  4.    None of the above
 Discuss Question
Answer: Option A. -> the variable in E will appear as external nodes and operations in internal nodes
Question 56. If every node u in G is adjacent to every other node v in G, A graph is said to be
  1.    Isolated
  2.    Complete
  3.    Finite
  4.    Strongly connected
 Discuss Question
Answer: Option B. -> Complete
Question 57. Two dimensional arrays are also called
  1.    tables arrays
  2.    matrix arrays
  3.    both of the above
  4.    none of the above
 Discuss Question
Answer: Option C. -> both of the above

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