Answer:
numX = 3
Explanation:
First, let's analyze what the code is showing:
If both conditions in the if-statement are true, then numX = 3. If one or both conditions are false, then numX = 7 ('and' means that both conditions have to be true for the if-statement to become true).
- this statement is true.
!=
- this statement is also true (!= means 'not equal').
Since both conditional statements are true, then numX must equal .
Hope this helps :)
Using the knowledge in computational language in python it is possible to write a code that computes an integer's checksum.
<h3>Writting the code:</h3><em>def checkSum(n): # Function definition</em>
<em> total = 0 # total variable which returns sum</em>
<em> c = 0 # counter variable which count the even position</em>
<em> while(n!=0): # running a loop while n != 0</em>
<em> r = int(n%10) #breaking the number into digits</em>
<em> c=c+1 # increase counter</em>
<em> if c%2==0: # if counter is even position then double the number </em>
<em> r = r*2</em>
<em> while(r!=0): # do the process</em>
<em> total = total + int(r%10)</em>
<em> r = int(r/10)</em>
<em> n=int(n/10) </em>
<em> else: # if counter is odd position then simple add the digit </em>
<em> total = total + r # into total</em>
<em> n=int(n/10)</em>
<em> return total # in the last return the sum of digits</em>
<em># Driver code</em>
<em>n = int(input("Enter Number:")) # asking user to enter the number </em>
<em>print(checkSum(n)) # calling the function</em>
See more about python at brainly.com/question/18502436
#SPJ1
Answer:
Given address = 94EA6
tag = 0 * 94 ( 10010100 )
line = 0 * 1 D 4 ( 111010100 )
word position = 0*6 ( 110 )
Explanation:
using the direct mapping method
Number of lines = 512
block size = 8 words
word offset = = 3 bit
index bit = = 9 bit
Tag = 20 - ( index bit + word offset ) = 20 - ( 3+9) = 8 bit
Given address = 94EA6
tag = 0 * 94 ( 10010100 )
line = 0 * 1 D 4 ( 111010100 )
word position = 0*6 ( 110 )