Answer and Explanation:
Given that total number of records in a file = 100000
Each record consists of= 240 bytes
Given that B= 2400 bytes.
Then total blocks in file = 100000 records * 240 / 2400
= 10000 blocks.
Time that will take for exhaustive read
= s + r + b.btt
= 16 + 8.3 + (10000) * 0.8
= 8024.3 msec
Now as per given X be the number of records that are searched randomly and it takes more than exhaustive read time.
Hence, X (s + r + btt) > 8024.3
X (16+8.3+0.8) > 8024.3
X > 8024.3/25.1
So that, X > 319.69
Hence, atleast 320 random reads should be made to search the file
Unicode is a 16 bit system which can support 65636 different characters which is much more than the number of characters that ASCII code support.
StrawberryTeaa (could be any fruit: blueberry, peach, etc)
potatoxchip
pastelsquid
SquishyPeach
GummiBear
ElegantFlaws (could add an e and remove the s: EleganteFlaw)
hunnie_b (or honee, honnie, hunni, etc)
agonyisheree
It's cool if you don't like these. I had trouble when I changed my user too. But you'll find your perfect username eventually. :)
<span>As far as I remember, this one - a. a move toward stricter control of mass-media communications by Congress and the FCC </span><span>is a trend that began during the Vietnam War and continued with the Internet.</span>
