GATE CSE 2015 Set 2 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2015 Set 2

MCQ (Single Correct Answer)

-0.3

Consider a complete binary tree where the left and the right sub-trees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is

$$\Omega \left( {\log \,\,n} \right)$$

$$\Omega \left( n \right)$$

$$\Omega \left( {n\,\,\log \,\,n} \right)$$

$$\Omega \left( {{n^2}} \right)$$

GATE CSE 2015 Set 2

Numerical

-0

A binary tree $$T$$ has $$20$$ leaves. The number of nodes in $$T$$ having two children is _______________.

Your input ____

GATE CSE 2015 Set 2

MCQ (Single Correct Answer)

-0.6

Which one of the following hash functions on integers will distribute keys most uniformly over $$10$$ buckets numbered $$0$$ to $$9$$ for $$𝑖$$ ranging from $$0$$ to $$2020$$?

$$h\left( i \right) = {i^2}\,mod\,\,10$$

$$h\left( i \right) = {i^3}\,mod\,\,10$$

$$h\left( i \right) = \left( {11 * {i^2}} \right)\,\bmod \,10$$

$$h\left( i \right) = \left( {12 * i} \right)\,\bmod \,10$$

GATE CSE 2015 Set 2

Numerical

-0

With reference to the B⁺ tree index of order 1 shown below, the minimum number of nodes (including the Root node) that must be fetched in order to satisfy the following query: “Get all records with a search key greater than or equal to 7 and less than 15” is _________ GATE CSE 2015 Set 2 Database Management System - File Structures and Indexing Question 15 English

GATE CSE 2015 Set 2 Database Management System - File Structures and Indexing Question 15 English

Your input ____

PREVIOUS NEXT

GATE CSE Papers

2023