Combinational and Sequential Design Notes | B.Sc. (Information Technology) Semester 1 | Mumbai University | munotes
Official Notes munotes.in
Combinational and Sequential Design
B.SC. (INFORMATION TECHNOLOGY) · SEMESTER 1
Strictly as per the University of Mumbai NEP syllabus in force for B.Sc. (Information Technology)
For B.Sc. (Information Technology) students of the University of Mumbai and all its affiliated colleges
Open the book ↓munotes.in First Year
Contents
Module I 1. Study of Logic gates and their ICs and universal gates:
- How This Paper Is Examined, and How to Read This Book 1
- The Bench: Breadboard, Power Supply and the Five Volt Rail 3
- Reading a DIP: Pin One, the Notch, and the Chips That Break the Rule 6
- Switches, LEDs and the Logic Probe 9
- Wiring a Circuit That Works the First Time 12
- When It Does Not Work: Finding the Fault 15
- Bits, and Why a Digital Circuit Has Only Two Voltages 18
- Binary, Decimal, Octal and Hexadecimal 20
- Converting Between the Bases 23
- Binary Addition and Subtraction 25
- Signed Numbers, and the Two Complements 28
- BCD: the 8421 Code 31
- Excess-3, and Why It Is Self-Complementing 34
- Gray Code, and Why Exactly One Bit Changes 37
- The Three Basic Gates: AND, OR and NOT 40
- NAND and NOR 43
- XOR and XNOR 46
- Positive Logic, Negative Logic and the Bubble 49
- TTL: What a 1 and a 0 Really Are 52
- The 7400, 7408, 7432 and 7404 55
- The 7402, and Its Reversed Pins 58
- The 7486 and the 74266, Which Needs a Resistor 61
- Testing a Gate IC Before You Trust It 64
- Boolean Algebra: the Postulates 67
- The Laws: Commutative, Associative and Distributive 70
- The Theorems: Idempotence, Absorption and Consensus 73
- Duality, and What It Saves You 77
- De Morgan's Two Laws 80
- Verifying De Morgan on the Bench 84
- Simplifying an Expression by Algebra 88
- The Truth Table as the Statement of a Problem 92
- Minterms and the Sum of Products 96
- Maxterms and the Product of Sums 100
- Moving Between SOP, POS and the Table 104
- The Karnaugh Map: Why Gray Order Makes It Work 107
- Two and Three Variable Maps 111
- The Four Variable Map 115
- Grouping: Prime Implicants and Essential Prime Implicants 119
- Don't-Care Conditions 123
- Reading a Product of Sums Answer Off the Map 127
- When the Map Gives Two Answers 131
- NAND Is Universal 135
- Building the Five Gates from NAND 139
- NOR Is Universal 143
- Building the Five Gates from NOR 146
- Converting an SOP Circuit to All-NAND 150
- Converting a POS Circuit to All-NOR 154
- Implementing an Expression with the Fewest Gates 157
- The Fewest ICs, Which Is a Different Question 161
- Designing a Combinational Circuit from Words 165
- A Worked Design, End to End 168
- A Second Worked Design, in POS Form 172
- What a Code Converter Is 177
- Binary to Gray Code Converter 181
- Gray to Binary Code Converter 184
- Binary to BCD Code Converter 187
- Binary to Excess-3 Code Converter 191
- The Half Adder 194
- The Full Adder 197
- The Four Bit Ripple Carry Adder 200
- The Half and Full Subtractor 204
- Subtraction by Complement, and the Adder-Subtractor 208
- The BCD Adder 211
- The BCD Subtractor 215
- The Excess-3 Adder 219
- The Excess-3 Subtractor 222
Module II 6. Implement Arithmetic circuits.
- Arithmetic Circuits Beyond the Adder 225
- Multiplying in Binary by Hand 228
- The Two by Two Binary Multiplier 231
- Comparing Two Bits 235
- The Two Bit Magnitude Comparator 238
- Cascading Comparators, and the 74266 242
- The Data Path Family 245
- What an Encoder Does 248
- The Eight to Three Encoder 250
- The Priority Encoder 254
- What a Decoder Does 257
- The 2-to-4 and 3-to-8 Decoder from Gates 260
- The 74138 263
- The 74139 266
- What a Multiplexer Does 269
- The Four to One Multiplexer from Gates 272
- The 74153 276
- The 74157 279
- What a Demultiplexer Does 282
- The One to Four Demultiplexer 285
- The 74151 288
- Realising a Three Variable Function on a 74151 291
- Realising a Four Variable Function on a 74151 295
- Realising a Function on a 74138 299
- Combinational Against Sequential 303
- The SR Latch from NOR Gates 307
- The SR Latch from NAND Gates 311
- The Gated Latch and the D Latch 314
- Level Triggering, Edge Triggering and Master-Slave 317
- The SR Flip-Flop 321
- The D Flip-Flop 324
- The JK Flip-Flop, and the Race Around 327
- The T Flip-Flop 330
- Characteristic Tables and Excitation Tables 333
- The 7473 336
- The 7474 340
- The 7476 343
- Converting SR to JK, D and T 346
- Converting JK to D, T and SR 349
- Converting D to T and T to D 352
- What a Counter Is 355
- The Three Bit Ripple Counter with the 7473 358
- Propagation Delay, and Why Ripple Counters Glitch 361
- Designing a Synchronous Counter 365
- The Three Bit Synchronous Counter with the 7473 369
- An Up-Down Counter, and a Counter with a Gap 372
- Mod-N Counters 376
- Mod-N Counters from the 7473 and 7400 380
- The 7490 384
- The 7492 and the 7493 388
- Mod-N Counters from the 7490, 7492 and 7493 392
- Cascading Counters Past Ten 396
- Registers and What They Hold 399
- The Serial In, Serial Out Register 402
- The Serial In, Parallel Out Register 405
- The Parallel In, Serial Out Register 408
- The Parallel In, Parallel Out Register 411
- The Bidirectional Shift Register 414
- The 7495 417
- Ring Counters and Johnson Counters 420
- The Seven Segment Display 424
- Designing the Seven Segment Decoder by K-Map 427
- The 7447 431
- Simulating Before You Wire 435
Module J The certified journal, the two-hour practical examination, the viva and the internal assessment
The chapters
Every chapter of this book comes with the B.Sc. (Information Technology) Semester 1 notes.
The cover and the contents are free to look through. Buy the notes once to read every chapter of every subject in this semester.
Notes: ₹499 Already bought it? Sign in
Free either way: question papers, the syllabus, and the cover and contents of every book.
The rest of this subject
These notes are cut from the University's printed syllabus. Open the syllabus itself for the same subject.