Recent questions

Recent questions

0 votes

0 answers

1

Unacademy
Please explain in details

raja11sep asked in Algorithms 2 hours ago

18 views

0 votes

1 answer

2

Self Doubt
Could anyone please explain various tricks to find out wheather the given context free Grammar is ambiguous or not in an easier way?

vishnu777 asked in Theory of Computation 19 hours ago

32 views

0 votes

0 answers

3

Made Easy Test Series
“Consider the following proposed solution to dining philosophers problem to avoid deadlock. Consider the binary semaphore lock is initialized to 1. Which of the following is correct?” In the above question, is the given solution deadlock free? Will removing (iii) and (iv) can make the solution deadlock free?

abuhujair asked in Operating System 20 hours ago

23 views

0 votes

1 answer

4

Applied Full length Test
The packet is sent from source to router with the link having the maximum transmission unit (MTU) as 480 bytes, the header is of size 20 bytes. The intermediate fragment size is X and the last fragment size is Y when the packet size is of 2000 bytes including the header. Calculate the value of X+Y in bytes? what i was getting 672 but they have given 652

Sagar475 asked in Computer Networks 20 hours ago

23 views

0 votes

2 answers

5

normalization - DBMS
If AD is the only candidate key for some relation R(A,B,C,D,E) then will CD → E be considered a partial dependency?

atulcse asked in Databases 22 hours ago

46 views

0 votes

1 answer

6

Gate Applied Test Series
Question→ Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will guarantee a deadlock is ___ Answer Given is: 1

lalitver10 asked in Operating System 22 hours ago

54 views

0 votes

1 answer

7

computer networks - queuing delay
Consider the queuing delay in a router buffer (preceding an outbound link). Suppose packet length is L bits and the link rate is R bps, and that N packets arrive to the buffer every LN/R seconds. Find the average queuing delay of the packets.

atulcse asked in Computer Networks 1 day ago

32 views

0 votes

2 answers

8

Self doubt CN
Can the header length of IPV4 change at the router? If yes, then why?

tusharhigh asked in Computer Networks 1 day ago

42 views

1 vote

1 answer

9

Made Easy Test Series
Whether the following language is DCFL, or CFL but not DCFL?

abuhujair asked in Theory of Computation 1 day ago

41 views

1 vote

3 answers

10

MADE EASY TEST SERIES | MOCK 2 - 2022
Assume that you have made a request for a web page through your web browser to a web server. Initially the browser cache is empty. Further, the browser is configured to send HTTP requests in PERSISTENT mode. The web page contains text ... very small images. The minimum number of TCP connections required to display the web page completely in your browser is ___.

kbbhatt04 asked in Computer Networks 2 days ago

57 views

1 vote

1 answer

11

DCFL - TOC
Is the following language a DCFL? Please explain your reasoning.

atulcse asked in Theory of Computation 2 days ago

53 views

0 votes

1 answer

12

parse tree - context-free grammars - TOC
Given a CFG and a string, what is the relation between the number of leftmost derivations, the number of rightmost derivations and the number of parse trees?

atulcse asked in Theory of Computation 2 days ago

51 views

0 votes

1 answer

13

Gate Applied Test Series
A min heap of size 2048 is stored on an array with array indices [1..2048] is stored and the minimum number of comparisons required to determine the maximum of element is _______.(Assume that we are allowed to access the array indexes)

Sagar475 asked in Algorithms 2 days ago

32 views

0 votes

1 answer

14

Applied Test Series
Consider a hypothetical 32-bit microprocessor having 32-bit instructions composed of two fields : the first byte contains the opcode and the remainder is an immediate operand or an operand address. What is the maximum directly addressable memory capacity (in Megabytes)? consider memory as byte addressable.

Sagar475 asked in CO and Architecture 2 days ago

15 views

0 votes

1 answer

15

Discrete Maths(Applied Test Series)
The number of all abelian groups, up to isomorphism, of order 32 is not: 4 5 6 7

Sagar475 asked in Set Theory & Algebra 2 days ago

30 views

0 votes

1 answer

16

Made Easy Test Series
The round trip delay between A and B is given as 60 ms, and the bottleneck bandwidth of the link between A and B is 512 KBps. What is the optimal window size (in packets) if the packet size is 64 bytes and the channel is full duplex.

LRU asked in Computer Networks 2 days ago

by LRU

47 views

0 votes

1 answer

17

Strategy
Plz can anyone tell me prepration strategies and revision how to do it plz tell me

Vaishnavi Gadhe asked in Revision 2 days ago

by Vaishnavi Gadhe

27 views

0 votes

1 answer

18

computer organization
Is non-linear pipe lining in gate 2022???

ramraj13 asked in CO and Architecture 2 days ago

46 views

1 vote

1 answer

19

Made Easy Test Series
Consider L = {w011w | w ∈ (o+1)*}. Find minimum number of states that are required in DFA (L). Found this question in Made Easy Test Series and I think the question is incorrect, as the language is not regular. The solution of this question given by Made Easy ... the given solution to be true L should be, L = {w011x | w,x ∈ (o+1)*}. Request you all to provide your comments.

abuhujair asked in Theory of Computation 2 days ago

49 views

0 votes

0 answers

20

Made Easy Test Series
Consider a fully associative cache with 6 cache blocks (0 to 5) and the following sequence of memory block requests: 5, 4, 29, 18, 21, 7, 25, 18, 16, 35, 45, 22, 7, 19 If LRU replacement policy is used, which cache block is used for memory block 19? Assume initially 6 blocks are placed in a cache according to lexicographic order of cache index.

LRU asked in CO and Architecture 3 days ago

by LRU

45 views

Page:

1
2
3
4
5
6
...
1000
next »

Follow @gateoverflow

GATE Overflow

Recent questions

Search GATE Overflow