Q.1
What is the time complexity for inserting a new item in a ternary heap of n elements?
  • a) O (log n/ log 3)
  • b) O (n!)
  • c) O (n)
  • d) O (1)
Q.2
Is decrease priority operation performed more quickly in a ternary heap with respect to the binary heap.
  • a) True
  • b) False
Q.3
What is the time complexity for decreasing priority of key in a minimum ternary heap of n elements?
  • a) O (log n/ log 3)
  • b) O (n!)
  • c) O (n)
  • d) O (1)
Q.4
What is the time complexity for increasing priority of key in a maximum ternary heap of n elements?
  • a) O (log n/ log 3)
  • b) O (n!)
  • c) O (n)
  • d) O (1)
Q.5
What is the time complexity for deleting root key in a ternary heap of n elements?
  • a) O (log n/ log 3)
  • b) O (3log n/ log 3)
  • c) O (n)
  • d) O (1)
Q.6
What is the time complexity for increasing priority of key in a minimum ternary heap of n elements?
  • a) O (log n/ log 3)
  • b) O (3log n/ log 3)
  • c) O (n)
  • d) O (1)
Q.7
What is the time complexity for decreasing priority of key in a maximum ternary heap of n elements?
  • a) O (log n/ log 3)
  • b) O (3log n/ log 3)
  • c) O (n)
  • d) O (1)
Q.8
Do ternary heap have better memory cache behavior than binary heap.
  • a) True
  • b) False
Q.9
What is the time complexity for creating a ternary heap using swapping?
  • a) O (log n/ log 3)
  • b) O (n!)
  • c) O (n)
  • d) O (1)
Q.10
Which of the following is the application of minimum ternary heap?
  • a) Prim’s Algorithm
  • b) Euclid’s Algorithm
  • c) Eight Queen Puzzle
  • d) Tree
0 h : 0 m : 1 s