Q. 1
Computer Aptitude Test
Difficulty: Hard
(1 Mark)
The least significant bit of the binary number, which is equivalent to any odd decimal number, is:
💡
Step-by-Step Explanation & Concept Rationale
All odd integers in binary end with 1 in the 20 position.
Q. 2
Computer Aptitude Test
Difficulty: Hard
(1 Mark)
Binary circuit elements have:
💡
Step-by-Step Explanation & Concept Rationale
Binary logic is based on two states: 0 (off) and 1 (on).
Q. 3
Computer Aptitude Test
Difficulty: Hard
(1 Mark)
EBCDIC can code up to how many different characters?
💡
Step-by-Step Explanation & Concept Rationale
The 8-bit EBCDIC code supports 28=256 unique character representations.
Q. 4
Computer Aptitude Test
Difficulty: Hard
(1 Mark)
The computer code for the interchange of information between terminals is:
💡
Step-by-Step Explanation & Concept Rationale
American Standard Code for Information Interchange is the global standard for terminal data.
Q. 5
Computer Aptitude Test
Difficulty: Hard
(1 Mark)
If in a computer, 16 bits are used to specify address in a RAM, the number of addresses will be:
💡
Step-by-Step Explanation & Concept Rationale
Calculation: 216=65,536.
To find the number of unique memory addresses that can be generated using a given number of address bits, we use the formula: $(\text{Number of addresses}=2^{n})$ Where \(n\) is the number of bits. Given \(n = 16\):
A ($2^{16}$): This represents the direct mathematical expression of the formula (\(2^{16}\)). (Note: In many standard digital electronics multiple-choice questionnaires, option A is printed as "216" due to a typo omitting the superscript formatting for $(2^{16})$).
B (65536): Evaluating the exponential formula gives exactly \(2 \times 2 \times 2 \dots = 65,536\) unique addressable locations.
C (64K): In computer memory architecture, \(1\text{ K}\) (Kilobyte/Kibi) is equal to $(2^{10} = 1,024)$. Dividing our total addresses by this unit gives:
$$(\frac{65,536}{1,024}=64)$$
To find the number of unique memory addresses that can be generated using a given number of address bits, we use the formula: $(\text{Number of addresses}=2^{n})$ Where \(n\) is the number of bits. Given \(n = 16\):
A ($2^{16}$): This represents the direct mathematical expression of the formula (\(2^{16}\)). (Note: In many standard digital electronics multiple-choice questionnaires, option A is printed as "216" due to a typo omitting the superscript formatting for $(2^{16})$).
B (65536): Evaluating the exponential formula gives exactly \(2 \times 2 \times 2 \dots = 65,536\) unique addressable locations.
C (64K): In computer memory architecture, \(1\text{ K}\) (Kilobyte/Kibi) is equal to $(2^{10} = 1,024)$. Dividing our total addresses by this unit gives:
$$(\frac{65,536}{1,024}=64)$$
Q. 6
Computer Aptitude Test
Difficulty: Hard
(1 Mark)
Which number system is commonly used as a shortcut notation for groups of four binary digits?
💡
Step-by-Step Explanation & Concept Rationale
Hex uses one character (0-F) to represent 4 bits (24=16).
Q. 7
Computer Aptitude Test
Difficulty: Hard
(1 Mark)
The original ASCII code used.. bits of each byte, reserving that last bit for error checking:
💡
Step-by-Step Explanation & Concept Rationale
Standard ASCII is a 7-bit code; the 8th bit was often a parity bit.
Q. 8
Computer Aptitude Test
Difficulty: Hard
(1 Mark)
A technique used by codes to convert an analog signal into a digital bit stream is known as:
💡
Step-by-Step Explanation & Concept Rationale
PCM is the standard method for digitally representing analog signals.
Q. 9
Computer Aptitude Test
Difficulty: Hard
(1 Mark)
EBCDIC is:
💡
Step-by-Step Explanation & Concept Rationale
Extended Binary Coded Decimal Interchange Code is a standard 8-bit character encoding.
Q. 10
Computer Aptitude Test
Difficulty: Hard
(1 Mark)
Extended ASCII uses:
💡
Step-by-Step Explanation & Concept Rationale
Extended ASCII expands the standard 7-bit set to 8 bits to include additional characters.
Q. 11
Computer Aptitude Test
Difficulty: Hard
(1 Mark)
What is 'BigEndian'?
💡
Step-by-Step Explanation & Concept Rationale
A method of storing binary data where the most significant byte comes first.
Q. 12
Computer Aptitude Test
Difficulty: Hard
(1 Mark)
What is 'Bit'?
💡
Step-by-Step Explanation & Concept Rationale
A binary digit (0 or 1).
Q. 13
Computer Aptitude Test
Difficulty: Hard
(1 Mark)
What is 'Byte'?
💡
Step-by-Step Explanation & Concept Rationale
A group of binary digits (usually eight) operated on as a unit.
Study Stream Progress:
Showing 13 of 13 Questions (100%)
Ready to Test Your Retention & Speed?
Now that you have reviewed the study questions and rationales, test yourself in our interactive 1-by-1 practice engine or take the full official timed mock exam.