We are given N items to build a heap ,this can be done with ______ successive inserts.
Question # 2
While joining nodes in the building of Huffman encoding tree if there are more nodes with same frequency, we
choose the nodes _______.
Question # 3
The definition of transitive property is
Question # 4
Merge sort and quicksort both fail into the same category of sorting algorithms,What is this category ?
Question # 5
Suppose we are sorting an array of eight integers using quick sort ,and we have just finished the first partitioning with the array looking like this
2 5 1 7 9 12 11 10
Which statement is correct?
Question # 6
Consider te following array
23 15 5 12 40 10 7
After the first pass of a particular algorithm, the array looks like
15 5 12 23 10 7 40
Name the algorithm used
Question # 7
Which of the following statement is correct?
Question # 8
Which of the following heap method increase the value of key at position „p‟ by the amount „delta‟?
Question # 9
We can build a heap in ________ time.
Question # 10
I have implemented the queue with a linked list, keeping track of a front pointer and a rear pointer. Which of
these pointers will change during an insertion into an EMPTY queue?
Question # 11
If both pointers of the node in a binary tree are NULL then it will be a/an _______ .
Question # 12
The data of the problem is of 2 GB and the hard disk is of 1 GB capacity,to solve this problem we should
Question # 13
Suppose A is an array containing numbers in increasing order, but some numbers occur more than once when
using a binary search for a value, the binary search always finds ____________
Question # 14
What requirement is placed on an array, so that binary search may be used to locate an entry?
Question # 15
Which of the following statement is NOT true about threaded binary tree?
Question # 16
Which of the following is not an example of equivalence relation:
Question # 17
Suppose we are sorting an array of eight integers using quick sort, and we have just finished the first
partitioning with the array looking like this:
2 5 1 7 9 12 11 10
Which statement is correct?
Question # 18
Every AVL is
Question # 19
If there are 56 internal node in a binary tree then how many external nodes this binary tree will have ?
Question # 20
Suppose you implement a heap (with the largest element on top) in an array. Consider the different arrays
below, determine the one that cannot possibly be a heap:
.gif)
Home
News
Colleges
Courses
Admission
Lectures
Online Test
Past Papers
Date Sheets
Results
Study Abroad
Jobs
Tutors
More
Apps
.png)
