×
Detail Form
We will send your result on your email id and phone no. please fill detail
1.
In Data Structures, which of the following is the tightest upper-bound that represents the time complexity of inserting an object into a binary search tree of n nodes?
2.
In Data Structures, a circular queue with n–1 elements is implemented with an array of n elements. The insertion and deletion operations are carried out using REAR and FRONT as array index variables.
If REAR = FRONT = 0 initially, then which of the following conditions is true for the two extreme states of the queue?
If REAR = FRONT = 0 initially, then which of the following conditions is true for the two extreme states of the queue?
3.
The postfix form of the following infix expression is ____________________________.
(2+3)*(4+(5*6)/(((7*8)/9)*4))
4.
What is the output of the python code below:
d = {
'a': 1,
'b': 2,
'c': 3,
}
print d.keys()
'a': 1,
'b': 2,
'c': 3,
}
print d.keys()
5.
In C++, the data type defined by the keyword union allows _________________________________:
- One different portion of memory to be accessed as the same data type
- One same portion of memory to be accessed as different data types
- One same portion of memory to be accessed as the same data type
- One different portion of memory to be accessed as different data types
6.
What is the output of the following C++ code:
#include
using namespace std;
main() {
union abc {
int x;
char ch;
}
var;
var.ch = 'A';
cout <
}
#include
using namespace std;
main() {
union abc {
int x;
char ch;
}
var;
var.ch = 'A';
cout <
}
7.
Which of these is an expression for runtime in T(n) for the following recurrence:
T(n) = 4T(n/2) + n^2
8.
What is the time complexity of the following code snippet:
void fun() {
int i, j;
for (i = 1; i <= N; ++i)
for j = 1;
j <= log(i);
++j)
printf("*");
}
int i, j;
for (i = 1; i <= N; ++i)
for j = 1;
j <= log(i);
++j)
printf("*");
}
9.
The five items: A, B, C, D and E are pushed into a stack, one after the other starting from A. The stack is popped four times and each element is inserted into a queue, after which, two elements are deleted from the queue and pushed back into the stack. Now, one item is popped from the stack.
Which item is popped?
Which item is popped?
10.
A system requires a minimum of 100 seconds to sort 1000 names with a quick sort. What is the minimum time needed to sort 100 names?