If there are 56 internal node in a binary tree then how many external nodes this binary tree will have ?
Question # 2
Select the FALSE statement binary tree.
Question # 3
A complete binary tree of height ____ has nodes between 16-31.
Question # 4
Consider the following paragraph with blanks.
A …….…….. is a linear list where …………… and ………… take place at the
same end . This end is called the …….……….
What would be the correct filling the above blank positions?
Question # 5
Union is a ___________ time operation
Question # 6
Which of the given option is NOT a factor in Union by Size:
Question # 7
By using _____ we avoid recursive method of traversing a tree,which makes use of stacks and consumes a lot of memory and time.
Question # 8
A kind of expression where the operator is present between two operands called ________ expressions .
Question # 9
Which of the following statement is NOT true about threaded binary tree?
Question # 10
_________ is a data structure that can grow easily dynamically at run time without having to copy existing
elements.
Question # 11
Which of the following statement is NOT true about find operation :
Question # 12
A complete binary tree us a tree that is ___ filled with the possible exception of the bottom level.
Question # 13
A compound data structure is the data structure which can have multiple data items of same type or of different types,which of the following can be considered compound data structure ?
Question # 14
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 # 15
The definition of transitive property is
Question # 16
Here is a small function definition:
void f(int i, int &k)
{
i
= 1;
k = 2;
}
Suppose that a main program has two integer variables x and y, which are given the value 0. Then the main
program calls f(x,y); What are the values of x and y after the function f finishes?
Question # 17
A complete binary tree of height ___ has node between 16 to 31.
Question # 18
Suppose we have a hash table whose hash function is "n% 12",if the number 35 is already in the hash table which of the following numbers would cause a collision ?
Question # 19
In a selection sort of n element ,how many times the swap function is called the execution of the algorithm?
Question # 20
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?
Home
News
Colleges
Courses
Admission
Lectures
Online Test
Past Papers
Date Sheets
Results
Study Abroad
Jobs
Tutors
More
Apps
