CPTS 121 Final Exam Questions and Verified Answers
100% Guarantee Pass
1. recursion
Answer: The process in which a function calls itself either directly or indirectly through another function
2. base case
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.
3. recursive step
Answer: the line that calls the recursive function
4. recursive function
Answer: A function that calls itself
5. function call stack
Answer: (often referred to just as the call stack or the stack) is responsible for maintaining the local variables
and parameters during function execution.
6. what is a bit
, Answer: Bit is derived from binary digit - A binary digit or bit has two possible values; 0 or 1
7. nibble
Answer: A sequence of 4-bits
One example of a nibble of data is 11112 This is the number 15 in decimal
8. byte
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'
9. How can we determine if a number is even or odd without using the mod (%)
operator?
Answer: If the least significant bit (lsb) is 1 the number is odd, if its 0 the number is even
10. How do we multiply and divide by powers of 2 without using the multipli-
cation (*) and division (/) operators?
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
11. bitwise negation
Answer: ~
0 -> 1 or 1 -> 0, where -> represents "becomes"
, 12. bitwise left shift
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
13. bitwise right shift
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
14. bitwise and
Answer: &
10102 & 00112; means AND each bit in each corresponding position - The result is 00102
15. bitwise or
Answer: |
10102 | 00112; means OR each bit in each corresponding position - The result is 10112
16. bitwise xor
Answer: ^
10102 ^ 00112; means XOR each bit in each corresponding position - The result is 10012
17. what is a command line argument
100% Guarantee Pass
1. recursion
Answer: The process in which a function calls itself either directly or indirectly through another function
2. base case
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.
3. recursive step
Answer: the line that calls the recursive function
4. recursive function
Answer: A function that calls itself
5. function call stack
Answer: (often referred to just as the call stack or the stack) is responsible for maintaining the local variables
and parameters during function execution.
6. what is a bit
, Answer: Bit is derived from binary digit - A binary digit or bit has two possible values; 0 or 1
7. nibble
Answer: A sequence of 4-bits
One example of a nibble of data is 11112 This is the number 15 in decimal
8. byte
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'
9. How can we determine if a number is even or odd without using the mod (%)
operator?
Answer: If the least significant bit (lsb) is 1 the number is odd, if its 0 the number is even
10. How do we multiply and divide by powers of 2 without using the multipli-
cation (*) and division (/) operators?
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
11. bitwise negation
Answer: ~
0 -> 1 or 1 -> 0, where -> represents "becomes"
, 12. bitwise left shift
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
13. bitwise right shift
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
14. bitwise and
Answer: &
10102 & 00112; means AND each bit in each corresponding position - The result is 00102
15. bitwise or
Answer: |
10102 | 00112; means OR each bit in each corresponding position - The result is 10112
16. bitwise xor
Answer: ^
10102 ^ 00112; means XOR each bit in each corresponding position - The result is 10012
17. what is a command line argument
