COMPUTER SCIENCE questions

Here is your homework 3. You should be able to work on this homework after topic 0-6. You can submit multiple times but only the last submission before deadline will be graded.

Please answer the following questions.

1. Analysis question. Assume we have boolean B = True, please show, though boolean is instance of integer, it is not exactly an integer?

Hints: 

 1) you can use isinstance() to show it is an instance of integer which is mentioned in video/material

 2) then use == and is to test whether it is exactly an integer

2. Coding question. You can refer to the codes from materials. And try/practice in the python playground or env if you set it up before answering these questions.

(Numeric type) Bitwise operation

Question 2-1: Please use left shift operation << to show how to calculate m multiplies 2 to the power of n.

Question 2-2: Please use right shift operation >> to show how to calculate m over 32. (Assume m is positive integer and divisible by 32)

Question 2-3: Find number of bits needed to be flipped to convert 12345678 to 202110

Hints:

 1) xor operation ^ – if two bits are different it returns 1; otherwise, return 0.

 2) try bin(3).count(“1”). This gets the number of 1 in bit in number 3.

Rubric:

1. Q1 – 30:

(15) for “though boolean is instance of integer”

(15) for “it is not exactly an integer”

2. Q2 – 70.

20 pts for each of the first two coding questions.

30 pts for the last coding question.

3. Submission after deadline will not be graded unless you reach out instructor for an extension in advance.