GATE 2020 Computer Science and IT Question Paper with answer

Which of the following is not valid?

∃x(p(x) → w) ≡ ∀x p(x) → w
∀x (p(x) w) ≡ ∀x p(x) → w
∃x(p(x) ^ w) ∃x(p(x) ^ w
∀x (p(x) v w) . ∀x (p(x) v w

Answer

Given set (v1, v2, v3 …… v100) the edge weight is |v1-v2| where i ≤ i ≤ j ≤ 100 then the weight of the minimum spanning tree is ____

99
99
99
99

Answer

T(n) = T (n^t/a) +(b) = find t(n)

(log_b log_a n)
θ (log_a log_b n)
(log_ab n)
(log₂ n)

Answer

What is the worst-case time complexity of inserting n elements in an empty linked list in the sorted order?

n
n log n
n²
n² log n

Answer

In the AVL tree n elements are there what is the time complexity of inserting other n² elements?

n²
O(n² log n)
O(n)
O(n log n)

Answer

Pages: 1 2 3 4 5 6 7 8 9

Latest MCQs