Home
Book Fire Online by http://bookfire.net Prev Page Prev Page
Table of Contents
Back Cover
The Essentials of Computer Organization and Architecture
Preface
To the Instructor
Chapter 1: Introduction
1.2 The Main Components of a Computer
1.3 An Example System - Wading through the Jargon
1.4 Standards Organizations
1.5 Historical Development
1.6 The Computer Level Hierarchy
1.7 The Von Neumann Model
1.8 Non-Von Neumann Models
Chapter Summary
Further Reading
References
Review of Essential Terms and Concepts
Exercises
Chapter 2: Data Representation in Computer Systems
2.2 Positional Numbering Systems
2.3 Decimal To Binary Conversions
2.4 Signed Integer Representation
2.5 Floating-Point Representation
2.6 Character Codes
2.7 Codes For Data Recording And Transmission
2.8 Error Detection And Correction
Chapter Summary
Further Reading
References
Review Of Essential Terms And Concepts
Exercises
Chapter 3: Boolean Algebra and Digital Logic
3.2 Boolean Algebra
3.3 Logic Gates
3.4 Digital Components
3.5 Combinational Circuits
3.6 Sequential Circuits
3.7 Designing Circuits
Chapter Summary
Further Reading
References
Review of Essential Terms and Concepts
Exercises
Focus on Karnaugh Maps
Chapter 4: MARIE : An Introduction to a Simple Computer
4.2 Marie
4.3 Instruction Processing
4.4 A Simple Program
4.5 A Discussion on Assemblers
4.6 Extending Our Instruction Set
4.7 A Discussion on Decoding — Hardwired vs. Microprogrammed Control
4.8 Real World Examples of Computer Architectures
Chapter Summary
Further Reading
References
Review of Essential Terms and Concepts
Exercises
Chapter 5: A Closer Look at Instruction Set Architectures
5.2 Instruction Formats
5.3 Instruction Types
5.4 Addressing
5.5 Instruction-Level Pipelining
5.6 Real-World Examples of ISAs
Chapter Summary
Further Reading
References
Review of Essential Terms and Concepts
Exercises
Chapter 6: Memory
6.2 Types of Memory
6.3 The Memory Hierarchy
6.4 Cache Memory
6.5 Virtual Memory
6.6 A Real-World Example of Memory Management
Chapter Summary
Further Reading
References
Review of Essential Terms and Concepts
Exercises
Chapter 7: Input/Output and Storage Systems
7.2 Amdahl's Law
7.3 I/O Architectures
7.4 Magnetic Disk Technology
7.5 Optical Disks
7.6 Magnetic Tape
7.7 RAID
7.8 Data Compression
Chapter Summary
Further Reading
References
Review of Essential Terms and Concepts
Exercises
Focus on Selected Disk Storage Implementations
Chapter 8: System Software
8.2 Operating Systems
8.3 Protected Environments
8.4 Programming Tools
8.5 Java — All of the Above
8.6 Database Software
8.7 Transaction Managers
Chapter Summary
Further Reading
References
Review of Essential Terms and Concepts
Exercises
Chapter 9: Alternative Architectures
9.2 RISC Machines
9.3 Flynn's Taxonomy
9.4 Parallel and Multiprocessor Architectures
9.5 Alternative Parallel Processing Approaches
Chapter Summary
Further Reading
References
Review of Essential Terms and Concepts
Exercises
Chapter 10: Performance Measurement and Analysis
10.2 The Basic Computer Performance Equation
10.3 Mathematical Preliminaries
10.4 Benchmarking
10.6 Disk Performance
Chapter Summary
Further Reading
References
Review Of Essential Terms And Concepts
Exercises
Chapter 11: Network Organization and Architecture
11.2 Early Business Computer Networks
11.3 Early Academic and Scientific Networks — The Roots and Architecture of the Internet
11.5 Network Protocols II — TCP/IP Network Architecture
11.6 Network Organization
11.7 High-Capacity Digital Links
11.8 A Look at the Internet
Chapter Summary
Further Reading
References
Review of Essential Terms and Concepts
Exercises
Appendix A: Data Structures and the Computer
A.2 Fundamental Structures
A.3 Trees
A.4 Network Graphs
Summary
Further Reading
References
Exercises
Glossary
Glossary Numbers
Glossary A
Glossary B
Glossary C
Glossary D
Glossary E
Glossary F
Glossary G
Glossary H
Glossary I
Glossary J
Glossary K
Glossary L
Glossary M
Glossary N
Glossary O
Glossary P
Glossary Q
Glossary R
Glossary S
Glossary T
Glossary U
Glossary V
Glossary W
Glossary Z
Answers and Hints for Selected Exercises
Chapter 2
Chapter 3
Chapter 4
Chapter 5
Chapter 6
Chapter 7
Chapter 8
Chapter 9
Chapter 10
Chapter 11
Appendix A
Index
Index A
Index B
Index C
Index D
Index E
Index F
Index G
Index H
Index I
Index J
Index K
Index L
Index M
Index N
Index O
Index P
Index Q
Index R
Index S
Index T
Index U
Index V
Index W
Index X
Index Z
List of Figures
List of Tables
List of Code Examples
List of Sidebars
Team LiB
Previous Section Next Section

Exercises

  1.  Hints and Answer    Construct a truth table for the following:

    1.  Hints and Answer    

    2.  Hints and Answer    

  2. Construct a truth table for the following:



  3.  Hints and Answer    Using DeMorgan's Law, write an expression for the complement of F if F(x,y,z) = .

  4. Using DeMorgan's Law, write an expression for the complement of F if F(x,y,z) = xy + .

  5.  Hints and Answer    Using DeMorgan's Law, write an expression for the complement of F if F(w,x,y,z) = .

  6. Use the Boolean identities to prove the following:

    1. The absorption laws

    2. DeMorgan's laws

  7.  Hints and Answer    Is the following distributive law valid or invalid? Prove your answer.

    x XOR (y AND z) = (x XOR y) AND (x XOR z)

  8. Show that

    1. Using truth tables

    2. Using Boolean identities

  9. Show that

    1. Using truth tables

    2.  Hints and Answer    Using Boolean identities

  10. Simplify the following functional expressions using Boolean algebra and its identities. List the identity used at each step.

  11. Simplify the following functional expressions using Boolean algebra and its identities. List the identity used at each step.

    1.  Hints and Answer    

    2.  Hints and Answer    

    3.  Hints and Answer    

  12. Simplify the following functional expressions using Boolean algebra and its identities. List the identity used at each step.

    1. (ab + c + df)ef

    2. x + xy

  13. Simplify the following functional expressions using Boolean algebra and its identities. List the identity used at each step.

    1.  Hints and Answer    xy + x

    2. yz + xz

    3. wx + w(xy + y)

  14. Use any method to prove the following either true or false:

  15.  Hints and Answer    Using the basic identities of Boolean algebra, show that:

    x( + y) = xy

  16.  Asterisk Mark   Using the basic identities of Boolean algebra, show that:

    x + y = x + y

  17.  Hints and Answer    Using the basic identities of Boolean algebra, show that:

    xy + z + yz = xy + z

  18.  Hints and Answer    The truth table for a Boolean expression is shown below. Write the Boolean expression in sum-of-products form.

    x

    y

    z

    F

    0

    0

    0

    1

    0

    0

    1

    0

    0

    1

    0

    0

    0

    1

    1

    1

    1

    0

    0

    0

    1

    0

    1

    0

    1

    1

    0

    1

    1

    1

    1

    0

  19. The truth table for a Boolean expression is shown below. Write the Boolean expression in sum-of-products form.

    x

    y

    z

    F

    0

    0

    0

    1

    0

    0

    1

    0

    0

    1

    0

    0

    0

    1

    1

    1

    1

    0

    0

    0

    1

    0

    1

    0

    1

    1

    0

    1

    1

    1

    1

    0

  20. Draw the truth table and rewrite the expression below as the complemented sum of two products:

  21. Given the Boolean function

    1.  Hints and Answer    Derive an algebraic expression for the complement of F. Express in sum-of-products form.

    2. Show that .

    3. Show that .

  22. Given the function

    1. List the truth table for F.

    2. Draw the logic diagram using the original Boolean expression.

    3. Simplify the expression using Boolean algebra and identities.

    4. List the truth table for your answer in Part c.

    5. Draw the logic diagram for the simplified expression in Part c.

  23. Construct the XOR operator using only AND, OR, and NOT gates.

  24.  Asterisk Mark   Construct the XOR operator using only NAND gates.

  25. Design a circuit with three inputs (x,y, and z) representing the bits in a binary number, and three outputs (a,b, and c) also representing bits in a binary number. When the input is 0, 1, 2, or 3, the binary output should be one less than the input. When the binary input is 4, 5, 6, or 7, the binary output should be one greater than the input. Show your truth table, all computations for simplification, and the final circuit.

  26. Draw the combinational circuit that directly implements the following Boolean expression:

  27.  Hints and Answer    Draw the combinational circuit that directly implements the following Boolean expression:

  28. Find the truth table that describes the following circuit:

  29.  Hints and Answer    Find the truth table that describes the following circuit:

  30. Find the truth table that describes the following circuit:

  31. Draw circuits to implement the parity generator and parity checker shown in Tables 3.11 and 3.12, respectively.

  32. Draw a half-adder using only NAND gates.

  33. Draw a full-adder using only NAND gates.

  34. Tyrone Shoelaces has invested a huge amount of money into the stock market and doesn't trust just anyone to give him buying and selling information. Before he will buy a certain stock, he must get input from three sources. His first source is Pain Webster, a famous stock broker. His second source is Meg A. Cash, a self-made millionaire in the stock market, and his third source is Madame LaZora, a world-famous psychic. After several months of receiving advice from all three, he has come to the following conclusions:

    1. Buy if Pain and Meg both say yes and the psychic says no.

    2. Buy if the psychic says yes.

    3. Don't buy otherwise.

    Construct a truth table and find the minimized Boolean function to implement the logic telling Tyrone when to buy.

  35.  Hints and Answer     Asterish Mark   A very small company has hired you to install a security system. The brand of system that you install is priced by the number of bits encoded on the proximity cards that allow access to certain locations in a facility. Of course, this small company wants to use the fewest bits possible (spending the least amount of money as possible) yet have all of their security needs met. The first thing you need to do is determine how many bits each card requires. Next, you have to program card readers in each secured location so that they respond appropriately to a scanned card.

    This company has four types of employees and five areas that they wish to restrict to certain employees. The employees and their restrictions are as follows:

    1. The Big Boss needs access to the executive lounge and the executive washroom.

    2. The Big Boss's secretary needs access to the supply closet, employee lounge, and executive lounge.

    3. Computer room employees need access to the server room and the employee lounge.

    4. The janitor needs access to all areas in the workplace.

    Determine how each class of employee will be encoded on the cards and construct logic diagrams for the card readers in each of the five restricted areas.

  36. How many 256 x 8 RAM chips are needed to provide a memory capacity of 4096 bytes?

    1. How many bits will each memory address contain?

    2. How many address lines must go to each chip?

    3. How many lines must be decoded for the chip select inputs? Specify the size of the decoder.

  37.  Hints and Answer      Asterish Mark   Investigate the operation of the following circuit. Assume an initial state of 0000. Trace the outputs (the Qs) as the clock ticks and determine the purpose of the circuit. You must show the trace to complete your answer.

  38. Describe how each of the following circuits works and indicate typical inputs and outputs. Also provide a carefully labeled black box diagram for each.

    1. coder

    2. ltiplexer

  39.  Hints and Answer    Complete the truth table for the following sequential circuit:

  40. Complete the truth table for the following sequential circuit:

  41.  Hints and Answer    Complete the truth table for the following sequential circuit:

  42. A sequential circuit has one flip-flop; two inputs, X and Y; and one output, S. It consists of a full-adder circuit connected to a D flip-flop, as shown below. Fill in the characteristic table for this sequential circuit by completing the Next State and Output columns.

  43.  Hints and Answer     Asterish Mark   A Mux-Not flip-flop (MN flip-flop) behaves as follows: If M = 1, the flip-flop complements the current state. If M = 0, the next state of the flip-flop is equal to the value of N.

    1. Derive the characteristic table for the flip-flop.

    2. Show how a JK flip-flop can be converted to an MN flip-flop by adding gate(s) and inverter(s).

  44.  Hints and Answer    List the steps necessary to read a word from memory in the 4 x 3 memory circuit shown in Figure 3.25.


Team LiB
Previous Section Next Section
Linking to Www Google.Com. Host by Book Fire