GATE Core Subject Knowledge & Technical Concepts 2

Question 1

In a binary search tree, the worst-case time complexity for searching an element is:

Accepted Answer

O(n)

Answer

In the worst case (a skewed BST), every node must be visited, giving O(n) time complexity.

Question 2

Which of the following sorting algorithms has the best average-case time complexity?

Accepted Answer

Merge Sort

Answer

Merge Sort has O(n log n) average-case complexity, which is optimal for comparison-based sorting.

Question 3

The output of a JK flip-flop when J=1 and K=1 is:

Accepted Answer

Toggle

Answer

When both J and K are 1, the JK flip-flop toggles its output on the clock edge.

Question 4

In a full adder, the carry-out expression is:

Accepted Answer

AB + BCin + ACin

Answer

The carry-out of a full adder is Cout = AB + BCin + ACin (carry generated or propagated).

Question 5

Which scheduling algorithm can lead to starvation?

Accepted Answer

Priority Scheduling

Answer

Priority Scheduling can starve low-priority processes if high-priority processes continuously arrive.

(GATE) Graduate Aptitude Test in Engineering Practice Test