EE 203 • Midterm • Digital Systems
Digital design konseptlerinin temellerini bu derste atacağız.
Combinational ve Sequential circuit tasarlamayı, register ve counter çalışma prensiplerini öğrenerek, teorik olarak dijital devreleri anlamış olacağız. Laboratuvarda veya simülasyonda hazırlayacağınız devrelerin tüm teorik alt yapısını görecek ve bunları problemlere uygulayacağız.
Eğitmen
Oğuzhan Çakmak
Elektrik Elektronik Mühendisi
Güncellenecek
1499 TL
Ders Özeti
Bu ders ile kazanacakların:
- Üniversitene özel hazırlanmış dersleri izle
- Çıkmış soruları ve çözümlerini gör
- Örnek sınav sorularıyla pratik yap
- Anlamadığın yerleri tekrar et
- İstediğin yerden eriş
- Kendi hızında öğren
Ders İçeriği
Binary Numbers
Introduction
Binary Numbers
Binary Arithmetic
Number-Base Conversion & Octal and Hexadecimal Numbers
Complements
Example - 1
Example - 2
Example - 3
Example - 4
Signed Binary Numbers
Arithmetic Operations with Signed Binary Numbers
Example - 5
Example - 6
Binary Codes
Binary Logic
Binary Logic and Boolean Algebra
Laws and Rules of Boolean Algebra
Boolean Functions
Example - 1
Example - 2
Example - 3
Example - 4
Canonical and Standard Forms - 1
Example - 5
Canonical and Standard Forms - 2
Example - 6
Canonical and Standard Forms - 3
Other Logic Operations
Gate Level Minimization
The Map Method
Example - 1
Example - 2
Example - 3
Example - 4
Four-Variable K-Map
Example - 5
Example - 6
Product of Sums Simplification
Example - 7
Don't-Care Conditions
Example - 8
NAND and NOR Implementation
Example - 9
Example - 10
Other Two-Level Implementations
Example - 11
Exclusive-OR (XOR) Function
Combinational Logic
Combinational Circuits
Analysis of Circuits
Example - 1
Example - 2
Design of Circuits
Example - 3
Example - 4
Example - 5
Example - 6
Example - 7
Half and Full Adders
Example - 8
Binary Adder
Carry Lookahead Logic
Example - 9
Example - 10
Example - 11
Binary Adder-Subtractor
Example - 12
BCD Adder
Binary Multiplier
Example - 13
Magnitude Comparator
Example - 14
Decoder - 1
Example - 15
Decoder - 2
Example - 16
Example - 17
Example - 18
Example - 19
Example - 20
Encoder
Example - 21
Example - 22
Multiplexer
Example - 23
Example - 24
Example - 25
Example - 26
State Elements (flip-flops)
Sequential Circuits
SR Latch
SR Latch With Control Input & D Latch
Flip-Flops & D-type Flip-Flops
SR Flip-Flops
JK Flip-Flops & T Flip-Flops
Sample Midterm Questions
Example - 1 (Binary numbers and number systems)
Example - 2 (Binary numbers and number systems)
Example - 3 (Binary numbers and number systems)
Example - 4 (Binary numbers and number systems)
Example - 5 (Binary logic and Boolean algebra)
Example - 6 (Binary logic and Boolean algebra)
Example - 7 (Binary logic and Boolean algebra)
Example - 8 (Binary logic and Boolean algebra)
Example - 9 (Boolean function minimization techniques)
Example - 10 (Boolean function minimization techniques)
Example - 11 (Boolean function minimization techniques)
Example - 12 (Boolean function minimization techniques)
Example - 13 (Boolean function minimization techniques)
Example - 14 (Boolean function minimization techniques)
Example - 15 (Combinational logic circuit design)
Example - 16 (Combinational logic circuit design)
Example - 17 (Combinational logic circuit design)
Example - 18 (Combinational logic circuit design)
Example - 19 (Combinational logic circuit design)
Example - 20 (Combinational logic circuit design)
Example - 21 (Combinational logic circuit design)
Example - 22 (Combinational logic circuit design)
Example - 23 (Combinational logic circuit design)
Example - 24 (Combinational logic circuit design)
Example -25 (flip-flops)
Example - 26 (flip-flops)
Example - 27 (flip-flops)
Example - 28 (Boolean function minimization techniques)
Example 29 - (Combinational circuit design)
Example - 30 (combinational circuit design)
Example - 31 (flip-flops)
Example - 32 (Binary numbers and number systems)
Example - 33 (Binary numbers and number systems)
Example - 34 (Boolean function minimization techniques)
Example - 35 (Boolean function minimization techniques)
Example - 36 (Boolean function minimization techniques)
Example - 37 (Boolean function minimization techniques)
Example - 38 (Boolean function minimization techniques)
Example - 39 (Combinational logic circuit design)
Example - 40 (Combinational logic circuit design)
Example - 41 (flip-flops)
1499 TL
Ders Özeti
Sıkça Sorulan Sorular
Örneğin, Koç Üniversitesi - MATH 101 (Calculus) veya başka bir okulun benzer dersi olsun, paketlerimiz tam da o derse göre tasarlanır. Böylece nokta atışı çalışır, zaman kazanırsın.
Sınava özel videolar —konu anlatımları, çıkmış sorular ve çözümleri, özet notlar—içerir. Sınavda sıkça çıkan soruları hedefler. Eğitmenlerimiz, üniversitenin akademik takvimini takip ederek paketleri sürekli günceller. Böylece, gereksiz detaylarla vakit kaybetmeden başarını artırmaya odaklanabilirsin.