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
Questions by Nishisahu
0
votes
1
answer
1
Test Book Test Full Test 7
A message consisting of $2400$ bits is to be passed over the Internet. The message is passed to the transport layer which appends a $150$ - bit header, followed by the network layer which uses a $120$ - bit header. Network layer packets ... network only accepts up to $900$ bits long. The number of bits, including headers delivered to the destination network, is _________.
A message consisting of $2400$ bits is to be passed over the Internet. The message is passed to the transport layer which appends a $150$ – bit header, followed by the ...
1.6k
views
asked
Jan 2, 2022
Computer Networks
computer-networks
fragmentation
+
–
1
votes
1
answer
2
Made Easy Test
Suppose there are $11$ nodes in a binary tree. Find the number of unlabeled binary trees if the number of nodes either in the left sub tree or in the right sub tree is divisible by $4.$
Suppose there are $11$ nodes in a binary tree. Find the number of unlabeled binary trees if the number of nodes either in the left sub tree or in the right sub tree is di...
1.2k
views
asked
Dec 25, 2021
DS
data-structures
binary-tree
made-easy-test-series
numerical-answers
+
–
1
votes
1
answer
3
TestBook test series: Database
Consider two relations $R$ and $S$ of size $1200$ bytes and $1000$ bytes respectively. The size of a tuple in both relations is $20$ bytes. The block size of the system is $100$ Bytes. How many extra block transfers would be required, in the worst case, if nested loop join is used instead of block nested loop join technique to compute the natural join?
Consider two relations $R$ and $S$ of size $1200$ bytes and $1000$ bytes respectively. The size of a tuple in both relations is $20$ bytes. The block size of the system i...
362
views
asked
Oct 17, 2021
Databases
testbook-test-series
databases
+
–
3
votes
1
answer
4
Number of final states
A FA accepting language L(A) has n states and m transition. ∑ = {a, b} L(A) is given as L(A)={ x | if x ∊ L(A) then u ∊ L(A) for $∃u, v ∊ ∑^{*}$ where x=uv } Find number of final state in above DFA?
A FA accepting language L(A) has n states and m transition. ∑ = {a, b}L(A) is given asL(A)={ x | if x ∊ L(A) then u ∊ L(A) for $∃u, v ∊ ∑^{*}$ where x=uv }Fin...
366
views
asked
Oct 8, 2021
Theory of Computation
theory-of-computation
minimal-state-automata
finite-automata
+
–
1
votes
2
answers
5
Self Doubt
How many min heap possible with 6 distinct node?
How many min heap possible with 6 distinct node?
444
views
asked
Sep 23, 2021
DS
data-structures
binary-heap
counting
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register