Course Descriptions
Ders Adı / Ders Kodu
Saatler
Kredi
AKTS
Logic Design
ELEC1401
Number systems. Boolean algebra. Logic circuits and simplification of the circuit. Logic design with gates. MSI and LSI technologies. Combinatorial circuits. Sequential circuits. Counters. Arithmetic logic, memory and control units.
(
3
+
0
+
1
)
3
5
AKTS
5Kredi
3Saatler
(3 + 0 + 1 )Logic Design Laboratory
ELEC1402
Verification of logic gates. Introduction to combinational circuits. Introduction to VHDL. Binary adder circuit. Binary adder-subtractor circuit. Combinational circuit design. Multiplexers. Flip-flops. Counters.
(
0
+
2
+
0
)
1
2
AKTS
2Kredi
1Saatler
(0 + 2 + 0 )Area Elective-I
SOFT-AE-I
Area Elective-I
(
3
+
0
+
0
)
3
5
AKTS
5Kredi
3Saatler
(3 + 0 + 0 )Ethics
HUSS1002
The basic theories in Ethics (the Philosophy of Morality). The practical implications of these theories in particular professions and areas such as engineering, medicine, pharmacology, genetics, technological innovation, artificial intelligence and robotology, management, marketing, international relations, public services, media and law. The meaning and significance of virtue and values. Moral principles within particular professions and their foundation in Ethics.
(
1
+
0
+
0
)
1
1
AKTS
1Kredi
1Saatler
(1 + 0 + 0 )Software Architecture
SOFT3205
Requirement Analysis, Domain Analysis, Software Design, Design Patterns, Software Verification, Documentation
(
3
+
0
+
0
)
3
5
AKTS
5Kredi
3Saatler
(3 + 0 + 0 )Requirements Analysis
SOFT3501
Software Requirements and Types. Requirements Engineering Processes. Problem analysis and Requirements Inception. Requirements elicitation, analysis, specification. Requirements negotiation, prioritization. Use Case Models. Requirement analysis documentation.
(
3
+
0
+
0
)
3
6
AKTS
6Kredi
3Saatler
(3 + 0 + 0 )Summer Practice I
SOFT3910
Summer Practice I
(
0
+
0
+
0
)
0
1
AKTS
1Kredi
0Saatler
(0 + 0 + 0 )General Elective-I
SOFT-GE-I
General Elective-I
(
3
+
0
+
0
)
3
5
AKTS
5Kredi
3Saatler
(3 + 0 + 0 )Automata and Formal Languages
COMP3105
Regular languages. Finite State Machines. Regular grammars. Regular expressions. Context Free Languages. Context Free Grammars. Push Down Automata. Pumping Lemma Theorem. Chomsky hierarchy. Turing Machines. Turing Thesis. Halting Problem. Decidable and Undecidable Languages.
(
3
+
0
+
1
)
3
5
AKTS
5Kredi
3Saatler
(3 + 0 + 1 )Software Verification and Validation
SOFT3406
Difference between verification and validation. V&V planning. Code inspection. Code review. Automated verification. Testing techniques, tools, documentation.
(
3
+
0
+
0
)
3
5
AKTS
5Kredi
3Saatler
(3 + 0 + 0 )