Solution: The solution of Q.10(a)(1) is already given in question you can see but record is not assigned in variable blocking spanned and variable blocking unspanned method. So here we assigned the records in variable blocking spanned and variable blocking unspanned method. And discuss why variable blocking unspanned is less efficient compared to variable blocking spanned.
Variable blocking spanned:
Disk X
Block 1(length =10) Block2(length =10) Block3(length =10)
|
R1(n=4) |
R2(n=5) |
R3(n=1) |
R3(n=1) |
R4(n=4) |
R5(n=2) |
R6(n=3) |
R6(n=4) |
6B wastage |
Variable blocking unspanned:
Disk X
Block 1(length =10) Block2(Length =10) Block3(length =10)
|
R1(n=4) |
R2(n=5) |
1B wastage |
R3(n=2) |
R4(n=4) |
R5(n=2) |
2B wastage |
R6(n=7) |
3 B wastage |
In variable blocking spanned we can span the records in
different block Means portion of a single record may accupied in
different blocks due to their large size, such records are called
Spanned Records. So, the memory wastage is less than variable
blocking unspanned. As you see in figure, Memory wastages in only
one blocks 3.
But in variable blocking unspanned we cannot spanned the records in different block. So, the memory wastage is more than variable blocking spanned. You can see in figure Memory wastages accrues in each block 1,2 and 3 also.
If we want to add some additional records the we can lie in remaining size of block 3 in spanned but in unspanned we require an extra block for it.so the increasing no of blocks makes more difficulty to accessing it and more time required for it. But it is not happening in spanned so we can say that variable blocking unspanned is less efficient compared to variable blocking spanned.
figure:

10.a. Consider a file F which contains a sequence of variable-length records, with record's length (n)...
Really don't know what its about...
Course in operating system, file system
Question 2. File Systems (10 marks) (a) Consider a 32GB hard disk and a FAT file system with 24 bits cluster (block) address. What is the minimum block (cluster) size in order to fully utilize all space in the hard disk? (3 marks) (b) Consider an index-based file system with the inode containing 64 direct pointers, 1 indirect pointer, and 1 double-indirect pointer. Suppose the size of a...
I
Need Help with 4,6,8,10,15,18
Problems 123 If f(n) is a periodic sequence with period N, it is also periodic with period 2N. Tet 8(k) denote the DFS coefficients of X(n) considered as a periodic sequence with period N and X,(k) denote the DFS coefficients of x(n) considered as a periodic sequence with period 2N. X,(k) is, of course, periodic with period N and X2(k) is periodic with period 2N. Determine 8(k) in terms of X (k). 5. Consider two...
Multi-Level Indexing. Construct a B+-tree for a data file that contains 10 records with the following key values, respectively: 23, 26,43,77,4,92 The index fan-out p 3, that is, each internal tree node of the B+-tree contains at most p-1 = 2 keys and p = 3 pointers; the underlying data file has a blocking factor pI-2, that is, each leaf of the B+-tree contains at most pI-2 data records. Assume that the tree is initially empty and records are added...
Write a SQL Program to print out the first 10 numbers of the following sequence F(n). F(1) = 3, F(2)=5. F(n)=3*F(n-1) –2*F(n-2). E.g., F(3) = 3*F(2) – 2* F(1) = 3*5–2*3=15-6=9 Your program will print out F(1), F(2),..., F(10). Hint: use three variables, the first storing F(n), the second storing F(n-1), and the third storing F(n-2). Think of how to compute the first variable from the other two and how to update the other two variables in each iteration
Consider the following problem based on the transformation of a sequence (or collection) of coloured disks Assume that you have a very large collection of disks, each with an integer value representing the disk colour from the range [0, c. For example, the colour mapping might be: O-red, 1-yellow, 2-blue, 3-pink. ..., c-black For a given sequence of coloured disks e.g., ( 0,1,2,3,4 ), at each time step (or iteration) you are only allowed to perform one of three basic...
Consider the following problem based on the transformation of a sequence (or collection) of coloured disks Assume that you have a very large collection of disks, each with an integer value representing the disk colour from the range [0, c. For example, the colour mapping might be: O-red, 1-yellow, 2-blue, 3-pink. ..., c-black For a given sequence of coloured disks e.g., ( 0,1,2,3,4 ), at each time step (or iteration) you are only allowed to perform one of three basic...
2. A binary string is a finite sequence u-діаг . . . an, where each ai is either 0 or 1. In this case n is the length of the string v. The strings ai, aia2,... ,ai... an-1,ai... an are all prefixes of v. On the set X of all binary strings consider the relations Ri and R2 defined as follows: Ri-(w, v) w and v have the same length ) R2 = {(u, v) I w is a prefix...
In terms of the programming language required, the algorithm
needs to be written in pseudocode
Dynamic Programming Consider the following problem based on the transformation of a sequence (or collection) of coloured disks Assume that you have a very large collection of disks, each with an integer value representing the disk colour from the range [0, c. For example, the colour mapping might be 0-red. 1-yellow, 2-blue, 3-pink. , c-black For a given sequence of coloured disks e.g., ( 0,1,2,3,4...
please use matlab
100 Let f(x) for questions 8, 9, 10 8. Make a function file for f(3) = I 100 I f.m function y = f(x) 9. Estimate f'(-5) by making a limit table with 5 rows. >> format long >> clearf . >> h = >> [h; (f(x+h) - f(x))./h]' ans = 0.100000000000000 -4.081632653061220 0.010000000000000 -4.008016032064176 0.001000000000000 -4.000800160032013 0.000100000000000 -4.000080001596017 0.000010000000000 10. Find R4, the Regular Right Sum with 4 rectangles, in order to approximate f(x) dx >>...
2: (a) Consider a discrete-time sequence x[n] = cos(n+3). Find the fundamental period(N). (b) Consider the sinusodal signal x(t) = 10 sin(21 Fot) with analog frequency F. Write an equa- tion for the discrete time signal n. (c) In part(b) if Fe = 400Hz and the sampling frequency F. = 4kHz, determine the fundamen- tal period of x[n].