Digital Fundamentals Question Bank
Unit I: Digital Fundamentals
Model problems
1. Convert (25.75)10 into binary, octal, and hexadecimal.
2. Subtract (10110)2 − (1001)2 using 1’s and 2’s complement methods
3. Add signed 8-bit numbers +45 and −30 using 2’s complement and indicate overflow if any.
4. Encode decimal 47 in BCD and Excess-3 code.
5. Convert Gray code 1101 into binary and binary 1011 into Gray code.
Short-answer questions
Define positional number system.
Why is 2’s complement preferred over 1’s complement?
What is unsigned number representation?
State DeMorgan’s theorems.
Define BCD and Excess-3 code.
Long-answer questions
1. Explain decimal, binary, octal, and hexadecimal number systems with examples.
2. Explain signed addition and subtraction using 1’s and 2’s complement methods.
3. Discuss BCD, Excess-3, Gray code, and alphanumeric codes with examples.
Unit II: Logic Gates
Model problems
1. Implement 𝐹 = 𝐴. 𝐵 + 𝐶 using only NAND gates.
2. Express a Boolean function in SOP and POS forms.
3. Minimize 𝐹 = ∑𝑚(1,3,5,7) using a 3-variable K-map
Short-answer questions
List the basic logic gates.
Why are NAND and NOR called universal gates?
Define minterm and maxterm.
What is the difference between SOP and POS?
Draw XOR and XNOR truth tables.
Long-answer questions
1. Explain all logic gates with symbols and truth tables.
2. Explain SOP, POS, minterms, and maxterms with suitable examples.
3. Solve a 4-variable K-map minimization problem step by step.
Unit III: Combinational Circuit Design
Model problems
1. Design a half adder and write its truth table.
2. Design a full adder using two half adders and one OR gate.
3. Construct a 4-bit binary parallel adder.
4. Design a 1-bit magnitude comparator.
5. Realize a Boolean function using an 8×1 multiplexer.
Short-answer questions
Define combinational circuit
What is the function of a carry look-ahead adder?
Distinguish encoder and decoder.
State the applications of multiplexers.
Why is a BCD adder needed?
Long-answer questions
1. Explain half adder, full adder, half subtractor, and full subtractor with truth tables and logic
diagrams
2. Explain carry look-ahead adder and compare it with ripple carry adder.
3. Design and explain multiplexer, demultiplexer, encoder, and decoder circuits.
Unit IV: Sequential Circuits
Model problems
1. Draw the output waveform of a JK flip-flop for a given clock sequence
2. Convert an SR flip-flop into a D flip-flop using logic gates.
3. Design a 3-bit ripple counter using JK flip-flops.
4. Explain the operation of a 4-bit ring counter.
Short-answer questions
Define flip-flop.
What is an excitation table?
What is race-around condition?
Distinguish ripple and synchronous counters
What is a universal shift register?
Long-answer questions
1. Explain SR, D, JK, and master-slave flip-flops with truth tables
2. Explain edge triggering and conversion of one flip-flop type into another.
3. Describe ripple counter, ring counter, shift register, and universal shift register with diagrams.
Unit V: Memory and Logic Devices
Model problems
1. For a memory of size 2K × 8, determine the number of address lines and total bits.
2. Draw and explain an SRAM cell.
3. Show the organization of ROM for a given truth table.
4. Implement a function using PLA.
Short-answer questions
List the different types of ROM
Differentiate SRAM and DRAM.
What is EEPROM?
What is a programmable logic array?
Long-answer questions
1. Explain ROM, PROM, EPROM, EEPROM, RAM, SRAM, and DRAM with neat diagrams.
2. Compare PLA and PAL with suitable logic implementation examples.
3. Explain the classification and applications of programmable logic devices.