← Back to 2. Simple as Possible (SAP) - I

📝 Adder Subtractor of Simple as Possible (SAP) I Computer

📖 From An Introduction To Microprocessor 8085 • 2. Simple as Possible (SAP) - I • 8 questions available

Practice MCQs for Adder Subtractor of Simple as Possible (SAP) I Computer. Test your knowledge with carefully crafted questions across easy, medium, and hard difficulty levels.

🔄 Last updated: 2026-07-30

Easy Questions

Medium Questions

Hard Questions

📝 Sample Questions

Q1. What is the definition of an adder‑subtractor circuit?

🔹 A. A circuit that can add or subtract two binary numbers based on a control signal

🔹 B. A circuit that only adds binary numbers

🔹 C. A circuit that only subtracts binary numbers

🔹 D. A memory register that stores intermediate results

💡 Difficulty: easy | ✅ Correct: A

Q2. A 4‑bit adder‑subtractor receives A = 1011₂ (11) and B = 0101₂ (5) with the control set for subtraction. Which output correctly shows the 4‑bit difference and the overflow condition?

🔹 A. Result 0110, Overflow

🔹 B. Result 0110, No overflow

🔹 C. Result 1110, Overflow

🔹 D. Result 1110, No overflow

💡 Difficulty: medium | ✅ Correct: B

Q3. A 16‑bit adder‑subtractor computes A − B where A = 0x7FFF and B = 0x0001. What is the 16‑bit result and does signed overflow occur?

🔹 A. Result 0x7FFE, No overflow

🔹 B. Result 0x8000, Overflow

🔹 C. Result 0x7FFE, Overflow

🔹 D. Result 0x8000, No overflow

💡 Difficulty: hard | ✅ Correct: A

⬆️ View all questions in the quiz below

🔗 Related Topics

📝 Architecture of Simple as Possible (SAP) I Computer 📝 Instruction Set of Simple as Possible (SAP) I Computer 📝 Programming of Simple as Possible (SAP) I Computer 📝 Working of Simple as Possible (SAP) I Computer 📝 Fetch Cycle of Simple as Possible (SAP) I Computer

🚀 Start Quiz 📝 Practice Mode