Answer:
1.A table is a range of data that is defined and named in a particular way.
2.Table tools and layout
3.In insert tab Select the table and select the number of rows and colums
4.Split cell is use to split the data of a cell.Merge cell is used to combine a row or column of cells.
5.Select the cell and click down arrow next to the border button.
Answer:
In the presentation layer of the OSI reference model provides a variety of coding and functions that can be applied in application layer data. Information send by the application layer are ensured by these functions. As, presentation layer is the important layer in the OSI reference model because it is responsible for important services like data compression, data conversion, decryption and encryption.
Encryption at gateway is defined as, when the important data is first encrypted using protocol and then it is transferred in the network. And gateway re-director operates in the presentation layer.
Answer:
int sumAll(int n)//function definition.
{
if(n==1)//if condition.
return 1;
else//else condition.
{
return n+sumAll(n-1);//return the value and call the function in recursive manner.
}
}
Explanation:
- The above-defined function is a recursive type function that is written in the c language, which holds the if and else condition.
- When the user passes the largest value from 1, then the else condition will be executed which adds the largest value and pass the value after the decrement of the value as an argument.
- When the value will become 1, then the function if-block will be executed which returns the value and ends the calling function recursively.
Document design techniques that make
your document easier for readers to skim and therefore gives your writing
"High Skim Value" is true. The answer is letter A. Documents that
give you a high skim value are the headings and subheadings, white space and
the toposgraphy.
Answer:
Option d) B is 1.33 times faster than A
Given:
Clock time, 
No. of cycles per instructions, 
Solution:
Let I be the no. of instructions for the program.
CPU clock cycle, 
= 2.0 I
CPU clock cycle, 
= 1.0 I
Now,
CPU time for each can be calculated as:
CPU time, T = 
Thus B is faster than A
Now,
Performance of B is 1.33 times that of A
