Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged descriptive
19
votes
4
answers
2371
ISI2016
A palindrome is a sequence of digits which reads the same backward or forward. For example, $7447$, $1001$ are palindromes, but $7455$, $1201$ are not palindromes. How many $8$ digit prime palindromes are there?
A palindrome is a sequence of digits which reads the same backward or forward. For example, $7447$, $1001$ are palindromes, but $7455$, $1201$ are not palindromes. How ma...
abhi18459
1.7k
views
abhi18459
asked
May 8, 2016
Combinatory
isi2016
combinatory
discrete-mathematics
normal
descriptive
+
–
21
votes
3
answers
2372
GATE CSE 1998 | Question: 6a
Solve the following recurrence relation $x_n = 2x_{n-1}-1, n>1$ $x_1=2$
Solve the following recurrence relation$x_n = 2x_{n-1}-1, n>1$$x_1=2$
Arjun
5.7k
views
Arjun
asked
May 3, 2016
Algorithms
gate1998
algorithms
recurrence-relation
descriptive
+
–
0
votes
1
answer
2373
SQL
what is the difference b/w following two query:- SELECT distinct R.* FROM R,S where R.a = S.a; SELECT R.* FROM R,(select distinct a from S) as S1 where R.a = S1.a; a is attribute and ***duplicate*** tuples are allowed
what is the difference b/w following two query:-SELECT distinct R.*FROM R,Swhere R.a = S.a;SELECT R.*FROM R,(select distinct a from S) as S1where R.a = S1.a;a is attribut...
indrajeet
514
views
indrajeet
asked
Apr 28, 2016
Databases
databases
sql
descriptive
+
–
0
votes
2
answers
2374
Peterson Davie 3.38c
Suppose an $IP$ packet is fragmented into $10$ fragments, each with a $1$% (independent) probability of loss. To a reasonable approximation, this means there is a $10$% chance of losing the whole packet due to loss of a fragment. What is the ... loss of the whole packet if the packet is transmitted twice, (c) Explain how use of the Ident field might be applicable here.
Suppose an $IP$ packet is fragmented into $10$ fragments, each with a $1$% (independent) probability of loss. To a reasonable approximation, this means there is a $10$% c...
makhdoom ghaya
662
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
difficult
+
–
0
votes
1
answer
2375
Peterson Davie 3.38b
Suppose an $IP$ packet is fragmented into $10$ fragments, each with a $1$% (independent) probability of loss. To a reasonable approximation, this means there is a $10$% chance of losing the whole packet due to loss of a fragment. What is ... loss of the whole packet if the packet is transmitted twice, (b) Assuming any given fragment may have been part of either transmission?
Suppose an $IP$ packet is fragmented into $10$ fragments, each with a $1$% (independent) probability of loss. To a reasonable approximation, this means there is a $10$% c...
makhdoom ghaya
764
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
difficult
+
–
0
votes
2
answers
2376
Peterson Davie 3.38a
Suppose an $IP$ packet is fragmented into $10$ fragments, each with a $1$% (independent) probability of loss. To a reasonable approximation, this means there is a $10$% chance of losing the whole packet due to loss of a fragment. What is ... of the whole packet if the packet is transmitted twice, (a) Assuming all fragments received must have been part of the same transmission?
Suppose an $IP$ packet is fragmented into $10$ fragments, each with a $1$% (independent) probability of loss. To a reasonable approximation, this means there is a $10$% c...
makhdoom ghaya
499
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
difficult
+
–
0
votes
1
answer
2377
Peterson Davie 3.37
Path $MTU$ is the smallest $MTU$ of any link on the current path (route) between two hosts. Assume we could discover the path $MTU$ of the path used in the previous exercise, and that we use this value as the $MTU$ for all the path segments. Give the sizes and offsets of the sequence of fragments delivered to the network layer at the destination host.
Path $MTU$ is the smallest $MTU$ of any link on the current path (route) between two hosts. Assume we could discover the path $MTU$ of the path used in the previous exerc...
makhdoom ghaya
866
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
1
answer
2378
Peterson Davie 3.36
Suppose a $TCP$ message that contains $1024$ bytes of data and $20$ bytes of $TCP$ header is passed to $IP$ for delivery across two networks interconnected by a router (i.e., it travels from the source host to a router to the destination host) ... offsets of the sequence of fragments delivered to the network layer at the destination host. Assume all $IP$ headers are $20$ bytes.
Suppose a $TCP$ message that contains $1024$ bytes of data and $20$ bytes of $TCP$ header is passed to $IP$ for delivery across two networks interconnected by a router (i...
makhdoom ghaya
655
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
1
answer
2379
Peterson Davie 3.35
Some signalling errors can cause entire ranges of bits in a packet to be overwritten by all $0$s or all $1$s. Suppose all the bits in the packet, including the Internet checksum, are overwritten. Could a packet with all $0$s or all $1$s be a legal $IPv4$ packet? Will the Internet checksum catch that error? Why or why not?
Some signalling errors can cause entire ranges of bits in a packet to be overwritten by all $0$s or all $1$s. Suppose all the bits in the packet, including the Internet c...
makhdoom ghaya
1.9k
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
1
answer
2380
Peterson Davie 3.34
Why does the Offset field in the $IP$ header measure the offset in $8$-byte units? (Hint: Recall that the Offset field is $13$ bits long.)
Why does the Offset field in the $IP$ header measure the offset in $8$-byte units? (Hint: Recall that the Offset field is $13$ bits long.)
makhdoom ghaya
425
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
1
answer
2381
Peterson Davie 3.33
What aspect of $IP$ addresses makes it necessary to have one address per network interface, rather than just one per host? In light of your answer, why does $IP$ tolerate point-to-point interfaces that have nonunique addresses or no addresses?
What aspect of $IP$ addresses makes it necessary to have one address per network interface, rather than just one per host? In light of your answer, why does $IP$ tolerate...
makhdoom ghaya
1.2k
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
1
answer
2382
Peterson Davie 3.32b
Suppose a $10$-Mbps Ethernet hub (repeater) is replaced by a $10$-Mbps switch, in an environment where all traffic is between a single server and $N$ "clients." Because all traffic must still traverse the server-switch link, nominally there is no improvement in bandwidth. (b) What other advantages and drawbacks might a switch offer versus a hub?
Suppose a $10$-Mbps Ethernet hub (repeater) is replaced by a $10$-Mbps switch, in an environment where all traffic is between a single server and $N$ "clients." Because a...
makhdoom ghaya
918
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
0
answers
2383
Peterson Davie 3.32a
Suppose a $10$-Mbps Ethernet hub (repeater) is replaced by a $10$-Mbps switch, in an environment where all traffic is between a single server and $N$ "clients. "Because all traffic must still traverse the server switch link, nominally there is no improvement in bandwidth. (a) Would you expect any improvement in bandwidth? If so, why?
Suppose a $10$-Mbps Ethernet hub (repeater) is replaced by a $10$-Mbps switch, in an environment where all traffic is between a single server and $N$ "clients. "Because a...
makhdoom ghaya
262
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
0
answers
2384
Peterson Davie 3.30
A stage of an $n \times n$ banyan network consists of $(n/2) 2 \times 2$ switching elements. The first stage directs packets to the correct half of the network, the next stage to the correct quarter, and so on, until the packet is routed to the correct output ... of $2 \times 2$ switching elements needed to make an $n \times n$ banyan network. Verify your answer for $n = 8$.
A stage of an $n \times n$ banyan network consists of $(n/2) 2 \times 2$ switching elements. The first stage directs packets to the correct half of the network, the next ...
makhdoom ghaya
379
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
difficult
+
–
0
votes
0
answers
2385
Peterson Davie 3.29c
Suppose that a switch is designed to have both input and output $FIFO$ buffering. As packets arrive on an input port they are inserted at the tail of the $FIFO$. The switch then tries to forward the packets at the head of each $FIFO$ ... buffering memory can be redistributed freely. Suggest a reshuffling of the buffers that avoids the above problem, and explain why it does so.
Suppose that a switch is designed to have both input and output $FIFO$ buffering. As packets arrive on an input port they are inserted at the tail of the $FIFO$. The swit...
makhdoom ghaya
168
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
0
answers
2386
Peterson Davie 3.29c
Suppose that a switch is designed to have both input and output $FIFO$ buffering. As packets arrive on an input port they are inserted at the tail of the $FIFO$. The switch then tries to forward the packets at the head of each $FIFO$ ... buffering memory can be redistributed freely. Suggest a reshuffling of the buffers that avoids the above problem, and explain why it does so.
Suppose that a switch is designed to have both input and output $FIFO$ buffering. As packets arrive on an input port they are inserted at the tail of the $FIFO$. The swit...
makhdoom ghaya
149
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
0
answers
2387
Peterson Davie 3.29b
Suppose that a switch is designed to have both input and output $FIFO$ buffering. As packets arrive on an input port they are inserted at the tail of the $FIFO$. The switch then tries to forward the packets at the head of each $FIFO$ to the tail of the appropriate output $FIFO$. (b) What is this behavior called?
Suppose that a switch is designed to have both input and output $FIFO$ buffering. As packets arrive on an input port they are inserted at the tail of the $FIFO$. The swit...
makhdoom ghaya
161
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
0
answers
2388
Peterson Davie 3.29a
Suppose that a switch is designed to have both input and output $FIFO$ buffering. As packets arrive on an input port they are inserted at the tail of the $FIFO$. The switch then tries to forward the packets at the head of each $FIFO$ to the tail of ... $FIFO$. (a) Explain under what circumstances such a switch can lose a packet destined for an output port whose $FIFO$ is empty
Suppose that a switch is designed to have both input and output $FIFO$ buffering. As packets arrive on an input port they are inserted at the tail of the $FIFO$. The swit...
makhdoom ghaya
154
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
0
answers
2389
GATE CSE 1991 | Question: 07b
It is required to design a hardwired controller to handle the fetch cycle of a single address CPU with a $16$ bit instruction-length. The effective address of an indexed instruction should be derived in the fetch cycle itself. Assume ... bits of an instruction constitute the operand field. Draw the logic schematic of the hardwired controller including the data path.
It is required to design a hardwired controller to handle the fetch cycle of a single address CPU with a $16$ bit instruction-length. The effective address of an indexed ...
go_editor
797
views
go_editor
asked
Apr 24, 2016
CO and Architecture
gate1991
co-and-architecture
control-unit
hardwired-controller
normal
unsolved
descriptive
+
–
17
votes
1
answer
2390
GATE CSE 1991 | Question: 10c
Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative $E \rightarrow E -T\mid T$ $T \rightarrow T/F\mid F$ $F \rightarrow (E) \mid id$ ($E$ is the start symbol ... given production rules and adding at most one more production rule. Convert the grammar obtained above into one that is not left recursive.
Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative$E \rightarrow E -T\mid T$$T \rightarrow T/F\mid F$ ...
go_editor
2.6k
views
go_editor
asked
Apr 24, 2016
Compiler Design
gate1991
grammar
compiler-design
normal
descriptive
+
–
14
votes
5
answers
2391
GATE CSE 1991 | Question: 10b
Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative $E \rightarrow E -T\mid T$ $T \rightarrow T/F\mid F$ $F \rightarrow (E) \mid id$ ($E$ is the start symbol ... with redundant parentheses. Do this with minimum number of changes to the given production rules and adding at most one more production rule.
Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative$E \rightarrow E -T\mid T$$T \rightarrow T/F\mid F$ ...
go_editor
4.0k
views
go_editor
asked
Apr 24, 2016
Compiler Design
gate1991
grammar
compiler-design
normal
descriptive
+
–
22
votes
3
answers
2392
GATE CSE 1991 | Question: 09b
For the following code, indicate the output if static scope rules dynamic scope rules are used var a,b : integer; procedure P; a := 5; b := 10; end {P}; procedure Q; var a, b : integer; P; end {Q}; begin a := 1; b := 2; Q; Write ('a = ', a, 'b = ', b); end
For the following code, indicate the output if static scope rulesdynamic scope rulesare usedvar a,b : integer; procedure P; a := 5; b := 10; end {P}; procedure Q; var a, ...
go_editor
4.2k
views
go_editor
asked
Apr 24, 2016
Compiler Design
gate1991
runtime-environment
normal
compiler-design
parameter-passing
descriptive
+
–
13
votes
2
answers
2393
GATE CSE 1992 | Question: 07b
Consider the function $F(n)$ for which the pseudocode is given below : Function F(n) begin F1 ← 1 if(n=1) then F ← 3 else For i = 1 to n do begin C ← 0 For j = 1 to n – 1 do begin C ← C + 1 end F1 = F1 * C end F = F1 end [$n$ is a positive integer greater than zero] Solve the recurrence relation for a closed form solution of $F(n)$.
Consider the function $F(n)$ for which the pseudocode is given below :Function F(n) begin F1 ← 1 if(n=1) then F ← 3 else For i = 1 to n do begin C ← 0 For j = 1 to ...
go_editor
2.3k
views
go_editor
asked
Apr 24, 2016
Algorithms
gate1992
algorithms
recurrence-relation
descriptive
+
–
0
votes
1
answer
2394
Peterson Davie 3.26
Suppose a workstation has an $I/O$ bus speed of $800$ Mbps and memory bandwidth of $2$ Gbps. Assuming direct memory access (DMA) is used to move data in and out of main memory, how many interfaces to $100$-Mbps Ethernet links could a switch based on this workstation handle?
Suppose a workstation has an $I/O$ bus speed of $800$ Mbps and memory bandwidth of $2$ Gbps. Assuming direct memory access (DMA) is used to move data in and out of main m...
makhdoom ghaya
1.2k
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
1
answer
2395
Peterson Davie 3.25
Cell switching methods (like $ATM$) essentially always use virtual circuit switching rather than datagram forwarding. Give a specific argument why this is so (consider the preceding question).
Cell switching methods (like $ATM$) essentially always use virtual circuit switching rather than datagram forwarding. Give a specific argument why this is so (consider th...
makhdoom ghaya
316
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
0
answers
2396
Peterson Davie 3.24
What percentage of an $ATM$ link's total bandwidth is consumed by the $ATM$ cell headers? Ignore padding to fill cells or $ATM$ adaptation layer headers.
What percentage of an $ATM$ link's total bandwidth is consumed by the $ATM$ cell headers? Ignore padding to fill cells or $ATM$ adaptation layer headers.
makhdoom ghaya
206
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
1
answer
2397
Peterson Davie 3.23
Suppose a bridge has two of its ports on the same network. How might the bridge detect and correct this?
Suppose a bridge has two of its ports on the same network. How might the bridge detect and correct this?
makhdoom ghaya
930
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
1
answer
2398
Peterson Davie 3.4
Give forwarding tables for switches $S1$ to $S4$ in Figure 3.46. Each switch should have a default routing entry, chosen to forward packets with unrecognized destination addresses toward OUT. Any specific destination table entries duplicated by the default entry should then be eliminated.
Give forwarding tables for switches $S1$ to $S4$ in Figure 3.46. Each switch should have a default routing entry, chosen to forward packets with unrecognized destination ...
makhdoom ghaya
1.1k
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
1
answer
2399
Peterson Davie 3.3
For the network given in Figure 3.45, give the datagram forwarding table for each node. The links are labeled with relative costs; your tables should forward each packet via the lowest-cost path to its destination.
For the network given in Figure 3.45, give the datagram forwarding table for each node. The links are labeled with relative costs; your tables should forward each packet ...
makhdoom ghaya
3.3k
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
7
votes
1
answer
2400
GATE CSE 1992 | Question: 10b
Show the activation records and the display structure just after the procedures called at lines marked $x$ and $y$ have started their execution. Be sure to indicate which of the two procedures named $A$ you are referring to. Program Test; Procedure A; Procedure B; Procedure A; begin …… end A; begin y: A; end B; begin B; end A; begin x: A; end Test
Show the activation records and the display structure just after the procedures called at lines marked $x$ and $y$ have started their execution. Be sure to indicate which...
go_editor
1.5k
views
go_editor
asked
Apr 24, 2016
Programming in C
gate1992
parameter-passing
programming
runtime-environment
normal
descriptive
+
–
Page:
« prev
1
...
75
76
77
78
79
80
81
82
83
84
85
...
91
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register