A computer "nibble" consists of four "bits," each bit being either a 0 or a 1. If characters are represented using a code that uses a nibble for each character, how many different characters can be represented?

All computers store the strings of O's and 1's of binary numbers in the same format. True False

Computer Science In MIPS MARS Assembly Language Write a program that reads a character between "O" to "9" and convert each character based on the following code "O" to be translated to "a" %3D "1" to be translated to "A" "2" to be translated to "c" "3" to be translated to "C" "4" to be translated to "x" "5" to be translated to "Y" "6" to be translated to "m" "7" to be translated to "M" "8" to be translated to "b" "9" to be translated to "B" Pls, use a case statement with a loop...You read one character at a time..then you print its translated character. If you enter any other character outside the 0 to 9 then the program exit successfully.

FIND AND CORRECT ALL THE ERRORS   sc = input("enter socre, done to stop") while sc!="DONE":   ct = 0   tot = 0   sc = input("enter a score, -999 to stop")   ct+=1   tot+=ct print("average:",tot/ct)

Assume a fully associative cache with 4 lines. Assume that the initial state of the tags are Joe, Kim, Sue, and Meg respectively as shown below. Applying the LRU policy, complete the table below for the following tag address sequence: Joe -> Dan -> Sue You can complete the table by replacing labels noted from A through P. Note that the TAG will be the names and COUNT will be numbers. The first column "Joe" is completed for you as a reference. INITIAL TAG Joe Kim Sue Meg A= COUNT 0 1 2 3 Joe TAG Joe Kim Sue Meg B= COUNT 3 0 1 2 Dan TAG A с E G |= COUNT B D F H Sue TAG I K M O J= COUNT J L N P

Sequences of Operations Find the number of operations performed in the pseudocode below. y x + x + x z + y + y + y + 2 q + x + x+y+z