Skip Navigation LinksBilgisayar-Mühendisliği-BLGM(Türkçe)0124-4681

Computer Engineering-BLGM (Turkish)

Duration (Years)
Medium of Instruction

General Information

During the four-year undergraduate program, along with the basic courses on computer software, hardware and computer networks, Computer Engineering Program offers various elective courses on mathematics, physics, English, economics, business and social sciences to provide the students with an enriched learning experience. Regularly updated educational program has been designed in accordance with international standards.


The main aim of the program is to introduce the students with the most up-to-date developments in the area of the computer engineering and, at the same time, to enhance their life-long learning skills. The Program aims to bring up qualified and well-educated computer engineers who possess in-depth knowledge in computer systems, hardware and software, and who are able to put their theoretical knowledge into practice by producing new designs. The department graduates are perfectly equipped to deal with rapidly changing environment due to their solid education and strong background in the underlying principles of the technology, as well as hands on experience they get through laboratory work.

Career Opportunities

Students successfully graduating from the Computer Engineering undergraduate program receive the title of the ‘Computer Engineer’. There is a big demand for the graduates of the Computer Engineering program, both locally and internationally. Many of our graduates have been employed in large, technology oriented international companies with lucrative salaries. Also, many of our graduates choose to continue their education to obtain Master’s and Ph.D. degrees, both at EMU and abroad. After finishing their postgraduate studies, some of our graduates have been employed at reputable universities in the UK and the USA.

Contact Information

Tel: +90 392 630 1484
Fax: +90 392 365 0711

Duration (Years)
Medium of Instruction


Course Code Course Title Semester Credit Lecture Hour (hrs/week) Lab (hrs/week) Tutorial (hrs/week) ECTS
Semester 1
BLGM101 Foundations of Computer Engineering
This course introduces the student to the fundamental concepts of the computer engineering discipline. Topics covered include: Computers and information processing -notion of computers, concepts of data and information, applications of computers, history of computing. Computer hardware -CPU, memory, input/output interface, secondary storage, ports, types of computer systems, computer software -system software, utilities, application software, data communication, an overview of operating systems. General Problem Solving Concepts: basic data types, constants and variables, basic operators and expressions, algorithms, pseudo codes, and flow charts, sequential, and conditional problem solving (IF statements and CASE logic), looping (WHILE/WHILE-END, REPEAT-UNTIL, FOR structures), formatted output, examples in C programming language.
1 3 3 3 - 6
MATE163 Discrete Mathematics 1 3 3 1 - 5
ENGL171 English - I
ENGL171 (Elementary) is a 1st semester 1st year English Language course. It aims to develop all four skills. By the end of this course, students are expected to improve the level of their English to A1. Contact hours are 4 hours per week. The course is for Turkish Medium Programs.
1 3 3 1 - 4
MATE151 Calculus - I 1 4 4 1 - 7
FIZK103 Physics - I
Fizik ve Ölçme, Vektörler,Vektörlerin (bir ve iki boyutta olmak üzere) uygulamaları, Newton'un kanunları ve uygulamaları, dairesel hareket, iş ve enerji, enerjinin korunumu ve değişimi, çizgisel momentum ve çarpışma problemleri, enerji ve momentumun korunumu, katı cisimlerin sabit bir eksen etrafında dönmesi, yuvarlanma hareketi, açısal momentum ve statik denge.
1 4 4 1 - 6
Semester 2
BLGM100 Introduction to Profession
A series of seminars are held in current topics and areas of specialization in Software Engineering. Speakers are invited from different departments of EMU including Computer Engineering Department or other International Universities, Industry and Consulting firms, to deliver seminars in all aspects of engineering that are not normally covered in the lecture courses.
2 No-Credit - 2 - 2
BLGM112 Programming Fundamentals
An overview of C programming language, Sequential structure Data types and classes of data, arithmetic operators and expressions, assignment statements, type conversions, simple I/O functions (printf, scanf, fprintf, fscanf, gets, puts, fgets, fputs). Selective structure Relational operators, logical operators, conditional expression operator, conditional statements (if, switch). Repetitive structures While, do-while, for loops, loop interruptions (goto, break, continue), Null statement, comma operator. Functions Function definition and function call, external variables, storage classes, recursion. Arrays Array declaration, array initialization, arrays as function arguments. Pointers Basics of pointers, functions and pointers, arrays and pointers, strings and pointers, library functions for processing strings, pointer arrays. Structures Basics of structures, structures and functions, arrays of structures. (Pre-requisite: CMPE 101)
2 4 4 1 - 7
ENGL172 English - II
ENGL172 (Elementary) is a 2nd semester 1st year English Language course. It aims to further develop all four skills. By the end of this course, students are expected to further improve the level of their English to high A1. Contact hours are 4 hours per week. The course is for Turkish Medium Programs.
2 3 3 1 - 4
MATE152 Calculus - II 2 4 4 1 - 7
FIZK104 General Physics - II
Heat, 1st and 2nd law of thermodynamics, electrical fields, Gauss' law, electric potential, magnetic fields, magnetic field sources, Faraday's law, inductor, alternative current circuits, electromagnetic waves. Semiconductors, diodes and circuits, transistors and amplifier circuits.
2 4 4 1 - 6
HIST280 Atatürk's Principles and History of Turkish Reforms 2 2 2 - - 3
Semester 3
BLGM223 Digital Logic Design
Binary Systems (Binary Numbers, Octal and Hexadecimal Numbers, Number Base Conversions, Complements, Signed Binary Numbers, Binary Codes, Binary Logic). Boolean Algebra and Logic Gates (Basic Definitions, Basic Properties of Boolean Algebra, Boolean Functions, Canonical and Standard Forms, Other Logic Operations, Digital Logic Gates, ICs). Simplification of Boolean Functions (The Map Method, Tow-and Three- Variable maps, Four- and Five- Variable Maps, Product of Sums Simplification, NAND and NOR Implementation, Other Two-Level Implementations, Don't-Care Condition, The Tabulation Method, Determination of Prime Implicants, Selection of Prime Implicants). Combinational Logic (Design Procedure, Adders, Subtractors, Code Conversion, Analysis Procedure, Multilevel NAND Circuits, Multilevel NOR Circuits, Exclusive-OR Functions). MSI and PLD Components (Binary Adder and Subtractor, Decimal Adder, Decoders and Encoders, Multiplexers, PLA and PAL). (Pre-requisite: MATH163)
3 4 4 1 - 7
BLGM231 Data Structures
Data types. Binary and decimal Integers. Floating point number. Pointers. Arrays. Structures. Array of structures. Self-referential structures. Dynamic memory allocation. Concept of Abstract Data Type (ADT). Memory allocation of arrays. Linked lists (singly linked, doubly linked, circular). Dynamic implementation of lists. The stack. Infix, postfix, and prefix notations. Applications of the stack: Infix-to-postfix conversion, evaluation of postfix expressions. Recursion. Binary search. The towers of Hanoi problem. Queues. Trees and their applications. Binary tree representations. Binary tree traversals. Binary search trees (definition, operations). Heaps (Pre-requisite: CMPE 112)
3 4 4 1 - 7
BLGM211 Object-Oriented Programming
Basics of C++ and Control structures. Program design, Object-Oriented programming and its specific features. Layout of a simple C++ program (elementary C++ programming. Fundamental types, scope. Overview of selection and iteration structures of C and C++ languages. Examples of C++ programs. Functions and Arrays. Review of functions and arrays. Prototypes (declarations), function definition, function overloading, inline functions, scope resolution operator (::), call-by-value, call-by-reference (reference parameters), default arguments, array declarations, operations on arrays, using arrays as function arguments. Pointers, C strings and C++ strings. Pointer variables, declaration and initialization. Use of pointers in call-by-reference function calls, returning a reference, arrays of pointers, pointers to arrays, pointers to functions, dynamic memory allocation with C++ operators new and delete, C-strings, input/output operations, standard C-string functions, formatted and unformatted input /output, C++ string type (the standard string class). Classes and Data abstraction. Structure definition, accessing members 2 of structures, class declarations, constructors, constructor initialization lists. Class destructor, member access specifiers public and private, const member functions, friend functions and classes, static data and function members. Operator Overloading. Fundamentals and restrictions of operator overloading,this pointer, overloading unary and binary operators. Composition and Inheritance. Base classes and derived classes, protected class members, virtual functions and polymorphism, virtual destructors, private access vs. protected access, abstract base classes. Revision of the material discussed in the course. (Pre-requisite: CMPE 112)
3 4 4 1 - 7
ENGL203 Occupational English
ENGL 203 is a basic Vocational English course offered in the third semester. The course aims to revise technical terms and knowledge while using a range of skills, including reading, writing, and oral communication skills. Throughout the course, the students will focus on tasks which intend to help them in their immediate and future academic and professional life. The tasks selected for this course will be parallel with topics covered in their field of study. Therefore students will not only have the opportunity to digest those topics but they will also practise the English language.
3 3 3 - - 4
MATE241 Linear Algebra and Ordinary Differential Equations 3 4 4 1 - 6
Semester 4
BLGM224 Digital Logic Systems
Synchronous Sequential Logic; Latches, Circuit Delay Model, Flip-Flops. Mealy and Moore Models for Sequential Circuits. Analysis of Clocked Sequential Circuits. Introduction to Sequential Circuit Design. State Reduction and Assignment. Flip-Flop Excitation Tables. Design Procedure. Design of Counters. Registers, Counters and the Memory Unit; Registers, Shift Registers. Ripple Counters. Synchronous Counters, Timing Sequences. Random Access Memory (RAM), Memory Decoding. Implementation Technology; Programmable Logic Devices (ROM, PLA, PAL, CPLD, FPGA). Algorithmic State Machines (ASM); ASM Flow Chart. Timing Considerations. Control Implementation. Asynchronous Sequential Circuits; Flow Table. Transition Table. Race Condition. Implementation with Lumped Delay Elements and Latches. Glitches and Hazards. (Pre-requisite: CMPE 223)
4 4 4 1 - 7
BLGM226 Electronics for Computer Engineers
Circuits, currents and voltages, power and energy, Kirchoff's current and voltage laws. Circuit elements and circuits. Resistive circuits: resistance in series and parallel, resistive network analysis by series and parallel equivalents, node and mesh analysis. Thevenin and Norton equivalents. Superposition. Inductance and Capacitance, physical characteristics, practical capacitor and inductors. Basic diode concepts: Zener diode, Ideal diode model, rectifiers and waveshaping. Basic amplifier concepts, cascaded, ideal, and differential amplifiers, offset voltage, bias current and offset current. Bipolar Junction Transistors: Current and voltage relationship, common emitter characteristics, pnp BJT LargeSignal DC Circuit models. Common Emitter amplifiers. Emitter Follower. Operational Amplifiers: ideal OPAmp, summing point, inverting and noninverting amplifiers, Nonlinear imperfection, Differential and Instrumentation Amplifiers, Integrators and Differentiatiors. Logic Circuits: Basic concepts: TTL and CMOS implementation of logic gates.
4 4 4 1 - 6
BLGM242 Operating Systems
Operating system definition, simple batch systems, multiprogramming, time-sharing, personal computer systems, parallel systems. introduction to process, process scheduling, operations on processes, cooperating processes, interprocess communications, interrupts, process synchronization, criticalsection problem, atomic instructions, semaphores, synchronization problems, CPU scheduling,scheduling criteria and algorithms, multiple processes and real-time scheduling, algorithm evaluation, deadlocks, characterization and handling of deadlocks, deadlock prevention avoidance and detection,deadlock recovery, memory management and virtual memory, address spaces, swapping, memory allocation, paging, segmentation, file-systems, file concepts, access methods, directory structure.
4 4 4 1 - 6
MATE373 Numerical Analysis for Engineers 4 3 3 1 - 6
UE-AH01 Uni.Elective - Arts & Humanities- I
Uni. Elective - Art & Humanities - II
4 3 3 - - 6
Semester 5
BLGM323 Microprocessors
Introduction to computing: Inside the computer, CPU-RAM-ROM. 80x86 microprocessor: short history, registers, mov and add instructions, program segments, data segments, logical and physical addresses, stack, push, pop, flag register, addressing modes. Assembly Language Programming: Directives, .asm, .lst, .obj, .map, linking, and .exe files, control transfer instructions, data types and data definition. Arithmetic Logic Instructions: unsigned multiplication and division, unsigned, signed, bcd, packed-bcd and ascii number conversion, rotate and shift instructions. Bios and DOS programming: bios display and keyboard interrupts, int 21h dos function calls. Macro definitions: mouse button and cursor position. 8088 PC/XT expansion slot, 80286 and the ISA bus, Memory and memory interfacing: EPROM, SRAM and DRAM devices, address decoding circuits, ISA bus memory interfacing. Memory mapped and Isolated I/O methods and device interfacing: ISA bus I/O address decoding and simple I/O ports, Programmable 4 Peripheral Interface 8255 and LED, 7-segment-display, switch, button, keypad, stepper motor interfacing. D/A converters, A/D converters. Hardware Interrupts: NMI and INTR pins, interrupt servicing and TSR programs. Serial Data Communication and 8251 USART.
5 4 4 1 - 7
BLGM343 Systems Programming
Systems programming in an OS environment. UNIX and the objectives of systems programming in UNIX. A program in the UNIX environment. Command line parameters. System calls and their classification. System calls for interprocess communication and for networking programming. Processes as fundamental objects in UNIX. Creating a process. Process ID. Parent process ID. Child process ID. More about the fork() system call. A family of exec() system calls. Basic concepts of threads and multithreaded programming. Interprocess communication, its purpose and using in systems programs. Mechanisms of interprocess communication in UNIX. Importance of interprocess communication for computer networks. A client-server paradigm of interprocess communication in networks. Unnamed and named pipes for interprocess communication. Message queues, shared memory, signals and semaphores. Sockets and their using for interprocess communication in computer networks. Client/Server model and its implementation with sockets in computer networks. Using IP addresses and port numbers with sockets. TCP and UDP sockets for communication in networks. Organization of a Web client-server network system. Remote procedure call (RPC) for networks, its operation and parameter passing. Introductory concepts of systems and network programming in Windows operating systems. TCP and UDP sockets for network communication in Windows environment.
5 4 4 1 - 6
BLGM371 Analysis of Algorithms
Definition and properties of Algorithms. Design, analysis, and representation of Algorithms. Data abstraction. Pseudo code conventions. Models of computation. Mathematical Foundations: Growth of functions, asymptotic notations. Study of recursive algorithms and associated recurrence relations (substitution method, iteration method, master method, recursion trees). Design paradigms for algorithms: Brute-Force (Exhaustive Search), Divide-and-Conquer (Merge Sort, Binary Search Tree) Dynamic Programming (Matrix-Chain multiplication, LCS-length, 01-Knapsack Problem). Greedy algorithms (Greedy Activity Selector, Fractional Knapsack Problem). Graph Algorithms: Representation of sets and graphs. Breadth-first search, depth-first search. Minimum spanning trees. Single-source shortest paths. All-pairs of shortest paths.
5 4 4 1 - 7
BLGM321 Basic of Signals and Systems
Fundamental concepts of signals and systems for computer engineers with focus on discrete-time systems. Sinusoids, complex numbers, spectrum representation, sampling, frequency response, filters, and the z-Transform. Digital signal processing of multimedia signals.
5 4 4 1 - 6
MATE332 Probability and Statistical Methods 5 3 3 - 1 5
Semester 6
BLGM324 Computer Architecture and Organization
Introduction to RISC architecture, MIPS Instruction set: Representing instructions in the computer, Linkers, Supporting procedures in computer hardware, Passing the arguments to a procedure, Constant or immediate operands in MIPS, Addressing in branches and jumps in MIPS, MIPS addressing modes, MIPS assembly program. Integer Arithmetics: Negative number representations, Addition and subtraction, Logic operations, Constructing the Arithmetic Logic Unit (ALU), Multiplication algorithms, Division algorithms, Floating point arithmetic algorithms. Design Performance Measures: CPU performance, Evaluating the performance. Processor Data path: Logic conventions and clocking, MIPS single clock cycle implementation: (Building a datapath), The simple implementation scheme, The multiple clock cycle implementation, Designing the control unit for the multiple clock cycle implementation: Finite state machines (FSM) and Microprogramming. Enhancing Performance with Pipelining: A pipelined datapath, Pipelined control, Data hazards, Control for data hazards, Reducing data hazards, Branch hazards, Exceptions, Performance of pipelined systems.
6 4 4 1 - 7
BLGM344 Computer Networks
Introduction to fundamental concepts of computer networks. Basic performance and engineering tradeoffs in the design and implementation of computer networks. Network hardware/software, protocols and layers, OSI and TCP/IP reference models. Data link layer design issues including encoding, framing, error detection, reliable delivery, and multiple access. Multiplexing, switching, and routing. LANs, wireless LANs, cellular networks. TCP/IP protocol family. Network applications. New trends in computercommunication networks. ).
6 4 4 1 - 7
BLGM354 Database Management Systems
This course introduces the student to the fundamentals of database management. Topics covered include: the Entity-Relationship model; the Relational model and its mathematical foundations; most important features of Structured Query Language (including basic structure, aggregate functions, nested queries, index definition, stored procedures and functions, views, database modification, domain constraints, assertions, triggers, transaction definition, data definition language, granting privileges, security), query languages Datalog and QBE; Object-Oriented and Object-Relational databases; design principles of Relational databases (normal forms, functional dependencies, decomposition).
6 4 4 1 - 6
BLGM318 Principles of Programming Languages
Evolution of programming languages and concepts. Syntax and semantics of programming languages. Context-free grammars. Lexical analysis. Syntax analysis. Top-down vs. bottom-up parsing. LR parsing tables. Names, scope and lifetime. Expressions. Statements. Subprogram linkage. Stack implementation of subprogram calls. Parameter passing methods. Object oriented concepts. Implementation of inheritance: virtual method tables. Concurrency. Exception handling. Functional or Logic programming.
6 4 4 1 - 6
UE-AH02 Uni. Elective - Art & Humanities - II 6 3 3 - - 4
Semester 7
BLGM400 Summer Training
As a part of the fulfillment of the graduation requirements, all students must complete 40 work days of summer training after the second and/or third year, during summer vacations. The summer training should be carried out in accordance with the rules and regulations set by the department. (3rd/4th year standing)
7 No-Credit - - - 1
OEC-I Opt. Elective Course I 7 4 4 1 - 6
OEC-II Opt. Elective Course II 7 4 4 1 - 6
OEC-III Opt. Elective Course III 7 4 4 1 - 6
BLGM471 Automata Theory
Mathematical preliminaries and basic concepts. Strings, Languages and Grammars. Chomsky hierarchy of grammars. Deterministic and nondeterministic finite automata. Equivalence of deterministic and nondeterministic finite automata. Minimization of finite automata. Regular grammars and regular expressions. Pushdown automata. Context free grammars. Chomsky normal form. Greibach normal form. Correspondence of pushdown automata and context free grammars. Introduction to Parsing.
7 4 4 1 - 6
BLGM405 Graduation Project - I 7 1 1 1 - 3
UE-AH03 Uni. Elective - Art & Humanities - III 7 3 3 - - 4
IENG356 Ethics in Engineering 7 3 3 - - 4
BLGM412 Software Engineering
The software life cycle and the phases in software development: Project scheduling, feasibility study, analysis, specification, design, implementation, testing, quality assurance, documentation, maintenance. Management issues: Planning, organization, control. Also included are formal specification techniques, structured programming, modular system design and other current issues.
7 4 4 1 - 6
Semester 8
OEC-IV Opt. Elective Course V 8 4 4 1 - 6
UE-AH03 Uni. Elective - Art & Humanities - IV 8 3 3 - - 4
UE-AH04 Uni. Elective - Arts & Humanities V 8 3 3 - - 5
BLGM406 Graduation Project - II
This course is the sequel to CMPE405. It consists in the implementation of a realistic, preferably interdisciplinary, engineering capstone project emphasizing engineering design principles on a computer engineering topic. It is carried out by a team of students under the supervision of an instructor. The team must complete the detailed design and implementation of the preliminary design they started in the CMPE 405 course. It is an extended exercise in the professional application of the skills and experience 6 gained in the undergraduate program. The team has to make a presentation and submit a detailed final report which documents the design, implementation and testing.
8 3 1 4 - 7

Undergraduate Programs

Apply Online

Graduate Programs

Apply Online

For Agencies

Agency Login