Bayburt University Lifelong Learning Programme

Description of Individual Course Units

Course Unit Code	Course Unit Title	Type of Course Unit	Year of Study	Semester	Number of ECTS Credits
E116.1B3	Digital Electronics	Elective	1	2	3

Level of Course Unit

Short Cycle

Objectives of the Course

Collectors, extractors, multiplication circuits, comparators, arithmetic logic units.

Name of Lecturer(s)

Öğr. Gör. Derya YARIMKAYA

Learning Outcomes

1	Recognizes the transformation of the number system and number systems. Issue systems generated code in the appropriate field and apply it to systems knows.
2	Recognizes logic gates, doors, electrical circuit equivalent of LojiLk create. Analyze. A logical expression can implement logic gates.
3	Knows the rules of Boolean mathematics and simplification of the rules of mathematics can make any logical boolean expression.
4	Logical expressions can transmit the truth table, truth table, Karnaugh maps can place values, as a result of the Karnaugh map; grouping can process, and groupings in the entire circuit by combining the outputs of the output statements to find the desired draw.
5	Create truth table for a given system, here you can switch to Karnaugh maps and draw Karnaugh maps to find the system's output is the simplest form.
6	Encoder (encoder) and decoder (Decoder) circuits can know and Data selector (multiplexer) and the data splitter (demultiplexer) circuits, and can know.
7	Collector / Summing), remover (Substractor), Multiplication (Multiply) circuit and the comparator (Comparator) circuitry, and can know.

Mode of Delivery

Normal Education

Prerequisites and co-requisities

None

Recommended Optional Programme Components

None

Course Contents

To know the number systems, to convert number systems to each other, to add, subtract, multiply and divide operations with binary numbers, to recognize the code systems used in digital electronic circuits and to convert the codes to each other, to logically integrated structures, logic gates: NOT (OR) Boolean mathematics, Simplification and drawing of logical expressions by using Boolean rules, Logical expressions of logical expressions, Boolean expressions, Boolean expressions, Boolean expressions, Boolean expressions, Boolean algebra, Mapping of Karnaugh maps of two, three, four and five varieties, transferring a problem to a logic field in any field, creating a truth table, from which karnaugh maps Encoder and Decoder circuits: 4 inputs-2 outputs, 8 inputs-3 outputs, 16 inputs-4 outputs and Decimal input-BCD output. Encoders, priority encoders. 2 input-4 output, 3 input-8 output, 4 input-16 output BCD input-Decimal output and BCD input, 7 segment output decoders, setting of data selector (multiplexer) and data distributor (demultiplexer) 4-bit data adders, 4-bit data adders, 16-input data selectors, 16-input data selectors, 4-output, 8-output and 16-output data distributors, half adder, full adder, Deduction Integrated Striking Circuits. Multiply circuits and realization, Establishment of comparator circuits, Half comparator, Full comparator, Four bit parallel (cascade) comparator, Arithmetic logic unit structure, examination and realization.

Weekly Detailed Course Contents

Week	Theoretical	Practice	Laboratory
1	Recognition of number systems, Converting number systems to each other, Addition, subtraction, multiplication and division operations with binary numbers.
2	Recognition of number systems, Converting number systems to each other, Addition, subtraction, multiplication and division operations with binary numbers.
3	Recognition of number systems, Converting number systems to each other, Addition, subtraction, multiplication and division operations with binary numbers.
4	BCD code, BCO code, BCH code, Excess-3 code, parity code, gray code and alphanumeric codes.
5	BCD code, BCO code, BCH code, Excess-3 code, parity code, gray code and alphanumeric codes.
6	Logic integrations, logic gates, boolean math principles, boolean math rules, simplification with boolean rules, truth table, logic gates from a single gate.
7	Logic integrations, logic gates, boolean math principles, boolean math rules, simplification with boolean rules, truth table, logic gates from a single gate.
8	Midterm
9	Karnaugh map rules, karnaugh maps, karnaugh maps and various applications.
10	Karnaugh map rules, karnaugh maps, karnaugh maps and various applications.
11	TTL logic gates AND, OR, NAND, NOR Gates
12	CMOS Logic CMOS Inverter
13	CMOS Logic CMOS Inverter
14	Code Translator, Encoders, Decoder, Multiplexer, Demultiplexer
15	Collectors, extractors, multiplication circuits, comparators, arithmetic logic units.
16	Final Exam.