Information System Engineering - Computer Engineering

Variables and functions. Boolean algebra and truth tables. Logic gates, Karnaugh maps. Incompletely specified functions, Multilevel logic circuits. Tabular minimization. Number representation. Arithmetic circuits. Binary codes. Programmable logic devices. Multiplexers, decoders and encoders. Synchronous sequential circuits, flip-flops, synchronous counters.

Variables and functions. Boolean algebra and truth tables. Logic gates, Karnaugh maps. Incompletely specified functions, Multilevel logic circuits. Tabular minimization. Number representation. Arithmetic circuits. Binary codes. Programmable logic devices. Multiplexers, decoders and encoders. Synchronous sequential circuits, flip-flops, synchronous counters.

ENGL 181 is a first-semester freshman academic English course. It is designed to help students improve the level of their English to B1+ level, as specified in the Common European Framework of Reference for Languages. The course connects critical thinking with language skills and incorporates learning technologies such as IQ Online. The purpose of the course is to consolidate students’ knowledge and awareness of academic discourse, language structures, and lexis. The main focus will be on the development of productive (writing and speaking) and receptive (reading) skills in academic settings.

ENGL191 is a first-semester freshman academic English course. It is designed to help students improve the level of their English to B1+ level, as specified in the Common European Framework of Reference for Languages. The course connects critical thinking with language skills and incorporates learning technologies such as IQ Online. The purpose of the course is to consolidate students’ knowledge and awareness of academic discourse, language structures, and lexis. The main focus will be on the development of productive (writing and speaking) and receptive (reading) skills in academic settings.

Physical quantities and units. Vector calculus. Kinematics of motion. Newton`s laws of motion and their applications. Work-energy theorem. Impulse and momentum. Rotational kinematics and dynamics. Static equilibrium.

Limits and continuity. Derivatives. Rules of differentiation. Higher order derivatives. Chain rule. Related rates. Rolle's and the mean value theorem. Critical Points. Asymptotes. Curve sketching. Integrals. Fundamental Theorem. Techniques of integration. Definite integrals. Application to geometry and science. Indeterminate forms. L'Hospital's Rule. Improper integrals. Infinite series. Geometric series. Power series. Taylor series and binomial series.

Sets and set operations. Relations and functions: binary relation, equivalence relation, partial order, types of functions, composition of functions, inverse function. Integers and their properties: integers, primes, divisibility, fundamental theorem of arithmetic. Logic and proofs: propositions, theorem, tautology and contradiction, direct proof, proof by contradiction, proof by contraposition, proof by induction. Recursion: recursively defined sequences, homogeneous and inhomogeneus recursive relations, characteristic polynomial, solving recurrence relations. Principles of counting: the addition and multiplication rules, the principle of inclusion-exclusion, the pigeonhole principle. Introduction to Combinatorics: permutations and combinations, repetitions, derangements, the binomial theorem. Boolean algebra: basic Boolean functions, digital logic gates, minterm and maxterm expansions, the basic theorems of Boolean algebra, simplifying Boolean function with Karnaugh maps.

A series of seminars are held in current topics and areas of specialization in Electrical, Electronic, and Information Systems Engineering. Speakers are invited from different departments of EMU 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. These include, safety at work, standards, quality control, engineering ethics, etc

High-level programming environments. Variables, expressions and assignments. Introducing C programming. Structured programming; sequential, selective and repetitive structures. Function definition and function calls. Prototypes and header files. Recursive functions. Arrays and pointers. Dynamic memory management. Parameter passing conventions. Multi dimensional arrays. Structures and unions. Conditional compilation, modular programming and multi-file programs. Exception handling. File processing. Formatted I/O. Random file access. Index structures and file organization.

High-level programming environments. Variables, expressions and assignments. Introducing C programming. Structured programming; sequential, selective and repetitive structures. Function definition and function calls. Prototypes and header files. Recursive functions. Arrays and pointers. Dynamic memory management. Parameter passing conventions. Multi dimensional arrays. Structures and unions. Conditional compilation, modular programming and multi-file programs. Exception handling. File processing. Formatted I/O. Random file access. Index structures and file organization.

Kinetic theory of ideal gases. Equipartition of energy. Heat, heat transfer and heat conduction. Laws of thermodynamics, applications to engine cycles. Coulombs law and electrostatic fields. Gauss's law. Electric potential. Magnetic field. Amperes law. Faradays law.

Systems of linear equations: elementary row operations, echelon forms, Gaussian elimination method. Matrices: elementary matrices, invertible matrices, symmetric matrices, quadratic forms and Law of Inertia. Determinants: adjoint and inverse matrices, Cramer's rule. Vector spaces: linear independence, basis and dimensions, Euclidean spaces. Linear mappings: matrix representations, changes of bases. Inner product spaces: Cauchy-Schwarz inequality, Gram-Schmidt orthogonalization. Eigenvalues and eigenvectors: characteristic polynomials, Cayley-Hamilton Theorem, Diagonalization, basic ideas of Jordan forms.

Vectors in R3. Lines and Planes. Functions of several variables. Limit and continuity. Partial differentiation. Chain rule. Tangent plane. Critical Points. Global and local extrema. Lagrange multipliers. Directional derivative. Gradient, Divergence and Curl. Multiple integrals with applications. Triple integrals with applications. Triple integral in cylindrical and spherical coordinates. Line and surface integrals. Independence of path. Green's Theorem. Conservative vector fields. Divergence Theorem. Stokes' Theorem.

ENGL182 is a second-semester freshman academic English course. It is designed to help students improve the level of their English to B2 level, as specified in the Common European Framework of Reference for Languages (CEFR). The course connects critical thinking with language skills and incorporates learning technologies such as IQ Online. The purpose of the course is to consolidate students’ knowledge and awareness of academic discourse, language structures, and lexis. The main focus will be on the development of productive (writing and speaking) and receptive (reading) skills in academic settings.

ENGL192 is a second-semester freshman academic English course. It is designed to help students improve the level of their English to B2 level, as specified in the Common European Framework of Reference for Languages. The course connects critical thinking with language skills and incorporates learning technologies such as IQ Online. The purpose of the course is to consolidate students’ knowledge and awareness of academic discourse, language structures, and lexis. The main focus will be on the development of productive (writing and speaking) and receptive (reading) skills in academic settings.

Structures and unions. Storage structures and memory allocations. Primitive data structures. Data abstraction and Abstract Data Types. Array and record structures. Sorting algorithms and quick sort. Linear & binary search. Complexity of algorithms. String processing. Stacks & queues; stack operations, implementation of recursion, polish notation and arithmetic expressions. Queues and implementation methods. Dequeues & priority queues. Linked storage representation and linked-lists. Doubly linked lists and circular lists. Binary trees. Tree traversal algorithms. Tree searching. General trees. Graphs; terminology, operations on graphs and traversing algorithms.

Structures and unions. Storage structures and memory allocations. Primitive data structures. Data abstraction and Abstract Data Types. Array and record structures. Sorting algorithms and quick sort. Linear & binary search. Complexity of algorithms. String processing. Stacks & queues; stack operations, implementation of recursion, polish notation and arithmetic expressions. Queues and implementation methods. Dequeues & priority queues. Linked storage representation and linked-lists. Doubly linked lists and circular lists. Binary trees. Tree traversal algorithms. Tree searching. General trees. Graphs; terminology, operations on graphs and traversing algorithms.

Circuit variables and circuit elements. Some circuit simplification techniques. Techniques of circuit analysis. The operational amplifiers. The natural and step response of RL and RC circuits. Natural and step responses of RLC circuits. Sinusoidal steady-state analysis. Introduction to the Laplace Transform. The Laplace Transform in circuit analysis.

First-order differential equations. Higher order homogeneous linear differential equations. Solution space. Linear differential equations with constant coefficient. Non-homogeneous linear equations; variation of parameters, operator methods. System of linear differential equations with constant coefficients. Laplace transforms. Power series solutions. Bessel and Legendre equations. Orthogonal functions and Fourier expansions. Introduction to partial differential equations. First- and second-order linear PDE's. Separation of variables. Heat and wave equations.

Object oriented concepts. Data typing, data encapsulation and the abstract data type. Object identity, inheritance, reusability, polymorphism. Object oriented programming languages. Classes, functions references. Object declarations and data types. Expressions and statements. Dynamic storage management. Operators, overloading and friends. Derived classes, initialization, inheritance, I/O libraries. Building generic libraries. Error handling in libraries.

Basics of Java programming language. Introduction to object-oriented programming. Classes, objects, methods, access modifiers (private, public, protected). Class derivation, abstract classes, interfaces, static class members. Inheritance, encapsulation, polymorphism. Object construction and destruction, namespaces, exception handling. Method overloading and overriding, container classes, template classes. Unified Modeling Language (UML) class diagrams.

Continuous-time and discrete-time signals and systems. Linear time-invariant (LTI) systems: system properties, convolution sum and the convolution integral representation, system properties, LTI systems described by differential and difference equations. Fourier series: Representation of periodic continuous-time and discrete-time signals and filtering. Continuous time Fourier transform and its properties: Time and frequency shifting, conjugation, differentiation and integration, scaling, convolution, and the Parseval?s relation. Representation of aperiodic signals and the Discrete-time Fourier transform. Properties of the discrete-time Fourier transform.

Continuous-time and discrete-time signals and systems. Linear time-invariant (LTI) systems: system properties, convolution sum and the convolution integral representation, system properties, LTI systems described by differential and difference equations. Fourier series: Representation of periodic continuous-time and discrete-time signals and filtering. Continuous time Fourier transform and its properties: Time and frequency shifting, conjugation, differentiation and integration, scaling, convolution, and the Parseval`s relation. Representation of aperiodic signals and the Discrete-time Fourier transform. Properties of the discrete-time Fourier transform.

Semiconductor devices, basic amplifier concepts, diodes, P-N junction diodes, Schottky diodes, Bipolar Junction Transistors (BJTs), Field-Effect Transistors: MOSFETs, JFETs, transistor biasing.

Complex numbers. Algebra of complex numbers. Polar representation. Complex functions. Limit and continuity. Analyticity. Analytic functions. Cauchy-Riemann equations. Line integrals. Cauchy integral formula. Isolated singularities. Residue theorem. Numerical error. Solution of nonlinear equations. Convergence. Solution of linear system of equations: direct and iterative methods. Interpolation. Curve fitting. Numerical differentiation and integration.

The software life cycle. Requirements analysis and specification of requirements. Software design and selection. Initial design, modularity, structure charts and partitioning. Detailed design and notations. Data modeling and design. The Relational database model. Software testing, documentation and maintenance. Object modeling and principles of OO analysis

Introducation to Software Enginering

Review of Fourier transform and its properties. Transmission of signals through linear systems. Power spectral density and autocorrelation function. The sampling theorem and the Nyquist rate, aliasing distortion. Non-ideal sampling: Pulse amplitude modulation (PAM) and flat-top PAM and equalization. Digital signaling: quantization, encoding and pulse code modulation (PCM), line codes and their spectra, regenerative repeaters. Pulse transmission: Intersymbol interference (ISI), Nyquist method for zero ISI, time division multiplexing (TDM), pulse-time modulation techniques. Complex envelope representation of bandpass and modulated signals. RF circuits: limiters, converters, multipliers, detectors, PLL circuits and etc. Analog modulation techniques: AM, DSB-SC, SSB etc. Binary modulation techniques: ASK, BPSK, FSK.

Review of Fourier transform and its properties. Transmission of signals through linear systems. Power spectral density and autocorrelation function. The sampling theorem and the Nyquist rate, aliasing distortion. Non-ideal sampling: Pulse amplitude modulation (PAM) and flat-top PAM and equalization. Digital signalling: quantisation, encoding and pulse code modulation (PCM), line codes and their spectra, regenerative repeaters. Pulse transmission: Intersymbol interference (ISI), Nyquist method for zero ISI, time division multiplexing (TDM), pulse-time modulation techniques. Complex envelope representation of bandpass and modulated signals. RF circuits: limiters, converters, multipliers, detectors, PLL circuits and etc. Analog modulation techniques: AM, DSB-SC, SSB etc. Binary modulation techniques: ASK, BPSK, FSK.

Basic computer organization and introductory microprocessor architecture. Introduction to assembly language programming: basic instructions, program segments, registers and memory. Control transfer instructions; arithmetic, logic instructions; rotate instructions and bitwise operations in assembly language. Basic computer architecture: pin definitions and supporting chips. Memory and memory interfacing. Basic I/O and device interfacing: I/O programming in assembly and programmable peripheral interface (PPI). Interfacing the parallel and serial ports.

Basic computer organization and introductory microprocessor architecture. Introduction to assembly language programming: basic instructions, program segments, registers and memory. Control transfer instructions; arithmetic, logic instructions; rotate instructions and bitwise operations in assembly language. Basic computer architecture: pin definitions and supporting chips. Memory and memory interfacing. Basic I/O and device interfacing: I/O programming in assembly and programmable peripheral interface (PPI). Interfacing the parallel and serial ports.

Overview of digital signals and systems. Frequency and time representation of sampling, decimation, interpolation. Z-transform: Evaluation, region of convergence (ROC) and properties. Discrete time system structures: tapped delay line and lattice structures. Fast Fourier Transform (FFT). Digital filter design: Finite impulse response (FIR), infinite impulse response (IIR), windowing, Hilbert transform.

Overview of digital signals and systems. Frequency and time representation of sampling, decimation, interpolation. Z-transform: Evaluation, region of convergence (ROC) and properties. Discrete time system structures: tapped delay line and lattice structures. Fast Fourier Transform (FFT). Digital filter design: Finite impulse response (FIR), infinite impulse response (IIR), windowing, Hilbert transform.

Introduction to probability and statistics. Operations on sets. Counting problems. Conditional probability and total probability formula, Bayes' theorem. Introduction to random variables, density and distribution functions. Expectation, variance and covariance. Basic distributions. Joint density and distribution function. Descriptive statistics. Estimation of parameters, maximum likelihood estimator. Hypothesis testing.

Machine level representation of data. Assembly level machine organization. Memory system organization. I/O and communication. CPU implementation. Operating system principles. Concurrency. Scheduling and dispatch; preemptive and non-preemptive scheduling. Process and threads. Physical memory and memory management hardware. Virtual memory; paging and segmentation. Memory mapped files. Device management. Characteristics of serial or parallel devices. Buffering strategies. Servers and interrupts. Security and protection; security methods and devices. Protection, access and authentication. Encryption.

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.

Database systems; components of database systems, DBMS functions, database architecture and data independence, hypertext, hypermedia and multimedia. Data modeling. Entity-relationship model. Object-oriented model. Relational data model. Entity and referential integrity. Relational algebra and relational calculus. Relational database design. Functional dependency and normal forms. Transaction processing. Distributed databases. Physical database design; storage and file structures, indexed files, hashed files, B-trees, files with dense index, files with variable length records.

Principles of data communications; information transfer, computer networks and their applications. Network structures, architectures and protocols. Open systems and the OSI reference model; services and network standardization. Communication systems: transmission media, analog and digital transmission. PSTN, modems, PCM, encoding and digital interface. Transmission and switching: FDM, TDM, modulation, circuit, packet and message switching. The store and forward concept. Networking characteristics. Storage, delay, multiplexing, bandwidth sharing and dynamic bandwidth management, QoS. Channel organization, framing, channel access control. PSPDN and integrated digital network concept: ISDN. LANs, MANs and WANs. ATM and gigabit networking. Communication models. De-facto standards. The Internet open architecture and the protocol suite. Modern applications of networking.

Basic concepts of data transmission. Overview of networks. The layered network architecture, ISO reference model. Circuit switching, packet switching. Physical layer. Communication techniques. Frequency and time division multiplexing, modulation, modems, error detecting. Data link layer. Data link protocols. Network layer. Routing and congestion. Local area networks. Other layers. Examples of commonly used networks and their protocols. Basics of LANs ,wireless LANs, new trends in computer communication and computer networks

Review of probability and random variables. Random processes, stationarity, correlation, covariance and ergodicity concepts. Transmission of random processes through linear filters, power spectral density. Gaussian random processes, white noise, filtered noise and narrowband noise. Baseband pulse transmission and optimal (matched filter) receiver. Probability of error for pulse transmission. Nyquist criterion for distortionless binary transmission, partial response signaling, multi-level signaling and tapped delay line equalization. Geometric interpretation of signals, coherent detection of signals in noise. Digital modulation techniques such as PSK, FSK, QPSK and etc. Detection of the digitally modulated signals.

ENGL 201 is a Communication Skills course for students at the Faculty of Engineering. The course aims to introduce a range of skills, including effective written and oral communication, research skills and study skills. Throughout the course the students will be involved in project work intended to help them in their immediate and future academic and professional life. This will include library research, technical report writing and an oral presentation. By investigating a topic of their own choice, students will develop their understanding of independent research skills. During the report writing process, students will improve their writing and develop the ability to produce organized, cohesive work. The oral presentation aims to enhance spoken fluency and accuracy and provide training in the components of a good presentation.

This is a one-credit course that can be taken in the 7th academic semester. It forms a preparation phase for the INFE406. Students are expected to familiarize with their projects, carry out literature survey and prepare materials, study components and relevant standards before the implementation phase in the following semester.

In partial fulfillment of graduation requirements, each student is required to complete 40 continuous working days of training during the summer vacations, normally at the end of the junior year, in accordance with rules and regulations set by the Department. Special attention should be given to most but not necessarily all of the following areas of training: production, operation, maintenance, management and safety. A formal report describing the projects the student was involved in is to be submitted.

The seven-layer reference model; physical, data link, network, transport, session, presentation and application. Host name resolution and the domain name service. Public-key cryptography. The WEB as an example client server computing; designing clients and servers. Technologies of the web; URLs, HTML, HTTP, applets etc. Communication and networking; protocol suites, streams and datagrams, remote procedure calls, internetworking and routing. Distributed object systems; serializing objects, distributed object frameworks. COM and DCOM. Collaboration technology and groupware. Distributed operating systems.

Modeling of information sources and measure of information. Joint and conditional entropy. Source Coding: Huffman, Lempel Ziv coding and arithmetic coding. The Rate distortion theory. Modeling of communication channel and the Channel Capacity Theorem. Scalar and vector quantization and Transform coding. Coding of discrete information sources: Block codes, cyclic codes, convolutional codes. Combined modulation and coding, trellis coded modulation (TCM).

The objective of the course is to introduce the concept of Harvard + RISC architecture microcontrollers and design of embedded computing systems on typical applications including interrupts, timers, LCD and LED displays, keypads, a/d converters, rotary coders, stepper motors, serial and parallel communication interfacing. The design applications are introduced on a very widely used typical 16-bit embedded microcontroller unit, PIC18F452. The scope of the course is the simple, distinct PIC18F452 embedded system design with the applications in C and RISC assembly programming. The design/theory scale of the course is around 60/40.

This course studies; computational geometry, curve, surface and object representations, geometric transformations, three dimensional graphics, color, shading, shadowing, hidden line elimination, surface removal, anti-aliasing, digitizing and scanning, display algorithms, graphics hardware, display devices.

Information security requirements, security threats, attacks, and methods providing information protection, discretionary and mandatory access models. Malicious software. Symmetric and asymmetric cryptographic methods, DES, AES, RSA. Authentication, digital signature, certificates, one-time passwords, hash functions. Practical aspects of information security in operating systems, databases, network applications.

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

Functional, non-functional and domain requirements. User and system requirements. Feasibility study. Estimation techniques. Languages and models for representing requirements. Performance, reliability, availability, safety, and security issues. Requirements documentation standards. Requirements management: handling requirements changes

Design, analysis and representation of algorithms. Models of computation, fundamental strategies -divide and conquer, recursion, search and traversal, backtracking, branch and bound, analysis tools and techniques for algorithms, representation of sets and graphs, algorithms on graphs, NP-completeness and intractability

Software metrics. Quality planning and quality control. Inspections and formal technical reviews. Blackbox and white-box testing, problem analysis and reporting techniques. Verification and validation techniques. Process and product quality assessment. Process measurement. Software quality assurance standards.

The purpose of this course is to expose the Object Oriented Programming approach and its use in building Graphical User Interfaces. It will be done in fact through the presentation of the JAVA language. The student is to learn the language structure of JAVA, its object oriented aspect, the similarities and differences with C. He must also acquire a practical programming experience in Java through a number of exercises and projects. Concerning the applications of the language, we will focus on the implementation of Graphical User Interfaces as well as animation programs. Blueprints and a practical object oriented development methodology will be given for such applications.

Functional, non-functional and domain requirements. User and system requirements. Feasibility study. Estimation techniques. Languages and models for representing requirements. Performance, reliability, availability, safety, and security issues. Requirements documentation standards. Requirements management: handling requirements changes

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

Information security requirements, security threats, attacks, and methods providing information protection, discretionary and mandatory access models. Malicious software. Symmetric and asymmetric cryptographic methods, DES, AES, RSA. Authentication, digital signature, certificates, one-time passwords, hash functions. Practical aspects of information security in operating systems, databases, network applications.

This course studies; computational geometry, curve, surface and object representations, geometric transformations, three dimensional graphics, color, shading, shadowing, hidden line elimination, surface removal, anti-aliasing, digitizing and scanning, display algorithms, graphics hardware, display devices.

The objective of the course is to introduce the concept of Harvard + RISC architecture microcontrollers and design of embedded computing systems on typical applications including interrupts, timers, LCD and LED displays, keypads, a/d converters, rotary coders, stepper motors, serial and parallel communication interfacing. The design applications are introduced on a very widely used typical 16-bit embedded microcontroller unit, PIC18F452. The scope of the course is the simple, distinct PIC18F452 embedded system design with the applications in C and RISC assembly programming. The design/theory scale of the course is around 60/40.

The purpose of this course is to expose the Object Oriented Programming approach and its use in building Graphical User Interfaces. It will be done in fact through the presentation of the JAVA language. The student is to learn the language structure of JAVA, its object oriented aspect, the similarities and differences with C. He must also acquire a practical programming experience in Java through a number of exercises and projects. Concerning the applications of the language, we will focus on the implementation of Graphical User Interfaces as well as animation programs. Blueprints and a practical object oriented development methodology will be given for such applications.

Design, analysis and representation of algorithms. Models of computation, fundamental strategies -divide and conquer, recursion, search and traversal, backtracking, branch and bound, analysis tools and techniques for algorithms, representation of sets and graphs, algorithms on graphs, NP-completeness and intractability

Software metrics. Quality planning and quality control. Inspections and formal technical reviews. Blackbox and white-box testing, problem analysis and reporting techniques. Verification and validation techniques. Process and product quality assessment. Process measurement. Software quality assurance standards.

This is a service course offered to non-IE engineering students. The aim is to prepare the students to assume positions in industry as engineering managers. The topics covered include the historical development of industrial management, introductory operations management, functions of technology management, managing technological change, managing engineering projects, and managing the engineering career.

An introduction to the basics of economic analysis for decisions in engineering design, in manufacturing, in manufacturing equipment, and in industrial projects. Time value of money. Cash-flow analysis. Cost of capital. Return on investment. Elements of cost and cost estimation. Break-even analysis. Decision making among alternatives. Effects of depreciation. Taxes. Replacement analysis. Inflation.

Elementary microeconomics. The economic problem. Supply and demand. Elasticity. Marginal analysis of consumers' and firms' behavior. The theory of profit maximization. Analysis of markets. Pricing in competitive and non-competitive markets

This course studies; computational geometry, curve, surface and object representations, geometric transformations, three dimensional graphics, color, shading, shadowing, hidden line elimination, surface removal, anti-aliasing, digitizing and scanning, display algorithms, graphics hardware, display devices.

Information security requirements, security threats, attacks, and methods providing information protection, discretionary and mandatory access models. Malicious software. Symmetric and asymmetric cryptographic methods, DES, AES, RSA. Authentication, digital signature, certificates, one-time passwords, hash functions. Practical aspects of information security in operating systems, databases, network applications.

The objective of the course is to introduce the concept of Harvard + RISC architecture microcontrollers and design of embedded computing systems on typical applications including interrupts, timers, LCD and LED displays, keypads, a/d converters, rotary coders, stepper motors, serial and parallel communication interfacing. The design applications are introduced on a very widely used typical 16-bit embedded microcontroller unit, PIC18F452. The scope of the course is the simple, distinct PIC18F452 embedded system design with the applications in C and RISC assembly programming. The design/theory scale of the course is around 60/40.

The purpose of this course is to expose the Object Oriented Programming approach and its use in building Graphical User Interfaces. It will be done in fact through the presentation of the JAVA language. The student is to learn the language structure of JAVA, its object oriented aspect, the similarities and differences with C. He must also acquire a practical programming experience in Java through a number of exercises and projects. Concerning the applications of the language, we will focus on the implementation of Graphical User Interfaces as well as animation programs. Blueprints and a practical object oriented development methodology will be given for such applications.

Design, analysis and representation of algorithms. Models of computation, fundamental strategies -divide and conquer, recursion, search and traversal, backtracking, branch and bound, analysis tools and techniques for algorithms, representation of sets and graphs, algorithms on graphs, NP-completeness and intractability

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

Software metrics. Quality planning and quality control. Inspections and formal technical reviews. Blackbox and white-box testing, problem analysis and reporting techniques. Verification and validation techniques. Process and product quality assessment. Process measurement. Software quality assurance standards.

Functional, non-functional and domain requirements. User and system requirements. Feasibility study. Estimation techniques. Languages and models for representing requirements. Performance, reliability, availability, safety, and security issues. Requirements documentation standards. Requirements management: handling requirements changes

Design, analysis and representation of algorithms. Models of computation, fundamental strategies -divide and conquer, recursion, search and traversal, backtracking, branch and bound, analysis tools and techniques for algorithms, representation of sets and graphs, algorithms on graphs, NP-completeness and intractability

The purpose of this course is to expose the Object Oriented Programming approach and its use in building Graphical User Interfaces. It will be done in fact through the presentation of the JAVA language. The student is to learn the language structure of JAVA, its object oriented aspect, the similarities and differences with C. He must also acquire a practical programming experience in Java through a number of exercises and projects. Concerning the applications of the language, we will focus on the implementation of Graphical User Interfaces as well as animation programs. Blueprints and a practical object oriented development methodology will be given for such applications.

The objective of the course is to introduce the concept of Harvard + RISC architecture microcontrollers and design of embedded computing systems on typical applications including interrupts, timers, LCD and LED displays, keypads, a/d converters, rotary coders, stepper motors, serial and parallel communication interfacing. The design applications are introduced on a very widely used typical 16-bit embedded microcontroller unit, PIC18F452. The scope of the course is the simple, distinct PIC18F452 embedded system design with the applications in C and RISC assembly programming. The design/theory scale of the course is around 60/40.

Software metrics. Quality planning and quality control. Inspections and formal technical reviews. Blackbox and white-box testing, problem analysis and reporting techniques. Verification and validation techniques. Process and product quality assessment. Process measurement. Software quality assurance standards.

Information security requirements, security threats, attacks, and methods providing information protection, discretionary and mandatory access models. Malicious software. Symmetric and asymmetric cryptographic methods, DES, AES, RSA. Authentication, digital signature, certificates, one-time passwords, hash functions. Practical aspects of information security in operating systems, databases, network applications.

Functional, non-functional and domain requirements. User and system requirements. Feasibility study. Estimation techniques. Languages and models for representing requirements. Performance, reliability, availability, safety, and security issues. Requirements documentation standards. Requirements management: handling requirements changes

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

This course studies; computational geometry, curve, surface and object representations, geometric transformations, three dimensional graphics, color, shading, shadowing, hidden line elimination, surface removal, anti-aliasing, digitizing and scanning, display algorithms, graphics hardware, display devices.

Design and practical works oriented projects will be given to students with an aim to stimulate application of theoretical knowledge to practical situations. INFE406 can be taken in the 8th academic semester. It provides experience in designing and implementing systems within multiple realistic constraints using conventional materials, components, equipments and software. Projects should be implemented conforming to relevant standards, ethical issues and environmental policies.

This course is designed to introduce moral rights and responsibilities of engineers in relation to society, employers, colleagues and clients. Analysis of ethical and value conflict in modern engineering practice. Importance of intellectual property rights and conflicting interests. Ethical aspects in engineering design, manufacturing, and operations. Cost-benefit-risk analysis and safety and occupational hazard considerations.