Trees MCQ

Test your knowledge with important Trees MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Trees MCQs at Bissoy

• Prefix expression can be evaluated _________
  ক

  from right to left

  খ

  from left to right

  গ

  from the exact middle

  ঘ

  from second right element
• What is the postfix expression of the given expression, (2*4-(5+7/3^4)-8)10?
  ক

  2 4 5 * 7 3 4 ^ / + 8 – – 10

  খ

  2 4 * ^ 5 7 3 4 / + 8 10 – –

  গ

  2 4 * 5 7 ^ 3 4 / + – 8 10 –

  ঘ

  2 4 * 5 7 3 4 ^ / + – 8 – 10
• What is the postfix expression of (A+B)-C*(D/E))+F?
  ক

  A B + C D E / * – F +

  খ

  A B C D E + / * F – +

  গ

  A B C + * D E / F + –

  ঘ

  A B + C – * D E / F +
• What is the postfix expression of 9+3*5/(10-4)?
  ক

  9 3 + * 5 / 10 4 –

  খ

  9 3 5 + * / 10 4 –

  গ

  9 3 + 5 * / 10 4 –

  ঘ

  9 3 5 * / + 10 – 4
• Conversion from prefix to postfix expression can be done _______________
  ক

  using bubble sort

  খ

  using radix sort

  গ

  using two queues

  ঘ

  in a direct manner
• Infix to prefix conversion can be done using __________
  ক

  two queues

  খ

  two stacks

  গ

  one stack and two queues

  ঘ

  one stack
• Topological sorting of a graph represents _______ of a graph.
  ক

  linear probing

  খ

  linear ordering

  গ

  quadrilateral ordering

  ঘ

  insertion sorting
• The time complexity to find shortest distances by using Dijkstra’s algorithm is __________
  ক

  O(E2)

  খ

  O(V+1-E)

  গ

  O(V+E)

  ঘ

  O(E+VlogV)
• The time complexity to find a Eulerian path in a graph of vertex V and edge E is _____________
  ক

  O(V2)

  খ

  O(V+E-1)

  গ

  O(V+E)

  ঘ

  O(E+1)
• How many cycles are there in a wheel graph of order 5?
  ক

  6

  খ

  10

  গ

  25

  ঘ

  7
• How many edges are there in a complete graph of order 9?
  ক

  35

  খ

  36

  গ

  45

  ঘ

  19
• What is a separable graph?
  ক

  A disconnected graph by deleting a vertex

  খ

  A disconnected graph by removing an edge

  গ

  A disconnected graph by removing one edge and a vertex

  ঘ

  A simple graph which does not contain a cycle
• If G is a simple graph with n-vertices and n>=3, the condition for G has a Hamiltonian circuit is __________
  ক

  the degree of each vertex is at most n/2

  খ

  the degree of each vertex is equal to n

  গ

  the degree of every vertex is at least n+1/2

  ঘ

  the degree of every vertex in G is at least n/2
• A binary cycle space forms a ______ over the two element field.
  ক

  triangular graph

  খ

  vector space

  গ

  binary tree

  ঘ

  hamiltonian graph
• For an n-vertex undirected graph, the time required to find a cycle is ____________
  ক

  O(n)

  খ

  O(n2)

  গ

  O(n+1)

  ঘ

  O(logn)
• If two cycle graphs Gm and Gn are joined together with a vertex, the number of spanning trees in the new graph is ______
  ক

  m+n-1

  খ

  m-n

  গ

  m*n

  ঘ

  m*n+1