×
Detail Form
We will send your result on your email id and phone no. please fill detail
1.
The time complexity of inserting a data element into a sorted linked list of size N is _________________________.
2.
The best and the worst time complexity of a binary search on an array of size N is _______________________.
3.
In the node of a linked list, what data type is the address of the location of the next node in the list?
4.
In data structures, which of the following searches traverse an array sequentially to locate any given item?
5.
The sorting algorithm in which the worst case time complexity is not proportional to (N^2) is ________________________.
6.
Arrange the following sequence to perform a postorder traversal:
- Visit the root node
- Traverse the right subtree
- Traverse the left subtree
7.
In Data Structures, a complete graph with N nodes has _________________ edges.
8.
In C, a string can be reversed in a _______________________________.
9.
In Java, a complete n-ary tree is one in which every node has either zero or n sons. If x is the number of internal nodes of a complete n-ary tree, the number of leaves can be obtained by using the formula _______________.
10.
In Java, let P be a quicksort program to sort numbers in the ascending order. Let t1 and t2 be the time taken by the program to complete its execution for the inputs [ 1 2 3 4 ] and [ 5 4 3 2 1], respectively. Which of the following statements is true?