Answer:
ssume that,
Maximum “students” count can be 10.
*Driver Class*
*Solution class*
import java.util.*;
class Student {
private String name;
private int rollNo;
public String getName() {}
public void setName(String name) {}
public int getRollNo() {}
public void setRollNo(int rollNo) {}
};
class ClassRoom {
private int i;
private Student[] students;
public void addStudent(String name, int rollNo) {}
public Student[] getAllStudents() {}
};
Your answer is true your welcome!
Answer:
Since there are only two digits in binary, there are only two possible outcomes of each partial multiplication: If the digit in B is 0, the partial product is also 0. If the digit in B is 1, the partial product is equal to A.
Explanation:
The pseudocode to find the sum of all integers that are multiples of 9, from 1 to 250.
totalSum = 0
for i from 1 to 250{
if i is divided by 9 and remainder is 0{
totalSum = totalSum + i;
}
}
print(totalSum)
in python language the code will be
totalSum = 0
for i in range(1,250):
if i%9==0:
totalSum += i
If you will run the program , the answer would be 3402.
