Computer Architecture : Internal Evaluation.

 

Internal Evaluation: Concept Mapping

Instructions:
Select any one chapter from the "Computer Architecture" syllabus for your BSc IT program (e.g., Chapter 1: Computer Arithmetic, Chapter 2: Logic Gates & Boolean Algebra, Chapter 3: Arithmetic Circuits, etc.).

Create a comprehensive concept map that visually illustrates the relationships and interconnections between the fundamental concepts and sub-topics within your chosen chapter. Your map should demonstrate how these ideas build upon each other to form a cohesive understanding of the chapter’s content.

Guidance for Students:

  • Clearly state the title of the chapter you have chosen.
  • Begin by identifying the central theme or main concepts of your chosen chapter and branch out to related ideas and specific sub-topics.
  • Use lines or arrows to clearly show the relationships between different concepts.
  • Label your lines/arrows with concise phrases to explain the nature of the relationship (e.g., "is a type of," "is defined by," "is used for," "can be used to implement," "is derived from," "is the inverse of," "helps simplify," "consists of").
  • You may include small, illustrative examples (like simple truth tables, binary examples, or architectural components) within your map if it aids clarity, but the primary focus should be on the connections between concepts.
  • The goal is to show a holistic and structured understanding of the chosen chapter’s content.

 

 

Internal Evaluation: Problem Solving  

Instructions: Solve the following problems, showing all your steps clearly.

Part A: Number System Conversions & Binary Arithmetic

1. Conversion

·         Convert the decimal number 225 (base 10) to its 8-bit binary, octal, and hexadecimal equivalents.

·         Convert the hexadecimal number B3F (base 16) to its decimal and binary equivalents.

2. Binary Subtraction

·         Perform the binary subtraction: 110101 (base 2) – 10110 (base 2).
Show your work using the direct subtraction method.

·         Perform the binary subtraction: 100000 (base 2) – 111 (base 2).
Show your work using the 2’s complement method for an 8-bit representation.

Part B: Logic Gates & Boolean Algebra

Consider a digital system with three inputs: A, B, and C, and one output: F. The system’s output F is ‘1’ if and only if:

  • A is ‘1’ AND B is ‘1’, OR
  • A is ‘0’ AND C is ‘1’, OR
  • B is ‘0’ AND C is ‘0’.

1.     Truth Table: Construct the complete truth table for this system.

2.     Boolean Expression: Write the Boolean expression for the output F in Sum of Products form directly from the truth table.

3.     Logic Circuit Diagram: Draw the logic circuit diagram for the unsimplified Boolean expression obtained in step 2, using only basic AND, OR, and NOT gates.

4.     Boolean Simplification: Simplify the Boolean expression for F using the postulates and theorems of Boolean Algebra. Show each step of your simplification process.

5.     Simplified Logic Circuit: Draw the logic circuit diagram for the simplified Boolean expression obtained in step 4.