Sail E0 Webinar

MCQs

Total Questions : 57 | Page 3 of 6 pages
Question 21. In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in tree for efficiency. These special pointers are called
  1.    Leaf
  2.    Branch
  3.    Path
  4.    Thread
 Discuss Question
Answer: Option D. -> Thread
Question 22. Which of the following statement is false ?
  1.    Arrays are dense lists and static data structure
  2.    Data elements in linked list need not be stored in adjacent space in memory
  3.    Pointers store the next data element of a list
  4.    Linked lists are collection of the nodes that contain information part and next pointer
 Discuss Question
Answer: Option C. -> Pointers store the next data element of a list
Question 23. The following data structure is non-linear type
  1.    Strings
  2.    Lists
  3.    Stacks
  4.    None of the above
 Discuss Question
Answer: Option D. -> None of the above
Question 24. The elements of an array are stored successively in memory cells because
  1.    by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
  2.    the architecture of computer memory does not allow arrays to store other than serially
  3.    A and B both false
  4.    A and B both true
 Discuss Question
Answer: Option A. -> by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
Question 25. The time factor when determining the efficiency of algorithm is measured by
  1.    Counting the number of key operations
  2.    Counting the number of statements
  3.    Counting the kilobytes of algorithm
  4.    None of the above
 Discuss Question
Answer: Option A. -> Counting the number of key operations
Question 26. The memory address of the first element of an array is called
  1.    base address
  2.    floor address
  3.    foundation address
  4.    first address
 Discuss Question
Answer: Option A. -> base address
Question 27. In a graph if e=[u, v], Then u and v are called
  1.    endpoints of e
  2.    adjacent nodes
  3.    neighbors
  4.    all of the above
 Discuss Question
Answer: Option D. -> all of the above
Question 28. The Average case occur in linear search algorithm
  1.    When Item is somewhere in the middle of the array
  2.    When Item is not in the array at all
  3.    When Item is the last element in the array
  4.    All the above
 Discuss Question
Answer: Option A. -> When Item is somewhere in the middle of the array
Question 29. Which of the following data structures are indexed structures
  1.    linear arrays
  2.    linked lists
  3.    both of above
  4.    none of above
 Discuss Question
Answer: Option A. -> linear arrays
Question 30. The difference between linear array and a record is
  1.    An array is suitable for homogeneous data but the data items in a record may have different data type
  2.    In a record, there may not be a natural ordering in opposed to linear array.
  3.    A record form a hierarchical structure but a linear array does not
  4.    All of above
 Discuss Question
Answer: Option D. -> All of 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