1

### GATE CSE 2015 Set 2

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
A
$\Omega \left( {\log \,\,n} \right)$
B
$\Omega \left( n \right)$
C
$\Omega \left( {n\,\,\log \,\,n} \right)$
D
$\Omega \left( {{n^2}} \right)$
2
Numerical

### GATE CSE 2015 Set 2

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

3

### GATE CSE 2015 Set 2

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$?
A
$h\left( i \right) = {i^2}\,mod\,\,10$
B
$h\left( i \right) = {i^3}\,mod\,\,10$
C
$h\left( i \right) = \left( {11 * {i^2}} \right)\,\bmod \,10$
D
$h\left( i \right) = \left( {12 * i} \right)\,\bmod \,10$
4
Numerical

### GATE CSE 2015 Set 2

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 _________

### Paper Analysis of GATE CSE 2015 Set 2

Subject NameTotal Questions
Algorithms5
Compiler Design3
Computer Networks6
Computer Organization4
Data Structures3
Database Management System4
Digital Logic3
Discrete Mathematics12
Operating Systems4
Programming Languages3
Software Engineering3
Theory of Computation4
Web Technologies1