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
Answers by stblue
2
votes
41
Regular expressions
(a (ba)* (a + bb) + b (ab)* (b + aa)) (a+b)* = (a+b)* (aa+bb) (a+b)*. how???
(a (ba)* (a + bb) + b (ab)* (b + aa)) (a+b)* = (a+b)* (aa+bb) (a+b)*. how???
870
views
answered
Aug 25, 2017
Theory of Computation
theory-of-computation
regular-expression
+
–
1
votes
42
anyone who can solve this i know how to solve but i have a doubt ?
How many different words can be formed using all the letters of the word ALLAHABAD? (a) When vowels occupy the even positions. (b) Both L do not occur together.
How many different words can be formed using all the letters of the word ALLAHABAD?(a) When vowels occupy the even positions.(b) Both L do not occur together.
913
views
answered
Aug 21, 2017
2
votes
43
Context free languages and Regular Languages
Let L be CFL and M a regular language. Language L ⋂ M is always (a) always regular (b) never regular (c) always DCFL (d) always context free language
Let L be CFL and M a regular language. Language L ⋂ M is always(a) always regular (b) never regular(c) always DCFL (d) always context free language
493
views
answered
Aug 20, 2017
Theory of Computation
theory-of-computation
context-free-language
+
–
2
votes
44
#TOC what will be the R.E of this DFA?
I'm getting R.E as 0*1(01)*1(0+1)* but people are getting (0+10)*11(1+0)* Please tell, how!?
I'm getting R.E as 0*1(01)*1(0+1)* but people are getting (0+10)*11(1+0)*Please tell, how!?
1.4k
views
answered
Aug 20, 2017
Theory of Computation
finite-automata
regular-expression
+
–
1
votes
45
First & Follow Question
is it correct?
is it correct?
2.0k
views
answered
Aug 20, 2017
Compiler Design
first-and-follow
compiler-design
+
–
4
votes
46
Compiler Design : First & Follow
is it correct ?
is it correct ?
6.1k
views
answered
Aug 20, 2017
Compiler Design
first-and-follow
compiler-design
+
–
7
votes
47
Fragmentation
Suppose a network:- Suppose a TCP message contains 492 B of data and TCP header is of size 20B then deliver it to IP. IP header is 20 B. Assume link A-R1 has the maximum frame size of 700 B including a frame size of 14 B, link R1-R2 can support a ... of 256 B including a 12 B frame header. Then calculate the no of fragments at each link and show the format of fragments in each link.
Suppose a network:-Suppose a TCP message contains 492 B of data and TCP header is of size 20B then deliver it to IP. IP header is 20 B.Assume link A-R1 has the maximum fr...
2.4k
views
answered
Aug 20, 2017
Computer Networks
fragmentation
computer-networks
network-layering
tcp
+
–
5
votes
48
Self_doubt
This is true that at every router the value of TTL is decremented by one but does that actually mean that other fields in the header are also recomputed?
This is true that at every router the value of TTL is decremented by one but does that actually mean that other fields in the header are also recomputed?
1.7k
views
answered
Aug 19, 2017
Computer Networks
computer-networks
+
–
3
votes
49
Context Free Languages
{${a^{i}b^{j}c^{k}| (i\leq j)or(j\leq i),j=k}$} is CFL?
{${a^{i}b^{j}c^{k}| (i\leq j)or(j\leq i),j=k}$} is CFL?
242
views
answered
Aug 19, 2017
9
votes
50
Deadlock and Unsafe state
Why unsafe state not leads to deadlock? Please don't redirect to any other link. Explain it by taking an example.
Why unsafe state not leads to deadlock?Please don't redirect to any other link. Explain it by taking an example.
6.0k
views
answered
Aug 17, 2017
Operating System
operating-system
deadlock-prevention-avoidance-detection
+
–
4
votes
51
CN: TCP Window Size
Consider TCP congestion control. Assuming RTT as 4 seconds and segment size as 3KB, if bandwidth is 500kbps, what is the smallest window size for which there is no stalling in this case?
Consider TCP congestion control. Assuming RTT as 4 seconds and segment size as 3KB, if bandwidth is 500kbps, what is the smallest window size for which there is no stalli...
1.7k
views
answered
Aug 16, 2017
Computer Networks
computer-networks
tcp
+
–
0
votes
52
GATE CSE 2016 Set 1 | Question: 44
Let $X$ be a recursive language and $Y$ be a recursively enumerable but not recursive language. Let $W$ and $Z$ be two languages such that $\overline{Y}$ reduces to $W$, and $Z$ reduces to $\overline{X}$ (reduction means the standard ... enumerable. $W$ is not recursively enumerable and $Z$ is recursive. $W$ is not recursively enumerable and $Z$ is not recursive.
Let $X$ be a recursive language and $Y$ be a recursively enumerable but not recursive language. Let $W$ and $Z$ be two languages such that $\overline{Y}$ reduces to $W$,...
12.5k
views
answered
Aug 15, 2017
Theory of Computation
gatecse-2016-set1
theory-of-computation
easy
recursive-and-recursively-enumerable-languages
reduction
+
–
1
votes
53
GATE CSE 2013 | Question: 17
Which of the following statements is/are FALSE? For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. Turing recognizable languages are closed under union and complementation. Turing decidable languages are closed under intersection and ... and intersection. $1$ and $4$ only $1$ and $3$ only $2$ only $3$ only
Which of the following statements is/are FALSE?For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.Turing recognizable lan...
21.0k
views
answered
Aug 14, 2017
Theory of Computation
gatecse-2013
theory-of-computation
normal
closure-property
+
–
39
votes
54
GATE CSE 2001 | Question: 1.18
Which of the following statements is false? An unambiguous grammar has same leftmost and rightmost derivation An LL(1) parser is a top-down parser LALR is more powerful than SLR An ambiguous grammar can never be LR(k) for any k
Which of the following statements is false?An unambiguous grammar has same leftmost and rightmost derivationAn LL(1) parser is a top-down parserLALR is more powerful than...
18.1k
views
answered
Aug 14, 2017
Compiler Design
gatecse-2001
compiler-design
grammar
normal
+
–
0
votes
55
question set
An unambiguous grammar has same leftmost and rightmost derivation. True or False and how??
An unambiguous grammar has same leftmost and rightmost derivation.True or Falseand how??
348
views
answered
Aug 14, 2017
Compiler Design
compiler-design
parsing
+
–
33
votes
56
GATE IT 2005 | Question: 83b
Consider the context-free grammar $E\rightarrow E+E$ $E\rightarrow (E *E)$ $E\rightarrow \text{id}$ where $E$ is the starting symbol, the set of terminals is $\{id, (,+,),*\}$, and the set of non-terminals is $\{E\}$. For the terminal string $id + id + id + id$, how many parse trees are possible? $5$ $4$ $3$ $2$
Consider the context-free grammar$E\rightarrow E+E$$E\rightarrow (E *E)$$E\rightarrow \text{id}$where $E$ is the starting symbol, the set of terminals is $\{id, (,+,),*\}...
7.0k
views
answered
Aug 14, 2017
Compiler Design
gateit-2005
compiler-design
parsing
normal
+
–
3
votes
57
R.S.AGGARWAL
If log 2 =0.30103, find the number of digits in 256 ?
If log 2 =0.30103, find the number of digits in 256 ?
921
views
answered
Aug 13, 2017
Verbal Aptitude
quantitative-aptitude
+
–
6
votes
58
CPU SCHEDULING
Consider 3 process P0, P1, P2 to be scheduled as per SRTF algorithm. The process P0 is known to be scheduled first and when P0 is running 5 units of time the process P2 arrived. The process P2 has own 2 units of time, the process P1 ha arrived and completed running in 4 units of time. Then the minimum burst time of P0 is
Consider 3 process P0, P1, P2 to be scheduled as per SRTF algorithm. The process P0 is known to be scheduled first and when P0 is running 5 units of time the process P2 a...
1.4k
views
answered
Aug 13, 2017
Operating System
operating-system
process-scheduling
+
–
3
votes
59
#combinotirics
Find the largest integer value of x such that the following inequality holds: (10 C x-1) <2*(10 C x) In this question if solved line by line i am getting x<6. but clearly if you put x=7, it satisfies the inequality and 7 becomes the largest integer. Is there a procedure to get answer 7 step by step??
Find the largest integer value of x such that the following inequality holds:(10 C x-1) <2*(10 C x)In this question if solved line by line i am getting x<6.but clearly if...
195
views
answered
Aug 12, 2017
Combinatory
combinatory
+
–
0
votes
60
#Disk
Consider a disk with seek time of 4 ms, rotation speed of 15,000 rpm and 512-byte sectors with 500 sectors per track. Suppose that we wish to read a file consistinh of 2500 sectors for a total of 1.28 Mbytes. We would like to estimate the total time for the transfer?
Consider a disk with seek time of 4 ms, rotation speed of 15,000 rpm and 512-byte sectors with 500 sectors per track. Suppose that we wish to read a file consistinh of 25...
4.7k
views
answered
Aug 12, 2017
1
votes
61
Random question
Let ‘R’ be a regular expression, then which of the following statements is/are TRUE for every 'R'? S1: There exists 'S' which satisfies property R + S = S. S2: There exists 'S' which satisfies property R.S = S A) only S1 is true B) only S2 is true C) Both are true D) Both are false Please answer this with a suitable explanation.
Let ‘R’ be a regular expression, then which of the following statements is/are TRUE for every 'R'?S1: There exists 'S' which satisfies property R + S = S.S2: There ex...
1.6k
views
answered
Aug 12, 2017
Theory of Computation
regular-expression
+
–
6
votes
62
Digital Logic: Gate2016 ECE
The delays of NOR gates, Multiplexer and Inverters are 2ns, 1.5ns and 1ns respectively. If all the inputs P, Q, R, S and T are applied at the same time instant, Then the Maximum propagation delay (in ns) of the circuit is _______________
The delays of NOR gates, Multiplexer and Inverters are 2ns, 1.5ns and 1ns respectively.If all the inputs P, Q, R, S and T are applied at the same time instant, Then the M...
6.9k
views
answered
Aug 12, 2017
Digital Logic
multiplexer
gate-ece
digital-logic
+
–
0
votes
63
logic gate
In the logic circuit shown below the redundant gate is _________??????
In the logic circuit shown below the redundant gate is _________??????
1.6k
views
answered
Aug 11, 2017
5
votes
64
madeeasy workbook
if a disk system has an average seek time of 30ns and rotation rate of 360RPM. each track of the disk has 512 sectors each of size 512 Bytes. what is the time taken to read 4 successive sectors,also compute the effective data transfer rate a) 0.0843 sec , 1536 kbps b) 0.123 sec , 1436 kbps c) 0.156 sec ,1326 kbps d) 0.135 sec , 1252 kbps
if a disk system has an average seek time of 30ns and rotation rate of 360RPM. each track of the disk has 512 sectors each of size 512 Bytes. what is the time taken to re...
2.7k
views
answered
Aug 11, 2017
6
votes
65
SRTF question
With the use of SRTF the execution of three processes is as follows, the process A is scheduled first and A has been running for 6 units of time, the process B is arrived process B ran for 2 units of time, later process C is arrived and completed running in 4 units of time. Find the minimum possible burst time of the process A and B. 9, 6 10, 6 2, 8 11, 7
With the use of SRTF the execution of three processes is as follows, the process A is scheduled first and A has been running for 6 units of time, the process B is arrived...
1.5k
views
answered
Aug 11, 2017
Operating System
process-scheduling
+
–
0
votes
66
Threads
The primary difference between process and thread ? (A) The number of I/O requests mode. (B) The amount of overhead associated with creation and context switching . (C) The amount of memory allocation (D) The average number of instructions executed
The primary difference between process and thread ?(A) The number of I/O requests mode.(B) The amount of overhead associated with creation and context switching .(C) The ...
1.9k
views
answered
Aug 11, 2017
Operating System
threads
operating-system
process
+
–
0
votes
67
TOC What language is this?
The given set is 1,2,4,8, . . . . . 2^n in unary number system which is shown in BOLD below L = {1,11,1111,11111111, . . . . . . . . } Is it regular or CFL?
The given set is 1,2,4,8, . . . . . 2^n in unary number system which is shown in BOLD belowL = {1,11,1111,11111111, . . . . . . . . }Is it regular or CFL?
583
views
answered
Aug 11, 2017
Theory of Computation
theory-of-computation
regular-expression
finite-automata
identify-class-language
+
–
1
votes
68
Kenneth Rosen Edition7th Exercise 6.1 Example 20 (Page No. 394)
what does it mean that "each person has same left and right neighbour "?
what does it mean that "each person has same left and right neighbour "?
420
views
answered
Aug 10, 2017
Combinatory
discrete-mathematics
kenneth-rosen
combinatory
+
–
3
votes
69
TOC Question
Sorry my BAD, it's an infinite language! The given set {1, 101, 11011,1110111,......} is a Regular Language or CFL?
Sorry my BAD, it's an infinite language!The given set {1, 101, 11011,1110111,......} is a Regular Language or CFL?
960
views
answered
Aug 10, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
Page:
« prev
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register