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 mystylecse
1
votes
1
Proof of whether a TM accepts epsilon is semi decidable
From rice theorem, I know that it is not recursive. But can someone prove that ? Or atleast give some intuitive proof?
From rice theorem, I know that it is not recursive. But can someone prove that ? Or atleast give some intuitive proof?
1.1k
views
answered
Sep 14, 2017
Theory of Computation
theory-of-computation
decidability
+
–
0
votes
2
Turing machines decidability
Check whether the language below is recursive, recursively enumerable but not recursive, or not recursively enumerable? {⟨M1,M2⟩∣ M1 and M2 are two TMs, and ϵ∈L(M1)∖L(M2)}.
Check whether the language below is recursive, recursively enumerable but not recursive, or not recursively enumerable?{⟨M1,M2⟩∣ M1 and M2 are two TMs, and ϵ∈L(M...
664
views
answered
Sep 14, 2017
Theory of Computation
theory-of-computation
turing-machine
decidability
+
–
4
votes
3
Virtual Gate Test Series: Computer Networks - Transmission Control Protocol
On TCP connection, consider FIN, SYN packets will take $1$ byte and ACK packets will take $0$ bytes. Assume client and server are working on this connection. Client and server selected random numbers for sequence numbers $100$ and $500$ ... $(D)$ SEQ NUM = 501 and ACK NUM = 301
On TCP connection, consider FIN, SYN packets will take $1$ byte and ACK packets will take $0$ bytes. Assume client and server are working on this connection. Client and s...
1.7k
views
answered
Sep 14, 2017
Computer Networks
computer-networks
tcp
sequencenumber
virtual-gate-test-series
+
–
0
votes
4
TOC Turing machines Decidability
Check whether the language below is recursive, recursively enumerable but not recursive, or not recursively enumerable? L={⟨M⟩∣ M halts on all palindromes}. How can i use Rice's theorem here? Tyes={All palidroms} Tno={Signma*}.Will that work here? M halts on all palindromes means M halts on only palindromes ?
Check whether the language below is recursive, recursively enumerable but not recursive, or not recursively enumerable?L={⟨M⟩∣ M halts on all palindromes}.How can i...
999
views
answered
Sep 8, 2017
Theory of Computation
theory-of-computation
turing-machine
decidability
+
–
0
votes
5
decidability
INFINITEDFA= {<A> | A is a DFA and L(A) is an infinite language } . Then - a) INFINITEDFA is decidable. b) INFINITEDFA is undecidable. c) INFINITEDFA is Turing-recognizable. d) INFINITEDFA is Turing-unrecognizable.
INFINITEDFA= {<A | A is a DFA and L(A) is an infinite language } . Then -a) INFINITEDFA is decidable.b) INFINITEDFA is undecidable.c) INFINITEDFA is Turing-recognizable.d...
743
views
answered
Sep 8, 2017
Theory of Computation
decidability
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
+
–
1
votes
6
decidability
A = { <M> | M is a DFA that accepts some string with more 1s than 0s }. Then A is - a) undecidable b) recursive enumerable c) decidable d) none of the above
A = { <M | M is a DFA that accepts some string with more 1s than 0s }. Then A is - a) undecidable b) recursive enumerablec) decidabled) none of the above
1.7k
views
answered
Sep 8, 2017
Theory of Computation
decidability
theory-of-computation
recursive-and-recursively-enumerable-languages
turing-machine
+
–
1
votes
7
decidability
E={<M> | M is a TM and L(M)=Φ}. Is E Turing-recognizable?
E={<M | M is a TM and L(M)=Φ}. Is E Turing-recognizable?
568
views
answered
Sep 8, 2017
Theory of Computation
decidability
+
–
1
votes
8
ip address
An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: 245.248.128.0/20. The ISP wants to give half of this chunk of addresses to Organization A, and a quarter to Organization B, while retaining the remaining with itself. Which of the following is a valid allocation of addresses to A and B?
An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: 245.248.128.0/20.The ISP wants to give half of this chunk of addr...
1.3k
views
answered
Sep 5, 2017
Computer Networks
computer-networks
ip-addressing
+
–
2
votes
9
morris mano addressing mode 3rd edition
2.0k
views
answered
Sep 1, 2017
CO and Architecture
addressing-modes
co-and-architecture
+
–
0
votes
10
Calculating disk access time
A program of size 64MB is stored on disk which supports an average seek time of 30ms and rotation time of 20ms. Page size is 4MB and track size is 32MB. If the pages of the program are contiguously placed on disk, then the total time required to load the program from disk in ms is _____ Given answer: 120
A program of size 64MB is stored on disk which supports an average seek time of 30ms and rotation time of 20ms. Page size is 4MB and track size is 32MB. If the pages of t...
9.9k
views
answered
Aug 31, 2017
Operating System
operating-system
disk
+
–
2
votes
11
Inode Questions
Consider an indexed file allocation using index nodes (inodes). An inode contains among other things, 14 direct indexes, one indirect index, two double indexes, and three triple indexes. If the system contains the 10485 files, size of disk is 1 PB ... be addressed by the double indirect block alone?____MB 4. What is the maximum file size possible in this allocation scheme?____GB
Consider an indexed file allocation using index nodes (inodes). An inode contains among other things, 14 direct indexes, one indirect index, two double indexes, and three...
3.0k
views
answered
Aug 31, 2017
Operating System
inode
operating-system
file-system
+
–
3
votes
12
CN Slow Start Throughput
R.T.T=10 microsec. M.S.S=100 Bytes Slow start protocol used to send data.Sender needs to send data till it completes sending window size 8MSS.Find:- a. Total Time taken b. Throughput for 1st RTT c. Total Throughput d. Average Throughput
R.T.T=10 microsec.M.S.S=100 BytesSlow start protocol used to send data.Sender needs to send data till it completes sending window size 8MSS.Find:-a. Total Time takenb....
1.1k
views
answered
Aug 17, 2017
Computer Networks
congestion-control
computer-networks
tcp
+
–
3
votes
13
Cn: Optimal windows size
The round trip delay between x and y is given as 60 ms and bandwidth of link between X and Y is 512 KBps. What is the optimal window size (in packets) if the packet size is 64 bytes and channel is full duplex
The round trip delay between x and y is given as 60 ms and bandwidth of link between X and Y is 512 KBps. What is the optimal window size (in packets) if the packet size...
3.6k
views
answered
Aug 16, 2017
Computer Networks
computer-networks
sliding-window
+
–
0
votes
14
test book test
46 bit Virtual addressing system uses 3 level paging. The page table entry is 32 bits. Size of Page Table is equal to 1 page. The processor uses 1 MB, 16 way set associative cache with 64 block. What is the size of Page Table? a) 2KB b) 4KB c) 8KB d) 16KB
46 bit Virtual addressing system uses 3 level paging. The page table entry is 32 bits. Size of Page Table is equal to 1 page. The processor uses 1 MB, 16 way set associat...
1.2k
views
answered
Aug 11, 2017
0
votes
15
frame size != page size
Consider a system with 2 level paging applicable the page table is divided into 8K pages each of size 16KB. The memory is byte addressable if the physical address space is 128 MB which is divided into 4KB frames. The page table entry size of outer page table ... bits. What will be the page table size of inner and outer page table. How can frame size and page size be unequal?
Consider a system with 2 level paging applicable the page table is divided into 8K pages each of size 16KB. The memory is byte addressable if the physical address space i...
2.8k
views
answered
Aug 11, 2017
Operating System
memory-management
paging
operating-system
+
–
0
votes
16
GATE CSE 2006 | Question: 59
Consider the following translation scheme. $ S\rightarrow ER$ $ R\rightarrow *E\left \{ \text{print}(\text{ }*\text{'}); \right \} R\mid \varepsilon $ $ E\rightarrow F+E\left \{ \text{print}(\text{ }+\text{'}); \right \}\mid F $ ... $2 * 3 + 4$ $2 * +3 \ 4$ $2 \ 3 * 4 +$ $2 \ 3 \ 4+*$
Consider the following translation scheme. $ S\rightarrow ER$$ R\rightarrow *E\left \{ \text{print}(\text{‘}*\text{’}); \right \} R\mid \varepsilon $$ E\rightarrow F+...
11.1k
views
answered
Aug 9, 2017
Compiler Design
gatecse-2006
compiler-design
grammar
normal
+
–
0
votes
17
Permutations
How many different words of 3 length can be formed from a,e,i,o,u containing a,e ?
How many different words of 3 length can be formed from a,e,i,o,u containing a,e ?
801
views
answered
Aug 9, 2017
Combinatory
combinatory
discrete-mathematics
+
–
26
votes
18
GATE CSE 2009 | Question: 13
Which of the following statement(s) is/are correct regarding Bellman-Ford shortest path algorithm? P: Always finds a negative weighted cycle, if one exists. Q: Finds whether any negative weighted cycle is reachable from the source. $P$ only $Q$ only Both $P$ and $Q$ Neither $P$ nor $Q$
Which of the following statement(s) is/are correct regarding Bellman-Ford shortest path algorithm?P: Always finds a negative weighted cycle, if one exists.Q: Finds whethe...
16.8k
views
answered
Jul 29, 2017
Algorithms
gatecse-2009
algorithms
graph-algorithms
normal
+
–
29
votes
19
GATE CSE 2009 | Question: 21
An unbalanced dice (with $6$ faces, numbered from $1$ to $6$) is thrown. The probability that the face value is odd is $90\%$ of the probability that the face value is even. The probability of getting any even numbered face is the same. If the ... following options is closest to the probability that the face value exceeds $3$? $0.453$ $0.468$ $0.485$ $0.492$
An unbalanced dice (with $6$ faces, numbered from $1$ to $6$) is thrown. The probability that the face value is odd is $90\%$ of the probability that the face value is ev...
16.6k
views
answered
Jul 29, 2017
Probability
gatecse-2009
probability
normal
conditional-probability
+
–
10
votes
20
GATE CSE 2009 | Question: 47
While opening a $TCP$ connection, the initial sequence number is to be derived using a time-of-day (ToD) clock that keeps running even when the host is down. The low order $32$ bits of the counter of the ToD clock is to be used for the initial sequence numbers ... sequence numbers used for packets of a connection can increase? $0.015$/s $0.064$/s $0.135$/s $0.327$/s
While opening a $TCP$ connection, the initial sequence number is to be derived using a time-of-day (ToD) clock that keeps running even when the host is down. The low orde...
25.5k
views
answered
Jul 28, 2017
Computer Networks
gatecse-2009
computer-networks
tcp
difficult
ambiguous
+
–
3
votes
21
GATE CSE 2009 | Question: 58
Frames of $1000\text{ bits}$ are sent over a $10^6$ bps duplex link between two hosts. The propagation time is $25ms$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). Let $I$ be ... before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time) $16ms$ $18ms$ $20ms$ $22ms$
Frames of $1000\text{ bits}$ are sent over a $10^6$ bps duplex link between two hosts. The propagation time is $25ms$. Frames are to be transmitted into this link to maxi...
30.3k
views
answered
Jul 28, 2017
Computer Networks
gatecse-2009
computer-networks
sliding-window
normal
+
–
23
votes
22
GATE CSE 1989 | Question: 3-viii
In which of the following case(s) is it possible to obtain different results for call-by-reference and call-by-name parameter passing? Passing an expression as a parameter Passing an array as a parameter Passing a pointer as a parameter Passing as array element as a parameter
In which of the following case(s) is it possible to obtain different results for call-by-reference and call-by-name parameter passing?Passing an expression as a parameter...
4.6k
views
answered
Jul 22, 2017
Compiler Design
gate1989
parameter-passing
runtime-environment
compiler-design
multiple-selects
+
–
0
votes
23
ISRO-2013-14
A processor is fetching instructions at the rate of $1$ MIPS. A DMA module is used to transfer characters to RAM from a device transmitting at $9600$ bps. How much time will the processor be slowed down due to DMA activity? $9.6$ms $4.8$ms $2.4$ms $1.2$ms
A processor is fetching instructions at the rate of $1$ MIPS. A DMA module is used to transfer characters to RAM from a device transmitting at $9600$ bps. How much time w...
7.3k
views
answered
Jul 21, 2017
CO and Architecture
isro2013
dma
+
–
1
votes
24
dma throughput
A DMA controller transfers $16$ bytes to memory using cycle stealing with frequency $1.2$GHz. The number of clock cycles used for transfer of $16$ bytes is $20$ Clock cycles. Find the throughout?
A DMA controller transfers $16$ bytes to memory using cycle stealing with frequency $1.2$GHz. The number of clock cycles used for transfer of $16$ bytes is $20$ Clock cyc...
1.2k
views
answered
Jul 21, 2017
CO and Architecture
dma
+
–
4
votes
25
GATE CSE 1993 | Question: 6.8
The details of an interrupt cycle are shown in figure. Given that an interrupt input arrives every $1$ msec, what is the percentage of the total time that the CPU devotes for the main program execution.
The details of an interrupt cycle are shown in figure.Given that an interrupt input arrives every $1$ msec, what is the percentage of the total time that the CPU devote...
6.5k
views
answered
Jul 19, 2017
Operating System
gate1993
operating-system
interrupts
normal
descriptive
+
–
6
votes
26
MadeEasy Subject Test: CO & Architecture - Io Handling
The solution says that the answer should be 80, but applying the formula (x/y)*100, where x is 250 and y is 200 fraction comes out to be greater than 1. Am i making a mistake in interpreting x and y here?
The solution says that the answer should be 80, but applying the formula (x/y)*100, where x is 250 and y is 200 fraction comes out to be greater than 1. Am i making a mis...
801
views
answered
Jul 19, 2017
CO and Architecture
co-and-architecture
made-easy-test-series
interrupts
io-handling
+
–
6
votes
27
GATE CSE 1987 | Question: 2a
State whether the following statements are TRUE or FALSE In a microprocessor-based system, if a bus (DMA) request and an interrupt request arrive sumultaneously, the microprocessor attends first to the bus request.
State whether the following statements are TRUE or FALSEIn a microprocessor-based system, if a bus (DMA) request and an interrupt request arrive sumultaneously, the micro...
3.0k
views
answered
Jul 19, 2017
CO and Architecture
gate1987
co-and-architecture
interrupts
io-handling
true-false
+
–
2
votes
28
GATE CSE 2005 | Question: 70
Consider a disk drive with the following specifications: $16$ surfaces, $512$ tracks/surface, $512$ sectors/track, $1$ KB/sector, rotation speed $3000$ rpm. The disk is operated in cycle stealing mode whereby whenever one $4$ byte word is ready it is sent ... $40$ nsec. The maximum percentage of time that the CPU gets blocked during DMA operation is: $10$ $25$ $40$ $50$
Consider a disk drive with the following specifications:$16$ surfaces, $512$ tracks/surface, $512$ sectors/track, $1$ KB/sector, rotation speed $3000$ rpm. The disk is op...
65.4k
views
answered
Jul 18, 2017
CO and Architecture
gatecse-2005
co-and-architecture
disk
normal
dma
+
–
2
votes
29
GATE CSE 1989 | Question: 11a
A system of four concurrent processes, $P, Q, R$ and $S$, use shared resources $A, B$ and $C$. The sequences in which processes, $P, Q, R$ and $S$ ... What strategies can be used to prevent deadlocks in a system of concurrent processes using shared resources if preemption of granted resources is not allowed?
A system of four concurrent processes, $P, Q, R$ and $S$, use shared resources $A, B$ and $C$. The sequences in which processes, $P, Q, R$ and $S$ request and release res...
3.3k
views
answered
Jul 6, 2017
Operating System
descriptive
gate1989
operating-system
resource-allocation
+
–
2
votes
30
GATE CSE 2013 | Question: 9
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production (i.e., of type $A \rightarrow \epsilon$ and $A \rightarrow a$) to parse a string with $n$ tokens? $n/2$ $n-1$ $2n-1$ $2^{n}$
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production (i.e., of type $A \rightarrow \epsilo...
35.3k
views
answered
Jun 26, 2017
Compiler Design
gatecse-2013
compiler-design
parsing
normal
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register