Register
Filter

Recent activity by Vishnu__

3 answers
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...
5 answers
9
ISRO2020-41
Minimum number of states required in DFA accepting binary strings not ending in $\text{“101”}$ is $3$ $4$ $5$ $6$
Minimum number of states required in DFA accepting binary strings not ending in $\text{“101”}$ is$3$$4$$5$$6$
1 answer
10
prepladder question bank
How many 128 K × 1 RAM chips are required, and what is the size of decoder needed to give the memory capacity of 1 MB. Here memory is byte addressable.
How many 128 K × 1 RAM chips are required, and what is the size of decoder needed to give the memory capacity of 1 MB. Here memory is byte addressable.
1 answer
14
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
2 answers
17
Floating point representation
What is the 16 bits pattern which represent (-13.5) in normalized signed magnitude fraction . S = 1 bit , Exponent = 7 bits , Mantissa = 8 bits . Represent it in hexadecimal also.
What is the 16 bits pattern which represent (-13.5) in normalized signed magnitude fraction . S = 1 bit , Exponent = 7 bits , Mantissa = 8 bits . Represent it in hexadeci...
1 answer
18
2's complement
Is 2's complement code weighted or unweighted? Why?
Is 2's complement code weighted or unweighted? Why?
1 answer
21
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.
2 answers
22
ISRO2015-31
If there are 32 segments, each size 1 k bytes, then the logical address should have 13 bits 14 bits 15 bits 16 bits
If there are 32 segments, each size 1 k bytes, then the logical address should have13 bits14 bits15 bits16 bits
2 answers
23
ISRO2015-33
Suppose a system contains $n$ processes and system uses the round-robin algorithm for CPU scheduling then which data structure is best suited ready queue of the process stack queue circular queue tree
Suppose a system contains $n$ processes and system uses the round-robin algorithm for CPU scheduling then which data structure is best suited ready queue of the processst...
1 answer
24
KVS Part B 2018
______ operation preserves those tuples that would be lost in____ (a) Natural join, Outer join (b) Outer join, Natural join (c) Left Outer Join, Right Outer Join (d) Left Outer Join, Natural Join
______ operation preserves those tuples that would be lost in____(a) Natural join, Outer join(b) Outer join, Natural join(c) Left Outer Join, Right Outer Join(d) Left Out...
2 answers
25
GATE CSE 2019 | Question: 55
Consider the following relations $P(X,Y,Z), Q(X,Y,T)$ and $R(Y,V)$ ... Answer: ________
Consider the following relations $P(X,Y,Z), Q(X,Y,T)$ and $R(Y,V)$.$$\overset{\textbf{Table: P}}{\begin{array}{|l|l|l|} \hline \textbf{X} & \textbf{Y} & \textbf{Z} \\\hli...
0 answers
26
HCU PHD 2018 JUNE
Suppose there are three relations as given below: (x) R(a,b)= (0,1),(4,5),(8,9). (y) S(b,c )=(1,2),(5,2),(5,6),(5,10),(13,10). (z) T( c,d)=(2,3),(6,7)(10,11),(10,3) the number of tuples in (R * S) * T, where * is the full natural outer join, is: (a) 5 (b) 8 (c) 13 (d) 60
Suppose there are three relations as given below:(x) R(a,b)= (0,1),(4,5),(8,9).(y) S(b,c )=(1,2),(5,2),(5,6),(5,10),(13,10).(z) T( c,d)=(2,3),(6,7)(10,11),(10,3)the numbe...
1 answer
29
Minimum relations required for ER diagram
How many minimum relations required for the above ER diagram? According to me it should be 7. Please let me know the answer according to you.
How many minimum relations required for the above ER diagram?According to me it should be 7. Please let me know the answer according to you.
2 answers
30
NIELIT 2016
a tuple in relation DBMS is a equivalent to (a) Record (b) Field (c) File (d) Database
a tuple in relation DBMS is a equivalent to(a) Record(b) Field(c) File(d) Database