EEEN 103 • MidtermDigital System Design and Microprocessors

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.

1999 TL

666 TL a month, 3 instalments at no extra cost

55 past exam questions with solutions
63 topic lessons · 11 h 16 min
Access for the whole term

Instructor

Oğuzhan Çakmak

Oğuzhan Çakmak

Elektrik Elektronik Mühendisi

Marhaba, ben Oğuzhan!

Mühendisliğin sadece kağıt üzerinde formüllerden ibaret olmadığını, hayatın tam içinde olduğunu düşünenlerdenim. Karadeniz Teknik Üniversitesi Elektrik-Elektronik Mühendisliği mezunuyum ve şu anda yine KTÜ'de Elektronik üzerine Yüksek Lisans eğitimime devam ediyorum. Öncesinde edindiğim Biyomedikal (Ön Lisans) altyapım da disiplinler arası bakış açıma katkı sağladı.

Lise yıllarımdan beri TÜBİTAK projelerinin içindeyim; lisans dönemimden bu yana da aktif olarak Ar-Ge ve proje danışmanlığı yapıyorum. Yaklaşık 5 yıldır da bu tecrübelerimi özel dersler aracılığıyla öğrenci arkadaşlarımla paylaşıyorum.

Neler Yapıyoruz? Özellikle Devreler 1-2, Elektronik ve Sayısal Tasarım derslerinde; ezberci bir yaklaşımdan uzak, bol görsel destekli ve gerçek hayat örnekleriyle dolu bir işleyişi benimsiyorum. Benim derslerimde "Bu formülü neden ezberliyoruz?" diye düşünmezsiniz; o formülün arkasındaki mühendislik felsefesini ve gerçekte hangi sorunu çözdüğünü kavrarsınız.

Ders Dışı: Mühendislik benim için bir yaşam tarzı. Derslerden kalan zamanlarımda beni robotik projeler geliştirirken, 3D yazıcımla tasarım basarken, ahşap atölyesinde veya bir arabayı tamir ederken bulabilirsiniz. Doğada olmak ise en büyük enerji kaynağım.

Gelin, karmaşık görünen devreleri ve sistemleri birlikte en sade ve mantıklı haliyle çözelim!

Topics

Course introduction

Introduction

Free

Binary Numbers

Important

Binary Arithmetic

Important

Number-Base Conversion & Octal and Hexadecimal Numbers

Important

Complements

Important

Example 1

Free

Example 2

Free

Example 3

Important

Example 4

Important

Signed Binary Numbers

Arithmetic Operations with Signed Binary Numbers

Example 5

Important

Example 6

Important

Binary Codes

Binary Logic

Laws and Rules of Boolean Algebra

Free

Boolean Functions

Important

Example 1

Free

Example 2

Free

Example 3

Important

Example 4

Important

Canonical and Standard Forms 1

Important

Example 5

Canonical and Standard Forms 2

Important

Example 6

Canonical and Standard Forms 3

Important

Other Logic Operations

The Map Method

Example 1

Example 2

Example 3

Example 4

Four-Variable K-Map

Free

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 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

Sequential Circuits

Free

SR Latch

Important

SR Latch With Control Input & D Latch

Important

Flip-Flops & D-type Flip-Flops

Important

SR Flip-Flops

Important

JK Flip-Flops & T Flip-Flops

Important

State Table and State Diagram

Free

Analysis Of Clocked Sequential Circuits Part 1

Important

Analysis Of Clocked Sequential Circuits Part 2

Important

Analysis Of Clocked Sequential Circuits Part 3

Important

Analysis Of Clocked Sequential Circuits Part 4

Important

Mealy and Moore Models

Important

State Reduction and Assignment

Design Procedure

Important

Registers

Free

Shift Registers

Important

Serial Adder

Important

Universal Shift Register

Important

Counters - Binary Ripple Counters

Important

Counters - Synchronous Counters

Important

UP-DOWN Binary Counter

Important

Binary Counter With Parallel Load

Important

Other Counters

Important

Introduction

Important

RAM (Random Access Memory)

Important

ROM (Read-Only Memory)

Important

PLA & PAL

Important

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)

Free

Example - 6 (Binary logic and Boolean algebra)

Example - 7 (Binary logic and Boolean algebra)

Example - 8 (Binary logic and Boolean algebra)

Free

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)

Free

Example - 14 (Boolean function minimization techniques)

Example - 15 (Combinational logic circuit design)

Example - 17 (Combinational logic circuit design)

Example - 18 (Combinational logic circuit design)

Free

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)

Free

Example - 24 (Combinational logic circuit design)

Example - 25 (Boolean function minimization techniques)

Example 26 - (Combinational circuit design)

Example - 27 (combinational circuit design)

Example - 28 (Binary numbers and number systems)

Example - 29 (Binary numbers and number systems)

Example - 30 (Boolean function minimization techniques)

Free

Example - 31 (Boolean function minimization techniques)

Example - 32 (Boolean function minimization techniques)

Example - 33 (Boolean function minimization techniques)

Example - 34 (Boolean function minimization techniques)

Example - 35 (Combinational logic circuit design)

Free

Example - 36 (Combinational logic circuit design)

Example - 1 (Sequential circuits)

Free

Example - 2 (Sequential circuits)

Example - 3 (Sequential circuits)

Example - 4 (Memory and programmable logic)

Example - 5 (Memory and programmable logic)

Example - 5 (Memory and programmable logic)

Example - 7 (Sequential circuits)

Past Exam Question 1

Past Exam Question 2

Past Exam Question 3

Past Exam Question 4

Past Exam Question 5

Past Exam Question 6

Past Exam Question 1

Past Exam Question 2

Past Exam Question 3

Past Exam Question 4

Past Exam Question 5

Past Exam Question 6

Past Exam Question 7

Frequently asked questions about EEEN 103 Midterm

Frequently asked questions about Unicourse

1999 TL