Answer:
Given
The above lines of code
Required
Rearrange.
The code is re-arrange d as follows;.
#include<iostream>
int main()
{
int userNum;
scanf("%d", &userNum);
if (userNum > 0)
{
printf("Positive.\n");
}
else
{
printf("Non-positive, converting to 1.\n");
userNum = 1;
printf("Final: %d\n", userNum);
}
return 0;
}
When rearranging lines of codes. one has to be mindful of the programming language, the syntax of the language and control structures in the code;
One should take note of the variable declarations and usage
See attachment for .cpp file
Answer:
Giving that: The following is a sequence of undo-log records written by 2 transactions T and U:
< START T >;
< T,A,10 >;
< START U >;
< U, B, 20 >;
< T, C, 30 >;
< U, D, 40 >;
< Commit U >;
< T, E, 50 >;
< Commit T >;
1. < START U >
Recovery action in this case will be undo(-1) and undo(0). All restored to its original Value
log records < T, A, 10 >, < T, abort >; as written out
2. < T, E, 50 >
Recovery action in this case will be undo(8) and redo(0). A and C is restored to its original value, B and D are set to 20 and 40
log records <T, C, 30 >, < T, A, 10 >, < T, abort > are written out
3. < Commit T >
Recovery action in this case will be redo(7) and redo(4). A and C are set to 10 and 30, B and D are set to 20 and 40
Update and measure those are the only understand answers
Answer:
a. (210^6)((210^7)/(2.510^8)) = 1.610^5 bits or 160,000 bits
b. 1.6*10^5 bits or 160,000 bits
c. Bandwidth delay product of link is maximum number of bits that can be in the link
d. Width of bit = Length of link / bandwidth-delay product so 1 bit is 125 meters long. Yes, this is longer than a football field.
e. Width of bit = s/R
Hope this helps :)
Answer:
I think the answer is
Ram- Cache Memory-Hard disk
Explanation:
I hope this helps you