Register
Filter

Recent activity by yankur9

1 answer
2
order of leaf node in b+ tree??
which formula should we use for calculating LEAF node in B+ tree? I. n*(K+r)+b<=block size where n=no of keys k=key size,r=record pointer,b=block pointer II. (n-1)(K+r)+b<=block size
which formula should we use for calculating LEAF node in B+ tree?I. n*(K+r)+b<=block sizewhere n=no of keysk=key size,r=record pointer,b=block pointerII. (n-1)(K+r)+b<=bl...
4 answers
3
doubt
Every table with two single-valued attributes is in 1NF, 2NF, 3NF and BCNF. ???? plz define clearly?? is it true for all the table having more than two attribute?? #refrence gate2014
Every table with two single-valued attributes is in 1NF, 2NF, 3NF and BCNF. ????plz define clearly??is it true for all the table having more than two attribute??#refr...
6 answers
8
ISRO2015-50
How many bits internet address is assigned to each host on a TCP/IP internet which is used in all communication with the host? $16$ bits $32$ bits $48$ bits $64$ bits
How many bits internet address is assigned to each host on a TCP/IP internet which is used in all communication with the host?$16$ bits$32$ bits$48$ bits$64$ bits
3 answers
10
ISRO2015-58
Which layers of the OSI reference model are host-to-host layers? Transport, session, presentation, application Session, presentation, application Datalink, transport, presentation, application Physical, datalink, network, transport
Which layers of the OSI reference model are host-to-host layers?Transport, session, presentation, applicationSession, presentation, applicationDatalink, transport, presen...
3 answers
12
ISRO2016-18
The functional difference between $SR$ flip-flop and $J$-$K$ flip-flop is that : $J$-$K$ flip-flop is faster than $SR$ flip-flop $J$-$K$ flip-flop has a feedback path $J$-$K$ flip-flop accepts both inputs $1$ None of them
The functional difference between $SR$ flip-flop and $J$-$K$ flip-flop is that :$J$-$K$ flip-flop is faster than $SR$ flip-flop$J$-$K$ flip-flop has a feedback path$J$-$K...
7 answers
13
GATE CSE 2015 Set 1 | Question: 22
Which of the following fields of an IP header is NOT modified by a typical IP router? Check sum Source address Time to Live (TTL) Length
Which of the following fields of an IP header is NOT modified by a typical IP router?Check sumSource addressTime to Live (TTL)Length
2 answers
15
GATE CSE 2002 | Question: 1.3
The solution to the recurrence equation $T(2^k) = 3T(2^{k-1})+1, T(1) =1$ is $2^k$ $\frac{(3^{k+1}-1)}{2}$ $3^{\log_2 k}$ $2^{\log_3 k}$
The solution to the recurrence equation $T(2^k) = 3T(2^{k-1})+1, T(1) =1$ is$2^k$$\frac{(3^{k+1}-1)}{2}$$3^{\log_2 k}$$2^{\log_3 k}$
2 answers
16
GATE CSE 2001 | Question: 1.22
Which of the following requires a device driver? Register Cache Main memory Disk
Which of the following requires a device driver?RegisterCacheMain memoryDisk
6 answers
17
GATE CSE 2001 | Question: 1.18
Which of the following statements is false? An unambiguous grammar has same leftmost and rightmost derivation An LL(1) parser is a top-down parser LALR is more powerful than SLR An ambiguous grammar can never be LR(k) for any k
Which of the following statements is false?An unambiguous grammar has same leftmost and rightmost derivationAn LL(1) parser is a top-down parserLALR is more powerful than...
2 answers
22
UGC NET CSE | June 2014 | Part 3 | Question: 72
Four bits are used for packed sequence numbering in a slinding window protocol used in a computer network. What is the maximum window size? 4 8 15 16
Four bits are used for packed sequence numbering in a slinding window protocol used in a computer network. What is the maximum window size?481516
3 answers
24
Question
Find minimal states in DFA accepting {w1aw2, |w1| = 2, |w2| >=3, w1,w2 $\in$ $(a+b)^*$}? Is it $7$ or $8$?
Find minimal states in DFA accepting {w1aw2, |w1| = 2, |w2| >=3, w1,w2 $\in$ $(a+b)^*$}?Is it $7$ or $8$?
1 answer
26
doubt
Explain Internal And External fragmentation clearly??
Explain Internal And External fragmentation clearly??
2 answers
27
MadeEasy Subject Test: Computer Networks - Icmp
When a strict routing has been specified by the source but can’t be followed by the intermediate routers, such events will be reported by ICMP???
When a strict routing has been specified by the source but can’t be followed by the intermediate routers, such events will be reported by ICMP???
2 answers
28
doubt
in case of shortest remaining time first(SRTF) . we always consider pre-emptive scheduling??
in case of shortest remaining time first(SRTF) .we always consider pre-emptive scheduling??