Answer:
3 bits
Explanation:
Capacity of main memory=16 Bytes=24
The number of address bits= 4 bits.
The size of the word= 1 Byte=20
The word bits=0.
Number of lines =4
Number of sets required=21
The sets bits is =1
The number of offset bits=20=0
Number of tag bits= total number of address bits - (word bits + offset bits + set bits)
= 4 - 0 -0- 1
= 3 bits
Answer:
def scramble(s):
if len(s) % 2 == 1:
index = int(len(s)//2)
else:
index = int(len(s)/2)
return s[index:] + s[:index]
Explanation:
Create a function called scramble that takes one parameter, s
Check the length of the s using len function. If the length is odd, set the index as the floor of the length/2. Otherwise, set the index as length/2. Use index value to slice the s as two halves
Return the second half of the s and the second half of the s using slice notation (s[index:] represents the characters from half of the s to the end, s[:index] represents the characters from begining to the half of the s)
Answer:
Cause it fun and i have fun
call of duty and football and boxing games
Since i was 7 now im 13
with your mind
I dont know
Answer:
I think you have gone mad BTW.....
