Not to be rude, but this is elementary school. How would anyone know this?
Answer:RISC(reduced instruction set computer) is the computer used for low level operation by simple command splited into numerous instructions in single clock only and CISC(Complex instruction set computer) is the computer that performs the operation in single instruction.
RISC architecture has hardwired control unit,data cache unit,data path ,instruction cache and main memory as components .CISC architecture persist of control unit,micro program control memory, cache, instruction and data path and main memory.
The differences between RISC and CISC are as follows:-
- The instruction in RISC are less and and low complexes while CISC has several number of complex instruction.
- The calculation done by RISC are precise and quick whereas CISC has slightly slow calculation processing.
- The execution of RISC is faster as compared to CISC.
- RISC uses hardware component for implementation of instruction because it does not persist its own memory and CISC implements instructions using its own memory unit .
Answer:
5
Explanation:
The operator 'x++' is called the post increment operator, it is assign first and then increment.
The operator '++x' is called the pre increment operator, it is increment first and then increment.
So, both are increment operator which increment the value by one.
initially the value of x is zero,
++x increase the value to 1 and than assign to x.
then, x++ it assign to x first then increment by 1 means x=2
and so on.....
Their are five increment operator are used. so, the result is 5.
Answer:
The solution code is written in Python
- def findSmallest(vec, start):
-
- index = start
- smallest = vec[start]
-
- for i in range(start + 1, len(vec)):
- if(smallest > vec[i]):
- smallest = vec[i]
- index = i
-
- return index
Explanation:
Firstly we can define a function findSmallest() that takes two input parameters, a vector, <em>vec</em>, and a starting position, <em>start </em> (Line 1).
Next, create two variables, <em>index</em> and <em>smallest</em>, to hold the current index and current value where the smallest number is found in the vector. Let's initialize them with <em>start</em> position and the value held in the<em> start </em>position (Line 3-4).
Next, create a for-loop to traverse through the next value of the vector after start position and compare it with current <em>smallest </em>number. If current <em>smallest</em> is bigger than any next value in the vector, the <em>smallest </em>variable will be updated with the new found lower value in the vector and the index where the lower value is found will be assigned to variable<em> index</em>.
At the end return index as output.
