# Recent activity by ANKUSH KUMAR

3 answers
1
Let $S = \sum_{i=3}^{100} i \log_{2} i$, and $T = \int_{2}^{100} x \log_{2}x dx$. Which of the following statements is true? $S > T$ $S = T$ $S < T$ and $2S > T$ $2S ≤ T$
0 answers
2
A queue is implemented using two stack A and B. Consider the following code void enqueue(int value) { While (!B.is Empty()) A.push(B.Pop()); A. push (value); } int dequeue () { While (!A.is Empty()) {X} return B.Pop(); } if enqueue is implemented using two stacks A & B With operation ... )); B) B.Push(A.Pop()); C) A.Pop(B. Push ()); D) B.Pop(A. Push ()); what is difference between option b,d???
4 answers
3
A $1\;\text{Mbps}$ satellite link connects two ground stations. The altitude of the satellite is $36,504\;\text{km}$ and speed of the signal is $3 \times 10^{8}\;\text{m/s}.$ What should be the packet size for a channel utilization of $25\%$ for a satellite link ... and that there are no errors during communication. $120\;\text{bytes}$ $60\;\text{bytes}$ $240\;\text{bytes}$ $90\;\text{bytes}$
4 answers
4
A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the furthest leaf) of such a tree ... described by which of the following? $\log_2 n$ $\log_{\frac{4}{3}} n$ $\log_3 n$ $\log_{\frac{3}{2}} n$
9 answers
5
Which one of the following Boolean expressions is NOT a tautology? $((a \rightarrow b) \wedge (b \rightarrow c)) \rightarrow (a \rightarrow c)$ $(a \leftrightarrow c) \rightarrow (\sim b\rightarrow (a\wedge c))$ $(a\wedge b \wedge c)\rightarrow (c \vee a)$ $a\rightarrow (b\rightarrow a)$
1 answer
6
#discrete 6 runners are in a 100 yard dash. Find the ways possible for 3 medals to be awarded if ties are possible.
1 answer
7
Number of 5 digit number having there digits in non decreasing order (from left to right) constructed by using the digits belonging to the set {1, 2, 3, 4, 5, 6, 7, 8, 9} ?
2 answers
8
A bagel shop has onion bagels, poppy seed bagels, egg bagels, salty bagels, pumpernickel bagels, sesame seed bagels, raisin bagels, and plain bagels. How many ways are there to choose a dozen bagels with at least three egg bagels and no more than two salty bagels?
5 answers
9
How many solutions are there to the equation x1 + x2 + x3 + x4 + x5 = 21, where xi , i = 1, 2, 3, 4, 5, is a nonnegative integer such that: 0$\leq$ x1$\leq$10 ?
3 answers
10
I tried solving it by enumerating all the paths and got ans 12.Can anyone provide some formula for this ?
1 answer
11
If Relation S is Transitive then what can we say about Transitivity of Sn ?