Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register
|
I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Answers by user2525
User user2525
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User user2525
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
A wait operation on a semaphore should not occur within a critical section controlled by that semaphore because:
answered
Aug 21, 2019
in
Operating System
|
190
views
operating-system
semaphores
0
votes
Context free language
Is the given language CFL or not? Σ*-L={a^n b^n a^n| n>=1}
answered
Aug 14, 2019
in
Theory of Computation
|
31
views
theory-of-computation
cfg
context-free-languages
0
votes
Ambiguity of grammars
Consider the Language: L = {$a^{n}b^{n}c^{k}$, n,k ≥ 1} ⋃ {$a^{n}b^{k}c^{k}$, n,k≥ 1} Which is True? (a) All the Grammars generating L will be ambiguous. (b) There exists a G which is unambiguous. (c) Language L is unambiguous (d) None of the above
answered
Aug 13, 2019
in
Theory of Computation
|
27
views
theory-of-computation
grammar
ambiguity
+1
vote
Selft doubt - Decidability
Given a TM, M accepts a set of 100 Strings is decidable?
answered
Aug 13, 2019
in
Theory of Computation
|
96
views
0
votes
Self Doubt: POSET
I am unable to understand how Equality of Sets is a POSET? How can it satisfy anti-symmetric property?
answered
Aug 13, 2019
in
Set Theory & Algebra
|
75
views
discrete-maths
0
votes
Relation between A,B and C
Let A= (a + b)* ab (a + b)*, B= a*b* and C= (a + b)*. Then the relation between A, B and C: A. A+B= C B. $A^{R}+B^{R}=C$ C. $A^{R}$+B= C D. None of these
answered
Aug 12, 2019
in
Theory of Computation
|
67
views
theory-of-computation
regular-languages
0
votes
TSPGECET-2019-CSE-10
The value of $c$ of Cauchy’s mean value theorem for the function $f(x)=\frac{1}{x^{2}}$ and $g(x)=\frac{1}{x^{2}}$ in $[a,b]$ $\frac{2ab}{a+b}$ $\frac{2ab}{a-b}$ $\frac{2}{a-b}$ $\frac{2}{ab}$
answered
Aug 12, 2019
in
Others
|
23
views
tspgecet-cse-2019
0
votes
TSPGECET-2019-CSE-11
Function $F$ finds maximum and minimum of $50$ numbers. Number of comparisons in this function are: $72$ $1225$ $147$ $50$
answered
Aug 12, 2019
in
Others
|
17
views
tspgecet-cse-2019
0
votes
TSPGECET-2019-CSE-2
If $P(A) = \frac{1}{5}$ , $P(B) = \frac{2}{3}$ and $P(A\cap B) = \frac{1}{15}$, then $P(A\cap B^{^{c}}) =$ $\frac{2}{15}$ $\frac{3}{5}$ $\frac{4}{15}$ $\frac{14}{15}$
answered
Aug 12, 2019
in
Others
|
20
views
tspgecet-cse-2019
0
votes
Self doubt: Digital logic 1
Is it a counter circuit?How to recognize ? If all flip-flop are reset state at first, what is it’s output at Y after $5$ th clock pulse?
answered
Aug 11, 2019
in
Digital Logic
|
55
views
digital-logic
0
votes
Complement of Context Free Language
I have read that CFL is not closed under complementation. I read somewhere that complement of CFL is CSL. I am not sure if I remember it correctly. Answer is given as D here. Kindly clarify my doubt. Thank you.
answered
Aug 11, 2019
in
Theory of Computation
|
77
views
theory-of-computation
0
votes
Regular expression doubt
Please explain the solution. Thank you.
answered
Aug 11, 2019
in
Theory of Computation
|
20
views
theory-of-computation
0
votes
Epsilon NFA doubt
Please show the approach. I am not fully aware of how delta star works. Does it mean applying epsilon *, a, epsilon * on qo state? Kindly explain. Thank you.
answered
Aug 11, 2019
in
Theory of Computation
|
50
views
theory-of-computation
finite-automata
+2
votes
Nullity of a matrix
Answer is given as 1. Please show the solution. Thank you.
answered
Aug 11, 2019
in
Linear Algebra
|
31
views
0
votes
Ace booklet question
If IP is 1 0 3 2 5 4 7 6 then what is $IP^{-1}$
answered
Aug 11, 2019
in
Computer Networks
|
26
views
computernetwork
ip
0
votes
Set Theory Practice Question
answered
Aug 10, 2019
in
Set Theory & Algebra
|
43
views
sets
+1
vote
Let S = { 0,3,6,9 } and ( S, (+) 12 ) forms a group where (+) 12 ; find inverse value of ( 0+3+6+9 )
answered
Aug 10, 2019
in
Set Theory & Algebra
|
55
views
group-theory
settheory
+1
vote
Language L = {an bn w | n ≥ 0, w ∈ {c, d}*, |w| = n} is
answered
Aug 9, 2019
in
Theory of Computation
|
19
views
theory-of-computation
+1
vote
LEAKY BUCKET ALGORITHM
Suppose a system has 50MB data to send on a network and transmit the data in burst at 8Mbps, the maximum transmission rate across routers in the network is 6Mbps,if system uses leaky bucket algorithm, the capacity(in MB) that bucket must hold so that no data is discarded is______(upto 1 decimal place)
answered
Aug 9, 2019
in
Computer Networks
|
230
views
computernetwork
0
votes
Self doubt, test Series
What are PDA and Turing Machine by default deterministic or non deterministic?
answered
Aug 8, 2019
in
Theory of Computation
|
33
views
selfdoubt
0
votes
Decompose to BCNF.
answered
Aug 8, 2019
in
Databases
|
27
views
+1
vote
ME test series
Let L = { Language of all CFG’s that are ambiguous .} and L’ be the complement of L . Which one will be RE L or L’ ?
answered
Aug 7, 2019
in
Theory of Computation
|
39
views
0
votes
Computer Networks - Wifi
Suppose that a 10-Mbps 802.11b LAN is transmitting 128- bytes frames back to back over radio channel with a bit error of 10^-5. How many frames per second will be damaged on average?
answered
Aug 7, 2019
in
Computer Networks
|
34
views
computernetwork
datalinklayer
+1
vote
gate 2014 toc self doubt
https://gateoverflow.in/1994/gate2014-2-35 in this question can’t we directly apply rices theorem we can have a Tyes for languages with 2014 length input and Tno for Σ* since Tyes subset Tno it shouldnt be recursively enumerable . could someone elaborate where i am wrong?
answered
Aug 7, 2019
in
Theory of Computation
|
35
views
theory-of-computation
decidability
ricestheorem
0
votes
Self doubt in physical and logical address
In operating system address generated by cpu is Logical Address but generally in computer architecture address generated by cpu is Physical address ? What is the reason ? Anyone explain plz?
answered
Aug 7, 2019
in
Operating System
|
52
views
+1
vote
Computer Network - traffic shaping
Computer A has 19.5 MB to send on a network and transmits the data in burst 6 Mbps. The maximum transmission rate across router in the network is 4Mbps. If Computer A transmission is shaped using a leaky bucket, how much capacity(Mb) must the queue in the bucket hold not to discard any data?
answered
Aug 7, 2019
in
Computer Networks
|
135
views
tcp
computernetwork
protocols
computer-networks
+1
vote
ALOHA QUESTION
Consider a slotted aloha with 2Mbps ethernet, what is the throughput (in kbps) for slotted aloha at G=3_______(upto1 decimal place)
answered
Aug 7, 2019
in
Computer Networks
|
374
views
computernetwork
0
votes
Computer Networks overhead question
Assuming that, for given network layer implementation, connection establishment overheads are 100 bytes and disconnection are 28 bytes, what would be the minimum size of a packet the transport layer needs to keep if it wishes to implement a datagram ... its overhead to a maximum of 12.5%. Ignore transport layer overheads. 512 bytes 768 bytes 1152 bytes 1024 bytes
answered
Aug 7, 2019
in
Computer Networks
|
268
views
computernetwork
computer-networks
protocols
tcp
0
votes
Minimum cost spanning trees
How many no of spanning trees are possible if the graph is not complete graph?
answered
Aug 7, 2019
in
Algorithms
|
34
views
+1
vote
Self Doubt: Knight and Knave problem
Consider there are two tribes living on the Island: Knights and knaves. Knights always tell truth while Knaves always tells lie. Suppose we counter two random people A and B, upon asking a question to A', A says If B is Knight then I am a Knave . What we can ... B is Knave b.) A is Knave and B is Knave c.) Both A and B are Knight d.) Both A and B are Knave
answered
Aug 6, 2019
in
Mathematical Logic
|
47
views
discrete-maths
0
votes
Operating System Semaphore
How is this option ensuring bounded waiting?
answered
Aug 6, 2019
in
Operating System
|
82
views
0
votes
Gate 2018 - First Order Logic
Consider the first-order logic sentence φ ≡ ∃s∃t∃u∀v∀w∀x∀y ψ(s,t, u, v, w, x, y) where ψ(s,t, u, v, w, x, y) is a quantifier-free first-order logic formula using only predicate symbols, and possibly equality, but no function ... of size equal to 7. Can anyone tell me the entire thing with an elaborate and proper explanation from the basic regarding this question.
answered
Aug 5, 2019
in
Mathematical Logic
|
122
views
discrete-maths
propositional-logic
Page:
1
2
3
next »
9,003
questions
3,135
answers
14,390
comments
95,818
users