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 Vishnu__
0
votes
1
Andrew S. Tanenbaum Edition 5th Exercise 5 Question 36 (Page No. 494)
Describe a way to reassemble IP fragments at the destination.
Describe a way to reassemble IP fragments at the destination.
537
views
answered
Jan 15, 2023
Computer Networks
computer-networks
tanenbaum
network-layer
fragmentation
descriptive
+
–
0
votes
2
me test
If a datagram of size 4000 bytes from transport layer arrives at network layer and it has to be forwarded through a link with maximum capacity of 800 bytes. Then calculate the number of fragments needed if the header size is 20 bytes. Also calculate the data size of the last fragment. 5 fragments ,100 bytes 5 fragments ,104 bytes 6 fragments ,100 bytes 6 fragments ,104 bytes
If a datagram of size 4000 bytes from transport layer arrives at network layer and it has to be forwarded through a link with maximum capacity of 800 bytes. Then calculat...
696
views
answered
Jan 15, 2023
Computer Networks
fragmentation
computer-networks
+
–
0
votes
3
Fragmentation
An IPV4 datagram is received by a router, in which total length is 1500, HLEN value is 10 and offset value is 100.The MTU of the forwarding link is 200. What is the offset value of last fragment?
An IPV4 datagram is received by a router, in which total length is 1500, HLEN value is 10 and offset value is 100.The MTU of the forwarding link is 200. What is the offse...
2.3k
views
answered
Jan 15, 2023
Computer Networks
fragmentation
computer-networks
+
–
0
votes
4
Peter Linz Edition 5 Exercise 8.1 Question 7(c) (Page No. 212)
Show that the following languages on $\Sigma = \{a,b,c\}$ are not context-free. $L = \{a^nb^jc^k:k=jn\}$.
Show that the following languages on $\Sigma = \{a,b,c\}$ are not context-free. $L = \{a^nb^jc^k:k=jn\...
547
views
answered
Jan 13, 2023
Theory of Computation
peter-linz
peter-linz-edition5
theory-of-computation
pumping-lemma
proof
context-free-language
+
–
0
votes
5
Peter Linz Edition 5 Exercise 8.1 Question 7(j) (Page No. 212)
Show that the following languages on $\Sigma = \{a,b,c\}$ are not context-free $L = \{a^nb^m:\text{n is prime or m is prime}\}$.
Show that the following languages on $\Sigma = \{a,b,c\}$ are not context-free $L = \{a^nb^m:\text{n is prime or m is prim...
356
views
answered
Jan 13, 2023
Theory of Computation
peter-linz
peter-linz-edition5
theory-of-computation
pumping-lemma
proof
context-free-language
+
–
0
votes
6
Peter Linz Edition 4 Exercise 8.1 Question 5 (Page No. 212)
Is the language L = {$a^nb^m : n = 2^m$} context-free?
Is the language L = {$a^nb^m : n = 2^m$} context-free?
621
views
answered
Jan 13, 2023
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
pumping-lemma
context-free-language
+
–
1
votes
7
ISI 2021 | PCB CS | Question: 7.b
Consider a $4$-way set associative cache mapping, in which the cache blocks are grouped into sets and each set has $4$ blocks. There are $16$ cache blocks in total. The following memory block requests arrive in order when ... . Show the cache configuration (along with intermediate configurations) on meeting the above memory requirements. What is the hit ratio?
Consider a $4$-way set associative cache mapping, in which the cache blocks are grouped into sets and each set has $4$ blocks. There are $16$ cache blocks in total. The f...
872
views
answered
Sep 16, 2022
CO and Architecture
isi2021-pcb-cs
descriptive
co-and-architecture
cache-memory
+
–
0
votes
8
Computer Architecture and Organisation
1. Assume a Bus System constructed to connect 7 registers and memory unit of 32 word length using multiplexer. So: a) How many multiplexer is needed? b) What type of multiplexer is required i.e size of multiplexer? c) Describe decoder used to select address of memory unit
1. Assume a Bus System constructed to connect 7 registers and memory unit of 32 word length using multiplexer. So:a) How many multiplexer is needed?b) What type of multip...
295
views
answered
Sep 16, 2022
CO and Architecture
co-and-architecture
memory-interfacing
branch-conditional-instructions
reference-book
digital-logic
+
–
0
votes
9
Accesing time
Could you please differentiate below . Memory access time .hit time . search time ?? Arey yar some one answer this.. why so dumb
Could you please differentiate below. Memory access time.hit time. search time??Arey yar some one answer this.. why so dumb
192
views
answered
Sep 3, 2022
CO and Architecture
co-and-architecture
effective-memory-access
hit-ratio
self-doubt
+
–
0
votes
10
ISI 2021 | PCB CS | Question: 7.a
Consider the single precision (i.e., $32$-bit) floating point representation of numbers in the normalized form where $8$ bits are used for the exponent with the bias of $127.$ What is the binary representation of $-10.4$ in the above form? The steps followed to arrive at the ... between $2^{-18}$ and $2^{-17}$ (i.e., excluding $2^{-18}$ and $\left.2^{-17}\right)?$
Consider the single precision (i.e., $32$-bit) floating point representation of numbers in the normalized form where $8$ bits are used for the exponent with the bias of $...
455
views
answered
Sep 3, 2022
CO and Architecture
isi2021-pcb-cs
descriptive
co-and-architecture
number-representation
+
–
1
votes
11
Floating Point Arithmetic - Stallings 7th edition Question - 9.22
Assume that the exponent e is constrained to lie in the range 0 <= e <= X with a bias of q, that the base is b, and that the significand is p digits in length. a. What are the largest and ... that can be written? b. What are the largest and smallest positive values that can be written as normalized floating-point numbers?
Assume that the exponent e is constrained to lie in the range 0 <= e <= X with a bias of q, that the base is b, and that the significand is p digits in length.a. What ar...
1.1k
views
answered
Aug 1, 2022
CO and Architecture
co-and-architecture
floating-point-representation
+
–
0
votes
12
Random college question paper
Given a relation R(A, B, C, D, E, F, G, H) with keys BD and C and functional dependencies D→G, E→F and H→C, decompose the R into the highest normal form possible.
Given a relation R(A, B, C, D, E, F, G, H) with keys BD and C and functional dependenciesD→G, E→F and H→C, decompose the R into the highest normal form possible.
493
views
answered
Jul 25, 2022
Databases
databases
database-normalization
tbb-dbms-2
+
–
0
votes
13
lexical and syntax error
what is the difference between lexical error and syntax error?
what is the difference between lexical error and syntax error?
1.4k
views
answered
Jul 7, 2022
Compiler Design
compiler-design
lexical-analysis
+
–
1
votes
14
Is priority inversion problem a case of deadlock?
I have read in some notes that priority inversion problem is a case of spin lock, not deadlock because in deadlock the processes are in blocked state, but here the processes are busy waiting and consuming memory. I have also read in a note ... different states. Which one of this is true? Is this problem a case of spin-lock or live lock or deadlock?
I have read in some notes that priority inversion problem is a case of spin lock, not deadlock because in deadlock the processes are in blocked state, but here the proces...
1.5k
views
answered
Jun 24, 2022
Operating System
operating-system
process-synchronization
+
–
0
votes
15
Compilation Techniques - Annotated Parse Tree
Given the following statement: 6 * (8-3) Make the Annotated Parse Tree based on the translation scheme below. S → B {A.i = B.val} A {S.val = A.s} A → - B {A1.i = A.i - B.val} A1 {A.s = A1.s} A → e {A.s = A.i} B → D {C.i = D.val} C {B.val = C.s} C → * ... = C.i * D.val} C1 {C.s = C1.s} C → e {C.s = C.i} D → ( S ) {D.val = S.val} D → num {D.val = num.val}
Given the following statement: 6 * (8-3)Make the Annotated Parse Tree based on the translation scheme below.S → B {A.i = B.val} A {S.val = A.s}A → - B {A1.i = A.i - B...
897
views
answered
Apr 19, 2022
Compiler Design
compiler-design
syntax-directed-translation
descriptive
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
