Register
Filter

Recent activity by RohitKumarSingh

1 answer
1
Scan cscan
plz explain scan cscan ,i have 2 books which gives 2 different implementation
plz explain scan cscan ,i have 2 books which gives 2 different implementation
5 answers
4
GATE CSE 2017 Set 1 | Question: 19
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ and $b$. The median of $Y$ is ______________ .
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ ...
1 answer
5
Test by Bikram | Mock GATE | Test 1 | Question: 45
How many times $fibon$\left ( 3 \right )$ is called during invocation of $fibon$ $\left ( 6 \right )$? $fibon(x) = fibon(x-1) + fibon(x-2)$ $fibon(0) = 1$ $fibon(1) = 1$ 3 4 5 6
How many times $fibon$$\left ( 3 \right )$ is called during invocation of $fibon$ $\left ( 6 \right )$?$fibon(x) = fibon(x-1) + fibon(x-2)$$fibon(0) = 1$$fibon(1) = 1$345...
1 answer
6
Seek Time
According to the specification of a particular hard disk seek time takes 3 milliseconds between adjacent tracks. If the disk has 100 tracks how long will it take for the head to move from the innermost cylinder to the outermost cylinder?
According to the specification of a particular hard disk seek time takes 3 milliseconds between adjacent tracks. If the disk has 100 tracks how long will it take for the ...
0 answers
7
Peter Linz Edition 4 Exercise 12.1 Question 14 (Page No. 306)
Consider the set of all n-state Turing machines with tape alphabet Γ = {0,1, B}. Give an expression for m(n), the number of distinct Turing machines with this Γ.
Consider the set of all n-state Turing machines with tape alphabet Γ = {0,1, B}. Give an expression for m(n), the number of distinct Turing machines with this Γ.
2 answers
8
Peter Linz Exercise 3.2
Provide dfa for the below regular expression
Provide dfa for the below regular expression