Sail E0 Webinar

MCQs

Total Questions : 36 | Page 3 of 4 pages
Question 21.
What is the least no. of spanning trees possible using a complete graph with n vertices?



  1.    n!
  2.    2^n-1
  3.    2^(n-1)-1
  4.    (2n)!/((n+1)*n!*n!)
 Discuss Question
Answer: Option C. -> 2^(n-1)-1


Question 22.
Structure of threaded binary tree :



  1.    Reduces the complexity of different operations
  2.    optimize the complexity of different operations
  3.    Increase the complexity of different operations
  4.    None of these
 Discuss Question
Answer: Option D. -> None of these


Question 23.
For a n-node binary tree if it is given that binary tree has maximum
possible leaves, what would be the maximum possible height of the tree:



  1.    O(n)
  2.    O((n-1)/2)
  3.    O(nlogn)
  4.    O(log n)
 Discuss Question
Answer: Option B. -> O((n-1)/2)


Question 24.
For a directed graph with n vertices maximum no. of possible edges is:



  1.    n^2
  2.    n(n-1)/2
  3.    n(n+1)/2
  4.    n(n-1)
 Discuss Question
Answer: Option D. -> n(n-1)

If you have N nodes, there are N - 1 directed edges than can lead from it (going to every other node). Therefore, the maximum number of edges is N * (N - 1).



Question 25.
Number of distinct binary trees with 7 nodes:



  1.    121
  2.    128
  3.    429
  4.    5040
 Discuss Question
Answer: Option C. -> 429


Question 26.
Which among the following data structure is used to store data on secondary



  1.    B+ Tree
  2.    Digital Search Tree
  3.    Splay Tree
  4.    Red Black tree
 Discuss Question
Answer: Option A. -> B+ Tree


Question 27.
In hashing load factor α is defined as n/m where n is the no. of
elements and m is the no. of slots. In a hash table in which collisions
are resolved by chaining, what is the expected time for an
unsuccessful search and a successful search under the assumption of
simple uniform hashing?



  1.    Î˜(logα), Θ(logα)
  2.    Î˜(nα), Θ(logα)
  3.    Î˜(logα), Θ(1+α)
  4.    Î˜(1+α), Θ(1+α)
 Discuss Question
Answer: Option D. -> Θ(1+α), Θ(1+α)


Question 28.
For a n-node binary tree if its given that binary tree has maximum
possible leaves, what would be the maximum possible height of the
tree:



  1.    O(n)
  2.    O((n-1)/2)
  3.    O(n log n)
  4.    O(log n)
 Discuss Question
Answer: Option A. -> O(n)


Question 29.

Let A, B, C, D.. are addresses of structures which are shown below
by boxes, each structure has data part and an address part xor
represents XOR of two.


Let A, B, C, D.. Are Addresses Of Structures Which Are Show...

Let A, B, C, D.. Are Addresses Of Structures Which Are Show...


With above information, the list can be traversed:
  1.    only L-R
  2.    only R-L
  3.    in both directions
  4.    in any direction but not both
 Discuss Question
Answer: Option C. -> in both directions


Question 30.
Which of the following sorting methods has least best case complexity



  1.    Bubble
  2.    Insertion
  3.    Merge
  4.    Quick
 Discuss Question
Answer: Option A. -> Bubble


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

DSP Combined 1 Free Revision Test SAIL JO E-0
GPOE / GPA Combined 1 Free Revision Test SAIL JO E-0
BSP Plant Specific Review Test SAIL JO E-0
BSL Combined 1 Free Revision Test SAIL JO E-0
GFM Combined 1 Free Revision Test SAIL JO E-0