The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by RohitKumarSingh
User RohitKumarSingh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User RohitKumarSingh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
Scan cscan
plz explain scan cscan ,i have 2 books which gives 2 different implementation
commented
Jan 25, 2019
in
Operating System

532
views
operatingsystem
diskscheduling
0
answers
2
TOC : Minimum State in Finite Automata ( virtualgate )
For a binary string x = a0a1 · · · an−1 define val(x) to be the value of x interpreted as a binary number, where a0 is the most significant bit. More formally, val(x) is given by How many minimum states will be in a finite automaton that accepts exactly the set of binary strings x such that val(x) is divisible by either 4 or 5. Ans is 5 or 20?
commented
Jan 16, 2019
in
Theory of Computation

76
views
theoryofcomputation
finiteautomata
minimalstateautomata
numberofstates
1
answer
3
self doubt
Twin primes are pairs of numbers p and p+2 such that both are primesfor instance, 5 and 7, 11 and 13, 41 and 43. The Twin Prime Conjecture says that there are infinitely many twin primes. Let TwinPrime(n) be a predicate that is true if n and n+2 are twin primes. Which of the ... (n)) ∃m. ∀n. n ≤ m implies TwinPrime(n) ∃m. ∀n. TwinPrime(n) implies n ≤ m ∀m. ∃n. n ≤ m and TwinPrime(n)
answered
Dec 29, 2018
in
Mathematical Logic

80
views
4
answers
4
GATE2017119
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 ______________ .
answered
Dec 27, 2018
in
Probability

6.2k
views
gate20171
probability
numericalanswers
normaldistribution
0
answers
5
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 from for the head to move from innermost most cylinder to the outermost cylinder?
asked
Dec 13, 2018
in
CO and Architecture

65
views
0
answers
6
Peter Linz Edition 4 Exercise 12.1 Question 14 (Page No. 306)
Consider the set of all nstate Turing machines with tape alphabet Γ = {0,1, B}. Give an expression for m(n), the number of distinct Turing machines with this Γ.
asked
Sep 19, 2018
in
Theory of Computation

35
views
turingmachine
theoryofcomputation
peterlinz
2
answers
7
Peter Linz Exercise 3.2
Provide dfa for the below regular expression
commented
Sep 14, 2018
in
Theory of Computation

293
views
theoryofcomputation
regularexpressions
50,741
questions
57,244
answers
198,017
comments
104,610
users