Sail E0 Webinar

MCQs

Total Questions : 57 | Page 2 of 6 pages
Question 11. The situation when in a linked list START=NULL is
  1.    Underflow
  2.    Overflow
  3.    Housefull
  4.    Saturated
 Discuss Question
Answer: Option A. -> Underflow
Question 12. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
  1.    Elementary items
  2.    Atoms
  3.    Scalars
  4.    All of above
 Discuss Question
Answer: Option D. -> All of above
Question 13. To represent hierarchical relationship between elements, the following data structure is not suitable
  1.    Deque
  2.    Priority
  3.    Tree
  4.    All of above
 Discuss Question
Answer: Option C. -> Tree
Question 14. An algorithm that calls itself directly or indirectly is known as
  1.    Recursion
  2.    Polish notation
  3.    raversal algorithm
  4.    None of the above
 Discuss Question
Answer: Option A. -> Recursion
Question 15. Binary search algorithm cannot be applied to
  1.    Sorted binary trees
  2.    Sorted linear array
  3.    Pointer array
  4.    Sorted linked list
 Discuss Question
Answer: Option D. -> Sorted linked list
Question 16. The indirect change of the values of a variable in one module by another module is called
  1.    internal change
  2.    inter-module change
  3.    side effect
  4.    all the above
 Discuss Question
Answer: Option C. -> side effect
Question 17. Linked lists are best suited 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 B. -> the size of the structure and the data in the structure are constantly changing
Question 18. In a Heap tree values in a node is greater than
  1.    every value in left sub tree and smaller than right sub tree
  2.    every value in children of it
  3.    Both of above conditions are true
  4.    None of above conditions are true
 Discuss Question
Answer: Option B. -> every value in children of it
Question 19. A connected graph T without any cycles is called
  1.    tree graph
  2.    free tree
  3.    tree
  4.    All of the above
 Discuss Question
Answer: Option D. -> All of the above
Question 20. Finding the location of the element with a given value is called
  1.    Traversal
  2.    Search
  3.    Sort
  4.    All of the above
 Discuss Question
Answer: Option B. -> Search

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