There are no items in your cart
Add More
Add More
| Item Details | Price | ||
|---|---|---|---|
Digital Logic
Learn, Understand, Discuss. "GO" for the Best.
| star star star star star | 5.0 (22 ratings) |
Instructor: Deepak Poonia (MTech IISc Bangalore, GATE CSE AIR 53; AIR 67)
Language: English
Validity Period: 180 days
Validity Period: 365 days
₹4000 25% OFF
₹2999 including 18% GST
₹6000 33% OFF
₹3999 including 18% GST
GO Classes Complete Discrete Mathematics and Complete Engineering Mathematics Courses are FREE for all learners. Sign up and start learning.
Important Links (Click Below):
Discrete Mathematics Complete Course (FREE for ALL)
Engineering Mathematics Complete Course (FREE for ALL)
Features of the course:
One-Stop Solution for your Complete Best GATE Preparation!!
1. Quality Content: No Rote-learning. No poor understanding. No rote memorization of formulas, tables, or theorems. Understand everything with proofs, intuitions, and ideas.
2. No Prerequisites: Every concept is taught from the basics, without assuming any prior knowledge whatsoever.
3. Homeworks, Quizzes & Practice: Practice questions with solutions to test your understanding of concepts.
4. GATE PYQs Video Solution: Detailed Video Solution of GATE Previous Years' Questions, with Complete Analysis of each question.
5. Weekly Quizzes: We provide many weekly quizzes to evaluate your understanding of concepts. Quizzes are available anytime and freely accessible to students enrolled in the GATE CS Complete Course.
6. Doubt Resolution: All of your doubts will be resolved directly by the faculty & our team of experts. There is a dedicated Private Telegram Group for Enrolled Students of GO Classes where our faculties resolve students' doubts. So, our students don't have to go anywhere else to ask doubts.
➤ Join GATE CS or DA COMPLETE Course - By GO Classes
➤ Join GO Classes TEST SERIES - GATE CS, DA
➤ Join GO Classes Weekly Quizzes - GATE CS, DA
➤ Watch GO Classes FREE Courses - Complete Courses, FREE for All Learners
➤ DPPs for GATE CS, DA - FREE for All Students
➤ GO Classes Toppers - GATE CS, DA
➤ Download GO Classes Android APP
➤ Join GO Classes Public Telegram Group for Doubt Discussion
| Module 1 - Boolean Algebra, Minimization of Boolean Functions | |||
| Lecture 1 - Introduction to Digital Logic & Boolean Algebra | |||
| Lecture 2 - Boolean Algebra 39:00 | |||
| Annotated Notes - Lecture 1-2 - Boolean Algebra (86 pages) | |||
| Lecture 3A - Binary & Decimal Number System | |||
| Lecture 3B - Practice - Decimal & Binary Number System 9:00 | |||
| Annotated Notes - Lecture 3A-3B - Binary & Decimal Number System (81 pages) | |||
| Lecture 4A - Boolean Algebra Continued 33:00 | |||
| Annotated Notes - Lecture 4A - Boolean Algebra Continued (39 pages) | |||
| Lecture 4B - Boolean Expressions & Boolean Algebra Laws 62:00 | |||
| Lecture 4C - Complement & Dual of Boolean Expressions 57:00 | |||
| Annotated Notes - Lecture 4B-4C - Boolean Expressions, Laws, Dual, Complement (142 pages) | |||
| Lecture 4D - Algebraic Simplification 118:00 | |||
| Annotated Notes - Lecture 4D - Algebraic Simplification (135 pages) | |||
| Weekly Quiz 1 - Boolean Algebra | |||
| Lecture 5A - Standard Forms of Boolean Expressions 38:00 | |||
| Lecture 5B - Minterm, Maxterm 54:00 | |||
| Annotated Notes - Lecture 5A-5B - Standard Forms of Boolean Expressions, Minterm (88 pages) | |||
| Lecture 5C - Revision - Minterm, Maxterm | |||
| Lecture 5D - Expressing Boolean Function using Minterms, Maxterms | |||
| Annotated Notes - Lecture 5C-5D - Expressing Boolean Function using Minterms, Maxterms (255 pages) | |||
| Lecture 5E - Revision & Practice - Standard Forms of Boolean Functions 42:00 | |||
| Lecture 5F - Practice Questions - Sum of Minterms, Product of Maxterms 20:00 | |||
| Annotated Notes - Lecture 5E-5F - Revision & Practice - Standard Forms of Boolean Functions (78 pages) | |||
| Lecture 6A - K-Map Part 1 - Boolean Function Minimization 67:00 | |||
| Annotated Notes - Lecture 6A - K-Map Part 1 - Boolean Function Minimization (70 pages) | |||
| Lecture 6B - K-Map Part 2 - Minimization of Boolean Expression using K-map 61:00 | |||
| Lecture 6C - K-Map Part 3 - Minimization of Boolean Expression using K-map 46:00 | |||
| Annotated Notes - Lecture 6B-6C - K-Map Part 2 - Minimization of Boolean Expression (131 pages) | |||
| Lecture 6D - K-Map Part 4 - Don't Cares, Prime Implicants 161:00 | |||
| Annotated Notes - Lecture 6D - K-Map Part 4 - Don't Cares, Prime Implicants (159 pages) | |||
| Lecture 6E - K-Map Part 5 - Prime Implicant, Essential Prime Implicant 153:00 | |||
| Annotated Notes - Lecture 6E - K-Map Part 5 - Prime Implicant, Essential Prime Implicant (138 pages) | |||
| Lecture 7 - Dual of a Boolean Function, Self Dual | |||
| Annotated Notes - Lecture 7 - Dual of a Boolean Function, Self Dual (218 pages) | |||
| Lecture 8 - ExOr, ExNor Functions & Their Properties 26:00 | |||
| Annotated Notes - Lecture 8 - ExOr, ExNor Functions & Their Properties (30 pages) | |||
| Weekly Quiz 2 - Boolean Algebra | |||
| (OPTIONAL) Positive Level Logic System, Negative Level Logic System 18:00 | |||
| Practice Sessions | |||
| Weekly Quizzes and Solutions | |||
| Module 2 - Number System | |||
| Lecture 1A - Octal, Hexadecimal Number Systems | |||
| Lecture 1B - Why Octal, Hexadecimal Number Systems are Important? 12:00 | |||
| Lecture 2 - Binary Addition 8:00 | |||
| Annotated Notes - Lecture 1A,1B,2 - Octal, Hexadecimal Number Systems (110 pages) | |||
| Lecture 3A - Complement of a number, Subtraction using r's complement 60:00 | |||
| Lecture 3B - Practice Questions - Subtraction using r's complement 9:00 | |||
| Lecture 3C - Subtraction using r-1's complement 29:00 | |||
| Lecture 3D - Signed Binary Numbers Representations 40:00 | |||
| Annotated Notes - Lecture 3A-3D - Complement of a number, Subtraction (146 pages) | |||
| Lecture 3E - Range of Signed Binary Numbers in Various Representations 49:00 | |||
| Annotated Notes - Lecture 3E - Range of Signed Binary Numbers in Various Representations (40 pages) | |||
| Lecture 4A - Addition of Signed Binary Numbers in Various Representations 46:00 | |||
| Annotated Notes - Lecture 4A - Addition of Signed Binary Numbers (36 pages) | |||
| Lecture 4B - Addition, Subtraction of Signed Binary Numbers in Signed Complement Systems 56:00 | |||
| Annotated Notes - Lecture 4B - Addition, Subtraction of Signed Binary Numbers (42 pages) | |||
| Lecture 5A - Overflow Definition, Overflow Detection in Signed Magnitude Representation | |||
| Lecture 5B - Overflow in Addition of Signed Binary Numbers in 2's, 1's Complement Representation 48:00 | |||
| Annotated Notes - Lecture 5 - Overflow for Addition Operation (105 pages) | |||
| Lecture 6 - Sign Extension in Various Representations 28:00 | |||
| Annotated Notes - Lecture 6 - Sign Extension in Various Representations (28 pages) | |||
| Lecture 7A - Binary Codes Introduction 30:00 | |||
| Annotated Notes - Lecture 7A - Binary Codes Introduction (16 pages) | |||
| Lecture 7B - BCD Code, 2421 Code, Self Complementary Binary Codes | |||
| Annotated Notes - Lecture 7B - BCD Code, 2421 Code, Self Complementary Binary Codes (68 pages) | |||
| Lecture 7C - Gray Codes 66:00 | |||
| Lecture 7D - Finding Gray Code - An Easy Alternate Way 9:00 | |||
| Annotated Notes - Lecture 7C-7D - Gray Codes (74 pages) | |||
| Weekly Quiz - Minimization, Number System | |||
| Weekly Quizzes and Solutions | |||
| Module 3 - Combinational Circuits | |||
| Lecture 1 - Compact Truth Table Representation 64:00 | |||
| Annotated Notes - Lecture 1 - Compact Truth Table Representation (42 pages) | |||
| Lecture 2A - Multiplexer 58:00 | |||
| Lecture 2B - Realization of Boolean Functions using Multiplexer 38:00 | |||
| Annotated Notes - Lecture 2A-2B - Multiplexer (119 pages) | |||
| Lecture 2C - Practice Questions - Multiplexer 59:00 | |||
| Annotated Notes - Lecture 2C - Practice Questions - Multiplexer (39 pages) | |||
| Lecture 2D - Function Realization using Multiplexer 26:00 | |||
| Lecture 2E - Building Large Mux using Small Mux 36:00 | |||
| Annotated Notes - Lecture 2D-2E - Building Multiplexer (64 pages) | |||
| Lecture 2F - Multiplexer with Enable Input 26:00 | |||
| Lecture 3 - Demultiplexer 16:00 | |||
| Lecture 4A -Encoder - Binary Encoder 43:00 | |||
| Lecture 4B - Encoder - Priority Encoder 27:00 | |||
| Annotated Notes - Lecture 2F-4B - Multiplexer with Enable Input (107 pages) | |||
| Lecture 5A - Decoder 60:00 | |||
| Lecture 5B - Active Low Decoder i.e. NAND gate Decoder 26:00 | |||
| Lecture 5C - Function Realization using Decoder 25:00 | |||
| Annotated Notes - Lecture 5 - Decoder (117 pages) | |||
| Lecture 6 - Propagation Delay & Timing Diagrams | |||
| Annotated Notes - Lecture 6 - Propagation Delay & Timing Diagrams (40 pages) | |||
| Lecture 7A - Adder - Half Adder 41:00 | |||
| Annotated Notes - Lecture 7A - Adder - Half Adder (34 pages) | |||
| Lecture 7B - Adder - Full Adder 64:00 | |||
| Annotated Notes - Lecture 7B - Adder - Full Adder (57 pages) | |||
| Lecture 7C - Adder - Ripple Carry Adder 70:00 | |||
| Annotated Notes - Lecture 7C - Adder - Ripple Carry Adder (55 pages) | |||
| Lecture 7D - Carry Look Ahead Adder Part 1 - Carry Generation & Carry Propagation 23:00 | |||
| Lecture 7E - Carry Look Ahead Adder Part 2 - Carry Generator Circuit 57:00 | |||
| Annotated Notes - Lecture 7D-7E - Carry Look Ahead Adder (63 pages) | |||
| Lecture 7F - Carry Look Ahead Adder Part 3 - Few Questions 17:00 | |||
| GATE CSE 2007 Question 35 - Look-Ahead Carry Generator Circuit | |||
| GATE CSE 2016 Question 33 - Carry Look-Ahead Adder 2:00 | |||
| Annotated Notes - Lecture 7F - Carry Look Ahead Adder (35 pages) | |||
| GRE Computer Science - Ripple Carry Adder Delay Question 22:00 | |||
| Lecture 8 - Adder for Signed Addition 26:00 | |||
| Annotated Notes - Lecture 8 - Adder for Signed Addition (27 pages) | |||
| Lecture 9A - Binary Subtractors - Half Subtractor, Full Subtractor 93:00 | |||
| Annotated Notes - Lecture 9A - Binary Subtractors - Half Subtractor, Full Subtractor (53 pages) | |||
| Lecture 9B - Subtractor Circuit using binary adder 193:00 | |||
| Annotated Notes - Lecture 9B - Subtractor Circuit using binary adder (87 pages) | |||
| Lecture 10A - Minimum NAND/NOR Gate Implementation - Part 1 128:00 | |||
| Annotated Notes - Lecture 8A - Minimum NAND, NOR Gate Implementation - Part 1 (87 pages) | |||
| Lecture 10B - Minimum NAND/NOR Gate Implementation - Part 2 | |||
| Annotated Notes - Lecture 10B - Minimum NAND, NOR Gate Implementation - Part 2 (81 pages) | |||
| Lecture 10C - Minimum NAND/NOR Gate Implementation - Part 3 | |||
| Annotated Notes - Lecture 10C - Minimum NAND, NOR Gate Implementation - Part 3 (100 pages) | |||
| Lecture 10D - Minimum NOR Gate Implementation | |||
| Annotated Notes - Lecture 10D - Minimum NOR Gate Implementation (50 pages) | |||
| Lecture 10E - Minimum NOR Gate Implementation - Part 2 | |||
| Annotated Notes - Lecture 10E - Minimum NOR Gate Implementation - Part 2 (90 pages) | |||
| Weekly Quizzes and Solutions | |||
| Module 4 - Functional Completeness | |||
| Functional Completeness - Complete Playlist | |||
| Annotated Notes - Functional Completeness (135 pages) | |||
| Annotated Notes - Post's Functional Completeness Theorem (243 pages) | |||
| Module 5 - Sequential Circuits | |||
| Lecture 1 - Introduction - Combinational Circuits Vs Sequential Circuits 53:00 | |||
| Lecture 2A - One Bit Storage Device - Cross Coupled Inverters 27:00 | |||
| Lecture 2B - SR Latch - Cross Coupled NOR gates 54:00 | |||
| Lecture 2C - S'R' Latch - Cross Coupled NAND gates 28:00 | |||
| Annotated Notes - Lecture 1-2 - Sequential Circuits, SR Latch (162 pages) | |||
| Lecture 3 - Timing Diagram of SR Latch, Clock 71:00 | |||
| Lecture 4 - Flipflops - SR Flipflop 87:00 | |||
| Annotated Notes - Lecture 3,4 - Clock, SR Flipflop (150 pages) | |||
| Lecture 5 - D Flipflop 45:00 | |||
| Lecture 6 - Clock Triggering of flipflops 27:00 | |||
| Lecture 7 - JK flipflop 48:00 | |||
| Lecture 8A - T flipflop 22:00 | |||
| Lecture 8B - Few Important Notes for Flipflops 10:00 | |||
| Annotated Notes - Lecture 5-8 - D, JK, T Flipflops (172 pages) | |||
| Lecture 9A - Flipflop Conversion 68:00 | |||
| Lecture 9B - Morris Mano PN Flip-flop Question 14:00 | |||
| GATE IT 2008 - JK Flipflop Question | |||
| Annotated Notes - Lecture 9A-9C - Flipflop Conversion (109 pages) | |||
| Lecture 9D - Flipflop Conversion - SR to T flipflop 26:00 | |||
| Annotated Notes - Lecture 9D - Flipflop Conversion - SR to T flipflop (20 pages) | |||
| Lecture 10A - Direct Inputs in flipflops - Preset & Clear Inputs 67:00 | |||
| Lecture 10B - Practice Questions on Flipflops 16:00 | |||
| Annotated Notes - Lecture 10 - Direct Inputs in flipflops - Preset & Clear Inputs (83 pages) | |||
| Lecture 11A - Master Slave Flipflops to Implement Edge Triggering 73:00 | |||
| Lecture 11B - Race Around Condition in JK Flipflops 38:00 | |||
| Annotated Notes - Lecture 11 - Master Slave Flipflops & Race Condition (112 pages) | |||
| (OPTIONAL) Lecture 12 - Timing Issues in Flipflops - Setup Time, Hold Time, Frequency | |||
| Annotated Notes - Lecture 12 - Timing Issues in Flipflops - Hold Time, Setup Time (127 pages) | |||
| Lecture 13 - Registers | |||
| Annotated Notes - Lecture 13 - Registers (231 pages) | |||
| Lecture 14 - Finite State Machines(FSM) - Mealy & Moore Machines | |||
| Annotated Notes - Lecture 14 - FSM Finite State Machines - Mealy & Moore Machine (240 pages) | |||
| Next Topic: Counters | |||
| Lecture 15A - Counters Introduction - Asynchronous Counters, Synchronous Counters 22:00 | |||
| Lecture 16A - Asynchronous Counters Part 1 - Divide by 2 Counter, Frequency Division 35:00 | |||
| Lecture 16B - Asynchronous Counters Part 2 - Mod-4 Asynchronous Counters, Transient States 40:00 | |||
| Annotated Notes - Lecture 15-16B - Counters, Asynchronous Counters Part 1,2 (100 pages) | |||
| Lecture 16C - Asynchronous Counters Part 3 - Binary Ripple Counters, Transient States, Maximum Frequency 133:00 | |||
| Lecture 16D - Asynchronous Counters Part 4 - Binary Up Ripple Counter, Mod-M Ripple Counter 68:00 | |||
| Lecture 16E - Asynchronous Counters Part 5 - Cascading Counters 6:00 | |||
| Lecture 16F - Asynchronous Counters Part 6 - Counting from Anywhere to Anywhere 12:00 | |||
| GATE ECE 1987 - Ripple Counter Question 6:00 | |||
| GATE ECE 1990 - Ripple Counter Question 3:00 | |||
| GATE ECE 1993 - Ripple Counter Question 3:00 | |||
| GATE ECE 1999 - Ripple Counter Question 4:00 | |||
| Annotated Notes - Lecture 16C-16F - Asynchronous Counters Part 3-6 (229 pages) | |||
| Lecture 17A - Synchronous Counters - The Analysis 54:00 | |||
| Lecture 17B - GATE CSE 1990 Synchronous Counter Question - Modulus of Counter 25:00 | |||
| GATE CSE 2021 - Synchronous Counter Question 13:00 | |||
| Lecture 17C - Synchronous Counters - Design 83:00 | |||
| Annotated Notes - Lecture 17 - Synchronous Counters (169 pages) | |||
| Lecture 18A - Ring Counter - Synchronous Counters 74:00 | |||
| Lecture 18B - Johnson Counter - Synchronous Counters 69:00 | |||
| Annotated Notes - Lecture 18 - Ring Counter, Johnson Counter (181 pages) | |||
| Students' Hand Written Notes | |||
| Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024) - Digital Logic | |||
| Notes by Quantum City (AIR 107, GATE CS 2024, Shreyas Rathod) - Digital Logic Notes (56 pages) | |||
| 1.0 Boolean algebra, minimization of boolean func (55 pages) | |||
| 2.0 Number system (39 pages) | |||
| 3 and 4 Combinational circuits and functional completeness (73 pages) | |||
| 5.0 Sequential circuit (100 pages) | |||
| Digital Electronics(Himanshu Dutta - AIR 16 GATE 2024) (186 pages) | |||
| Handwritten Notes AIR 75 Mahek Garala (6 pages) | |||
| Handwritten Notes by Rich Amrutiya (AIR 67 GATE CS 2026) - Digital Logic (318 pages) | |||
| Handwritten Notes by Shaikh Hasib (AIR 331 GATE CS 2026) (336 pages) | |||
| Handwritten Notes by Shaikh Hasib (AIR 331 GATE CS 2026) - Short Notes (37 pages) | |||
After a successful purchase, this item would be added to your courses.
You can access your courses in the following ways:
Other Courses