Answer:
sum = 0
for i in range(20, 100, 10):
sum = sum + i
Print(sum)
Explanation:
Answer:
Algorithm:
1. Declare an integer variable N.
2. Read the value N from user.
3.While(N):
3.1 find r=N%10;
3.2 print r in new line.
3.3 Update N as N=N/10.
4.end program.
Implementation in C++.
// header
#include <bits/stdc++.h>
using namespace std;
// main function
int main()
{
// variable
int N;
cout<<"Enter an Integer:";
cin>>N;
// find the digits of number
while(N)
{
// last digit
int r=N%10;
// print last digit
cout<<r<<endl;
// update the number
N=N/10;
}
return 0;
}
Output:
Enter an Integer:329
9
2
3
Answer:
A speed govenor
Explanation:
speed governor is an electronic device linked to the gearbox where sensors capture the movement of the vehicle. If the vehicle exceeds the specified speed limit, the device automatically slows the vehicle.
The logical expressions are
- (X NOR Y ) OR Z ⇒
- (A NAND B) AND NOT C ⇒
<h3>How to determine the
logical expressions?</h3>
<u>Logical expression 1</u>
X and Y are linked by the NOR gate.
So, we have:
X NOR Y
The X NOR Y is linked to Z by the OR gate.
So, we have:
(X NOR Y) OR Z
Hence, the logical expression is (X NOR Y ) OR Z ⇒
<u>Logical expression 2</u>
A and B are linked by the NAND gate.
So, we have:
A NAND B
The A NAND B is linked to C by the AND gate.
So, we have:
(A NAND B) AND C
Hence, the logical expression is (A NAND B) AND NOT C ⇒
See attachment for the truth tables
Read more about truth tables at:
brainly.com/question/27989881
#SPJ1
Answer:
Binary sort
Explanation:
Binary sort is one of the fastest search techniques used on arrays and other iterable data types. It algorithm sorts the array in ascending order then gets the item in the middle from which it divides the array to be searched in two parts. If the searched term is less than the mid item, then it is searched for in the first part, else it would be in the second.
