Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Vishnu__
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.
answered
in
Computer Networks
Jan 15, 2023
477
views
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
answered
in
Computer Networks
Jan 15, 2023
680
views
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?
answered
in
Computer Networks
Jan 15, 2023
2.3k
views
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\}$.
answered
in
Theory of Computation
Jan 13, 2023
457
views
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}\}$.
answered
in
Theory of Computation
Jan 13, 2023
344
views
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?
answered
in
Theory of Computation
Jan 13, 2023
591
views
peter-linz
peter-linz-edition4
theory-of-computation
pumping-lemma
context-free-language
1
vote
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?
answered
in
CO and Architecture
Sep 16, 2022
749
views
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
answered
in
CO and Architecture
Sep 16, 2022
292
views
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
answered
in
CO and Architecture
Sep 3, 2022
187
views
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)?$
answered
in
CO and Architecture
Sep 3, 2022
418
views
isi2021-pcb-cs
descriptive
co-and-architecture
number-representation
1
vote
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?
answered
in
CO and Architecture
Aug 1, 2022
1.0k
views
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.
answered
in
Databases
Jul 25, 2022
475
views
databases
database-normalization
tbb-dbms-2
0
votes
13
lexical and syntax error
what is the difference between lexical error and syntax error?
answered
in
Compiler Design
Jul 7, 2022
1.4k
views
compiler-design
lexical-analysis
1
vote
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?
answered
in
Operating System
Jun 24, 2022
1.4k
views
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}
answered
in
Compiler Design
Apr 19, 2022
867
views
compiler-design
syntax-directed-translation
descriptive
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...