Core Subject Knowledge & Technical Concepts Flashcards
7 cards from real GATE practice questions. Tap to flip, then mark Knew It or Still Learning — missed cards come back until you master them.
Read the first 7 Core Subject Knowledge & Technical Concepts flashcards as text
In a binary search tree, the worst-case time complexity for searching an element is:
Answer: O(n)
In the worst case (a skewed BST), every node must be visited, giving O(n) time complexity.
Which of the following sorting algorithms has the best average-case time complexity?
Answer: Merge Sort
Merge Sort has O(n log n) average-case complexity, which is optimal for comparison-based sorting.
The output of a JK flip-flop when J=1 and K=1 is:
Answer: Toggle
When both J and K are 1, the JK flip-flop toggles its output on the clock edge.
In a full adder, the carry-out expression is:
Answer: AB + BCin + ACin
The carry-out of a full adder is Cout = AB + BCin + ACin (carry generated or propagated).
Which scheduling algorithm can lead to starvation?
Answer: Priority Scheduling
Priority Scheduling can starve low-priority processes if high-priority processes continuously arrive.
The minimum number of NOR gates required to implement the Boolean function F = A + B is:
Answer: 3
F = A + B = (A NOR B) NOR (A NOR B), requiring 3 NOR gates (two for inputs, one for OR).
In Dijkstra's shortest path algorithm, which data structure gives the most efficient implementation?
Answer: Priority Queue (Min-Heap)
A priority queue (min-heap) allows efficient extraction of the minimum distance vertex in O(log V) time.