Thursday, December 18, 2025

Computer organization and architecture questions

 UNIT–1 (6 MARK QUESTIONS)


1. Explain the generations of computers with features.



2. Draw and explain the functional block diagram of a computer.



3. Differentiate between hardware and software.



4. Explain machine level, assembly level and high-level languages.



5. What is a digital computer? Explain its characteristics.



6. Explain number systems used in computers.



7. Perform binary addition and binary subtraction with example.



8. Explain binary to decimal and decimal to binary conversion.





---


✅ UNIT–2 (6 MARK QUESTIONS)


1. Explain basic logic gates with truth tables.



2. Explain NAND and NOR gates and why they are called universal gates.



3. Explain Boolean algebra laws and theorems.



4. What are minterms and maxterms? Explain with example.



5. Explain SOP and POS forms.



6. Explain Karnaugh Map (K-Map) and its advantages.



7. Explain Gray code and its applications.



8. Explain BCD and Excess-3 code.



9. Explain code conversion (Binary ↔ Gray or BCD ↔ Excess-3).





---


✅ UNIT–3 (6 MARK QUESTIONS)


1. Explain Half Adder and Full Adder with logic diagram.



2. Explain 4-bit parallel adder.



3. Explain Half Subtractor and Full Subtractor.



4. Explain Multiplexer with diagram.



5. Explain Demultiplexer with diagram.



6. Explain Encoder and Decoder.



7. Explain SR flip-flop.



8. Explain JK flip-flop with truth table.



9. Explain D flip-flop and T flip-flop.



10. Explain Ripple counter.



11. Explain Ring counter.



12. What is state reduction and state assignment?





---


✅ UNIT–4 (6 MARK QUESTIONS)


1. What is a microprocessor? Explain its basic elements.



2. Explain essential and non-essential elements of a microprocessor.



3. Explain addressing modes.



4. What are interrupts? Explain their types.



5. Explain the instruction cycle.



6. Differentiate between instruction cycle, machine cycle and T-state.



7. Explain pipelining.



8. What is superscalar pipeline?



9. Explain pipeline hazards.





---


✅ UNIT–5 (6 MARK QUESTIONS)


1. Explain memory hierarchy with diagram.



2. Explain cache memory.



3. Explain direct mapping technique in cache memory.



4. Explain associative mapping in cache memory.



5. Explain memory mapped I/O.



6. Explain DMA (Direct Memory Access).



7. Explain memory interleaving.



8. Explain 2-D and 3-D memory organization.



9. Explain memory management.

10.

No comments:

Post a Comment

Day three of theory of computation

 1. Non-deterministic Finite Automata (NFA)   Unlike a DFA, an NFA allows a machine to explore multiple paths simultaneously.   Definition: ...