1
GATE CSE 2009
+2
-0.6
Consider a binary max-heap implemented using an array. Which one of the following array represents a binary max-heap?
A
$$\left\{25,12,16,13,10,8,14\right\}$$
B
$$\left\{25,14,13,16,10,8,12\right\}$$
C
$$\left\{25,14,16,13,10,8,12\right\}$$
D
$$\left\{25,14,12,13,10,8,16\right\}$$
2
GATE CSE 2008
+2
-0.6
We have a binary heap on n elements and wish to insert n more elements (not necessarily one after another) into this heap. The total time required for this is
A
$$\Theta(\log n)$$
B
$$\Theta(n)$$
C
$$\Theta(n\log n)$$
D
$$\Theta(n^2)$$
3
GATE CSE 2007
+2
-0.6
Consider the process of inserting an element into a Max Heap, where the Max Heap is represented by an array. Suppose we perform a binary search on the path from the new leaf to the root to find the position for the newly inserted element, the number of comparisons performed is:
A
$$\Theta(\log_2n)$$
B
$$\Theta(\log_2\log_2n)$$
C
$$\Theta(n)$$
D
$$\Theta(n\log_2n)$$
4
GATE CSE 2006
+2
-0.6
Given two arrays of numbers a1,......,an and b1,......, bn where each number is 0 or 1, the fastest algorithm to find the largest span (i, j) such that ai+ai+1......aj = bi+bi+1......bj or report that there is not such span,
A
Takes O(3n) and $$\Omega(2^{n})$$ time if hashing is permitted
B
Takes O(n3) and $$\Omega(n^{2.5})$$ time in the key comparison model
C
Takes θ(n) time and space
D
Takes $$O(\sqrt n)$$ time only if the sum of the 2n elements is an even number
GATE CSE Subjects
Discrete Mathematics
Programming Languages
Theory of Computation
Operating Systems
Digital Logic
Computer Organization
Database Management System
Data Structures
Computer Networks
Algorithms
Compiler Design
Software Engineering
Web Technologies
General Aptitude
EXAM MAP
Joint Entrance Examination