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
Recent activity by _jerry
0
answers
1
MadeEasy Test Series: Computer Networks - Lan Technologies
The minimum frame length (in bytes) of the cable of length 240 meter for transmitting data at a rate of 500 Kbps in IEEE 802.3 LAN is __________. (Assume the signal speed in the cable to be, 2,00,000 m/s)
The minimum frame length (in bytes) of the cable of length 240 meter for transmitting data at a rate of 500 Kbps in IEEE 802.3 LAN is __________. (Assume the signal speed...
689
views
commented
Feb 2, 2018
Computer Networks
made-easy-test-series
computer-networks
lan-technologies
+
–
1
answer
2
The throughput for this transfer if stop wait protocol with pipelining is used ________.
Consider Host-A want to transmit data of size 105000 B to Host-B. The communication between Host-A and Host-B is birectional with bandwidth of link between them is 100 Mbps in both direction. Data will be ... for this transfer if stop wait protocol with pipelining is used ________. (in KBps) Ans: 144.06 KBps
Consider Host-A want to transmit data of size 105000 B to Host-B. The communication between Host-A and Host-B is birectional with bandwidth of link between them is 100 Mb...
1.6k
views
answered
Feb 2, 2018
Computer Networks
made-easy-test-series
computer-networks
stop-and-wait
throughput
+
–
2
answers
3
MadeEasy Test Series 2018: Databases - Indexing
In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a leaf node in a B+ tree implementing this file structure is ________. I am getting 63 as the answer, but in the solution, it's saying 64. Can anyone check?
In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest ...
1.6k
views
commented
Feb 1, 2018
Databases
databases
indexing
made-easy-test-series
madeeasy-testseries-2018
+
–
1
answer
4
Test series
Plz explain ? How to solve such que. As I have solved this type of que earlier but when I am doing revision I am not able to do it. So plz provide some good explanation..
Plz explain ? How to solve such que. As I have solved this type of que earlier but when I am doing revision I am not able to do it. So plz provide some good explanation.....
345
views
commented
Feb 1, 2018
1
answer
5
Gate_2018_Mock_Paper
What is mean here by word size=4 Byte ? Please solve the below question
What is mean here by word size=4 Byte ?Please solve the below question
399
views
commented
Jan 31, 2018
CO and Architecture
co-and-architecture
+
–
1
answer
6
Doubt Threads Scheduling
How are user level threads scheduled?
How are user level threads scheduled?
652
views
answer selected
Jan 30, 2018
Operating System
operating-system
threads
process-scheduling
+
–
1
answer
7
Strict and Conservative 2PL
We know, Conservative 2PL is another name of Strict 2PL. But According to Navathe book Conservative 2PL is deadlock free,but Strict 2PL can have deadlock. Then how both could be same??
We know, Conservative 2PL is another name of Strict 2PL. But According to Navathe bookConservative 2PL is deadlock free,but Strict 2PL can have deadlock.Then how both cou...
4.0k
views
answered
Jan 26, 2018
Databases
databases
two-phase-locking-protocol
concurrency
+
–
3
answers
8
Self Doubt Context Switching Threads
S1: Context Switching occurs only in kernel mode. :TRUE S2: Context Switching in user mode is faster as compared to context switching in kernel mode. : TRUE If Context Switching occurs only in kernel mode, then how is CS in user mode faster ... switching and then change back to user mode which means more time should be taken as compared to CS in kernel mode.
S1: Context Switching occurs only in kernel mode. :TRUES2: Context Switching in user mode is faster as compared to context switching in kernel mode. : TRUEIf Context Swit...
3.0k
views
commented
Jan 26, 2018
Operating System
operating-system
context-switch
threads
+
–
1
answer
9
Kenneth Rosen Edition 6th Exercise 7.6 Example 21 (Page No. 519 )
How is this a lattice?
How is this a lattice?
901
views
commented
Jan 25, 2018
Set Theory & Algebra
kenneth-rosen
discrete-mathematics
lattice
partial-order
+
–
4
answers
10
GATE CSE 2015 Set 3 | Question: 46
Consider a B+ tree in which the search key is $12$ $\text{bytes}$ long, block size is $1024$ $\text{bytes}$, record pointer is $10$ $\text{bytes}$ long and the block pointer is $8$ $\text{bytes}$ long. The maximum number of keys that can be accommodated in each non-leaf node of the tree is ______.
Consider a B+ tree in which the search key is $12$ $\text{bytes}$ long, block size is $1024$ $\text{bytes}$, record pointer is $10$ $\text{bytes}$ long and the block poin...
21.4k
views
commented
Jan 25, 2018
Databases
gatecse-2015-set3
databases
b-tree
normal
numerical-answers
+
–
1
answer
11
Self Doubt about Dirty Read and Recoverable
I can't exactly identify when a transaction has dirty read problem and when it doesn't. Take the following instances 1. S:T2r(x);T3r(x);T3 commit;T2 commit This is not dirty read as there is no write operation performed by ... this is recoverable. This is what I think regarding the above schedules. Is this right or is it only "JUGAAD"?
I can't exactly identify when a transaction has dirty read problem and when it doesn't. Take the following instances1. S:T2r(x);T3r(x);T3 commit;T2 commitThis is not dirt...
1.2k
views
commented
Jan 24, 2018
Databases
databases
transaction-and-concurrency
recoverable
dirty
read
+
–
3
answers
12
GATE CSE 2014 Set 2 | Question: 29
Consider the following schedule S of transactions $T1, T2, T3, T4:$ ... S is not conflict-serializable but is recoverable S is both conflict-serializable and recoverable S is neither conflict-serializable not is it recoverable
Consider the following schedule S of transactions $T1, T2, T3, T4:$$${\begin{array}{|l|l|l|l|}\hline\textbf{T1}& \textbf{T2}& \textbf{T3}& \textbf{T4} \\\hline& \...
28.4k
views
commented
Jan 24, 2018
Databases
gatecse-2014-set2
databases
transaction-and-concurrency
conflict-serializable
normal
+
–
5
answers
13
GATE IT 2007 | Question: 66
Consider the following two transactions$: T1$ and $T2.$ ...
Consider the following two transactions$: T1$ and $T2.$$\begin{array}{clcl} T1: & \text{read (A);} & T2: & \text{read (B);} \\ & \text{read (B);} & & \text{read (A);} \\ ...
18.0k
views
commented
Jan 24, 2018
Databases
gateit-2007
databases
transaction-and-concurrency
normal
+
–
2
answers
14
GATE CSE 2013 | Question: 42
What is the return value of $f(p,p)$, if the value of $p$ is initialized to $5$ before the call? Note that the first parameter is passed by reference, whereas the second parameter is passed by value. int f (int &x, int c) { c = c - 1; if (c==0) return 1; x = x + 1; return f(x,c) * x; }
What is the return value of $f(p,p)$, if the value of $p$ is initialized to $5$ before the call? Note that the first parameter is passed by reference, whereas the second ...
21.2k
views
commented
Dec 29, 2017
Programming in C
gatecse-2013
compiler-design
normal
marks-to-all
numerical-answers
parameter-passing
runtime-environment
+
–
4
answers
15
Digital Logic : 10's Complement
I can't seem to understand the 10's Complement. 10' s complement of 0 is 10 [ https://www.mathsisfun.com/numbers/tens-complement.html ] However, The problem in Morris Mano's Digital Design 10's Complement of 00,000,000 the answer in Solution Manual is 00,000,000. I am having a hard time understanding this. Can anyone explain this?
I can't seem to understand the 10's Complement.10' s complement of 0 is 10 [ https://www.mathsisfun.com/numbers/tens-complement.html ]However, The problem in Morris Mano'...
2.3k
views
answered
Dec 26, 2017
Digital Logic
number-representation
digital-logic
r-s-complement
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register