Answer: Its............ A Chromebook type of Chromebook...??
Explanation:
Ion know I aint a geek, geezer -_- (Thats a lie)
what are the different steps while solving a problem using computer? explain
Explanation:
The following six steps must be followed to solve a problem using computer.
Problem Analysis.
Program Design - Algorithm, Flowchart and Pseudocode.
Coding.
Compilation and Execution.
Debugging and Testing.
Program Documentation.
Consider a file system using the indexed allocation. The block size is 512 bytes and the pointer to a block takes 2 bytes. The largest file size that a one level indexed allocation method could handle is ___________ KB. Recall that 1KB is equal to 210 bytes. Answer -1 if there is no limit based on the provided information.
Answer:
128 KB
Explanation:
Given data :
The block size = 512 bytes
Block pointer size = 2 bytes
In an indexed allocation, a special block named Index Block contains all the pointers to the blocks that the file had occupied.
Therefore, the maximum number of block pointer in 1 block :
[tex]$=\frac{\text{block size}}{\text{pointer size}}$[/tex]
[tex]$=\frac{512}{2}$[/tex]
= 256
Thus, a block can hold maximum 256 pointers.
It is given the level of indexing is one. So,
Maximum size of the file = maximum number of block pointers in 1 file x block size
= 256 x 512
[tex]$=2^8 \times 2^9$[/tex]
[tex]$=2^{8+9}$[/tex]
[tex]$=2^{17}$[/tex]
[tex]$=2^7 \times 2^{10}$[/tex]
[tex]$=128 \times 2^{10}$[/tex]
= 128 KB (∵ 1 KB = [tex]2^{10} \ B[/tex] )
Therefore, the largest file that 1 level if indexed allocation method can handle is 128 KB.
2. 5s is a Chinese principle adapted for use in the workplace.
True or False
Answer:
A. true
Explanation:
because 5s is the.................