Answer:
1, 4, 7
Explanation:
The instruction in the question can be represented as:
for i in range(1,10,3):
print i
What the above code does is that:
It starts printing the value of i from 1
Increment by 3
Then stop printing at 9 (i.e.. 10 - 1)
So: The sequence is as follows
Print 1
Add 3, to give 4
Print 4
Add 3, to give 7
Print 7
Add 3, to give 10 (10 > 10 - 1).
So, it stops execution.
Answer:
I mean if your talking about games then just try Cool math I will give link in comments
Explanation:
Answer:
<u>Window.java</u>
- public class Window {
- int width;
- int height;
-
- public Window(int width, int height){
- this.width = width;
- this.height = height;
- }
- public int getWidth(){
- return width;
- }
- public int getHeight(){
- return height;
- }
-
- public int getClientAreaHeight(){
- return getHeight();
- }
- }
<u>Main.java</u>
- public class Main {
- public static void main (String [] args) {
- Window win1 = new Window(12, 15);
- System.out.println(win1.getClientAreaHeight());
- }
- }
Explanation:
<u>Window.java</u>
There is a Window class with two int type attributes, width and height (Line 1 - 3).
The constructor of this class will take two inputs, width and height and set these input to its attributes (Line 5 - 8). There are two methods getWidth and getHeight which will return the value of attributes width and height, respectively (Line 10 - 16).
The required new method getClientAreaHeight is defined in line 18 -20. This method will call the getHeight method to return the height value of the window (Line 19).
<u>Main.java</u>
We test the Window class by creating one Window instance and call the getClientAreaHeight method and print the return output (Line 1 -6).
We shall see 15 is printed.
Answer:
code = 010100000001101000101
Explanation:
Steps:
The inequality yields 
, where M = 16. Therefore,
The second step will be to arrange the data bits and check the bits. This will be as follows:
Bit position number Check bits Data Bits
21 10101
20 10100
The bits are checked up to bit position 1
Thus, the code is 010100000001101000101
