Answer:
Given that:
A= 40n^2
B = 2n^3
By given scenario:
40n^2=2n^3
dividing both sides by 2
20n^2=n^3
dividing both sides by n^2 we get
20 = n
Now putting n=20 in algorithms A and B:
A=40n^2
= 40 (20)^2
= 40 * (400)
A= 16000
B= 2n^3
= 2 (20)^3
= 2(8000)
B= 16000
Now as A and B got same on n = 20, then as given:
n0 <20 for n =20
Let us take n0 = 19, it will prove A is better than B.
We can also match the respective graphs of algorithms of A and B to see which one leads and which one lags, before they cross at n= 20.
Answer:
D) extents
Explanation:
Disks fragmentations in computer science refers to the cases of a file system laying out its contents in a non-continuous manner thus preventing an in-place alteration of the contents (that is the contents of the file are scattered in fragments across different location on the disk). Disk fragmentation is mostly associated with aging. To mitigate against this, modern implementation of file systems try to preallocate longer chunks of disk space, this is called extents, in this way fragmentation is avoided since a contiguous size of disk space is preallocated to the files and its contents stay together.
9
JavaScript’s Math module has a max method that finds the max of the given arguments.
I’m not sure how I can be any clearer
I’ve attached a screenshot if you still have no clue
