CPTS 121 Final Exam questions n
answers rated A+
recursion - correct answer ✔✔ The process in which a function calls itself either directly or
indirectly through another function
base case - correct answer ✔✔ tells when the recursion has to stop. For example, let us take
factorial function. The base case here is when n=0 or when n=1; and after every recursive call to
fact() function n value reduced by 1 and finally reaches base case.
recursive step - correct answer ✔✔ the line that calls the recursive function
recursive function - correct answer ✔✔ A function that calls itself
function call stack - correct answer ✔✔ (often referred to just as the call stack or the stack) is
responsible for maintaining the local variables and parameters during function execution.
what is a bit - correct answer ✔✔ Bit is derived from binary digit - A binary digit or bit has two
possible values; 0 or 1
nibble - correct answer ✔✔ A sequence of 4-bits
One example of a nibble of data is 11112 This is the number 15 in decimal
byte - correct answer ✔✔ A sequence of 8-bits
One example of a byte of data is 0100 00012 This is the number 65 in decimal It's also the ASCII
value for 'A'
, How can we determine if a number is even or odd without using the mod (%) operator? -
correct answer ✔✔ If the least significant bit (lsb) is 1 the number is odd, if its 0 the number is
even
How do we multiply and divide by powers of 2 without using the multiplication (*) and division
(/) operators? - correct answer ✔✔ Recall multiplication and division is expensive and resource
intensive
o Shift all bits in a number to the left by 1 to multiply by 2
o Shift all bits in a number to the right by 1 to divide by 2
bitwise negation - correct answer ✔✔ ~
0 -> 1 or 1 -> 0, where -> represents "becomes"
bitwise left shift - correct answer ✔✔ <<
means shift each bit in the number to the left by two positions and rotate in zeros - The result is
11002 if only a nibble of memory is available; otherwise it's 1011002
bitwise right shift - correct answer ✔✔ >>
means shift each bit in the number to the right by one position and rotate in zeros - The result is
01012; note the lsb is lost in the result
bitwise and - correct answer ✔✔ &
10102 & 00112; means AND each bit in each corresponding position - The result is 00102
bitwise or - correct answer ✔✔ |
10102 | 00112; means OR each bit in each corresponding position - The result is 10112
bitwise xor - correct answer ✔✔ ^
answers rated A+
recursion - correct answer ✔✔ The process in which a function calls itself either directly or
indirectly through another function
base case - correct answer ✔✔ tells when the recursion has to stop. For example, let us take
factorial function. The base case here is when n=0 or when n=1; and after every recursive call to
fact() function n value reduced by 1 and finally reaches base case.
recursive step - correct answer ✔✔ the line that calls the recursive function
recursive function - correct answer ✔✔ A function that calls itself
function call stack - correct answer ✔✔ (often referred to just as the call stack or the stack) is
responsible for maintaining the local variables and parameters during function execution.
what is a bit - correct answer ✔✔ Bit is derived from binary digit - A binary digit or bit has two
possible values; 0 or 1
nibble - correct answer ✔✔ A sequence of 4-bits
One example of a nibble of data is 11112 This is the number 15 in decimal
byte - correct answer ✔✔ A sequence of 8-bits
One example of a byte of data is 0100 00012 This is the number 65 in decimal It's also the ASCII
value for 'A'
, How can we determine if a number is even or odd without using the mod (%) operator? -
correct answer ✔✔ If the least significant bit (lsb) is 1 the number is odd, if its 0 the number is
even
How do we multiply and divide by powers of 2 without using the multiplication (*) and division
(/) operators? - correct answer ✔✔ Recall multiplication and division is expensive and resource
intensive
o Shift all bits in a number to the left by 1 to multiply by 2
o Shift all bits in a number to the right by 1 to divide by 2
bitwise negation - correct answer ✔✔ ~
0 -> 1 or 1 -> 0, where -> represents "becomes"
bitwise left shift - correct answer ✔✔ <<
means shift each bit in the number to the left by two positions and rotate in zeros - The result is
11002 if only a nibble of memory is available; otherwise it's 1011002
bitwise right shift - correct answer ✔✔ >>
means shift each bit in the number to the right by one position and rotate in zeros - The result is
01012; note the lsb is lost in the result
bitwise and - correct answer ✔✔ &
10102 & 00112; means AND each bit in each corresponding position - The result is 00102
bitwise or - correct answer ✔✔ |
10102 | 00112; means OR each bit in each corresponding position - The result is 10112
bitwise xor - correct answer ✔✔ ^
