×
Detail Form
We will send your result on your email id and phone no. please fill detail
1.
What is the output of the following Java code:
import java.util.*;
class Array {
public static void main(String args[ ]) {
int array[] = new int[5];
for (int i = 5; i > 0; i--)
array[5 - i] = i;
Arrays.sort(array);
System.out.print(Arrays.binarySearch(array, 2));
}
}
class Array {
public static void main(String args[ ]) {
int array[] = new int[5];
for (int i = 5; i > 0; i--)
array[5 - i] = i;
Arrays.sort(array);
System.out.print(Arrays.binarySearch(array, 2));
}
}
2.
Which of the following statements regarding binary search trees is true?
3.
What is the time complexity of insertion sort?
4.
Which of the following statements is false?
5.
A full binary tree with n non-leaf nodes contains __________________ nodes.
6.
The _____________ traversal is the process of traversing a binary tree in the following order:
Root Node --> Left Sub-tree --> Right Sub-tree
7.
The maximum number of nodes on level i of a binary tree is ____________.
8.
Which of the following statements about a tree and graph is correct:
1. A tree is a cyclic graph that can contain any number of cycles or self-loops.
2. A graph can be cyclic, acyclic, or both.
1. A tree is a cyclic graph that can contain any number of cycles or self-loops.
2. A graph can be cyclic, acyclic, or both.
9.
Which of these is the formula for the memory address of the fifth element of an array, where w is the number of words per memory cell in the array?
10.
Each data item in a record may be a group item that is composed of sub-items. What are the indecomposable items called?