Answer:
The answer is "physical design"
Explanation:
This design is the method of translating the specification of circuits into a physical design that explains how cells and roads connect. It is an architecture, that involves the system's internal processes of input and output.
- This system is created by establishing the design criteria, which determines basically what the applicant system is doing.
- It includes the architecture, process architecture and software design of user interfaces.
Answer:
It can improve the quality of education in many ways. It opens doorways to a wealth of information, knowledge and educational resources, increasing opportunities for learning in and beyond the classroom. Teachers use online materials to prepare lessons, and students to extend their range of learning
Explanation:
The only thing that I know is that after you input the text file, it could either:
-save those lines as a variable
-display the text file
However any more would be dependent on the language.
Answer:
The answer to the following question is the option "B".
Explanation:
In computer science, the term Reliability is an attribute for any computer-related element like software or hardware. It consistently acts according to its terms. It has a lengthy process for considering one of three similar properties that must be analyzed when using a computer component. So the answer to this question is option B which is "0.684".
Answer:
No you can not tell that recursion is ever required to solve a problem.
Recursion is required when in the problem, the solution of the input depends on the solution of the subsets of the input.
Iteration is also another form of repetitive approach we follow to solve that kind of problems.
But the difference between recursion and iteration is :
- In recursion we call the function repeatedly to return the result to next level.
- In iteration certain bunch of instructions in a loop are executed until certain conditions met.
Explanation:
For example in the Fibonacci sequence problem, to find 
, we need to compute 
and 
before that.
- In case of recursion we just call the method Fibonacci(n) repeatedly only changing the parameter Fibonacci(n-1), that calculates the value and return it.
Fibonacci(n)
1. if(n==0 or n==1)
2. return 1.
3.else
4. return( Fibonacci(n-1)+Fibonacci(n-1) )
- But in case of iteration we run a loop for i=2 to n, within which we add the value of current
and 
to find the value of 
Fibonacci(n)
1. if(n<=2)
2. result = 1
3. else
4. result1 =1 and result2=1.
5. { result = result1 +result2.
6. result1= result2.
7. result2 = result.
8. }
9. output result.
