# Recent activity by Ravi Raja

1 answer
1
How they calculated time for number of levels?
3 answers
2
What is the total number of comparisons needed in the best case to find minimum and maximum of $300$ elements?
1 answer
3
The hardware allows privileged instruction to be executed only in kernel mode. if an attempt to execute a privileged instruction in user mode, the hardware does not execute the instruction but rather treat it as illegal and traps it to the operating system. The instruction to ... is itself a privileged instruction. how can it be then executed if the system is not in kernel mode? please clarify...
0 answers
4
Trains X and Y arrive at a station at random between 8 A.M. and 8.20 A.M. Train X stops for four minutes and train Y stops for five minutes. Assuming that the trains arrive independently of each other. (a) Determine the probability that train X arrives ... . (c) Assuming that the trains met, determine the probability that train X arrived before train Y. Note: please explain in detail. Thanks
1 answer
5
Any condition for f(n) and g(n) or any value we can take??? I m confused becoz in big oh right side part must b greater than equal ??
1 answer
6
give the complete solution with explanation int main() { int arr    = {10,2,3,4,5,6,7,8}; int *p, *q; p = &arr  ; q = (int*) arr; printf("%d ,%d \n",*p ,*q); return 0; }
1 answer
7
Q.Consider a four labeled 1, 2, 3, 4. The number of distinct binary tree are possible such that whose inorder traversal is 1, 2, 3, 4 are _________ Answer must be 14 right ?
3 answers
8
Q9-Consider the following grammar: S → aPbSQ | a Q → t | ε P → r The number of states will reduce when a LALR(1) parse is computed out of CLR(1) parser for the above grammar _____. made easy solution my solution please correct me if i wrong no of state is reduce =6?