This is something you would have to do yourself if this is a partner project and we don’t know you or your partners name using someone else’s would make it obvious that you didn’t do the work yourself. And the picture is blank there’s no further info on what you need done.
The OS (Operating System) is stored in the ROM on a smartphone. Correct answer: C
ROM stands for Read Only Memory. It is a computer memory that does not require power to store it's data (non-volitile). It's the Internal Memory where the OS is stored. It is partitioned into two parts, one for the OS and the rest for apps to use.
Answer:
Internet
Explanation:
A collection of a set of instrument that solve a problem is called the internet.
The Internet is an enormous networking infrastructure that uses the Internet protocol suite (TCP/IP). It connects millions of computers together globally, forming a network in which computers can communicate with each other provided that they are both connected to the Internet.
The Internet contains billions of web pages and resources created by software engineers from around the world, making it a limitless place to locate information and solve peculiar problems.
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.
Answer:
vec[0].push_back(10)
Explanation:
Given
Declaration: vector <int> vec
Required
Assign 10 to the first element
This can be done using the push_back keyword.
The syntax is: <em>vectorname[position].push_back(value); </em>
In this case:
vectorname = vec
position = 0 i.e. first element
value = 10
So, we have:
vec[0].push_back(10)