1
GATE CSE 2022
Numerical
+1
-0.33

Suppose a binary search tree with 1000 distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assuming that the array indices start with 0, the 3rd largest element of the tree is stored at index ___________.

Your input ____
2
GATE CSE 2022
Numerical
+1
-0.33

Consider the queues Q1 containing four elements and Q2 containing none (shown as the Initial State in the figure). The only operations allowed on these two queues are Enqueue (Q, element) and Dequeue (Q). The minimum number of Enqueue operations on Q1 required to place the elements of Q1 in Q2 in reverse order (shown as the Final State in the figure) without using any additional storage is ______________.

GATE CSE 2022 Data Structures - Stacks and Queues Question 1 English

Your input ____
3
GATE CSE 2022
MCQ (Single Correct Answer)
+1
-0.33

In a relational data model, which one of the following statements is TRUE?

A
A relation with only two attributes is always in BCNF.
B
If all attributes of a relation are prime attributes, then the relation is in BCNF.
C
Every relation has at least one non-prime attribute.
D
BCNF decompositions preserve functional dependencies.
4
GATE CSE 2022
MCQ (More than One Correct Answer)
+1
-0.33

Consider the following three relations in a relational database.

Employee ( $$\underline {eld} $$ , Name), Brand ( $$\underline {bld} $$ , bName), Own ( $$\underline {eld} $$ , $$\underline {bld} $$)

Which of the following relational algebra expressions return the set of elds who own all the brands?

A
$$\pi$$eld ($$\pi$$eld, bld (Own) / $$\pi$$bld (Brand))
B
$$\pi$$eld (Own) $$-$$ $$\pi$$eld (($$\pi$$eld (Own) $$\times$$ $$\pi$$bld (Brand)) $$-$$ $$\pi$$eld, bld (Own))
C
$$\pi$$eld ($$\pi$$eld, bld (Own) / $$\pi$$bld (Own))
D
$$\pi$$eld (($$\pi$$eld (Own) $$\times$$ $$\pi$$bld (Own) / $$\pi$$bld (Brand))
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12