search
Log In

Answers by Shashi Shekhar 1

1 vote
1
answered Jul 24, 2019 in Programming 76 views
0 votes
2
Evaluation of the given postfix expression $10 \: 10 + 60 \: 6/^*8$- is $192$ $190$ $110$ $92$
answered Feb 15, 2019 in Others 143 views
0 votes
3
X is uniformly distributed random variable that takes values between 0 and 1.The value of E(X^3) will be
answered Feb 12, 2019 in Probability 1.2k views
35 votes
4
Suppose $Y$ is distributed uniformly in the open interval $(1,6)$. The probability that the polynomial $3x^2 +6xY+3Y+6$ has only real roots is (rounded off to $1$ decimal place) _______
answered Feb 12, 2019 in Probability 5.5k views
0 votes
5
If a grammar( $CFG$ ) has more than one Right most derivation, Can it be called ambiguous ? Or we say a grammar is ambiguous only when it has more than one left most derivation ?
answered Feb 9, 2019 in Compiler Design 536 views
2 votes
6
For any context-free grammar there is a parser that takes at most O (n$^3$ ) time to parse a string of n terminals. True or False?
answered Feb 9, 2019 in Compiler Design 144 views
1 vote
8
In a sliding window $ARQ$ scheme, the transmitter's window size is $N$ and the receiver's window size is $M$. The minimum number of distinct sequence numbers required to ensure correct operation of the $ARQ$ scheme is $min (M, N)$ $max (M, N)$ $M + N$ $MN$
answered Feb 5, 2019 in Computer Networks 3.6k views
0 votes
9
What is the for the question where two statements were given as: S1: matrix A is invertible S2:|A|=0?
answered Feb 4, 2019 in Set Theory & Algebra 362 views
0 votes
10
2 votes
11
A CPU has a five-stage pipeline and runs at $1$ GHz frequency. Instruction fetch happens in the first stage of the pipeline. A conditional branch instruction computes the target address and evaluates the condition in the third stage of the pipeline. The processor stops fetching new instructions following ... is: $\text{1.0 second}$ $\text{1.2 seconds}$ $\text{1.4 seconds}$ $\text{1.6 seconds}$
answered Dec 22, 2018 in CO and Architecture 8.3k views
0 votes
12
. In the standard merge sort algorithm on a list of size n, what is the maximum number of times an item can be compared? a)2 b)logn c)n-1 d)nlogn
answered Aug 23, 2018 in Algorithms 256 views
0 votes
13
which of the following is not a strict schedule? A) R1(A),R2(A),W1(A),Abort1,W2(A),Commit2 B) R1(A),R2(A),W1(A),Commit1,W2(A),Abort2 C) R1(A),R2(A),W2(A),Commit2,W1(A),Commit1 D) R1(A),W2(A),W1(A),Commit1,W2(A),Commit2
answered Aug 14, 2018 in Databases 98 views
–1 vote
15
Consider the processes P1, P2, P3, P4 whose arrival times are 0, 1, 2, 3 and Burst times are 5, 2, 13, 7. If the Context Switching time is 1 unit (ms), what is the average waiting time if Shortest Job Next scheduling algorithm is used? (a) 7.5 (b) 6.25 (c) 6.5 (d) None
answered Sep 5, 2017 in Operating System 259 views
...