Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
SougataSarkar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by SougataSarkar
5
answers
1
GATE IT 2006 | Question: 55
Consider the solution to the bounded buffer producer/consumer problem by using general semaphores $S, F,$ and $E$. The semaphore $S$ is the mutual exclusion semaphore initialized to $1$. The semaphore $F$ corresponds to the number of free slots in the buffer and is ... Signal $(F)$ in the Consumer process (I) only (II) only Neither (I) nor (II) Both (I) and (II)
Consider the solution to the bounded buffer producer/consumer problem by using general semaphores $S, F,$ and $E$. The semaphore $S$ is the mutual exclusion semaphore ini...
13.2k
views
commented
Dec 10, 2023
Operating System
gateit-2006
operating-system
process-synchronization
normal
+
–
3
answers
2
GATE CSE 1995 | Question: 1.21
In the interval $[0, \pi]$ the equation $x=\cos x$ has No solution Exactly one solution Exactly two solutions An infinite number of solutions
In the interval $[0, \pi]$ the equation $x=\cos x$ has No solutionExactly one solutionExactly two solutionsAn infinite number of solutions
5.6k
views
commented
Sep 25, 2023
Calculus
gate1995
calculus
normal
maxima-minima
+
–
4
answers
3
GATE CSE 2012 | Question: 18
Let $W(n) $ and $A(n)$ denote respectively, the worst case and average case running time of an algorithm executed on an input of size $n$. Which of the following is ALWAYS TRUE? $A(n) = \Omega (W(n))$ $A(n) = \Theta (W(n))$ $A(n) = \text{O} (W(n))$ $A(n) = \text{o} (W(n))$
Let $W(n) $ and $A(n)$ denote respectively, the worst case and average case running time of an algorithm executed on an input of size $n$. Which of the following is ALWA...
14.2k
views
commented
Sep 6, 2023
Algorithms
gatecse-2012
algorithms
easy
asymptotic-notation
+
–
9
answers
4
GATE CSE 2013 | Question: 44
Consider the following operation along with Enqueue and Dequeue operations on queues, where $k$ is a global parameter. MultiDequeue(Q){ m = k while (Q is not empty) and (m > 0) { Dequeue(Q) m = m – 1 } } What is the worst case time complexity of a sequence of $n$ queue operations on an initially empty queue? $Θ(n)$ $Θ(n + k)$ $Θ(nk)$ $Θ(n^2)$
Consider the following operation along with Enqueue and Dequeue operations on queues, where $k$ is a global parameter.MultiDequeue(Q){ m = k while (Q is not empty) and (m...
31.0k
views
commented
Aug 27, 2023
DS
gatecse-2013
data-structures
algorithms
normal
queue
+
–
5
answers
5
GATE IT 2006 | Question: 34
In the context-free grammar below, $S$ is the start symbol, $a$ and $b$ are terminals, and $\epsilon$ denotes the empty string. $S \to aSAb \mid \epsilon$ $A \to bA \mid \epsilon$ The grammar generates the language $((a + b)^* b)$ $\{a^mb^n \mid m \leq n\}$ $\{a^mb^n \mid m = n)$ $a^* b^*$
In the context-free grammar below, $S$ is the start symbol, $a$ and $b$ are terminals, and $\epsilon$ denotes the empty string.$S \to aSAb \mid \epsilon$$A \to bA \mid \e...
7.9k
views
commented
Jul 29, 2022
Theory of Computation
gateit-2006
theory-of-computation
context-free-language
normal
+
–
3
answers
6
GATE IT 2005 | Question: 5
Which of the following statements is TRUE about the regular expression $01^*0$? It represents a finite set of finite strings. It represents an infinite set of finite strings. It represents a finite set of infinite strings. It represents an infinite set of infinite strings.
Which of the following statements is TRUE about the regular expression $01^*0$?It represents a finite set of finite strings.It represents an infinite set of finite string...
9.7k
views
commented
Jul 26, 2022
Theory of Computation
gateit-2005
theory-of-computation
regular-expression
easy
+
–
9
answers
7
GATE CSE 1991 | Question: 17,b
Let $L$ be the language of all binary strings in which the third symbol from the right is a $1$. Give a non-deterministic finite automaton that recognizes $L$. How many states does the minimized equivalent deterministic finite automaton have? Justify your answer briefly?
Let $L$ be the language of all binary strings in which the third symbol from the right is a $1$. Give a non-deterministic finite automaton that recognizes $L$. How many s...
13.4k
views
commented
Jul 26, 2022
Theory of Computation
gate1991
theory-of-computation
finite-automata
normal
descriptive
+
–
4
answers
8
GATE CSE 2001 | Question: 2.5
Consider a DFA over $\Sigma=\{a,b\}$ accepting all strings which have number of a's divisible by $6$ and number of $b$'s divisible by $8$. What is the minimum number of states that the DFA will have? $8$ $14$ $15$ $48$
Consider a DFA over $\Sigma=\{a,b\}$ accepting all strings which have number of a's divisible by $6$ and number of $b$'s divisible by $8$. What is the minimum number of s...
18.4k
views
commented
May 5, 2022
Theory of Computation
gatecse-2001
theory-of-computation
finite-automata
minimal-state-automata
+
–
2
answers
9
GATE CSE 2018 | Question: 6
Let $N$ be an NFA with $n$ states. Let $k$ be the number of states of a minimal DFA which is equivalent to $N$. Which one of the following is necessarily true? $k \geq 2^n$ $k \geq n$ $k \leq n^2$ $k \leq 2^n$
Let $N$ be an NFA with $n$ states. Let $k$ be the number of states of a minimal DFA which is equivalent to $N$. Which one of the following is necessarily true?$k \geq 2^n...
10.3k
views
commented
Dec 25, 2021
Theory of Computation
gatecse-2018
theory-of-computation
minimal-state-automata
normal
1-mark
+
–
1
answer
10
can we find out minimum numbers of states in DFA if NFA has n states
11.7k
views
commented
Dec 22, 2021
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register