Answer:
a. file-naming conventions
Explanation:
File names need to follow certain criteria and constraints. Examples include:
- File names must not start with special symbols.
- File names can consist of letters,digits and special characters such as _.
- File name can contain an extension after a dot sign.
- File names must not be duplicates of an existing file.
Such constraints form part of file-naming conventions.
- file-path represents the complete path to the file in the directory structure.
- disk partition segments a hard disk into multiple volumes.
- file-path starts from the root directory and spans one or more subdirectories to the location of the actual file.
Answer:
yessss I tooo have a fire at my home
lolololololololololo
ok have a great day what is your name ?
Answer:
The formula does not require arguments.
Explanation:
One of the programs or software that runs on a computer is Microsoft Office programs. One of these programs is called Microsoft Excel. It is a spreadsheet program where calculations can be made, graphs, diagrams can be plotted and drawn as well.
In other to utilize Microsoft Excel properly, we make use of what we call FUNCTIONS. Functions in Microsoft Excel are defined as formulas, that have already been prepared or created before hand in the Microsoft Excel program so that we can be able to used Microsoft Excel properly and efficiently. Functions may or may not require ARGUMENTS to carry out necessary calculations.
An ARGUMENT is a number or variable that functions require to carry out or do their calculations.
Examples of the functions found in Microsoft Excel are the TODAY and NOW functions. These two functions are used in spreadsheets on Microsoft Excel with regards to Date and Time.
TODAY function is used to give us or update the current or present date while the NOW function gives us or updated the current date and time.
The uniqueness or similarities between the TODAY and NOW functions is that their formula do not require arguments.
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
