Scribd
Upload
154 views

Agenda: Few Exercises On Combinational Circuits Basic Storage Element I.E. SR Latch Concept of Memory

The document discusses computer programming concepts such as combinational circuits, basic storage elements like SR latches, memory concepts including address space and addressability, exercises on logic functions and truth tables, gated D latches, registers, memory organization, and memory hierarchy. It provides examples of calculating address space and addressability for different memory sizes.

Uploaded by

vipulugale
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT or read online on Scribd
154 views

Agenda: Few Exercises On Combinational Circuits Basic Storage Element I.E. SR Latch Concept of Memory

The document discusses computer programming concepts such as combinational circuits, basic storage elements like SR latches, memory concepts including address space and addressability, exercises on logic functions and truth tables, gated D latches, registers, memory organization, and memory hierarchy. It provides examples of calculating address space and addressability for different memory sizes.

Uploaded by

vipulugale
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT or read online on Scribd
You are on page 1/ 9

Computer Programming TA C162

Agenda
Few Exercises on Combinational Circuits

Basic Storage element i.e. SR latch

Concept of memory
• Address space
• Addressability

1
Computer Programming TA C162

Exercise:1
Convert given logic function into its equivalent Truth table
X = (A OR B) AND (B OR C)
• Write Boolean equation using SOP
• Write Boolean equation using POS
A B C X
SOP Expression 0 0 0 0
X = A’BC’ + A’BC + AB’C + ABC’ + ABC
0 0 1 0
0 1 0 1
0 1 1 1
POS Expression
X = (A+B+C).(A+B+C’).(A’+B+C) 1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1
2
Computer Programming TA C162

Take Home Exercises


Draw the truth table for following logic function
• Y = NOT(A) OR (B AND C)

• X = NOT(NOT(A) AND NOT(B))

Note: Write SOP Boolean expression and draw the


equivalent logic gate circuit.

3
Computer Programming TA C162

Gated D-Latch
Two inputs: D (data) and WE (write enable)
• when WE = 1, latch is set to value of D
S = NOT(D), R = D
• when WE = 0, latch holds previous value
S = R = 1

4
Computer Programming TA C162

Register
A register stores a multi-bit value.
• We use a collection of D-latches, all controlled by a
common WE.
• When WE = 1, n-bit value D is written to register.

5
Computer Programming TA C162

Memory
Now we know how to store bits,
We can build a memory – a logical k × m array of
stored bits.

Address Space k = 2n •
locations •
•
Number of locations in memory

m bits

Number of bits per location = Addressability


6
Computer Programming TA C162

Example: Addressability & Address Space


Example:1
A byte (8-bit) addressable memory has a 14 bit address then
What is Addressability? 8 bits

214
What is Address Space?

Example:2
A 64-bit addressable machine have 2 GB memory.
Addressability 64 Bits
Address Space 228

7
Computer Programming TA C162

Memory Hierarchy in Computer System

8
Computer Programming TA C162

More on Memory
Two basic kinds of RAM (Random Access Memory)
Static RAM (SRAM)
• Fast, maintains data as long as power applied i.e. volatile

Dynamic RAM (DRAM)


• Slower but denser, bit storage decays – must be
periodically refreshed

Also, non-volatile memories: ROM, PROM, flash...

You might also like