Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Mahesha999
0
answers
1
Madeeasy test series
Which of the following statement is correct? a. while a process is blocked on a semaphore's queue. it can be called as busy waiting. b. Circular waiting is a necessary condition for deadlock, but not a sufficient condition. C Mutual ... fregmentation can occure in disk system which does not employ condition for deadlock, but not a sufficient condition. answer with example.
Which of the following statement is correct?a. while a process is blocked on a semaphore's queue. it can be called as busy waiting.b. Circular waiting is a necessary cond...
447
views
commented
Feb 6, 2017
1
answer
2
Lattice Distributive
788
views
commented
Feb 5, 2017
1
answer
3
Compexity of sum of complexity bounds
264
views
asked
Feb 2, 2017
Algorithms
algorithms
time-complexity
test-series
+
–
2
answers
4
network layer
station A in network 1 send a payload of 1600 B to station B in network 3 via network 2 if fragmentation is done the actual data size to be transmitted? n/w 1: MTU=1500B n/w 2: MTU=480B n/w 3: MTU=1500B
station A in network 1 send a payload of 1600 B to station B in network 3 via network 2if fragmentation is done the actual data size to be transmitted?n/w 1: MTU=1500Bn/w...
2.3k
views
commented
Feb 1, 2017
2
answers
5
GATE CSE 2006 | Question: 31
Let SHAM$_3$ be the problem of finding a Hamiltonian cycle in a graph $G=(V,E)$ with $|V|$ divisible by $3$ and DHAM$_3$ be the problem of determining if a Hamiltonian cycle exists in such graphs. Which one of the following is true? Both DHAM$_3$ ... NP-hard, but DHAM$_3$ is not DHAM$_3$ is NP-hard, but SHAM$_3$ is not Neither DHAM$_3$ nor SHAM$_3$ is NP-hard
Let SHAM$_3$ be the problem of finding a Hamiltonian cycle in a graph $G=(V,E)$ with $|V|$ divisible by $3$ and DHAM$_3$ be the problem of determining if a Hamiltonian...
4.6k
views
commented
Jan 9, 2017
Theory of Computation
gatecse-2006
theory-of-computation
p-np-npc-nph
normal
+
–
3
answers
6
GATE CSE 2003 | Question: 12
Ram and Shyam have been asked to show that a certain problem $\Pi$ is $\text{NP-complete}.$ Ram shows a polynomial time reduction from the $\text{3-SAT}$ problem to $\Pi$, and Shyam shows a polynomial time reduction from $\Pi$ to $\text{3-SAT.}$ Which of ... not NP-complete $\Pi$ is in NP, but is not NP-complete $\Pi$ is NP-complete $\Pi$ is neither NP-hard, nor in NP
Ram and Shyam have been asked to show that a certain problem $\Pi$ is $\text{NP-complete}.$ Ram shows a polynomial time reduction from the $\text{3-SAT}$ problem to $\Pi$...
8.2k
views
commented
Jan 9, 2017
Algorithms
gatecse-2003
algorithms
p-np-npc-nph
normal
out-of-gate-syllabus
+
–
0
answers
7
Working with Turing Machine transitions
495
views
asked
Jan 1, 2017
Theory of Computation
turing-machine
theory-of-computation
+
–
1
answer
8
Working with PDA transitions
Either I dont understand PDA at all or this question is wrong or I am missing something very basic:
Either I dont understand PDA at all or this question is wrong or I am missing something very basic:
345
views
asked
Jan 1, 2017
Theory of Computation
pushdown-automata
+
–
1
answer
9
How can we convert left -recursive grammar to right-recursive grammar and vice-versa ?
3.2k
views
commented
Dec 29, 2016
1
answer
10
Language accepted by NFA
Consider the NFA below: The above NFA acceptes all those binary strings which represents the decimal numbers and are a. divisible by 6 only b. dividible by 2 and 3 only c. divisible by 2 or 3 d. None of these
Consider the NFA below:The above NFA acceptes all those binary strings which represents the decimal numbers and area. divisible by 6 onlyb. dividible by 2 and 3 onlyc. di...
1.9k
views
answer selected
Dec 27, 2016
Theory of Computation
theory-of-computation
regular-language
+
–
2
answers
11
Equivalent regex
Consider the regex: $(a+b)^*(a+b+\epsilon)a$ Which of the following is equivalent to above?: (a) $(a^*+b^*)^+(aa+ba)$ (b) $(\epsilon+a+b^*)^+a$ (c) $(a+b)^+(a+b+\epsilon)a$ (d) None of these
Consider the regex: $(a+b)^*(a+b+\epsilon)a$Which of the following is equivalent to above?:(a) $(a^*+b^*)^+(aa+ba)$(b) $(\epsilon+a+b^*)^+a$(c) $(a+b)^+(a+b+\epsilon)a$(d...
665
views
commented
Dec 27, 2016
Theory of Computation
regular-expression
+
–
2
answers
12
Which of these languages are regular, CFL and CSL?
Consider the following statements: $L_1=\left\{\text{wxw$^R$|w$\in$(a,b)$^*$, x$\in$c }\right\}$ $L_2=\left\{\text{wy|w, y $\in$ (a,b)$^*$}\right\} $ ... free, $L_2$ and $L_3$ are regular and $L_4$ is context sensitive languages $L_1, L_4$ are context free, $L_2$ and $L_3$ is context sensitive languages
Consider the following statements:$L_1=\left\{\text{wxw$^R$|w$\in$(a,b)$^*$, x$\in$c }\right\}$$L_2=\left\{\text{wy|w, y $\in$ (a,b)$^*$}\right\} $$L_3=\left\{\text{zwz|w...
2.9k
views
commented
Dec 26, 2016
Theory of Computation
theory-of-computation
context-free-language
context-sensitive
+
–
2
answers
13
How can I tell if these languages are context sensitive
How can I tell if languages $L_1$ and $L_2$ are Context Sensitive or not?
How can I tell if languages $L_1$ and $L_2$ are Context Sensitive or not?
971
views
commented
Dec 25, 2016
Theory of Computation
theory-of-computation
context-sensitive
+
–
2
answers
14
Which one of the following languages is regular
2.1k
views
asked
Dec 25, 2016
Theory of Computation
theory-of-computation
regular-expression
+
–
1
answer
15
DFA accepting (0+1)*01(0+1)*01(0+1)*
1.6k
views
asked
Dec 25, 2016
Theory of Computation
theory-of-computation
+
–
1
answer
16
Intersection of two context free languages
Does the below problem makes any sense? And if yes what is its answer? How?
Does the below problem makes any sense? And if yes what is its answer? How?
1.5k
views
asked
Dec 24, 2016
1
answer
17
How is this language context free?
How below language is context free? I am not able to imagine what could be the behaviour of the PDA accepting this language. Can anyone give a hint? $L=\{\omega:2n_a(\omega)\leq n_b(\omega)\leq 3n_a(\omega)\}$
How below language is context free? I am not able to imagine what could be the behaviour of the PDA accepting this language. Can anyone give a hint?$L=\{\omega:2n_a(\omeg...
297
views
asked
Dec 24, 2016
Theory of Computation
theory-of-computation
context-free-language
+
–
1
answer
18
Why can't linear bounded automata accept an empty string?
The linear bounded automata (LBA) is defined as follows: A linear bounded automata is a nondeterministic Turing machine $M=(Q,\Sigma,\Gamma,\delta,q_0,\square,F)$ (as in the definition of TM) with the restriction that ... explains why LBA cannot accept empty string (which is why CSG does not have lambda production). Can anyone explain?
The linear bounded automata (LBA) is defined as follows:A linear bounded automata is a nondeterministic Turing machine $M=(Q,\Sigma,\Gamma,\delta,q_0,\square,F)$ (as in t...
1.5k
views
commented
Dec 24, 2016
Theory of Computation
theory-of-computation
context-sensitive
+
–
1
answer
19
Addersg
Which of the following is/are true S1: parallel adder may consist of both half adder and full adder S2: serial adder consists of only full adders
Which of the following is/are trueS1: parallel adder may consist of both half adder and full adderS2: serial adder consists of only full adders
307
views
asked
Nov 2, 2016
2
answers
20
Joining
1.5k
views
commented
Oct 31, 2016
Databases
natural-join
referential-integrity
+
–
5
answers
21
GATE CSE 2009 | Question: 37,ISRO-DEC2017-55
What is the maximum height of any AVL-tree with $7$ nodes? Assume that the height of a tree with a single node is $0$. $2$ $3$ $4$ $5$
What is the maximum height of any AVL-tree with $7$ nodes? Assume that the height of a tree with a single node is $0$.$2$$3$$4$$5$
43.6k
views
comment edited
Apr 11, 2016
DS
gatecse-2009
data-structures
binary-search-tree
normal
isrodec2017
avl-tree
+
–
7
answers
22
GATE CSE 2016 Set 1 | Question: 50
Consider the following proposed solution for the critical section problem. There are $n$ processes : $P_0....P_{n-1}$. In the code, function $\text{pmax}$ ... in the critical section at any time The bounded wait condition is satisfied The progress condition is satisfied It cannot cause a deadlock
Consider the following proposed solution for the critical section problem. There are $n$ processes : $P_0....P_{n-1}$. In the code, function $\text{pmax}$ returns an inte...
47.6k
views
comment edited
Mar 13, 2016
Operating System
gatecse-2016-set1
operating-system
process-synchronization
difficult
ambiguous
+
–
7
answers
23
Let f(n)= Ω(n), g(n)= O(n) and h(n)= Ѳ(n).
Let $f(n)= Ω(n), g(n)= O(n)$ and $h(n)= Ѳ(n)$. Then $[f(n). g(n)] + h(n)$ is: Ω (n) O (n) Ѳ (n) None of these
Let $f(n)= Ω(n), g(n)= O(n)$ and $h(n)= Ѳ(n)$. Then $[f(n). g(n)] + h(n)$ is:Ω (n)O (n)Ѳ (n)None of these
18.7k
views
commented
Jan 31, 2016
Algorithms
asymptotic-notation
+
–
6
answers
24
GATE CSE 2005 | Question: 55
Consider the languages: $L_1 = \left\{ a^nb^nc^m \mid n,m >0\right\}$ and $ L_2 = \left\{a^nb^mc^m\mid n, m > 0\right\}$ Which one of the following statements is FALSE? $L_1 \cap L_2$ is a context-free language $L_1 \cup L_2$ is a context-free language $L_1 \text{ and } L_2$ are context-free languages $L_1 \cap L_2$ is a context sensitive language
Consider the languages:$L_1 = \left\{ a^nb^nc^m \mid n,m >0\right\}$ and $ L_2 = \left\{a^nb^mc^m\mid n, m 0\right\}$Which one of the following statements is FALSE?$L_1...
8.7k
views
commented
Jan 21, 2016
Theory of Computation
gatecse-2005
theory-of-computation
identify-class-language
normal
+
–
1
answer
25
Comment on (R,*) group / commutative / monoid
Which of the following true about (R,*)? 1) Group but not commutative 2) A commutative group 3) Not a semigroup 4) Not a monoid
Which of the following true about (R,*)?1) Group but not commutative2) A commutative group3) Not a semigroup4) Not a monoid
1.6k
views
answer selected
Jan 27, 2015
Set Theory & Algebra
set-theory&algebra
group-theory
+
–
5
answers
26
GATE CSE 1997 | Question: 1.4
The concatenation of two lists is to be performed on $O(1)$ time. Which of the following implementations of a list should be used? Singly linked list Doubly linked list Circular doubly linked list Array implementation of list
The concatenation of two lists is to be performed on $O(1)$ time. Which of the following implementations of a list should be used?Singly linked listDoubly linked listCirc...
19.5k
views
answered
Dec 18, 2014
DS
gate1997
data-structures
linked-list
easy
+
–
1
answer
27
Understanding Singularity, Triviality, consistency, uniqueness of solutions of linear system
I was solving problems on deciding whether the given system of linear equations with three unknowns have trivial unique solution, non trivial unique solution, non trivial infinite solutions or no solution ... solutions? For singular A, are there infinite non-trivial solutions or unique non-trivial solution?
I was solving problems on deciding whether the given system of linear equations with three unknowns have trivial unique solution, non trivial unique solution, non trivial...
5.9k
views
asked
Dec 7, 2014
1
answer
28
Factor of determinant with identical row
How the following fact applies to determinants (I came across it while solving problems): Consider A is a n× n matrix, the elements of which are real (or complex) polynomials in x. If r rows of the determinant become identical when x ... is collapsing of rows of matrix (into one row) with order of its factors. Am I missing some stupid fact here?
How the following fact applies to determinants (I came across it while solving problems):Consider A is a n× n matrix, the elements of which are real (or complex) po...
1.9k
views
asked
Dec 3, 2014
Linear Algebra
matrix
linear-algebra
polynomials
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register