GATE 2020 Computer Science and IT Question Paper with answer

There are n elements in the balanced binary search tree. What is the time complexity to report the k elements in the range [a, b]?

Binary min-heap has 1023 elements. Find the number of comparisons required to find the maximum elements?

Let A, B, C be the inputs that give output Z as shown in the below figure. The minterms required the output function Z (A, B, C)is ___

You are given an accumulator and memory of 32 registers in between then there is a multiplexer of the number of select lines in the multiplexer.

SELECT S.sno, S.sname

FROM Supplier S, catalog C

WHERE S. sno = C.sno AND

Cost > (SELECT AVG (cost)    

FROM Catalog

WHERE pno = `P4`   GroupBy pno);         

Number of rows returns by above query____