Register

NIELIT 2021 Dec Scientist B - Section B: 65

• edited by
697 views
0 votes
0 votes

Assume that a $\text{DBA}$ issued the following create table command : 

create table $\text{A (Aid, $\dots\dots$)}$

storage $\text{ (initial 20480, next 20480, maxextents 8, minextents 3, pctincrease 0)};$

How many bytes of disk space will be allocated to this file when it is first created $?$

  1. $163,840 \; \text{bytes}$
  2. $20480 \; \text{bytes}$
  3. $61,440 \; \text{bytes}$
  4. $8 \; \text{bytes}$
• edited by
User Avatar

1 Answer

0 votes
0 votes

Option C is correct.

Initial is given as 20480 B, and minextents is given as 3,

So we have to allocate 3 extents (minextents is 3) intially to this file, 

here first extent is 20480 B (because it is initial extent) and others two are Next extent (its size is also 20480 B, because no PCTincrease), PCTincrease is 0 (means percent of increase in next extent, here, no increase)

20480(initial) + 20480*2(Next extent) = 20480*3=61440Bytes

​​​​

• edited by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
soujanyareddy13 asked Dec 7, 2021
928 views
NIELIT 2021 Dec Scientist B - Section B: 43
Write Recurrence of Quick Sort in worst case. $ \text{T(n)} = \text{T (n-1)} + 1 $ $ \text{T(n)} = \text{T (n-1) + n} $ $ \text{T(n)} = 2 \text{T (n-1) + n} $ $ \text{T(n)} = \text{ T (n/3) + T (2n/2) + n} $
Write Recurrence of Quick Sort in worst case.$ \text{T(n)} = \text{T (n-1)} + 1 $$ \text{T(n)} = \text{T (n-1) + n} $$ \text{T(n)} = 2 \text{T (n-1) + n} $$ \text{T(n)} =...
User Avatar
0 votes
0 votes
0 answers
2
soujanyareddy13 asked Dec 7, 2021
537 views
NIELIT 2021 Dec Scientist B - Section B: 44
$y = 10 \cos (1800 \; \pi t) + 20 \cos (2000 \; \pi t) + 10 \cos (220 \; \pi t).$ Find the modulation index $(\mu)$ of the given wave. $0.3$ $0.5$ $0.7$ $1$
$y = 10 \cos (1800 \; \pi t) + 20 \cos (2000 \; \pi t) + 10 \cos (220 \; \pi t).$ Find the modulation index $(\mu)$ of the given wave. $0.3$$0.5$$0.7$$1$
User Avatar
0 votes
0 votes
1 answer
3
soujanyareddy13 asked Dec 7, 2021
594 views
NIELIT 2021 Dec Scientist B - Section B: 45
Match the following: ... $\text{W-3, X-1, Y-4, Z-2}$ $\text{W-3, X-1, Y-2, Z-4}$
Match the following:$$\begin{array} {llll} & \textbf{List-I} & & \textbf{List-II} \\ \text{W.} & \text{Condition coverage} & 1. & \text{Black-box testing} \\ \text{X.} ...
User Avatar
0 votes
0 votes
2 answers
4
soujanyareddy13 asked Dec 7, 2021
3,332 views
NIELIT 2021 Dec Scientist B - Section B: 46
_________ is the class of decision problems that can be solved by non-deterministic polynomial algorithms. $\text{NP}$ $\text{P}$ Hard Complete
_________ is the class of decision problems that can be solved by non-deterministic polynomial algorithms.$\text{NP}$$\text{P}$HardComplete
User Avatar
Link Copied!