· Web viewA1. Department courses. CMPE101 Foundations of Computer Engineering. CMPE112 Programming Fundamentals. CMPE211 Object Oriented Programming. CMPE223 Digital Logic Design

Appendix A

A1. Department coursesCMPE101 Foundations of Computer EngineeringCMPE112 Programming FundamentalsCMPE211 Object Oriented ProgrammingCMPE223 Digital Logic DesignCMPE224 Digital Logic SystemCMPE226 Electronics for Computer EngineersCMPE231 Data StructuresCMPE242 Operating SystemsCMPE318 Principles of Programming LanguagesCMPE321 Basics of Signals and SystemsCMPE323 MicroprocessorsCMPE324 Computer Architecture and OrganizationCMPE343 Systems ProgrammingCMPE344 Computer NetworksCMPE354 Database Management SystemsCMPE371 Analysis of AlgorithmsCMPE415 Visual ProgrammingCMPE405 Graduation Project – Part ICMPE406 Graduation Project – Part IICMPE412 - Software EngineeringCMPE416 Object Oriented Programming and Graphical User InterfacesCMPE418 Internet ProgrammingCMPE421 Parallel Computer ArchitectureCMPE423 Embedded Systems DesignCMPE424 Speech and Image ProcessingCMPE426 Digital Signal ProcessingCMPE443 Real-time System DesignCMPE444 Data CommunicationsCMPE447 Fiber Optic Computer CommunicationsCMPE461 Artificial IntelligenceCMPE462 Functional and Logic ProgrammingCMPE471 Automata TheoryCMPE474 Performance Analysis of Computer Systems and NetworksCMPE476 System Simulation

A2. Courses taken other department(s) of Engineering FacultyIENG355 Ethics in EngineeringIENG420 Engineering EconomyIENG450 Industrial Management

A3. Course taken other FacultiesCHEM101 General ChemistryENGL191 Communication in English IENGL192 Communication in English IIENGL201 Communication Skills in EnglishMATH151 Calculus IMATH152 Calculus IIMATH163 Discrete MathematicsMATH241 Ordinary Differential Equations and Linear AlgebraMATH322 Probability and Statistical MethodsMATH373 Numerical Analysis for EngineersPHYS101 Physics IPHYS101 Physics IITUSL181 Turkish as a Second Language

A1. Department Courses

CMPE101 Foundations of Computer Engineering Department: Computer EngineeringProgram Name: Computer Engineering Program Code: 25

Course Number: CMPE101

Credits: 3 Cr

Year/Semester:2009-2010 Spring

Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): NoneCatalog Description: 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, pseudocodes and flowcharts, 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.Course Web Page: http://cmpe.emu.edu.tr/courses/cmpe101 Textbook(s): “Technology in Action”, Alan Evans, Mary A. Poatsy and Kendall Martin, Seventh Edition, Pearson Prentice Hall, 2010.“Problem Solving and Program Design in C”, Jeri R. Hanly and Elliot B. Koffman, Sixth Edition, Pearson Addison-Wesley, 2009 Indicative Basic Reading List :“Programming in ANSI C”, R. Kumar and R. Agrawal, West Publ., 1992Topics Covered and Class Schedule:(3 hours of lectures per week)

Week 1 Introduction to the course.Week 2 Looking at computers; Understanding and assessing hardware; A closer look at system

hardware.Week 3 The operating system, utility programs and file management; Application software.Week 4 Using the Internet; Networking and security.Week 5 Introduction to problem solving techniques.Week 6 Introduction to C programming language.Week 7 Data types and expressions in C.Week 8 Principles of structured programming.Weeks 9-10 Midterm exams; selective structures.Week 11 Selective structures (Cont.).Week 12 Selective structures (Cont.); Repetitive structures. Week 13 Repetitive structures (Cont.); Midterm #2.Week 14 Repetitive structures (Cont.).Week 15 Functions.Week 16 Final exams.

Laboratory Schedule:(2 hours of laboratory per week)

Week 4 Delivering computer accounts and explaining laboratory regulations. Introduction to computer hardware.

Week 5 Introduction to Microsoft Word for Windows.Week 6 Introduction to Microsoft Excel for Windows.Week 7 Introduction to MS Visual C and C++ 6.0 Integrated Development

Environment (IDE).Week 8 Fundamentals of C programming language.Week 12 Simple selections.Week 13 Multiway selection using nested IF-ELSE and SWITCH statements.Week 14 While, do/while and for loop structures. Week 15 Makeup.Course Learning Outcomes:

Students must be able to(1) comprehend the general culture of computing.(2) tell the respective roles of hardware and software and discriminate between them.(3) generate solutions to problems in the form of algorithms and flowcharts.(4) write basic C codes: sequential structure; basic data types, expressions and inputs-outputs.(5) be able to do basic modular programming using C functions.(6) generate solutions to problems with structured programming, using C structures.(7) use conditional structures (if statements) in C programming.(8) use iterative structures (loops) in C programming.

Assessment

Method No PercentageMidterm Exam(s) 1 25%Quizzes 2 20 %Labs 8 15 %Final Examination 1 35%Attendance - 5%

Contribution of Course to Criterion 5Credit Hours for:

Mathematics & Basic Science : 0Engineering Sciences and Design : 0General Education : 3 Relationship of Course to Program Outcomes

The course has been designed to contribute to the following program outcomes:

(e) identify, formulate, and solve engineering problems(k) use the techniques, skills, and modern engineering tools necessary for engineering practice Prepared by: Dr. Manuel Carcenac and Dr. Ekrem Varoğlu Date Prepared: April 5, 2010

CMPE112 - Programming Fundamentals

Department: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE101 Foundations of Computer EngineeringCatalog Description:

An overview of C programming language. Sequential structures, 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 structures, relational operators, logical operators, conditional expression operator, conditional statements (if, switch). Repetitive structures, while, do-while, for loops, loop interruptions (goto, break, continue). Functions, function definitions and function calls, 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. Struc- tures, basics of structures, structures and functions, arrays of structures.

Course Web Page: http://cmpe.emu.edu.tr/courses/cmpe112

Textbook(s): K. N. King,C Programming: A Modern Approach, 2nd ed., Norton, 2008.

Indicative Basic Reading List :R. Hanly and E. B. Koffman, Problem Solving and Program Design in C, 5th ed., Addison Wesley, 2007.Topics Covered and Class Schedule:(4 hours of lectures per week)

Week 1 IntroductionWeek 2 Formatted I/O. Expressions Week 3 SelectionsWeek 4 Loops. Basic typesWeek 5 ArraysWeek 6 FunctionsWeek 7 Program organization Weeks 8-9 Midterm WeeksWeek 10 Pointers Week 11 More on pointers Week 12 Pointers and arrays Week 13 Strings Week 14 StructuresWeek 15 Final Exams


Week 4 Lab 0 - introductionWeek 5 Lab 1 - selectionsWeek 6 Lab 2 – loopsWeek 7 Lab 3 – arrays

Week 11 Lab 4 - functionsWeek 12 Lab 5 - pointersWeek 13 Lab 6 - arrays & pointersWeek 14 Lab 7 – stringsCourse Learning Outcomes:

On successful completion of the course, the student is expected to be able to:(1) Design and implement programs in the standard version of C(2) Develop good programming skills(3) Use modern C compilers and debuggers (such as Microsoft Visual C)

Assessment

Method No PercentageMidterm Exam(s) 1 40%Labs 8 10 %Final Examination 1 45%Attendance - 5%

Contribution of Course to Criterion 5B- Engineering Science and Design.

Credit Hours for:

Mathematics & Basic Science : 0Engineering Sciences and Design : 4 General Education : 0 Relationship of Course to Program Outcomes


a) an ability to apply knowledge of mathematics, science, and engineeringc) an ability to design a system, component, or process to meet desired needs within realistic constraints such as economic, environmental, social, political, ethical, health and safety, manufacturability, and sustainabilitye) an ability to identify, formulate, and solve engineering problemsk) an ability to use the techniques, skills, and modern engineering tools necessary for engineering practice Prepared by: Dr. Doğu Arifler, Dr. Yıltan Bitirim and Dr. Manuel Carcenac

Date Prepared: April 6, 2010

CMPE211- Object-Oriented Programming Department: Computer Engineering

Program Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE112 Programming Fundamentals Catalog Description: Revision of basic C language features (functions, arrays/strings, pointers). Discussion of C++ features (references, function overloading, default parameters, inline functions, string type). Introduction to Object-Oriented (OO) programming in C++ including abstract data types, classes, encapsulation, member access control, operator overloading and composition/inheritance. Definition of classes and objects. Conducting laboratory experiments and assignment(s).Course Web Page: http://cmpe.emu.edu.tr/courses/cmpe211

Textbook(s): Schaum's Outline of Programming with C++ by J.R.Hubbard, 2nd edition (ISBN 0071353461), McGraw-Hill, 2000.

C++ How to Program by H.M.Deitel, P.J.Deitel (ISBN 0130895717), Prentice Hall, 3rd edition, 2001

Indicative Basic Reading List :

Topics Covered and Class Schedule:(4 hours of lectures per week)

Weeks 1-2 Basics of C++ and control structures: (2 weeks)An introduction to basic input (cin) and output functions (cout) in C++ followed by an overview of basic control structures of C language.

Week 3-4 Functions and Arrays (2 weeks)Review of functions and arrays. Prototype declarations, function definition, call-by-value, call-by-reference, array declarations, operations on arrays, using arrays as function arguments.

Week 5-7 Pointers and C, C++ -Strings: (3 weeks)Pointer variables, declaration and initialization. Use of pointers in call-by-reference function calls, arrays of pointers, function pointers, formatted and unformatted input /output, C++ string type, string functions.

Weeks 8-9 Midterm Exams period

Weeks 10-12 Classes and Data Abstraction: (3 weeks)Structure definition, accessing members of structures, class constructors and destructors, const member functions, friend functions and classes, this pointer, dynamic memory allocation with new and delete.

Weeks 13-14 Operator Overloading: (2 weeks)Fundamentals and restrictions of operator overloading.


week 4 Introduction to compilation and execution of C++ applications week 5 Functions and Arraysweek 6 Pointers and Referencesweek 7 C and C++ strings

week 10 Classesweek 11 Operator overloadingCourse Learning Outcomes:

On successful completion of this course, all students are expected to be able to:

(1) Successfully use key features of C language including if-statements, loops (for, while, do-while), functions, call by value and by reference,

(2) Generating random numbers. (3) Using Arrays and Functions in programs(4) Pointers, dynamic memory allocation and de-allocation(5) Define classes, private and public members, accessing class members(6) Overload arithmetic and logical operators for generated classes

Assessment

Method No PercentageMidterm Exam(s) 2 20%+25%Labs 6 15 %Final Examination 1 35%Attendance - 5%


Mathematics & Basic Science : 0Engineering Sciences and Design : 4 General Education : 0

Relationship of Course to Program Outcomes

The course has been designed to contribute to the following program outcomes:e) identify, formulate, and solve engineering problems,k) use the techniques, skills, and modern engineering tools necessary for engineering practice

Prepared by: Dr. Hakan Altınçay Date Prepared: April 2, 2010

CMPE223 - Digital Logic Design Department: Computer Engineering

Program Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): MATH163 Discrete Mathematics

Catalog Description: 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).Course Web Page: http://cmpe.emu.edu.tr/courses/cmpe223

Textbook(s): J. F. Weakerly, “Digital Design: Principles and Practices”, Prentice-Hall, 2006.Indicative Basic Reading List :S. Brown and Z. Vranesic, “Fundamentals of Digital Logic with VHDL Design”, McGraw-Hill, 2009Richard S. Sandige, “Digital Design Essentials,” Prentice-Hall 2002.


Week 1 Binary, Octal, and Hexadecimal Numbers, Number Base Conversions, Signed Binary Numbers and Complements, Binary Addition, Subtraction, and Overflow, Binary Codes, and Binary Logic.

Weeks 2-6 (First Quiz) Simplification of Boolean Functions, SOP and POS Simplifications, NAND and NOR Implementations, Other Two-Level Implementations, Multilevel NAND and NOR Circuits, Exclusive-OR Functions, Don't-Care Conditions, The Tabulation Method, Determination and Selection of Prime Implicants. (Midterm Exam)

Week 7 Introduction to VHDL, Entities and architectures, Identifiers, spaces and comments, Netlists, Signal assignments. Generics. Constant and open ports, Testbenches and configurations.

Weeks 8-9 Combinational Logic, Analysis Procedure, Design Procedure, Adders/Subtractors, Code Conversion, and VHDL Implementations. (Second Quiz)

Weeks 10-14 MSI Components, Binary Adder and Subtractor, Decimal Adder, Decoders and Encoders, Multiplexers, VHDL Implementations. (Final Exam).


Week 3 Introduction to Digital Logic LaboratoryWeek 4 Digital Signals: Voltages and Currents

Week 6 Introduction to Basic Logic GatesWeek 7 Implementation Combinational Circuits

Week 10 Introduction VHDL Development EnvironmentWeek 11 VHDL Implementation of Logic GatesWeek 12 Behavioral VHDL Implementation of Combinational CircuitsWeek 13 Structural VHDL Implementation of Combinational Circuits Week 14 Makeups for Laboratory WorkCourse Learning Outcomes:

On successful completion of the course, a students is expected to be able to:

1. Use binary, octal, and hexadecimal number systems and apply techniques for number base conversions.2. Use various logic operations associated with Boolean variables to build and evaluate Boolean expressions and functions.3. Apply the various techniques of simplification of Boolean functions for the purpose of minimum cost realizations. In this respect, algebraic manipulations, Karnaugh map method, and the tabulation method should be used in combinational circuit realizations.4. Simulate the behavior of logic devices and combinational circuits using the VHDL language.5. Analyze and design gate- and system-level combinational circuits starting from their verbal descriptions. 6. Design and use functional combinational units such as adders/subtractors, comparators, decoders, multiplexers, to build larger size combinational logic systems. 7. Simulate the behavior of combinational systems including the preparation of input and testbench routines. 8. Carry out the physical realization of combinational systems through FPGA implementations.

Assessment




The course has been designed to contribute to the following program outcomes:a) apply knowledge of mathematics, science, and engineeringe) identify, formulate, and solve engineering problemsk) use the techniques, skills, and modern engineering tools necessary for engineering practicel) knowledge of mathematics through discrete mathematics and logic, basic sciences, and computer science

Prepared by: Dr. Adnan Acan Date Prepared: April 7, 2010

CMPE224 Digital Logic Systems Department: Computer EngineeringProgram Name: Program Code: 25

Computer EngineeringCourse Number: CMPE224

Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE223 Logic Design

Catalog Description: 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).Course Web Page: http://cmpe.emu.edu.tr/courses/cmpe224

Textbook(s): S. Brown and Z. Vranesic, “Fundamentals of Digital Logic with VHDL Design”, McGraw-Hill, Third Edition, 2009.

Indicative Basic Reading List :Richard S. Sandige. "Digital Design Essentials," Prentice-Hall 2002.John F. Wakerly, “Digital Design: Principles and Practices” Pearson Education, 2006.


Week 1 Synchronous sequential logic(SSL), flip-flops (FFs), VHDL implementation of FFs.Week 2 Analysis of clocked sequential circuits, state transition tables/diagrams. Week 3 Design of clocked sequential circuits, design procedure, state reduction and assignment,

flip-flop excitation tables.Week 4 Design procedure & case studies.Week 5 Design of counters.Week 6 VHDL implementation of SSLWeek 7 Registers & shift registersWeek 8 Asyncronous pipple countersWeek 9 Synchronous counters & timing sequencesWeek 10 VHDL implementation of registers and counters.Week 11 Characteristics of ASM flow chart, timing considerationsWeek 12 Datapath implementationWeek 13 Controlpath implementationWeek 14 Further issues in VHDL implementation of synchronous sequential circuitsWeek 15 Design case studies. Laboratory Schedule:(2 hours of laboratory per week)

Week 4 Introduction to Quartus 8 Development Environment.

Week 5 VHDL implementation of FFs.Week 6 Behavioral VHDL implementation of SSL. Week 7 Structural implementation of SSL.

Week 8 VHDL implementation of registers and counters.Week 9 VHDL implementation state-machines.Week 10 Structural VHDL implementation of Datapath and Controlpath.Week 11 VHDL dataflow architectures.Course Learning Outcomes: Students must be able to(1) Use latches, flip-flops, and differentiate between synchronous and asynchronous circuit operation.(2) Perform analysis of synchronous sequential circuits.(3) Apply fundamental design procedure for synchronous sequential circuits; consisting of the steps as construction

of initial state transition table / diagram, perform state reduction and state assignment, develop flip-flop excitations, and design of registers and counters.

(4) Make VHDL implementations on the structured design of synchronous sequential circuits.(5) Design shift registers and use register for data operations.(6) Perform the design of synchronous and asynchronous counters using intuitive approaches.(7) Carrya out VHDL implementations of registers and counters.(8) Apply algorithmic state machines (ASMs) approach for large-size digital system design; consisting of the steps

as development of ASM charts and ASM blocks, make state assignment on ASMs, and perform datapath and controlpath designs.

(9) Make VHDL implementation of ASMs.

Assessment

Method No PercentageMidterm Exam(s) 1 30 %Quizzes 2 25 %Labs 8 10 %Final Examination 1 35%Attendance - 5%



The course has been designed to contribute to the following program outcomes:a) apply knowledge of mathematics, science, and engineeringe) identify, formulate, and solve engineering problemsk) use the techniques, skills, and modern engineering tools necessary for engineering practicel) knowledge of mathematics through discrete mathematics and logic, basic sciences, and computer science

Prepared by: Dr. Adnan Acan Date Prepared: April 14, 2010

CMPE226 - Electronics for Computer Engineers Department: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): MATH241 Linear Algebra and Ordinary Differential EquationsCatalog Description: 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. Thevenin equivalents. Superposition. Inductance and capacitance, practical capacitor and inductors. Transformer, basic diode diode concepts, zener diode, ideal diode model, rectifiers and waveshaping. Basic amplifier concepts, Bipolar Junction Transistors: Current and Voltage relationship, common emitter characteristics. Operational amplifiers: Ideal op-amp, summing point, inverting and noninverting amplifiers, Differential and instrumentation amplifiers, Integrators and differentiators. Course Web Page: http://cmpe.emu.edu.tr/courses/cmpe226 Textbook(s): Floyed, T.L., Electronics Fundamentals: Circuits, Devices, and Applications, 7th Edition, Prentice Hall, 2007.Indicative Basic Reading List :Hambley, A.R., Electrical Engineering: Principles and Applications, Prentice-Hall.Terrel, D., Electronics for Computer Technology, Thomson, 2000.Topics Covered and Class Schedule:(4 hours of lectures per week)Weeks 1-2 Voltage, current and resistance: Electrical charge, voltage, current, resistance, the electrical

circuit. Ohm’s law, energy, and power: Application of Ohm’s law, energy and power, power in an electric circuit.

Weeks 3 -4 Series circuits: resistors in series, total series resistance, current in a series circuit, Kirchoff’s voltage law, voltage dividers. Parallel circuits: Resistors in parallel, total parallel resistance, voltage in a parallel circuit, Kirchoff’s current law, current dividers.

Weeks 5-6 (First Quiz). Series parallel circuits: Identifying series parallel relationships, analysis of series-parallel resistive circuits, voltage dividers with resistive loads, Thevenin’s theorem, the maximum power transfer theorem, superposition theorem.

Weeks 7-8 Introduction to alternating current and voltage: The sinusoidal waveform, sinusoidal voltage sources, voltage and current values of sine waves, angular measurement of a sine wave, the sine wave formula, analysis of AC circuits. Capacitors: The basic capacitor, series capacitors, parallel capacitors, capacitors in DC circuits, capacitors in ac circuits. (Midterm Exam)

Weeks 9-10 RC Circuits: Sinusoidal response of RC circuits, Impedance and phase angle of series RC circuits, analysis of series RC circuits, analysis of parallel RC circuits, analysis of parallel-series RC circuits. Inductors: The basic inductor, series and parallel inductors, inductors in DC circuits, inductors in AC circuits. RL Circuits: Sinusoidal response of RL circuits, impedance and phase angle of series RL circuits, analysis of series RL circuits, impedance and phase angle of parallel RL circuits, analysis of parallel RL circuits, analysis of series-parallel RL circuits.

Weeks 11-12 (Second Quiz). RLC Circuits: Impedance and phase angle of series RLC circuits, analysis of series RLC circuits, parallel RLC circuits. Transformers: The basic transformer, step-up and step-down transformers. Diodes and Applications: Introduction to semiconductors, the diode, diode characteristics, diode rectifiers, power supplies, clippers. Transistors: DC operation of bipolar junction transistors (BJT), The BJT as a switch.

Weeks 13-15 The Operational Amplifier: Introduction to operational amplifier, the differential amplifier, negative feedback, comparators, inverting operational amplifier, noninverting operational amplifier, summing amplifier, integrators and differentiators. (Final Exam).

Laboratory Schedule:(2 hours of laboratory per week)weeks 4 Resistor networksweek 5 Superposition theoremweek 6 Thevenin’s theoremweek 7 Capacitive and inductive circuit at AC

week 10 Semiconductor diodeweek 11 Half wave rectificationweek 12 Transistor familiarization: Common Emitter Transistor Circuitweek 13 Operational amplifierCourse Learning Outcomes: On successful completion of the course, the student is expected to be able to:

(1) apply fundamental principles in electric circuit theory (2) use Ohm’s law, KVL, KCL, Superposition and Thevenin’s theorems to analyse DC resistive circuits (3) identify RMS value, amplitude, frequency and period of AC waveforms(4) use phasor concept to analyse AC circuits that include RC, RL, and RLC(5) analyse diodes, clipper circuits, transformers and rectifiers(6) use circuit theory knowledge to analyse common-emitter connected transistor circuits (7) analyse operational amplifier circuits that involve inverting, non-inverting, integral and derivative

actions

Assessment


Contribution of Course to Criterion 5Credit Hours for: Mathematics & Basic Science : 0Engineering Sciences and Design : 4 General Education : 0

Relationship of Course to Program OutcomesThe course has been designed to contribute to the following program outcomes:a) apply knowledge of mathematics, science, and engineering, e) identify, formulate, and solve engineering problems, k) use the techniques, skills, and modern engineering tools necessary for engineering practice,

Prepared by: Prof.Dr. Hasan Kömürcügil Date Prepared: April 6, 2010

CMPE231 - Data Structures Department: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE112 Introduction to ProgrammingCatalog Description: Introduction to Data Structures: Primitive data structures. Arrays and Memory allocation (storage) of arrays. Character string operations. Two and multi dimensional arrays. Structures: Arrays of structures. Structures and Functions. Dynamic memory allocation . The Stack : :Stack as an Abstract Data Type. Representing the stack in C. Infix, Postfix, and Prefix notations; Infix-to-Postfix conversion. Recursion : : Recursive definition and functions. Queues ::The Queue as an Abstract Data Type. C implementation of Queues. Linked Lists: Inserting and Removing Nodes from a List. Linked implementation of Stacks and Queues. Linked Lists using Dynamic Variables. Queues as Lists in C. Circular Lists(Stack as a Circular List Queues as a Circular List),Doubly Linked Lists.Trees: Operations on Binary Trees. Binary Tree Representations. Binary Tree Traversals. Creating a binary tree. Deleting nodes from a binary tree. Sorting : :Efficiency of Sorting. The O notation. Bubble Sort. Quick Sort. Searching ,Graphs : ,Graphs :Sequential Search. Indexed Sequential Search. Binary Search. Binary Search Trees. Inserting into a Binary Search Tree. Graphs ,C representation of GraphsC representation of GraphsCourse Web Page: http://cmpe.emu.edu.tr/courses/cmpe231Textbook(s): Langsam Y., Augenstein M., Tenenbaum A. Data Structures Using C and C++, 2nd edition, Prentice Hall Int., 1996 (ISBN 013-529322-7)From the Publisher (Prentice Hall/Engineering)

Indicative Basic Reading List :Esakov, J., Weiss, T. Data Structures: An Advanced Approach Using C, PrenticeHallSoftwareSeries,1989. Weiss, M.A. Data Structures and Algorithm Analysis in C, 2nd edition, Addison-Wesley Pub. Co., 1996.Topics Covered and Class Schedule:(4 hours of lectures per week)

weeks 1-2 Primitive data structures. Binary and Decimal Integers, Real numbers, Character strings, Memory representation of information, pointers.

week 3-4 Arrays and Memory allocation (storage) of arrays. Character string operations. Two and multi dimensional arrays. Structures (Arrays of structures. Self-referential structures. Structures and Functions). Dynamic memory allocation. First Assignment is given for duration of two weeks.

weeks 5-6 The Stack : :Stack as an Abstract Data Type. Primitive operations. Representing the stack in C. Infix, Postfix, and Prefix notations; Infix-to-Postfix conversion..

weeks 7-8 The stack and Recursion : :Stack sort,Stack sort, Recursive definition. Examples: Factorial function. Fibonacci sequence. Binary search. The Towers of Hanoi problem. Recursion versus Iteration (1.Midterm Exam)

week 9 Queues ::The Queue as an Abstract Data Type. C implementation of Queues. Circular queu representation.

weeks 10-12 Linked Lists: Representation of linked list structures. Main operations using linked list structures. Type of linked list structures. Representation of Stacks and Queues using linked list. Linked Lists using Dynamic Variables. Queues as Lists in C. Circular Lists(Stack as a Circular List Queues as a Circular List), Doubly Linked Lists. 2.Assigment is given for duration of 2 weeks.(2.Midterm examination)

weeks 13-14 Tree representation, Binary Tree Representations. Operations on Binary Trees. Binary Tree Traversals. Creating a binary tree. Deleting nodes from a binary trees. Sorting and and Searching

week 15 Graphs :Graphs :Application of graphs.Application of graphs. C representation of Graphs.C representation of Graphs.

Laboratory Schedule:(2 hours of laboratory per week)weeks 3-4 (Tutorial) covers introduction to Microsoft Visual C++ 6 IDE , Memory representation and

http://cmpe.emu.edu.tr/courses/cmpe231

array implementations Structures, arrays, pointers and string operations.weeks 5-6 Multi dimensional array operations using text files. Binary Search operations. week 7 Experiments related with stack operations(Pop(),Push() functions) and implementations using C)Weeks 8-9 1.Assignment evaluation(control). Recursive program implementation using C

Weeks 10-11 Experiments related with queue implementation using Cweek 12 Experiments related with linked list operations using C.week 13 2.Assignment evaluation(control).weeks 14-15 Experiment related with trees type data structure using C. Laboratory make up examination.Course Learning Outcomes: On successful completion of the course, the student is expected to be able to:(1) Developed knowledge and understand fundamentals of data structures and abstract concepts.(2) Develop concept of problem solving using different data structures and demonstrate their implementation using

C language.(3) Use all kinds of operations using different data structures (insertion, deletion, sort, search) (4) Use array types data structures and apply their operations(insertion, deletion, search, sort).(5) Design the solution structure using stack type data structures and apply recursive programming using stack

structure.(6) Implement solutions using queue type data structure(7) Use Linked list type(dynamic) data structures and their operations and implement solutions .(8) Use Trees types data structures and their operations(insertion, deletion, sort), and implement solutions.(9) Use Sort, Search operations using different data structures.(10) Use Graph type data structures and related operations.

Assessment

Method No PercentageMidterm Exam(s) 2 25%+25%Quizzes 2 20 %Labs + Assignment 8 15 %Final Examination 1 35%

Contribution of Course to Criterion 5Credit Hours for: Mathematics & Basic Science : 0Engineering Sciences and Design : 4 General Education : 0 Relationship of Course to Program OutcomesThe course has been designed to contribute to the following program outcomes:a) apply knowledge of mathematics, science, and engineering, e) identify, formulate, and solve engineering problems, k) use the techniques, skills, and modern engineering tools necessary for engineering practice, l) knowledge of probability and statistics, mathematics through differential and integral calculus, discrete mathematics, basic sciences, computer science, and .....

Prepared by: Dr. Erden Başar Date Prepared: April 9 2010

CMPE242 - Operating Systems Department: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4Cr


Required Course Elective Course (click on and check the appropriate box)

Prerequisite(s): CMPE112 Programming Fundamentals

Catalog Description: 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, critical-section 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. Course Web Page: http://cmpe.emu.edu.tr/courses/cmpe242

Textbook(s): Andrew S. Tanenbaum, Modern Operating Systems, Second Edition, Prentice Hall, 2001.



weeks 1-2 Operating system definition, simple batch systems, multiprogramming, time-sharing, personal computer systems, parallel systems.

weeks 3-4 Introduction to process, process scheduling, operations on processes, cooperating processes, interprocess communications, interrupts.

weeks 5-6 Process synchronization; Critical-section problem, synchronizing hardware, semaphores, synchronization problems, critical regions, process monitors. (Midterm Exam I)

weeks 7-9 CPU scheduling; Criteria and algorithms, multiple process and real-time scheduling, algorithm evaluation.

weeks 10-12 Deadlocks; Characterization and handling of deadlocks, deadlock prevention avoidance and detection, deadlock recovery. (Midterm Exam II)

weeks 13-15 Memory management and virtual memory; Address spaces, swapping, contiguous allocation, paging, segmentation.


week 4 Interfacing with UNIX and understanding the important Shell commandsweek 5 Command Language Exercises week 6 Shell Command Exercisesweek 10 CPU Scheduling Algorithms

week 11 Deadlock Algorithmsweek 12 Memory managementCourse Learning Outcomes:

Students must be able to

(1) Understand the basic concepts of modern operating systems.(2) Describe the role and purpose of operating systems.(3) Understand the concept of how programming languages, operating systems, and hardware architectures interact.(4) The concept of a process and concurrency problems: synchronization, mutual exclusion, deadlocks.(5) Describe concurrent execution using states and state diagrams, ready lists, process control blocks, context

switching, interrupt handling in a concurrent environment.(6) Identify scheduling policies (e.g. First Come First Served, Shortest Job First, Round Robin, preemptive and

nonpreemptive...).(7) Deadlock avoidance, detection, prevention and recovery. Identify solution strategies, including semaphores,

monitors and condition variables.(8) Describe physical memory and memory management, including overlays, swapping, partitions, paging and

segmentation, page placement and replacement policies, working sets and caching.

Assessment





The course has been designed to contribute to the following program outcomes:b) an ability to design and conduct experiments, as well as to analyze and interpret data, k) use the techniques, skills, and modern engineering tools necessary for engineering practice,

Prepared by: Dr. Ahmet Ünveren and Dr. H. Altınçay Date Prepared: April 13, 2010

CMPE 318 Principles of Programming LanguagesDepartment: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE211 Object-Oriented Programming

Catalog Description:

Formal specification of programming languages: syntax, analysis, and semantics; evolution of programming languages and concepts; names and scope; data representation; evaluation sequence at expression, statement, and subprogram levels; Object Orientation implementation issues; abstraction, inheritance, polymorphism, concurrency, and exception handling; sampling of other paradigms such as functional, logical, scripting, high-performance, etc. as time permits. Weekly homework and lab work are assigned in parallel to lectures.Course Web Page: http://cmpe.emu.edu.tr/courses/cmpe218

Textbook(s): SEBESTA, Robert W.: Concepts of Programming Languages, 8th Edition, Pearson Intl (Addison-Wesley), 2008. ISBN: 0-321-50968-4.Indicative Basic Reading List :David Flanagan , Yukihiro Matsumoto: The Ruby Programming Language, O'Reilly Media, Inc., 2008, ISBN-10: 0596516177, ISBN-13: 978-0596516178Topics Covered and Class Schedule:(4 hours of lectures per week)

week 1 Overviewweek 2 Introduction, history of programming languagesweeks 3-4 The Ruby programming languageweek 5 Describing syntax and semanticsweek 6 Lexical and Syntax Analysisweek 7 Names, Bindings, Type Checking, Scopes, Data Types week 8 Expressions and Assignment Statements, Control Structuresweek 9 Midtermsweek 10 Logic Programmingweek 11 Subprogramsweek 12 Implementing subprograms week 13 Abstract data types and encapsulation conceptsweek 14 Support for Object-Oriented Programming


week 4 Ruby tutorialweek 6 Data structures in Rubyweek 8 Lexical analysis week 11 Syntax analysis

week 12 Class variables, instance variables, scopeweek 13 Prolog tutorial week 14 Prolog week 15 Term project controlCourse Learning Outcomes: Upon successful completion of the course, students should be able to

1. Enumerate the major programming paradigms and representative languages from each paradigm 2. Differentiate between the concepts of syntax and semantics

http://wps.aw.com/aw_sebesta_concepts_7

3. Specify the syntax of programming languages using context free grammars4. Draw a parse tree for a sentence in a language, given its grammar5. Derive a sentence in a language, given its grammar6. Demonstrate that a specific grammar is ambiguous7. Write simple lexical and syntax analyzers 8. List the key features of major programming language paradigms 9. Describe subprogram call/return semantics and its stack implementation10. Differentiate between static and dynamic scope11. Differentiate between static and dynamic binding12. List and describe the major parameter passing mechanisms for subprogram calls13. Define and use the notions of abstraction, information hiding, inheritance and abstract data types14. Write and trace simple programs in the Ruby Object Oriented Programming Language 15. Describe the way virtual method tables are used to implement inheritance in object-oriented programming

languages16. Write and trace simple programs in the Prolog Logic Programming Language

Assessment

Method No PercentageMidterm Exam(s) 1 3%Term Project 1 10 %Labs 8 15 %Final Examination 1 40%Attendance - 5%




The course has been designed to contribute to the following program outcomes:a) apply knowledge of mathematics, science, and engineeringe) identify, formulate, and solve engineering problemsk) use the techniques, skills, and modern engineering tools necessary for engineering practice

Prepared by: Dr. Zeki Bayram and Dr. Manuel Carcenac Date Prepared: April 5, 2010

CMPE 321 Basics of Signal and SystemsDepartment: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): MATH 241 Ordinary Differential Equations

Catalog Description: The course aims at giving the students the theoretical fundamentals within modern digital signal processing and also at providing knowledge and insights into applied signal processing problems. The student will be well prepared for both signal processing within the industry and for continued studies in the subject. The course will mainly provide

basic knowledge in signal and system theory with the intention of providing the necessary mathematical tools for digital signal processing. In this course MatLab package (graphical programming software) will be used, for both signal acquisition and processing. Applications include analysis of the audio and video signals and digital computer systems.Course Web Page: http://cmpe.emu.edu.tr/courses/cmpe321Textbook(s): Signal Processing First, J. H, McClellan, Ronald W. Schaffer, M. A. Yoder, Prentice Hall 2003.

Indicative Basic Reading List :Computer Exploration in Signal and Systems using MatLab, J. R. Buck, M. M. Daniel and A. C. Singer, 2nd Ed., Prentice Hall, 2002.Signals and Systems, A. V. Oppenheim, A. S. Willsky, 2nd Ed., Prentice Hall, 2002.


Weeks 1-2 Introduction. Mathematical Representation of Signals. Mathematical Representation of Systems.

Weeks 3-4 Sinusoids. Review of Sine and Cosine Functions. Sinusoidal Signals. Sampling and Plotting Sinusoids. Complex Exponentials and Phasors. Phasor Addition. Time Signals

Weeks 5-6 (First Quiz). Spectrum Representation: The Spectrum of a Sum of Sinusoids. Beat Notes. Periodic Waveforms. Fourier Series Analysis and Synthesis. Time-Frequency Spectrum. Frequency Modulation.

Week 7 Sampling and Aliasing: Sampling. Spectrum View of Sampling and Reconstruction. Discrete-to-Continuous Conversion. The Sampling Theorem

Weeks 8-9 (Midterm Exam)Week 10 FIR Filters: Discrete-Time Systems. The Running Average Filter. The General FIR Filter.

Implementation of FIR Filters. Linear Time-Invariant (LTI) Systems. Convolution and LTI Systems. Cascaded LTI Systems. Example of FIR Filtering.

Weeks 11-12 Frequency Response of FIR Filters. Sinusoidal Response of FIR Systems. Superposition and the Frequency Response. Steady State and Transient Response. Properties of the Frequency Response. Graphical Representation of the Frequency Response. Cascaded LTI Systems. Running-Average Filtering. Filtering Sampled Continuous-Time Signals.

Weeks 13-14 (Second Quiz) z-Transforms. Definition of the z-Transform. The z-Transform and Linear Systems. Properties of the z-Transform. The z-Transform as an Operator. Convolution and the z-Transform. Practical Bandpass Filter Design. Properties of Linear Phase Filters.

Weeks 15-16 (Final Exam).


weeks 3-4 Lab 01: Introduction to MATLAB weeks 5-6 Lab 02: Introduction to Complex Exponentialsweek 7 Lab 03: Introducing SP_first routines and functions in MatLabweek 10-11 Lab 04: AM and FM Sinusoidal Signals.weeks 12-13 Lab 05: Digital Images: A/D and D/A Environment.week 14 Lab 06: Sampling, Convolution, and FIR Filtering

Course Learning Outcomes: By the end of the course students should able to do following:

(9) use fundamental signal processing basics such as plotting sum of sinusoids, complex exponential, phasors, phasor addition and periodic waveforms.

(10) have skill in analysis and synthesis of Fourier series, time-frequency spectrum and analysis frequency modulation.

(11) perform sampling and aliasing techniques and study the effect of sampling, aliasing andreconstruction using MatLab for digital images.

(12) solve problems in discrete-time systems.(13) gain general knowledge in FIR filter and learn how to implement FIR filters in MatLab.(14) testing linear time-invariant (LTI) systems, perform convolution on LTI Systems, and cascaded LTI systems.(15) construct the sinusoidal response of FIR systems, superposition and the frequency response.

Assessment



Mathematics & Basic Science : 0Engineering Sciences and Design : 4 General Education : 0 Relationship of Course to Program OutcomesThe course has been designed to contribute to the following program outcomes:

a) apply knowledge of mathematics, science, and engineering,b) an ability to design and conduct experiments, as well as to analyze and interpret datae) identify, formulate, and solve engineering problems,k) use the techniques, skills, and modern engineering tools necessary for engineering practice,l) knowledge of probability and statistics, mathematics through differential and integral calculus, discrete mathematics, basic sciences, computer science, and...

Prepared by: Dr. Cem Ergün Date Prepared: April 07, 2010

CMPE 323 MicroprocessorsDepartment: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE224 Computer Architecture-1

Catalog Description: Introduction to computing: CPU-RAM-ROM. 80x86 microprocessor: registers, program and data segments, logical and physical addresses, stack, push, pop, flag register, addressing modes. Assembly Language Programming: Directives, linking, and .exe files, data types and data definition. Data Transfer, Arithmetic Logic and Control Instructions unsigned, signed, bcd, packed-bcd and ascii number conversion, rotate and shift instructions. Bios and DOS function calls. Macro definitions. 8088 PC/XT expansion slot, 80286 and the ISA bus, Memory interfacing:

EPROM, SRAM and DRAM devices, address decoding circuits, ISA bus memory interfacing. ISA bus I/O address decoding and simple I/O ports, Programmable Peripheral Interface 8255 and LED, 7-segment and LCD-display, switch, stepper motor interfacing. D/A converters, A/D converters. Serial Data Communication and 8251 USART.

Course Web Page: http://cmpe.emu.edu.tr/courses/cmpe323Textbook(s): M. Mazidi & J. Mazidi, The 80x86 IBM PC and Compatible Computers, Assembly Language, Design, and Interfacing, 4th Ed, Prentice-Hall, 2003.

Indicative Basic Reading List :B. B. Brey, The Intel Microprocessors Architecture, Programming, and Interfacing. Ed.6, Prentice-Hall, 2003TASM Assembler, Proteus Circuit Simulator, KC51 8051 C compiler.


Weeks 1-2 Introduction to computing: CPU-RAM-ROM. 80x86 microprocessor: registers, mov and add instructions, program segments, data segments, logical and physical addresses, stack, push, pop, flag register, addressing modes.

Weeks 3-4 Assembly Language Programming: Directives, .asm, .lst, .obj, .map, linking, and .exe files, control transfer instructions, data types and data definition.

Weeks 5-6 (First Quiz). Arithmetic Logic Instructions: multiplication and division, unsigned, signed, bcd, packed-bcd and ascii number conversion, rotate and shift instructions. Bios and DOS function calls: bios display and keyboard interrupts.

Week 7-8 Macro definitions: mouse button and cursor position. 8088 PC/XT expansion slot, 80286 and the ISA bus, (Midterm Exam)

Weeks 9-10 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,

Weeks 11-12 (Second Quiz). Programmable 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.

Weeks 13-15 Serial Data Communication and 8251 USART. Project-Homework: Design and Coding of an Intelligent Restaurant Service Terminal. (Final Exam).


week 4 Introduction to TASM, EDIT/DEBUG and Emu86 Assembler toolsweek 5 TASM Data Types, and Effect of ALU instructions on Flagsweek 6 TASM Data Types, and Effect of ALU instructions on Flagsweek 7 Using Signed Numbers and Look-up Tablesweek 10 8051 Microcontroller I/O and External Memory Interfaceweek 11 8051 Memory Decoders and Memory Interfaceweek 12 8051 Memory Mapped I/O and 8255A Interfacingweek 13 Allocated for free study on project-homeworkCourse Learning Outcomes: Students must be able to(16) know 8086 microprocessor registers, program and data segments, logical and physical addresses, stack, push,

pop, flag register, addressing modes.

(17) use arithmetic-logic, data transfer, and control instructions in assembly programs (18) use BIOS and DOS programming in assembly programs(19) analyze and design simple memory subsystems and interfacing, Isolated I/O subsystems Memory and I/O

address decoding. (20) analyze and Design Simple digital I/O ports(21) design 7 segment display, switch, button, keypad, stepper motor interfacing, and D/A and A/D converter circuits

using Programmable Peripheral Interface 8255.(22) write programs to initialize, receive and transmit serial data using a USART device

Assessment

Method No PercentageMidterm Exam(s) 1 25%Quizzes+Project+HW - 25 %Labs 8 15 %Final Examination 1 30%Attendance - 5%



a) apply knowledge of mathematics, science, and engineering,e) identify, formulate, and solve engineering problems,k) use the techniques, skills, and modern engineering tools necessary for engineering practice,l) knowledge of probability and statistics, mathematics through differential and integral calculus, discrete mathematics, basic sciences, computer science, and...

Prepared by: Dr. Mehmet Bodur Date Prepared: April 02, 2010

CMPE324 - Computer Architecture and OrganizationDepartment: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE 224 Computer ArchitectureCatalog Description: The main concern of this course is to provide a comprehensive overview of computer architecture with specific emphasis on design of reduced instruction set computers, helping the students understand the principles and tradeoffs such as cost/performance, or speed/flexibility, behind the design of modern computer systems. This course provides a foundation for bridging the gap between programming and the inner complexities of the computer.Course Web Page: http://cmpe.emu.edu.tr/courses/cmpe324Textbook(s):

Computer Organization and Design: The Hardware/Software Interface, D.A. Patterson and J.L. Hennessy, 4th Ed., Morgan Kaufmann, 2008. Indicative Basic Reading List :Computer Architecture: A Quantitative approach, J.L. Hennessy and D.A. Patterson, 3rd Ed., Morgan Kaufmann, 2003.Topics Covered and Class Schedule:(4 hours of lectures per week)

Weeks 1-2 Basic of Computer Organization; Classifying ISAs, Design Principles of RISC Processors; Arithmetic Operators; data representation; Language of the Machine I; Instruction formats, register organization, memory access using load and store instructions, accessing arrays, memory addressing, assembly language conventions.

Weeks 3-4 Language of the Machine II; control instructions, looping in MIPS, comparison instructions, logical operators, pseudo instructions, instruction encoding, supporting procedures in computer hardware, passing the arguments to a procedure, register saving conventions, how to use stacks, nested calls.

Weeks 5-6 (First Quiz). Arithmetic for computers; positive and and negative binary numbers, addition, substruction, shifting, logic operations and overflow detection; Designing ALU for basic MIPS instructions, Ripple carry adder and Carry look ahead adder implementations

Week 7 Designing ALU for basic MIPS instructions, Ripple carry adder and Carry look ahead adder implementations

Weeks 8-9 (Midterm Exam)Weeks 10-11 Floating point arithmetic algorithms; addition, subtraction, multiplication, and division, MIPS

floating point instruction; Logic conventions and clocking for MIPS datapath. Weeks 12-13 (Second Quiz). MIPS single clock cycle implementation; Building a datapath for R-type,

Immediate memory-register transfer instructions and control instruction, Designing ALU control, Comparing the performance of Single and Multi cycle implementations; how to calculate CPU execution time, Control unit design of Single Cycle Datapath.

Week 14 The multiple clock cycle implementation, Designing the control unit for the multiple clock cycle implementation: Finite state machines (FSM) and Microprogramming.

Week 15 Review. (Final Exam).


weeks 3-4 (Introduction to PCSpim (MIPS R2000 Simulator)week 5 Memory Referenced MIPS Instructions Used In Accessing The Arraysweek 6 Modular Programming in MIPS Using Jump-and-Link (jal) and Jump-Return (jr) Instructionsweeks 8-9 Introduction to Circuit Synthesis Using ALTERA MAX-PLUS-II VHDL Tools.

week 10-11 Single Clock Data Path in ALTERA MAX-PLUS-II VHDL Environment.Term Project – part1

weeks 12-13 Single Clock Data Path for 16-bit R-type Instructions in ALTERA MAX-PLUS-II VHDL Environment

week 14 Allocated for free study on project-homeworkTerm Project – part2.

Course Learning Outcomes: By the end of the course students should able to do following:(23) study the fundamentals of computer instruction set architecture, including machine-level instruction formats and

addressing modes(24) describe the difference between RISC and CISC instruction sets(25) implement binary number representations and binary arithmetic.(26) able to write, encode, and run a simple assembler program on a MIPS processor.(27) solve basic algorithms and hardware structures for performing integer computer arithmetic (addition, subtraction,

multiplication, and division).(28) compute floating point format representation of real numbers in a computer(29) construct the basic algorithms and hardware structures for addition and multiplication of floating point numbers.(30) perform the basic structure and organization of a MIPS processor datapath.(31) analyze the processor performance using CPI, clock rates and benchmark programs(32) learn the function of the control unit in a processor and will be able to design a control unit for a simple MIPS

and Multi-clock based MIPS processor.

Assessment

Method No PercentageMidterm Exam(s) 1 25%Quizzes 2 15 %Labs 7 15 %HW/Project - 10%Final Examination 1 30%Attendance - 5%


Mathematics & Basic Science : 0Engineering Sciences and Design : 4 General Education : 0 Relationship of Course to Program OutcomesThe course has been designed to contribute to the following program outcomes:a) apply knowledge of mathematics, science, and engineering, e) identify, formulate, and solve engineering problems, k) use the techniques, skills, and modern engineering tools necessary for engineering practice, l) knowledge of probability and statistics, mathematics through differential and integral calculus, discrete mathematics, basic sciences, computer science, and .....

Prepared by: Dr. Işık Aybay and Dr. Cem Ergün Date Prepared: April 07, 2010

CMPE 343 Systems ProgrammingDepartment: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE242 Operating SystemsCatalog Description: 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 identifier. Parent process identifier. Child process identifier. Basic concepts of threads and multithreaded programming. Interprocess communication (IPC), its purpose and using in systems programs. Mechanisms of interprocess communication in UNIX. Importance of interprocess communication for computer networks and distributed systems. Unnamed and named pipes for interprocess communication. Message queues, shared memory, signals and semaphores. Sockets and their using for interprocess communication in computer

networks. A client-server paradigm of interprocess communication. The client-server model and its implementation with sockets. 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. A survey of systems programming aspects in Windows operating systems. Course Web Page: http://cmpe.emu.edu.tr/courses/cmpe343 Textbook(s): Haviland, K. et al., UNIX System Programming, 2nd ed., Addison-Wesley, 1999.Curry, D.A., UNIX Systems Programming for SVR4, O’Reilly & Associates, 1996.Indicative Basic Reading List : Molay , B., Understanding Unis/Linux Programming: A guide to Theory and Practice, Prentice-Hall, 2003.Gray, J.S., Interprocess Communication in UNIX: The Nooks & Crannies, Prentice-Hall, 1997.Vahalia, U., UNIX Internals: The New Frontiers, Prentice-Hall, 1995.Bloomer, J., Power Programming with RPC, O’Reilly & Associates, 1992.Hart, J.M., Win32 System Programming, Addison-Wesley, 1997.Topics Covered and Class Schedule:(4 hours of lectures per week)

Weeks 1-2 Scopes of systems programming. Development a program in UNIX. Command line parameters and their use.

Weeks 3-4 System calls in UNIX, their classification and implementation in UNIX. A general system call interface.

Weeks 5-6 Processes as fundamental dynamic objects in UNIX. Creation of processes. Parallel running of processes. State diagram of a process. System calls for processes: fork(), system(), exec(), wait().

Weeks 7-8 Relationship between a parent process and its child processes. Basic concepts of threads and multithreaded processes. System calls for threads in UNIX. Files and directories in UNIX. System calls for files and their use for creation and accessing files. (Midterm exam)

Weeks 9-10 Interprocess communication mechanisms, their purpose, classification and related system calls. Unnamed and named pipes and related programming.

Weeks 11-12 Message queues. A client-server system with message queues. Semaphores and shared memory for interprocess communication. Signals and their use and programming with them.

Weeks 13-15 Sockets for remote interprocess communication. IP and port addressing of processes for communication through sockets. UDP sockets. A UDP-based client-server system and the related system calls. TCP sockets for reliable remote interprocess communication and the related system calls. Conclusion. (Final exam)


Week 3 Introductory laboratory work on processesWeek 4 Study of processes in UNIXWeek 5 Advanced work on processesWeek 7 Threads in UNIXWeek 8 Unnamed pipes

Week 10 Understanding message queuesWeek 11 UDP sockets for interprocess communicationWeek 12 TCP sockets for interprocess communication

Course Learning Outcomes:

On successful completion of the course, the student is expected to be able to:(1) tell the difference between conventional function calls versus system calls in UNIX(2) classify system calls in UNIX(3) use threads in programs (4) describe the relation of a thread to the concept of a process(5) differentiate communication between processes and between threads in the same process (6) define mechanisms for local and remote interprocess communication in UNIX(7) implement the client-server paradigm of computing with mechanisms of IPC

Assessment

Method No PercentageMidterm Exam(s) 1 30%Lab Work(s) 8 10 %Quizzes 2 30 %Final Examination 1 30%



(a) apply knowledge of mathematics, science, and engineering, (e) identify, formulate, and solve engineering problems, (k) use the techniques, skills, and modern engineering tools necessary for engineering practice, (l) use the knowledge of probability and statistics, mathematics through differential and integral calculus, discrete mathematics, basic sciences, computer science, and ..... Prepared by: Asst. Prof. Dr. Gürcü Öz Date Prepared: 16 April 2010

CMPE344 - Computer Networks Department: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE343 Systems Programming

Catalog Description: Introduction to fundamental concepts of computer networks. Basic performance and engineering trade-offs 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 computer-communication networks.


Textbook(s): L.L Peterson L. L. Peterson and B. S. Davie, Computer Networks: A Systems Approach, 4th ed., Morgan Kaufmann, 2007.Lab Manual: E. Aboelela, Network Simulation Experiments Manual, 2nd ed., Morgan Kaufmann, 2007.

Indicative Basic Reading List : A. S. Tanenbaum, Computer Networks, 4th ed., Prentice Hall, 2003


Week 1 FoundationsWeek 2 Network performanceWeek 3 Link layer servicesWeek 4 Ethernet: physical properties, multiple accessWeek 5 Wireless technologies: Bluetooth, Wi-Fi, WiMAX, cellularWeek 6 Packet switching conceptsWeek 7 Bridges and LAN switchesWeeks 8-9 Mid-Term Examination Week 10 ATM networks Week 11 Internetworking with IP Weeks 12-13 End-to-end protocols: UDP and TCPWeek 14 A brief overview of the application layerWeek 15: Final Examination


Week 4 March 15 Lab 1: Introduction to Lab and OPNET Week 5 March 22 Lab 2 EthernetWeek 6 March 29 Lab 3: WirelessWeek 11 May 3 Lab 4: Switched LANs

Weeks 12-13 May 10-17 Lab 5: ATMCourse Learning Outcomes:

At the end of the course, student must be able to(1) describe factors affecting network performance (bandwidth, latency, delay-bandwidth product);(2) describe large scale network issues;(3) explain fundamental principles of layered network protocol architectures;(4) describe functions of layers in OSI and TCP/IP protocol stacks;(5) explain key networking concepts such as multiplexing, multiple access, switching, bridging, and addressing;(6) classify automatic repeat request (ARQ) protocols (stop-and-wait and sliding window);(7) describe protocols for wired/wireless medium access (CSMA/CD and CSMA/CA);(8) explain issues related to virtual circuit switching and packet switching;(9) classify addressing in IP networks, subnets, classless routing and longest prefix match;(10) classify connection-oriented and connectionless services provided by TCP/IP;

(11) describe application layer protocols and domain name system (DNS)(12) use tools for evaluation of real-world network systems using high-fidelity simulation software (currently,

OPNET software)

Assessment

Method No PercentageMidterm Exam(s) 1 35%Lab Work(s) 5 10 %Lab Exam(s) 2 10 %Final Examination 1 45%



(a) apply knowledge of mathematics, science, and engineering (c) design a system, component, or process to meet desired needs within realistic constraints such as economic, environmental, social, political, ethical, health and safety, manufacturability, and sustainability(e) identify, formulate, and solve engineering problems (k) use the techniques, skills, and modern engineering tools necessary for engineering practicePrepared by: Asst. Prof. Dr. Gürcü Öz Date Prepared: 16 April 2010

CMPE 354 Database Management SystemsDepartment: Computer EngineeringProgram Name: Computer Engineering Program Code: 25

Course Number: CMPE 354

Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE231 Data Structures

Catalog Description: 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).



Textbook(s): Database System Concepts, by: Abraham Silberschatz, Henry F. Korth, S. Sudarshan, McGraw Hill, 5th edition, 2006



Weeks 1-2 Introduction to database management systems. Relational model. Weeks 3-4 Relational model and Structured Query Language.Weeks 5-6 Structured Query Language.Week 7-10 Problem sessions on the covered material, Midterm Exam. Term project task is to be announced. Week 11 Advanced SQL.Weeks 12 Application design and development (Triggers; Authorization in SQL; Application security).

Query-by-example (QBE) and Datalog. Object-based databases.Weeks 13-14 Entity-Relationship model and Relational database design (normal forms, functional

dependencies, decomposition)Week 15 Relational database design. Problem sessions on the covered after midterm exam material. Weeks 16-18 Final exams


Week 5 Introduction to MS SQL Server 2005Weeks 6-7 Simple SQL queriesWeeks 8, 11 Nested queries with aggregates

Week 12 Database modification queriesWeek 13 Use of stored procedures and ODBCWeeks 14-15 Term project accomplishment and defense

Course Learning Outcomes: Students must be able to

(1) Design a relational database using the concept of the entity-relational and relational models(2) Write SQL queries using the 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)

(3) Use Datalog and QBE for simple queries specification; realize differences between Relational and Object-based database systems.

(4) Get BCNF and 3NF decomposition of a database given a set of functional dependencies(5) Use SQL in MS SQL Server 2005(6) Design simple database systems with MS SQL Server 2005 (7) Program access to a database system using ODBC

Assessment Method No PercentageMidterm Exam(s) 1 35%

Assignment - 10 %Labs 6 10 %Final Examination 1 40%Attendance - 5%



The course supports achievement of the following program objectives(a). an ability to apply knowledge of mathematics, science, and engineering(e). an ability to identify, formulate, and solve engineering problems(j). a knowledge of contemporary issues(k). an ability to use the techniques, skills, and modern engineering tools necessary for engineering practice(l). a knowledge of probability and statistics, mathematics through differential and integral calculus, discrete mathematics, basic sciences, computer science, and engineering sciences necessary to analyze and design software, and systems containing hardware and software components

Prepared by: Dr. Alexander Chefranov, Dr. Ekrem Varoglu.

Date Prepared: April 5, 2010

CMPE 371 Analysis of AlgorithmsDepartment: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE231 Data Structures

Catalog Description: 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.


Textbook(s): Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, "Introduction to ALGORITHMS", MIT Press.



Week 1-2 Definition and properties of Algorithms. Design, analysis, and representation of Algorithms. Data abstraction. Pseudo code conventions. Models of computation.

Weeks 3 -4 Mathematical Foundations: Growth of functions, asymptotic notations.Weeks 5-6-7 Study of recursive algorithms and associated recurrence relations (substitution method,

iteration method, master method, recursion trees). (Midterm Exam I)Week 10 Brute-Force (Exhaustive Search), Divide-and-Conquer (Merge Sort, Binary Search Tree). Week 11-12 Dynamic Programming (Matrix-Chain Multiplication, LCS-length, 0-1 Knapsack Problem).

Weeks 13 Greedy algorithms (Greedy Activity Selector, Fractional Knapsack Problem. (Midterm Exam II)

Weeks 14 Graph Algorithms: Representation of sets and graphs. Breadth-first search, depth-first search.Week 15 Minimum spanning trees. Single-source shortest paths. All-pairs of shortest paths. NP-

completeness and intractability. (Final Exam)


Week 4 Exact Running time analysis of algorithmsWeek 5 Asymptotic notationsWeek 10 Divide and ConquerWeeks 11-12 Recurrences

Weeks 13-14 Dynamic programmingCourse Learning Outcomes:

On successful completion of the course, the student is expected to be able to:

(1) prove the correctness and analyze the running time of the basic algorithms for those classic problems in various domains,

(2) apply the three main algorithm designing techniques: divide-and-conquer, dynamic programming, and backtracking optimization,

(3) Analyze specification of a new problem, and choose an appropriate algorithmic design technique to present an algorithm for that problem and derive the time and space complexity of the algorithm designed.

Assessment



Mathematics & Basic Science : 0Engineering Sciences and Design : 4

General Education : 0 Relationship of Course to Program Outcomes

This course is used to assess the following items of Program Outcomes a) apply knowledge of mathematics, science, and engineering, e) an ability to identify, formulate, and solve engineering problems, k) use the techniques, skills, and modern engineering tools necessary for engineering practice,

Prepared by: Dr. Ahmet Ünveren Date Prepared: April 2, 2010

CMPE405 - Graduation Project – Part 1 Department: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 1 Cr

Year/Semester:2009-2010 Fall

Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): Fourth Year Standing

Catalog Description: The main aim of this course is to involve a student, as a team member and under the supervision of an instructor, in a preferably interdisciplinary capstone design project. The project, to be completed in CMPE406, includes a technical survey, the problem description and formulation, and detailed preliminary design documentation for the solution of a realistic computer engineering problem. It is an extended exercise in the professional application of the skills and experience gained in the undergraduate program. Students form teams, each team chooses exactly one topic proposed by course instructors, and is expected to present its progress in the form of reports and presentation, both during the semester and at the end of the semester.


Textbook(s): None

Indicative Basic Reading List :- Pierre F. Tiako, Designing software-intensive systems : methods and principles , IGI Global 2009.- O. G. Popa, Learn Hardware Software and Firmware Design, ISBN 0-9735678-7-2, Corollary Theorems Ltd.

eBook, 2005.- Joey F. George, Dinesh Batra, Joseph S. Valacich , Jeffrey A. Hoffer, Object-Oriented Systems Analysis and

Design (2nd Edition). ISBN-10: 0132279002, Prentice Hall; 2006

Topics Covered and Class Schedule:(1 hour of meeting per week for each team)

There are no formal classes for this course. The topics to be covered during weekly meetings are tentatively as follows:

Week 1 Discuss description and objectives of the projectWeeks 2-4 Requirements analysisWeeks 5-6 Identification and discussion of problems and their possible solution, refinements on the

requirements analysis Week 7 Oral presentation related with project concept, including ethical environmental social

economical impacts of the project in detailWeeks 8 Task division between the members of a team and proposal of the time-schedule for the projectWeeks 9-12 High-level design of a solution based on the requirements analysisWeek 13-14 Detailed design of the solution and consolidation of the project schedule templateWeek 15 Submission of a report that summarizes the whole semester’s work, including requirements

analysis and high/low level design activities

Tutorial Schedule:None.


At the end of the course, each student should be able to (1) apply knowledge obtained in earlier coursework and acquire new knowledge necessary to formulate a real-world

problem and develop its requirements.(2) self-learn new tools, algorithms, and/or techniques that contribute to the solution of the problem.(3) develop a design solution for a set of requirements applying the engineering design processes.(4) work in a team as a responsible member or leader in developing technical solutions on an interdisciplinary

project. (5) consider ethical, environmental, social and economical impacts of the project in detail. (6) write detailed intermediate and preliminary design reports to express technical ideas, strategies and

methodologies in written form.(7) make oral presentations on the status of the project.

Assessment Method PercentageTechnical Requirements Documentation 15%

Design Quality, Complexity and Documentation

35%

Weekly status reports and cooperation with the

30%

supervisorProgress Report 20%



a) an ability to apply knowledge of mathematics, science, and engineering.b) an ability to design and conduct experiments, as well as to analyze and interpret data.d) an ability to function on multidisciplinary teams.e) an ability to identify, formulate, and solve engineering problems.f) an understanding of professional and ethical responsibility.g) an ability to communicate effectively.

Prepared by: Curriculum Committee Date Prepared: 7 December 2009

CMPE406 - Graduation Project – Part 2 Department: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 3 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE 405

Catalog Description: This course is the sequel to CMPE 405. 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 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.


Textbook(s): None.

Indicative Basic Reading List :- Pierre F. Tiako, Designing software-intensive systems : methods and principles , IGI Global 2009.- O. G. Popa, Learn Hardware Software and Firmware Design, ISBN 0-9735678-7-2, Corollary Theorems Ltd.

eBook, 2005.- Joey F. George, Dinesh Batra, Joseph S. Valacich , Jeffrey A. Hoffer, Object-Oriented Systems Analysis and

Design (2nd Edition). ISBN-10: 0132279002, Prentice Hall; 2006Topics Covered and Class Schedule:(2 hours of meeting per week)

There are no formal classes for this course. The topics to be covered during weekly meetings are tentatively as follows:

Week 1 Review of the project concept, requirements and the design document formats and contents.Week 2 Oral presentation of students on the related standards and design requirementsWeeks 3-4 Determination of the detailed implementation methods and toolsWeeks 5-11 Actual implementation of the project, together with test case scenariosWeek 12 TestingWeek 13 Documentation of the developed projectWeek 14 Review of coding and documentation standards, project binder requirements, final presentation

and demonstrationWeek 15 Submission of the final report that summarizes project

Oral Presentation

Tutorial Schedule:None.


At the end of the course, each student should be able to (8) apply knowledge obtained in earlier coursework and acquire new knowledge necessary to design and

implement a system, component, or process to meet requirements. (9) apply engineering design processes in detail. (10) work in team on an interdisciplinary capstone project.(11) implement the software and/or hardware design tasks in a time schedule to satisfy the design requirements.(12) design and implement test methods for the scheduled sub units and final product based on their test plan

documents.(13) write detailed final report and progress reports for the design tasks. (14) make oral presentation on the finalized design and implementation.

Assessment

Method PercentageWeekly status reports and cooperation with the supervisor

20%

Project design 10%Project test plan 10%

Project implementation quality, documentation and accomplishment of stated objective

30%

Oral presentation 20%Final report 10%



a) an ability to apply knowledge of mathematics, science, and engineering.b) an ability to design and conduct experiments, as well as to analyze and interpret data.d) an ability to function on multidisciplinary teams.e) an ability to identify, formulate, and solve engineering problems.g) an ability to communicate effectively.k) use the techniques, skills, and modern engineering tools necessary for engineering practice.l) knowledge of probability and statistics, mathematics through differential and integral calculus, discrete mathematics, basic sciences, and computer science.

Prepared by: Curriculum Committee Date Prepared: 15 January 2010

CMPE412 Software EngineeringDepartment: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE218 Programming Languages

Catalog Description: In order to understand design concepts of software systems, it is important to learn basic concepts of project management with specific emphasis on teamwork. In order to learn the concepts of the software life cycle and the phases in software development, the following topics are discussed: Project scheduling, feasibility study, analysis, specification, design, implementation, testing, quality assurance, documentation, maintenance. Software engineering requires a basic understanding of management issues: Planning, organization, control. Also included are formal specification techniques, structured programming, modular system design and other current issues. In order to learn basic concepts of project management, teamwork and cooperation in software projects, special emphasis is put on the practical issues involved in software project development and management through the use of a one-semester group design project.


Textbook(s): Sommerville, Software Engineering, (latest ed: 8th), Addison-Wesley.Pressman, Software Engineering, (latest ed: 6th), McGraw-Hill.



Weeks 1-2 Introduction to SE, steps of the software development process, big projects that failed and reasons of failure

Weeks 3-4 Project management, planning and tracking progress, project metricsWeeks 5-6 Cost, human effort and timing estimation techniquesWeeks 7-8 Intermediate Presentations, review and Midterm ExamWeeks 9-10 Architectural Design, problem decomposition, application architecturesWeek 11-12 TestingWeeks 13-14 Review and Final Presentations of the term projectWeeks 15-16 Final Examination

Tutorial Schedule(Design Studio Laboratory):(2 hours of Tutorial per week)

Week 2 Finalizing project groups, discussion on the Project Scope and hints on how to prepare Requirements Analysis

Week 4 Discussion on the Requirements DocumentWeek 6 Discussion on Intermediate Report formats and Intermediate Presentations

Week 8 Midterm week, no lab.

Week 10 Up-to-date work shown to the course assistants – feedback given

Week 12 Up-to-date work shown to the instructor – feedback given

Week 14 Discussion on Final Report formats and Final Presentations, final discussion on work completed – feedback given


Students must be able to:(1) Understand how to perform a feasibility study(2) Understand software project analysis techniques(3) Understand software project specification methods(4) Understand software project design in general(5) Develop skills in software implementation using at least two different programming languages(6) Develop skills in testing software components(7) Develop skills in concepts of software project management, with special emphasis on planning, organization

and control of progress(8) Develop skills in understanding and using formal specification techniques(9) Develop skills in understanding and using popular software development environments(10) Develop skills in reading journal papers and writing a proposal, intermediate and final reports for the project(11) Develop appreciation of importance of project management for software projects(12) Develop appreciation of importance of cooperation in team projects(13) Develop appreciation of keeping track of the newly emerging technologies

Assessment

Method No PercentageMidterm Exam 1 20 %Term Project 15 50%Final Examination 1 30%


Mathematics & Basic Science : 0Engineering Sciences and Design : 4 General Education : 0 Relationship of Course to Program OutcomesThis course is used to assess the following items of Program Outcomes a) apply knowledge of mathematics, science, and engineering, c) an ability to design a system, component, or process to meet desired needs within realistic constraints such as

economic, environmental, social, political, ethical, health and safety, manufacturability, and sustainability, e) identify, formulate, and solve engineering problems, k) use the techniques, skills, and modern engineering tools necessary for engineering practice.

Prepared by: Dr. Isik Aybay Date Prepared: 7 December 2009

CMPE 415 - Visual ProgrammingDepartment: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE 112 Programming FundamentalsCatalog Description: The main concern of this course is to teach Graphical User Interface, event-driven programming and object-oriented programming for Windows and Internet environments with a visual programming language. Windows Presentation Foundation (WPF) Graphical User Interface, WPF Graphics and Multimedia, XML and XAML, Strings, and Database and Web Application development will also be introduced.Course Web Page: http://cmpe.emu.edu.tr/courses/cmpe415Textbook(s): “Visual Basic 2008 How to Program”, Paul J. Deitel and Harvey M. Deitel, Pearson Prentice Hall, 2008.Indicative Basic Reading List :

Topics Covered and Class Schedule:(4 hours of lectures per week)Weeks 1-2 Introduction to Computers, the Internet and Visual Basic. Introduction to Visual Basic 2008

Express and Visual Basic Programming.Weeks 3 -4 Introduction to Classes and Objects. Control Statements.Weeks 5-6 Methods. Arrays and Introduction to LINQ and Generic Collections.Week 7 Graphical User Interfaces with Windows Forms.Weeks 8-9 Midterm ExamsWeeks 10-11 Graphical User Interface with Windows Presentation Foundation (introduces XML and

XAML). WPF Graphics and Multimedia. Strings, Characters and Regular Expressions.

Weeks 12-13 Databases and LINQ to SQL. ASP.NET and ASP.NET Ajax.Weeks14-16 ASP.NET and ASP.NET Ajax (Cont.). Final Exams.

Term Project Schedule

Week 3 Term Project – Proposal Submission.Week 7 Term Project – Intermediate Report Submission.Week 15 Term Project – Final Report Submission and Demonstration.

Laboratory Schedule:(2 hours of laboratory per week)Week 2 Lab #1: Delivering computer accounts and explaining laboratory regulations. Introduction

to Visual Basic 2008 Express and Visual Basic Programming.Week 3 Lab #2: Introduction to Classes and Objects.Week 4 Lab #3: Control Statements.Week 5 Lab #4: Methods.

Week 6 Lab #5: Arrays and LINQ.Week 7 Lab #6: Graphical User Interfaces with Windows Forms.Week 10 Lab #7: Graphical User Interface with Windows Presentation Foundation (WPF).Week11 Lab #8: WPF Graphics and Multimedia. Strings, Characters and Regular Expressions. Week 12 Lab #9: Databases and LINQ to SQL.Week 13 Lab #10: ASP.NET.Week 14 Lab #11: ASP.NET.Week 15 Lab #12: ASP.NET Ajax.Course Learning Outcomes: On successful completion of the course, students are expected to(1) be able to develop software solutions for a given problem with a visual programming language(2) be able to develop Windows application / Internet application with a Graphical User Interface(3) be able to develop Database applications(4) develop skill in Visual programming for Windows environment / Internet environment(5) develop skill in Visual Basic .Net programming language

Assessment

Method No PercentageMidterm Exam(s) 1 30%Term project - 15 %Labs 12 10 %Final Examination 1 40%Attendance - 5%



The course has been designed to contribute to the following program outcomes:(a) an ability to apply knowledge of mathematics, science, and engineering.(b) an ability to design and conduct experiments, as well as to analyze and interpret data. (c) an ability to design a system, component, or process to meet desired needs within realistic constraints such as economic, environmental, social, political, ethical, health and safety, manufacturability, and sustainability. (e) an ability to identify, formulate, and solve engineering problems. (i) a recognition of the need for, and an ability to engage in life-long learning. (j) a knowledge of contemporary issues. (k) an ability to use the techniques, skills, and modern engineering tools necessary for engineering practice. (l) a knowledge of probability and statistics, mathematics through differential and integral calculus, discrete mathematics, basic sciences, computer science, and engineering sciences necessary to analyze and design software, and systems containing hardware and software components. Prepared by: Dr. Yıltan Bitirim Date Prepared: 2 April 2010

CMPE416-Object Oriented Programming and Graphical User Interfaces

Department: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE318 Principles of Programming Languages

Catalog Description: 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 aspects, the similarities and differences with C. He must also acquire a practical programming experience in Java through a number of exercises. 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.


Textbook(s): Java in a Nutshell - 5th Edition; David Flanagan; O'REILLY.



Weeks 1-2 Classical data structures and programming structures of Java.


Weeks 3-4-5 Classes, objects and Object Oriented Programming.Weeks 6-7 Graphical User Interfaces. (Midterm 1 Exam)Weeks 10-11 Graphics. (Midterm 2 Exam)Week 12 Threads.Week 13 Packages of classes. JDK. Various useful classes.Week 14 Applets. Exception handling.Week 14 (Final Exam)

Laboratory Schedule:(2 hours of laboratory per week)Week 4 Tutorial. Introduction to Java.Week 5 Tutorial. Arrays in Java.Week 6 Lab. Classes, subclasses, abstract methods.

Week 7 Lab. Classes, member classes.Week 10 Lab. Classes, subclasses, member classes.Week 11 Lab. Introduction to GUIs in Java.Week12 Lab. GUI, animation. Week 14 Lab. GUI, threads.Course Learning Outcomes:

Students must be able to(1) develop methodically a code according to the Object Oriented Programming approach, implying a clear and

intuitive modeling of data (and actions over these data) through classes and objects.(2) recognize the differences between Java and C/C++ so as to avoid confusing them.(3) use efficiently the memory handling approach of Java.(4) develop methodically Graphical User Interfaces for interactive Java programs.(5) develop basic multithreaded codes with GUIs and graphics in Java.

Assessment





This course is used to assess the following items of Program Outcomes

e) identify, formulate, and solve engineering problems, k) use the techniques, skills, and modern engineering tools necessary for engineering practice, Prepared by: Dr. Manuel Carcenac Date Prepared: April 5, 2010

CMPE 418 Internet ProgrammingDepartment: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE351/CMPE354 Database Systems Design

Catalog Description: As the part played by Internet in our daily life increases, so does the importance of methods and means of Web site realization. This course is devoted to a survey of Web site preparation, considering both client and server-side programming. Special emphasis will be assigned to mark-up and scripting languages. Participant of the course will learn XHTML and XML with style considerations. Web site scripting and salient features of C#, Microsoft .Net technology and server-side programming through ASP.Net Web forms, control and Web services will also be covered. Participant of the course will be required to carry out practical work in terms of assignments and small projects.


Textbook(s): Deitel and Deitel: Internet and World Wide Web How to Program, 4. Edition, Prentice Hall 2008Cooper, P.: Beginning Ruby: From Novice to Professional, APress 2007.



week 1 Introduction to Computers and the Internetweek 2 XHTMLweek 3 Cascading Style Sheets (CSS)


weeks 4-7 JavaScript and client-side scriptingweek 8 Midtermsweeks 9-10 XML, DTD, SCHEMA, XSLT week 11 Adding interactivity to the Client side using AJAXweek 12 The Ruby Languageweeks 13-14 The Ruby on Rails framework and Server-side programmingweek 15 Final Exams

Laboratory Schedule:(2 hours of laboratory per week)Week 4 developing a Web site with XHTML and CSSWeek 7 Dynamic Web page development using JavaScriptWeek 11 Using XML and transforming XML using XSLTWeek 12 Using AJAX to asynchronously get data from server Week 14 Generating a Web application with database connectivity using Ruby on Rails Course Learning Outcomes:

Students must be able to1. Differentiate between client-side and server-side programming2. Develop Web pages in XHTML3. Incorporate JavaScript into Web pages 4. Specify the presentation of a Web page using CSS5. Implement AJAX calls to add responsiveness to Web pages6. Write XML documents7. Use XSLT to transform XML documents into HTML8. Specify the structure of XML documents in DTD or XML Schema9. Understand the Model-View-Controller architecture10. Develop simple Ruby language programs11. Develop server side Web applications using the Ruby on Rails framework

Assessment

Method No PercentageMidterm Exam(s) 1 35%Labs+Assignment 5 15 %Final Examination 1 45%Attendance - 5%




This course is used to assess the following items of Program Outcomes (a) apply knowledge of mathematics, science, and engineering(e) identify, formulate, and solve engineering problems, (k) use the techniques, skills, and modern engineering tools necessary for engineering practice, Prepared by: Dr. Zeki Bayram Date Prepared: 6 April 2010

CMPE421 - Parallel Computer ArchitectureDepartment: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE324

Catalog Description: The main concern of this course is to provide a comprehensive overview of the modern microprocessor organization. Design of the major processor components is discussed in terms of the concepts presented in CMPE 324. Topics include pipeline design and control techniques, cache and virtual memory design, interfacing techniques, multi-processor computers and parallel algorithms.


Textbook(s): Computer Organization and Design: The Hardware/Software Interface, D.A. Patterson and J.L. Hennessy, 4th Ed., Morgan Kaufmann, 2008.

Indicative Basic Reading List :Computer Architecture: A Quantitative approach, J.L. Hennessy and D.A. Patterson, 3rd Ed., Morgan Kaufmann, 2003.


Week 1-2 Review of Single Cycle and Multi Cycle Datapaths of RISC architecture. Control unit and timing for Multi-stage instructions, Accessing and Understanding Performance

Week 3-4 Introduction to pipelining; pipelined MIPS datapath; pipeline hazards: structural, control, data; hazard detection unit and resolution with data forwarding unit, pipelining control

Week 5-6 (First Quiz). Data stalling and static branch hazard prediction with flushing and dynamic branch prediction, branch target buffer; instruction level pipelining, exceptions handling; Memory systems basics, Overview of SRAM and DRAM design; memory hierarchy; Principle

of locality, spatial and temporal.Week 7 (Midterm Exam)Week 8-9 Cache levels, cache memory design; Cache Arrangement: Direct Mapped, Fully Associative,

N-way Set Associative; Mapping blocks, write policy: Write through with Write Buffer Solution, Write-Back Solution; Cache Performance; Cache Block Replacement Policy.

Week 10-11 Mapping blocks, write policy: Write through with Write Buffer Solution, Write-Back Solution; Cache Performance; Cache Block Replacement Policy. Virtual memory; page tables, translation lookahead buffer

Week 12-13 (Second Quiz). A computer system with multiple CPUs for large scale computations. Low cost multiprocessor PCs and workstations basic concepts of parallel processing and basic hardware configurations: bus-based multiprocessor systems, multi-core systems, and network of PCs/workstations.

Weeks 14-15 Term Project Presentations. (Final Exam).

Term-Project ScheduleWeek 6 Term Project – Proposal Submission.Week 10 Term Project – Intermediate Report Submission.Week 14 Term Project – Final Report Submission and Presentations.


At the end of the course, student must be able to(1) gain a general knowledge of technical literature on new computer systems.(2) study the advanced concepts of computer architecture with specific emphasis on design of reduced instruction set

computers(3) explain how computing systems are structured by focusing on the processor, cache, memory and system buses

and implement single-cycle and pipelined uniprocessors.(4) describe the concepts of basic pipelining and advanced pipelining techniques.(5) design and analyze multi-stage pipelined CPUs, design hazard detection logic and design register forwarding

hazard prevention systems.(6) Have skill in hierarchical memory system design.(7) explain the purpose of cache memory systems(8) design simple cache memory systems(9) construct multi-level cache memory systems.(10) analyze the performance of a cache memory system.(11) design and analyze associative caches(12) describe the purposes of virtual memory systems(13) gain a general knowledge of basic concepts of parallel processing and basic hardware configurations

Assessment

Method No PercentageMidterm Exam(s) 1 25%Quizzes 2 15 %Term Project 1 20 %Attendance 5 %Final Examination 1 35%




a) apply knowledge of mathematics, science, and engineering, e) identify, formulate, and solve engineering problems, k) use the techniques, skills, and modern engineering tools necessary for engineering practice, l) knowledge of probability and statistics, mathematics through differential and integral calculus, discrete mathematics, basic sciences, computer science, and .....

Prepared by: Asst. Prof. Dr. Cem Ergün Date Prepared: 18 May 2010

CMPE 423 Embedded Systems DesignDepartment: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE 323 – Microprocessors

Catalog Description: 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. (CMPE323).


Textbook(s): Ibrahim, Dogan, Advanced PIC microcontroller projects in C: from USB to RTOS with the PIC18F series, Newnes, Elsevier, 2008Indicative Basic Reading List :Course Notes by M. Bodur.John B. Peatman, Embedded Design with the PIC18F452 Microcontroller, Pearson Education, 2003Topics Covered and Class Schedule:(4 hours of lectures per week)

Weeks 1-2 Embedded Microcontroller Architecture, and Instruction SetWeeks 3-4 Timing by instruction count, Programming in Assembly.Weeks 5-6 Application of Timer with C codingWeeks 7-8 LCD initialization; Display strings. (First Quiz), (Midterm Exam)Weeks 8 Mid-Term Examination Weeks 9-10 Interrupt management, Low-priority and high-priority interrupt structures, Critical regions,

External Interrupts. I/O pin considerations (Quiz-2)Weeks 11-12 Embedded Design Project Specification and Life Cycle. Analog to Digital Conversion, Serial

peripheral interface operation (Quiz-3)Weeks 13-15 UART operation, Student Design Project Organization and Discussions, Multi-processor

systems, (Quiz-3)

Laboratory Schedule:(2 hours of laboratory per week) Week 4 Installation of MPLAB and CC8EWeek 5 Timing by Delay LoopsWeek 5 Frequency Counter Using the TIMER0Week 7 Egg-Timer with LCD module

Week 10 RPG-Counter using Interrupts

Week 11 ADC Applications

Weeks 12-14 I/O Pins, and UART Applications


Passing students must be able to(1) Write simple programs and translate small C-code segments in a microcontroller assembly language such as

Microchip PIC18.(2) Know the structure of a timer unit, and use it in simple C coded programs for various timing tasks.(3) Use switches, LED’s and LCD module procedures in C coded programs(4) Know the latency problems in interrupt servicing, and use it in C coded programs. (5) Know the structure of analog-digital converter unit, and use it in C coded programs. (6) Know the structure of universal-asynchronous-communication unit, and use it in C coded programs. (7) Analyze technical requirements and design simple embedded systems using switches, LED’s, timers, LCD

modules, ADC and UART.(8) Analyze and comment on ethical social and environmental responsibilities of an embedded system design,(9) Practice an embedded system design including its documentation starting from detailed technical requirements.

Assessment

Method No PercentageQuiz 20%Midterm Exam 1 20%Lab 7 10%Project - 20%Final Examination 1 30%



a) apply knowledge of mathematics, science, and engineering,e) identify, formulate, and solve engineering problems, k) use the techniques, skills, and modern engineering tools necessary for engineering practice, l) knowledge of probability and statistics, mathematics through differential and integral calculus, discrete mathematics, basic sciences, computer science, and ...

Prepared by: Dr. Mehmet Bodur Date Prepared: May 20, 2010

CMPE 424 Speech and Image ProcessingDepartment: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s):

Catalog Description: Introduction to digital speech and image processing. Analysis of operations on images such as image enhancement, image restoration, edge detection, image compression. Discussion of the basic subject related to speech processing such as discrete time and continuous time signals, Fourier series and Laplace transform, sampling, Z-transform, digital filtering, fast Fourier transform, and signal processing applications.


Textbook(s): R. C. Gonzalez and R. E. Woods, Digital Image Processing, 3rd Edition, Prentice Hall, 2008.Thomas F. Quatieri, Discrete-Time Speech Signal Processing: Principles and Practice, Prentice Hall, 1 st edition, 2001.K. Jain, Fundamentals of Digital Image Processing, Prentice Hall, 1989.K.R. Castleman, Digital Image Processing, Prentice Hall, 1996.Gonzalez, Woods, and Eddins, Digital Image Processing Using MATLAB, Prentice Hall, 2004.Lawrence Rabiner, Biing-Hwang Juang, Fundamentals of Speech Recognition, Prentice Hall, 1993.Indicative Basic Reading List :


Weeks 1-2 Introduction to image processing. A general introduction to image processing, digital image processing problems and applications.

Weeks 3 -4 Image representation and modeling. Image perception, image sampling and quantization, image transforms, image representation by stochastic models.

Weeks 5-6 Image enhancement. Point operations, histogram modeling. Spatial operations, transform operations, color image enhancement.

Weeks 7-8 Image restoration. Image filtering and restoration, inverse and Wiener filtering, other Fourier domain filters.

Weeks 9-10 (Midterm Exams)Weeks 11-12 Image analysis. Edge detection, boundary extraction, boundary and region representation,

texture, image segmentation. Image compression. Pixel coding, predictive techniques, transform coding of images.

Weeks 13-14 ntroduction to speech processing. A general introduction to discrete-time speech signal processing, the speech communication pathway, analysis and synthesis based on speech production and perception.

Week 15 Discrete-time speech signal processing framework. Discrete-time signals and systems, Discrete-time Fourier Transform, the Z Transform, Discrete Fourier Transform (DFT), practical considerations in using DFT, conversion of continuous signals to discrete time.

Weeks 16-17 (Final Exams)



Passing students must be able to(1) Use the basics of digital image processing including image enhancement, image restoration, image

compression and image analysis(2) Implement image enhancement, histograms, image restoration, edge detection and image compression

techniques(3) Define the key applications of speech analysis such as speech modification, speech coding, speech

enhancement and speaker recognition (4) Prepare an individual research project on recent developments in one of the major topics related with the

course that involves speech or image processing(5) Write a research project report by reading recent articles related to the project topic and present the project in

front of other students and instructors(6) Implement image processing applications using MATLAB programming

Assessment

Method No PercentageMidterm Exam(s) 1 30%Assignments - 15 %Term Project - 15 %Final Examination 1 40%Attendance - 5%



This course is used to assess the following items of Program Outcomes This course is used to assess the following items of Program Outcomesa) apply knowledge of mathematics, science, and engineering,e) identify, formulate, and solve engineering problems,k) use the techniques, skills, and modern engineering tools necessary for engineeringpractice, l) knowledge of probability and statistics, mathematics through differential and integral

calculus, discrete mathematics, basic sciences, computer science, and ...

Prepared by: Dr. Önsen Toygar Date Prepared: April 12, 2010

CMPE426 - Digital Signal ProcessingDepartment: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course Prerequisite(s): MATH152

Catalog Description: This course concentrates on the fundamentals of digital signal processing. The emphasis will be on the following: discrete-time signals and systems, Z-transform, frequency analysis of discrete-time signals, frequency domain sampling, discrete Fourier transform (DFT), FFT algorithms, realization of discrete-time systems, design of FIR and IIR digital filters, adaptive digital filtering applications. Some of the theory developed in class will be confirmed by computer programming using MATLAB simulation package.


Textbook(s): G. Proakis and D.G. Manolakis, Digital Signal Processing: Principles, Algorithms and Applications, 3rd Edition, Prentice-Hall International Edition, ISBN: 0-13-373762-4.

Indicative Basic Reading List :E. C. Ifeachor and B. W. Jervis, Digital Signal Processing: A Practical Approach, 2nd Edition, Prentice-Hall International Edition, ISBN:0-201-59619-9.


Week 1

Week 2

Week 3

Weeks 4-5

Signals, Systems, Digital signal processing with its benefits, Application areas, Frequency concept, Types of digital signals, LTI systems.

Typical real-time DSP systems, Analog-to-digital conversion (ADC) process, Digital-to-analog conversion (DAC) process, Sampling-lowpass and bandpass signals.

Describing digital signals with impulse functions, Describing digital LTI systems, Digital convolution, Difference equations.

The discrete Fourier series, The Fourier transform of aperiodic digital signals, Frequency response of LTI systems, Properties of the transform.

Weeks 6-7

Weeks 8-9

Weeks 10

Week 11

Weeks 12-14

Week 15

Definition and properties of the transform, Z-plane poles and zeros, Geometric evaluation of the Fourier transform in the z-plane.

Mid-Term examination

The Discrete Fourier Transform (DFT): basic, properties and computation. The Fast Fourier Transform (FFT): basic, properties and computation.

Introduction, FIR filter design, FIR filter specifications, FIR coefficient calculation methods, window method, Realization structures for FIR filters.

Design stages for digital IIR filters, Coefficient calculation methods for IIR filters, Impulse invariant method of coefficient calculation, Bilinear z-transform method of coefficient calculation, Realization structures for IIR digital filters.

Final examination


Weeks 1-6 Matlab tutorialWeeks 7-15 Some of the theory developed in class will be confirmed by computer programming using

MATLAB simulation packageCourse Learning Outcomes:

At the end of the course, student must be able to(1) specify the significance of digital signal processing in the fields of computing, telecommunications, multi-

media technology and other areas of computer science.(2) describe analogue/digital conversion as required for the digital processing of analogue signals.(3) specify the fundamental concepts such as linearity, time-invariance, impulse response, convolution,

frequency response, z-transforms and the discrete time Fourier transform as applied to discrete time signal processing systems.

(4) describe the discrete Fourier transform (DFT), its applications and its implementation by FFT techniques.(5) use the MATLAB language and signal processing toolboxes for analyzing, designing and implementing

digital signal processing (DSP) systems such as digital filters (IIR and FIR).

Assessment

Method No PercentageMidterm Exam(s) 1 25%Quiz (s) 2 20 %Laboratory 5 10%Homework (s) 1 5%Final Examination 1 40%



Relationship of Course to Program OutcomesThe course has been designed to contribute to the following program outcomes:

(a) apply knowledge of mathematics, science, and engineering (e) identify, formulate, and solve engineering problems (k) use the techniques, skills, and modern engineering tools necessary for engineering practice (l) knowledge of probability and statistics, mathematics through differential and integral calculus, discrete mathematics, basic sciences, computer science, and .....

Prepared by: Prof. Dr. Omar Ramadan Date Prepared: 14 May 2010

CMPE443 Real-Time System DesignDepartment: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE 242 Operating Systems

Catalog Description: Course goal is to introduce students to key ideas, concepts and tools of Real-Time systems design. Introduction to real-time systems, ADA programming, architecture and design of real-time systems, concurrent programming and synchronization, real-time scheduling, reliability and exception handling, real-time OS, and distributed real-time systems


Textbook(s): PHILLIP A. LAPLANTE, REAL TIME SYSTEMS DESIGN AND ANALYSIS, 3rd EDITION, ISBN 0471228559



Weeks 1-2 Introduction to RTSWeeks 3 -4 Hardware considerations. Hardware interfacing, CPU, Memory, I/O, Interruptions, Enhancing

performance, Other special devices, non von Neumann architectures Weeks 5-7 Real-Time Operating Systems. Real-Time kernels. Theoretical foundations of RTOS. Term

project task is announced on April 2, 2010.Weeks 7-10 Inter-task communication and synchronization, exceptions. Problem sessions. Midterm examsWeek 11 Resource management (processor time, RAM, disk memory). Case studyWeek 12 Software requirements specification. Formal methods. Finite state machine. Statecharts. Petri

nets. Structured analysis and design. Object-oriented analysis and Unified Modeling Language. Software engineering principles.

Week 13 Programming languages and software production process. Assembly language. Procedural languages. Object-oriented languages. ADA 95 tasks, rendezvous, pragmas. Special RT languages.

Week 14 System performance analysis and optimization. Response time and time loading. Scheduling problems. calculation. Optimization technique. Analysis of memory requirements. Queuing models. Little's Law.

Weeks 15-18 Problem sessions. Final exams.


Weeks 4-5 Analysis of a dynamic system unit-step input responseWeek 6-7 Modeling of RLC circuit response on harmonic inputWeeks 8-11 Dynamic imagesWeek 12 Win32 timersWeek 13 ADA programmingWeeks 14-15 Term project accomplishment and defenseCourse Learning Outcomes:

Students must be able to(1) Use knowledge of the principles of hardware organization in real-time systems design (e.g., PLA

programming, programming on the level of machine instructions, pipeline organization, speedup estimation)(2) Use knowledge of operating systems organization in real-time system design (e.g., cooperative and

preemptive multitasking, task control blocks, threads, queues of processes, processes communication and synchronization)

(3) Apply real-time scheduling and resource allocation algorithms(4) Use pseudo-code, finite state automata, state-charts, Petri nets, UML for real-time systems design(5) Develop real-time visual models of dynamic system representing objects under control(6) Organize concurrent processes in ADA(7) Use methods of efficient and reliable programming

Assessment

Method No PercentageMidterm Exam(s) 1 30%Quizzes - 5 %Labs 5 10 %Term Project - 15%Final Examination 1 35%Attendance - 5%



This course is used to assess the following items of Program Outcomes This course is used to assess the following items of Program Outcomesa) apply knowledge of mathematics, science, and engineering,e) identify, formulate, and solve engineering problems,

j) a knowledge of contemporary issues k) use the techniques, skills, and modern engineering tools necessary for engineeringpractice, l) knowledge of probability and statistics, mathematics through differential and integralcalculus, discrete mathematics, basic sciences, computer science, and ...

Prepared by: Dr. Alexander Chefranov Date Prepared: April 5, 2010

CMPE444 - Data CommunicationsDepartment: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE344

Catalog Description: This course concentrates on the exchange of data between devices. The key aspects of transmission, interfacing, encoding schemes, link control, routing, error control, multiplexing, and other concepts related to the physical layer, data link layer, and network layer will be examined. The course then will proceed with wide area networks in examining the internal mechanisms and user network interfaces that have been developed to support voice, data, and multimedia communications. The traditional technologies of packet switching and circuit switching will be examined, as well as the more recent ATM and the emerging high-speed networks technologies.


Textbook(s): William Stallings. "Data & Computer Communications," Prentice-Hall 2007

Indicative Basic Reading List :L.L Peterson L. L. Peterson and B. S. Davie, Computer Networks: A Systems Approach, 4th ed., Morgan Kaufmann, 2007.R.O. Onvural , “Asynchronous Transfer Mode Networks: Performance Issues,” Artech House, 1995.Periodicals and journals {IEEE, ACM, Communications, Computer Networks and ISDN, Performance Evaluation, …..}S. Tanenbaum, Computer Networks, 4th ed., Prentice Hall, 2003


Week 1 Data communicationsWeek 2 Protocols and protocol architectureWeek 3 Analog and digital data transmissionWeek 4 Transmission impairmentsWeek 5 Guided transmission mediaWeek 6 Wireless transmission

Week 7 Modulating/Encoding techniquesWeeks 8 Mid-Term Examination Week 9 Modulating/Encoding techniquesWeek 10 Asynchronous and synchronous transmission; Flow and congestion controlWeek 11 Error detection and controlWeek 12 Multiplexing techniques: FDM/TDM/STDMWeek 13 Circuit switching / Packet switching / virtual circuit switchingWeek 14 ATM and high-speed networksWeeks 15-16 Final Examination

Tutorial Schedule:(2 hours of Tutorial per week)

Weeks 3-4 Reviewing of TCP/IP and OSI modelsWeeks 5-6 Solving examples on analog/digital transmission and transmission impairmentsWeeks 9-10 Demo on sampling theorem and solving problems related to modulation techniquesWeeks 11-12 Solving examples on flow and error control

Weeks 13-14 Solving examples related to ATM networksCourse Learning Outcomes:

At the end of the course, student must be able to (1) Know key communications tasks.(2) Understand protocol architectures.(3) Understand analog and digital data transmission.(4) Classify transmission impairments.(5) Compare digital-encoding/analog-modulation techniques. (6) Calculate chanel capacities and bandwidth requirements(7) Analyse the performances of flow control technigues.(8) Describe error detection and correction methods.(9) Describe multiplexing techniques.(10) Describe and compare switching techniques.(11) Know the working principles of ATM and high-speed networks

Assessment

Method No PercentageQuiz 2 18%Midterm Exam 1 35 %Attendance 15 5%Final Examination 1 42%



a) apply knowledge of mathematics, science, and engineering.e) identify, formulate, and solve engineering problems.k) use the techniques, skills, and modern engineering tools necessary for engineering practice.

l) knowledge of probability and statistics, mathematics through differential and integral calculus, discrete mathematics, basic sciences, and computer science.

Prepared by: Assoc. Prof. Dr. Muhammed Salamah Date Prepared: 16 April 2010

CMPE447 - Fiber Optic Computer Communications Department: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course Prerequisite(s): CMPE344

Catalog Description: This course will describe the basic principles of fiber optics, light propagation theories, attenuation of optical fibers,

dispersion and dispersion compensation of fiber optics. In addition, optical fiber transmitters, receivers and fiber

optic system design are also discussed. Finally, an introduction to fiber optic network is considered.


Textbook(s): D. K. Mynbaev and L. L. Scheiner, Fiber Optic Communications Technology, 1/e, Prentice Hall, 2001

Indicative Basic Reading List : J. C. Palais, Fiber Optic Communications, Prentice Hall, 1998


Week 1 Introduction to telecommunications and fiber opticsWeek 2 Physics of light: A brief overviewWeek 3 Optical Fibers: BasicsWeeks 4-5 Fiber optic dispersion and dispersion compensationWeeks 6-7 Optical TransmitterWeeks 8-9 Mid-Term Examination Weeks 10-11 Optical ReceiverWeeks 12-13 Fiber optic link designWeek 14 Introduction of Fiber Optic NetworkWeek 15 Final Examination


Weeks 3-14 Laboratory work may be given as project for designing fiber communications system links. In addition, some tutorials will be organized to establish a closer contact with students. Term projects may be arranged for students.


At the end of the course, student must be able to(1) explain the significance of fiber optics communications(2) describe the basic components of an optical system.(3) describe the propagation of light in optical wave-guides(4) explain the basic operation of fiber optic transmitters and receivers(5) Perform fiber optic link power budget analysis and design fiber optic link

Assessment

Method No PercentageMidterm Exam(s) 1 30%Quiz (s) 2 25%Homework (s) 1 5%Final Examination 1 40%



(a) apply knowledge of mathematics, science, and engineering (e) identify, formulate, and solve engineering problems (k) use the techniques, skills, and modern engineering tools necessary for engineering practice(l) knowledge of probability and statistics, mathematics through differential and integral calculus, discrete mathematics, basic sciences, computer science, and .....Prepared by: Prof. Dr. Omar Ramadan Date Prepared: 14 May 2010

CMPE461 Artificial Intelligence Department: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE318 Principles of Programming Languages Catalog Description: This undergraduate-level course introduces the basic concepts of artificial intelligence (AI). General understanding of basic concepts with emphasis on the agent perspective to artificial intelligence through intelligent agents, blind and informed search algorithms, constraint satisfaction, reasoning, and knowledge representation, are the major goals in the preparation of lectures and practical laboratory works. Active student participation is necessary in both lecture and laboratories. The students, by the end of this course, are expected to identify the uses of basic techniques in different fields of computer engineering.

Course Web Page: http://cmpe.emu.edu.tr/courses/cmpe461Textbook(s): Stuart Russel, Peter Norvig, “Artificial Intelligence: A Modern Approach”, 2nd Edition, Prentice Hall, 2003.Indicative Basic Reading List :George F. Luger, Artificial Intelligence: Structures and Strategies for Complex Problem Solving, 4th Edition, Addison-Wesley, 2002. Topics Covered and Class Schedule:(4 hours of lectures per week)Week 1 Definitions of AI from different point of views will be discussed. The four common AI

approaches, acting humanly, thinking humanly, acting rationally, and thinking rationally, will be discussed in detail.

Week 2 Definitions of AI from different point of views will be discussed. The four common AI approaches, acting humanly, thinking humanly, acting rationally, and thinking rationally, will be discussed in detail.

Week 3 Intelligent agents: How agents should act. Structure of intelligent agents. Environments.Week 4 Problem solving agents. Formulating problems and example problems. Searching for

solutions. Uninformed search strategies.Week 5 Informed search methods: Best-first search. Heuristic functions. Memory-bounded search.

Iterative improvement algorithms.Week 6 Informed search methods: Best-first search. Heuristic functions. Memory-bounded search.

Iterative improvement algorithms.Week 7 Constraint satisfaction problems (CSPs): Definitions, Backtracking search for CSPs, The

structure of problems.Weeks 8-9 Mid-Term Examination Week 10 Adversarial search: Games, Optimal decisions in games. Alpha-Beta pruning.Week 11 Agents that reason logically: A knowledge-based agent. Representation, reasoning, and logic.

Propositional logic.Weeks 12-13 First-order logic: Syntax and semantics. Extensions and notational variations. First order

logic. Week 14 Inference in first-order logic: Generalized modus-ponens. Forward and backward chaining.

Completeness. Resolution.Week 15 Final Examination

Laboratory Schedule:(2 hours of laboratory per week)Week 4 Modeling Intelligent Agents Using NetLogo Development Environment.Week 5 Implementation Uninformed Search Strategies.Week 7 Implementation of A* Search Algorithm.Week 8 Iterative Improvement Algorithms

Week 10 Reasoning with Propositional LogicWeek 11 Forward and Backward Chaining in FOLWeek 14 Makeups for Laboratory Work.Course Learning Outcomes: At the end of the course, student must be able to1. List and explain brief historical background, relations of AI with other fields, and applications of AI.2. Interpret the definitions of AI from the four main directions of AI research approaches3. Develop implementations of intelligent agents at different levels of complexities of agent architectures4. Build design descriptions of intelligent agents considering their percept, goal-based actions and environments.5. Use uninformed search strategies, explain their complexities, and describe problem specific application details.6. Use informed search strategies, incorporate heuristics within intelligent search strategies, and explain effects of heuristics in intelligent search methods.7. Implement basic algorithms for game playing, adversarial search, and pruning.8. Use constraint satisfaction modelling and its associated heuristics for the solution constraint satisfaction problems.9. Build knowledge bases and derive inferences using propositional logic(PL): atoms, formulas, knowledge-base, and the resolution principles in PL.10. Build knowledge bases and derive inferences using first-order logic: explains weaknesses of PL, terms, predicates, quantifiers, and reasoning mechanisms of FOL.

Assessment

Method No PercentageMidterm Exam(s) 1 25%Lab Work(s) 5 15 %Quiz1 + Quiz2 2 25 %Final Examination 1 35%

Contribution of Course to Criterion 5Credit Hours for: Mathematics & Basic Science : 0Engineering Sciences and Design : 4 General Education : 0 Relationship of Course to Program OutcomesThe course has been designed to contribute to the following program outcomes:a) apply knowledge of mathematics, science, and engineering, e) identify, formulate, and solve engineering problems, k) use the techniques, skills, and modern engineering tools necessary for engineering practice, l) knowledge of algorithms, data structures, mathematics through discrete mathematics and logic, basic sciences, computer science.

Prepared by: Asst. Prof. Dr. Adnan Acan Date Prepared: 18 May 2010

CMPE462 - Functional and Logic Programming Department: Computer EngineeringProgram Name: Computer Engineering Program Code: 25

Course Code: CMPE462

Credits: 4


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): CMPE318 Principles of Programming Languages

Catalog Description: Predicate Calculus, first order logic, unification, functional programming, LISP and LINDA languages. Pure logic programming, PROLOG language, constraint logic programming, concurrency and parallelism in LISP and PROLOG.

Course Web Page: http://cmpe.emu.edu.tr/bayram/courses/462/Teaching/Fall05/main.htm

Textbook(s): The Art of Prolog, Second Edition: Advanced Programming Techniques (Logic Programming). By: Leon Sterling, Ehud Shapiro. MIT Press, 1994. ISBN: 0262193388

Reference Books:The Functional Approach to Programming, by Guy Cousineau (Author), Michel Mauny (Author), K. Callaway (Translator). Publisher: Cambridge University Press; (October 29, 1998) ISBN: 0521576814 Indicative Basic Reading List :None


Week 1 Introduction to Logic Programming and Prolog Week 2 Logic variables, Substitution, UnificationWeek 3 Resolution, Non-determinism and Backtracking Week 4 Arithmetic, Lists in PrologWeek 5 Tree structures in Prolog, Structure InspectionWeek 6 Meta-Logical predicatesWeek 7 Cuts and NegationWeeks 8-9 Mid-Term Examination Week 10 Introduction to Functional Programming and HaskellWeek 11 Expressions, Predefined Types and OperationsWeek 12Week 13

Functions - pattern matching, conditions, non-determinismUser-defined types, Lists, Strings, Tuples

Week 14 Higher-order computations,Lazy Evaluation, Local DefinitionsWeek 15 Final Examination

Laboratory Schedule:(2 hours of laboratory per week) Week 3 Introduction to EclipseWeek 4 Lists (Prolog)Week 5 More ListsWeek 6 Trees, Lists and Arithmetic,Week 7 Inspecting TermsWeek 10 Introduction to Curry/HaskellWeek 11 Simple list processing and arithmetic in CurryWeek 12 More on lists (Haskell)Week 13 New Types


At the end of the course, student should be able to(1) Unify terms in Logic(2) Draw the resolution tree for a given query and logic program(3) Manipulate strings in Prolog and Haskell(4) Develop, debug and execute programs in Prolog(5) Develop, debug and execute programs in Haskell(6) List the major differences between the imperative programming paradigm and logic programming paradigm(7) List the major differences between the imperative programming paradigm and functional programming

paradigm

Assessment

Method No PercentageMidterm Exam 1 30%Lab Work(s) 9 25 %Attendance 1 5 %Final Examination 1 40%


Mathematics & Basic Science : 0Engineering Sciences and Design : 4General Education : 0Relationship of Course to Program OutcomesThe course has been designed to contribute to the following program outcomes:

(a) apply knowledge of mathematics, science, and engineering (c) design a system, component, or process to meet desired needs within realistic constraints such as economic, environmental, social, political, ethical, health and safety, manufacturability, and sustainability(e) identify, formulate, and solve engineering problems (k) use the techniques, skills, and modern engineering tools necessary for engineering practicePrepared by: Assoc. Prof. Zeki Bayram Date Prepared: 20/5/2010

CMPE 471 Automata TheoryDepartment: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): MATH 163 Discrete Mathematics

Catalog Description: Introduction to formal languages and grammars. Deterministic and non-deterministic finite automata. Regular languages. Regular expressions. Limitations of languages. Context-free grammars. Context-free languages. Pushdown automata. Parsing. Chomsky hierarchy. Unrestricted grammars. Recursive and recursively enumerable sets. Turing machines. Computability. The halting problem, insolvability. Course Web Page: http://cmpe.emu.edu.tr/courses/cmpe471

Textbook(s): J.E. Hopcroft, R. Motwani, J.D. Ullman, “Introduction to Automata Theory, Languages, and Computation”, 2nd or above editions, Addison-Wesley, 2001.

Indicative Basic Reading List :McNaughton R., “Elementary Computability, Formal Languages, and Automata”, Prentice-Hall, 1982Rayward Smith V.J., “Formal Language Theory”, McGraw-Hill, 1995


Week 1 Introduction to principles of computingWeek 2 Strings and Alphabets, Formal Languages, The notion of Grammar.Week 3 Phrase Structured Grammars, Regular Grammars, Context-Free Grammars.Weeks 4-5 Finite Automata (FA)Week 6 Deterministic Finite Automata (DFA), The Equivalence of Nondeterministic Finite Automata

(NFA) and DFA.Week 7 Regular Expressions and the Corresponding Languages.Week 8 Properties of Languages Accepted by FA. Equivalence of FA and Regular Languages.Week 9 The Pumping Lemma. Minimization of FA. Mealy/Moore Machines.Week 10 Properties of Context Free Languages (CFL). Derivation Trees and Ambiguity.Week 11 Chomsky and Greibach Normal Forms.Weeks 12-13 Equivalence of CFLs and PDAs.

Tutorial Schedule:

Weeks 3-4 Mathematical principles, Strings and Alphabets, Formal Languages. Weeks 6-7 Finite Automata (FA).Weeks 8-9 Deterministic Finite Automata (DFA), The Equivalence of Nondeterministic Finite Automata

(NFA) and DFA.Weeks 11-12 Context Free Languages and Push-down automataCourse Learning Outcomes:

Students are expected to(1) develop appreciation of principles of computation(2) develop abilities of analyzing problems in a formal and mathematical manner(3) know basics of formal languages and automata(4) understand regular grammars(5) use finite automata (6) understand context-free grammars(7) use push down automata(8) have a notion of Turing machines(9) become familiar with basics of compiler design

AssessmentMethod No PercentageMidterm Exam(s) 1 40%Final Examination 1 60%




The course has been designed to contribute to the following program outcomes:a) apply knowledge of mathematics, science, and engineering, e) identify, formulate, and solve engineering problems,

Prepared by: Prof. Dr. Marifi Güler Date Prepared: 12 April 2010

CMPE474 Performance Analysis of Computer Systems and Networks Department: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): MATH322

Catalog Description: This course aims to introduce fundamental concepts of performance evaluation of computer systems and networks. The course starts with an overview of probability theory and statistics. Then, the course continues with some fundamental performance analysis techniques including methods for performance measurement, performance metrics, monitoring, experimental design, and system modeling. Other topics include: comparing two or more systems; system tuning; performance bottleneck identification; characterizing the load on the system (workload characterization); determining the number and size of components (capacity planning); predicting the performance at future loads (forecasting); queuing theory, mean value analysis, and modelling. The course concludes with applications of the learned concepts to measure the performances of computer systems like communication networks, LANs, memory and I/O systems.


Textbook(s): Raj Jain, " The Art of computer Systems Performance Analysis: Techniques for experimental Design, Measurement, Simulation, and Modeling, Wiley, 1991.

Indicative Basic Reading List :- G. Bolch, S. Greiner, H. Meer, and K.S. Trividi , “Queueing Networks and Markov Chains, Modeling and

performance evaluation with computer science applications” Wiley, 1998.- L. Kleinrock, “Queueing Systems”, Vol.1: Theory. Wiley, 1975.


Week 1 Introduction to performance evaluationWeek 2 Main performance evaluation techniques and measuresWeek 3 Statistics for performance analysisWeek 4 Summarizing data and its variabilityWeek 5 Comparing systems ; Confidence interval calculationWeek 6 Approximate Visual Test; Sample size determinationWeek 7 Introduction to Queuing theory; Little’s Law; Utilization LawWeek 8 Mid-Term Examination Week 9 Stochastic Processes; Markov Processes; Birth-death Processes; Poisson ProcessesWeek 10 Analysis of a Single Queue; M/M/1 queuing analysis

Week 11 M/M/c queuing analysis; Operational lawWeek 12 M/G/1 queue. Pollaczek-Khinchin FormulaWeek 13 Open and Closed Queueing Networks; Product Form Networks.Week 14 Mean-Value Analysis; Queueing Network Models of Computer SystemsWeeks 15-16 Final Examination

Tutorial Schedule:(2 hours of Tutorial per week)

Weeks 3-4 Reviewing of probability theoryWeeks 5-6 Solving examples on probability and statisticsWeeks 9-10 Solving examples on comparing systems and confidence intervalWeeks 11-12 Solving examples on queuing theory

Weeks 13-14 Solving examples on queuing theory and networksCourse Learning Outcomes:

At the end of the course, student must be able to (1) Know applied probability theory.(2) Understand statistics and data presentation.(3) Practice performance evaluation techniques and performance measures or metrics.(4) Summarize and analyze experiments outcomes.(5) Compare systems using sample data. (6) Use Queuing theory to measure performances of systems.(7) Analyze single queue systems.(8) Analyze simple queuing networks.(9) Model communication networks and I/O computer systems

Assessment

Method No PercentageQuiz 2 20%Midterm Exam 1 30 %Homework 4 5%Attendance 15 5%Final Examination 1 40%



a) apply knowledge of mathematics, science, and engineering.e) identify, formulate, and solve engineering problems.k) use the techniques, skills, and modern engineering tools necessary for engineering practice.l) knowledge of probability and statistics, mathematics through differential and integral calculus, discrete mathematics, basic sciences, and computer science.

Prepared by: Assoc. Prof. Dr. Muhammed Salamah Date Prepared: 7 December 2009

CMPE 476 System SimulationDepartment: Computer EngineeringProgram Name: Computer Engineering Program Code: 25


Credits: 4 Cr



Catalog Description: General concepts of systems. Discrete and continuous systems. State variables. Models, modeling and simulation of systems. Principles and techniques for system modeling and simulation. Comparison of analytical modeling and simulation modeling techniques. General structure of a simulation system. Probability aspects of simulation. Techniques and methods of generation of random numbers and random variates with the desired probability distribution. Simulation languages and packages. Transaction-oriented and event-oriented simulation. Queueing systems in simulation. Validation and verification of simulation models. Output (statistical) analysis and representation of simulation results.


Textbook(s): S. M. Ross, Simulation, 4th ed., Academic Press, 2006.

Indicative Basic Reading List :R. Jain, The Art of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation, and Modeling, Wiley, 1991. Topics Covered and Class Schedule:(4 hours of lectures per week)

Week 1 Introduction (Ch. 1)Weeks 2-3 Elements of probability, random numbers (Ch. 2 & 3)Week 4 Discrete random variable generation (Ch. 4)Week 5 Continuous random variable generation (Ch. 5)Week 6 Case study: Communication system simulationWeek 7 ReviewWeek 8 Mid-Term Examination Week 9 Discrete event simulations (Ch. 6)Week 10 Case study: Simulating a packet switchWeek 11 Statistical analysis of simulated data (Ch. 7)Week 12 Statistical validation techniques (Ch. 9)Week 13 Case study: Comparing systemsWeek 14 Review and concluding remarksWeeks 15-16 Final Examination

Programming Assignments

Assignment 1 Statistical analysis of dataAssignment 2 Development of a random number generation libraryAssignment 3 Simulation of a discrete memoryless communication channelAssignment 4 Simulation of a packet switch

Assignment 5 Simulation of a simple random access protocolCourse Learning Outcomes:

Students must be able to

(1) Construct computer-based simulation models to analyze computersystems and communication networks;(2) Use probability and statistics to analyze results of a simulation;(3) Develop programming skills in C/C++ for writing efficient simulations.

Assessment

Method No PercentageMidterm Exam 1 35%Assignment - 35%Final Examination 1 50%



a) an ability to apply knowledge of mathematics, science, and engineering; b) an ability to design and conduct experiments, as well as to analyze and interpret data; c) an ability to design a system, component, or process to meet desired needs withinrealistic constraints such as economic, environmental, social, political, ethical, health and safety, manufacturability, and sustainability; e) an ability to identify, formulate, and solve engineering problems; k) an ability to use the techniques, skills, and modern engineering tools necessary for engineering practice.

Prepared by: Dr. Dogu Arifler Date Prepared: May 11, 2010

A2. Courses Taken Other Department(s) of Engineering Faculty

IENG355 - Ethics in Engineering

Department: Department of Industrial Engineering Program Name: Industrial Engineering Program Code: 26

Course Number: IENG355

Credits: 3 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): None

Catalog Description: 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, safety and occupational hazard considerations.Course Web Page: http://ie.emu.edu.tr

Textbook(s): Charles E. Harris, Jr., Michael S. Pritchard, Michael J. Rabins, “Engineering Ethics: Concepts and Cases” 3rd edition, 2005 Wadsworth. ISBN: 0-534-53397-3Indicative Basic Reading List :


Week 1 General Introduction, Engineering Ethics: Making a Difference Chapter 1

Week 2 Responsibility in Engineering Chapter 2

Week 3 Chp 2 Contd/ Framing the Problem Chapter 3

Week 4 Organizing Principles Chapter 4

Week 5 Review and Case Analysis

Week 6 Honesty, Integrity and Reliability Chapter 6

Week 7 Review and Case Analysis

Week 8-9 MIDTERM EXAM

Week 10 Safety, Risk and Liability in Engineering Chapter 7

Week 11 Engineers as Employees Chapter 8

Week 12 Engineers and the Environment Chapter 9

Week 13 International Engineering Professionalism Chapter 10

Week 14 International Engineering Professionalism Chapter 10

Week 15 FINAL EXAM WEEK



On successful completion of this course, all students will have developed knowledge and understanding of: Fundamental concepts of engineering ethics, Engineering code of ethics, The use of techniques to analyse cases, The importance of international professionalism.

On successful completion of this course, all students will have developed their skills in: Recognizing and defining ethical problems, Using different techniques for case analysis, Applying the suitable technique when analysing an ethical situation, Making use of the code of ethics during case analysis, Making ethically optimal decisions.

On successful completion of this course, all students will have developed their appreciation of, and respect for values and attitudes to:

The role of ethics in the engineering profession, Responsible professional conduct.

Assessment

Method No PercentageParticipation - 5%Quizzes 2 20 %Assignments 2 15%Midterm Exam 1 25 %Final Examination 1 35%


Mathematics & Basic Science : 0Engineering Sciences and Design : 3 General Education : 0 The course makes significant contributions to the following program outcomes:(d) an ability to function on multidisciplinary teams(f) an understanding of professional and ethical responsibility(g) an ability to communicate effectively(h) the broad education necessary to understand the impact of engineering solutions in a global, economic, environmental, and societal context(i) a recognition of the need for, and an ability to engage in life-long learning(j) a knowledge of contemporary issues

Prepared by: Asst. Prof. Dr. Emine Atasoylu Date Prepared: 30 April 2010

IENG420 - Engineering Economy Department: Department of Industrial Engineering

Program Name: Industrial Engineering Program Code: 26

Course Number: IENG420

Credits: 3 Cr



Catalog Description: 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.Course Web Page: http://ie.emu.edu.tr

Textbook(s): Leland T. Blank, Anthony J. Tarquin “Engineering Economy” 6th edition, McGraw-Hill International Edition, 2005



Week 1 Foundations of engineering economy; Factors: how time and interest affect money Week 2 Foundations of engineering economy; Factors: how time and interest affect money Week 3 Combining factors

Week 4 Nominal and effective interest rates Week 5 Present-worth evaluations

Week 6 Present-worth, future worth and capitalized cost evaluations

Week 7 Equivalent-annual worth analysis and review

Weeks 8-9 MIDTERM EXAM

Week 10 Rate of return analysis of single alternative

Week 11 Rate of return evaluations for multiple alternatives

Week 12 Benefit cost analysis and public sector economics

Week 13 Replacement analysis

Week 14 Breakeven analysis

Week 15: Effects of inflation


Course Learning Outcomes: On successful completion of this course, all students will have developed knowledge and understanding of:

1. The fundamental concepts of engineering economy

2. How to use engineering economy factors to account for the time value of money3. Service, revenue, mutually exclusive and independent alternatives4. How to consider inflation in an engineering economy analysis5. Depreciation and after tax economic analysis6. The assumptions that form the basis of methods applied

On successful completion of this course, all students will have developed their skills in:1. Economic analyses of alternatives using present worth, annual worth, future worth and rate of return methods2. Selecting and applying a suitable technique for the comparison of mutually exclusive alternatives3. Selecting and applying a suitable technique for the evaluation of independent alternatives4. Identifying relevant data to successfully perform an engineering economy study5. Evaluation of public projects using the benefit/cost ratio method6. Performing replacement study among an existing asset or system and its possible alternatives7. Determining the level of activity necessary or the value of a parameter to breakeven8. Using computer software for engineering economy analysis


1. The role of engineering economy in the decision making process2. The importance of accuracy in estimating costs and revenue and sensitivity analysis to these values3. Consider limitations of the analyses by taking into account the realistic constraints such as environmental, social,

political and ethical 4. Understand the impact of engineering solutions in global, environmental and societal context

Assessment

Method No PercentageParticipation - 5%Quizzes 2 30 %Midterm Exam 1 35 %Final Examination 1 40%



This course is designed as a one-semester course for freshman engineering students. It offers the opportunity to the student to develop:a. An ability to apply knowledge of mathematics, science and engineeringe. an ability to identify, formulate, and solve engineering problemsh. the broad education necessary to understand the impact of engineering solutions in global, economic, environmental, and societal context.j. a knowledge of contemporary issuesk. an ability to use the techniques, skills, and modern engineering tools necessary for engineering practice.

Prepared by: Asst. Prof. Dr. Emine Atasoylu Date Prepared: 30 April 2010

IENG450 - Industrial Management Department: Department of Industrial Engineering Program Name: Program Code: 26

Industrial Engineering Course Number: IENG450

Credits: 3 Cr



Catalog Description: 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.Course Web Page: http:// ie.emu.edu.tr

Textbook(s): Daniel L. Babcock, Managing Engineering and Technology, Second Edition, Prentice Hall, Upper Saddle River, NJ, 1996.



Week 1 Engineering Management and the History

Week 2 Planning and forecasting

Week 3 Planning and forecasting (continued)

Week 4 Decision Making

Week 5 Organizing and Human aspects of organization

Week 6 Motivating and Leading

Week 7 Markets

Week 8-9 MIDTERM EXAM

Week 10 Controlling

Week 11 Managing the Research and Development

Week 12 Managing Engineering Design

Week 13 Flexible Manufacturing Systems

Week 14 Operations Management

Week 15 FINAL EXAM WEEK



On successful completion of this course, all students will have developed knowledge and understanding of: Concept of engineering management,

Methods to motivate technical people, Basic concepts of planning.

On successful completion of this course, all students will have developed their skills in: Forecasting, Managing an organization, Being able to decide the validity of received data.


Human factors, Decision making, Well-organized systems.

Assessment

Method No PercentageParticipation - 5%Quizzes 2 20 %Midterm Exam 1 25 %Final Examination 1 50%


Mathematics & Basic Science : 0Engineering Sciences and Design : 3 General Education : 0 Relationship of Course to Program OutcomesThe course makes significant contributions to the following program outcomes:

a) an ability to apply knowledge of mathematics, science, and engineeringb) an ability to design and conduct experiments, as well as to analyze and interpret datac) an ability to design a system, component, or process to meet desired needs within realistic constraints such as economic,

environmental, social, political, ethical, health and safety, manufacturability, and sustainabilityd) an ability to function on multidisciplinary teamse) an ability to identify, formulate, and solve engineering problemsf) an understanding of professional and ethical responsibilityg) an ability to communicate effectivelyh) the broad education necessary to understand the impact of engineering solutions in a global, economic, environmental, and

societal contexti) a recognition of the need for, and an ability to engage in life-long learningj) a knowledge of contemporary issuesk) an ability to use the techniques, skills, and modern engineering tools necessary for engineering practice.

Prepared by: Instructor Orhan Korhan Date Prepared: 30 April 2010

A3. Course Taken Other Faculties

CHEM101 - General Chemistry Department: Department of Chemistry Program Name: Chemistry Program Code: 43

Course Number: Credits: Year/Semester:

CHEM101 3 Cr 2009-2010 Spring


Catalog Description: Atoms, molecules and ions; Mass relations in chemistry, stoichiometry; Gasses, the ideal gas law, partial pressures, mole fractions, kinetic theory of gases; Electronic structure and the periodic table; Thermochemistry, calorimetry, enthalpy, the first law of thermodynamics; Liquids and Solids; Solutions; Acids and Bases; Organic ChemistryCourse Web Page: http://courses.emu.edu.tr/chem101

Textbook(s): William L. Masterton and Cecile N. Hurley, Chemistry Principles and Reactions, 6th ed., Brooks/Cole Cengage Learning, 2009.



Week 1 Conversion of Units (Chp 1 section 1.2 (Significant figures excluded)) . Atoms, Molecules and Ions (Ch 2 Names of binary molecular compounds excluded)

Week 2 Mass Relations in Chemistry; Stoichiometry (Ch 3)Week 3 QUIZ 1 (19 March)

Week 4 Gases (Ch 5)Week 5 Electronic Structure and the Periodic Table (Ch 6 section 6.8 excluded except for electronegativity)Week 6 Covalent Bonding (Ch 7 section 7.3)Week 7 MIDTERM I

Week 8 Thermochemistry (Ch 8 8.6 excluded)Week 9 Liquids and Solids (Ch 9)Week 10 QUIZ 2 (14 May)

Week 12 Solutions Ch 10 Section (10.1)Week 13 Acids and Bases (Ch 13 sections 13.2, 13.3) 2 periodsWeek 14 Organic Chemistry (Ch 22 sections 22.1-22.3 Basic definitions of major organic compounds only)Week 15: Final Examination


Group 1 WED 7-8 (AS G07)

Group 2 FRI 1-2 (AS G07)

Group 3 MON 1-2 (AS G07)




At the end of the course, student must be able to1. Recognise the constituents and properties of matter in general, and of atoms, molecules and ions in particular.2. Describe the role of energy in chemistry.3. Describe chemical bonds and intermolecular interactions.4. Identify and name the substances.5. Describe periodicity and periodic table.6. Describe chemical mixtures.7. Interpret system of units used in physical sciences.8. Use symbols and units correctly; and formulate appropriate mathematical and chemical equations for solving problems.9. Apply the theoretical concepts and methods of chemistry covered in this course to solve problems.10. Use dimensional analysis method for solving numerical problems.11. Use efficiently and effectively a variety of printed and electronic text, material (including the textbook) relevant to the course.12. Handle chemicals properly, performing experiments as a team safely, and writing lab reports.13. Describe the concentration or the amount of active matter in an aqueous solution.14. Use good scientific English for written and oral communication.

Assessment

Method No PercentageMidterm Exam(s) 1 25%Lab Work(s) 5 10 %Attendance to lectures - 5 %Quizzes 2 20%Final Examination 1 40%



This course is designed as a one-semester course for freshman engineering students. It offers the opportunity to the student to develop:- An adequate background in fundamentals of descriptive, applied and theoretical chemistry. - Systematic problem solving skills through numerous conceptual and numerical problems requiring critical and analytical

thinking skills in addition to a good grasp of chemical concepts.- Scientific literacy and awareness to become an informed citizen.- Basic laboratory skills.

Prepared by: Assoc. Prof. Dr. Hasan Galip Date Prepared: 30 April 2010

ENGL191 - Communication in English I Department: Department of General Education Program Name: Department of General Education Program Code: 4A

Course Number: ENGL191

Credits: 3 Cr



Catalog Description: ENGL 191 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 GEMoodle. 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, speaking) and receptive (reading and listening) skills in academic settings, and on the improvement of study skills in general.Course Web Page: http://gemoodle.emu.edu.tr/ENGL 191Textbook(s): Cox, K. & Hill, D. (2007). English for Academic Purposes (EAP) Now! Preliminary (Students’ Book). Australia: Pearson LongmanIndicative Basic Reading List :


Week 1 Introduction to the Course Unit 1 (pp.12-14) Learning Styles QuizWeek 2 Unit 1: Customs - Speaking 1 (p.2) Unit 1: Customs - Reading (pp.2-5)Week 3 Unit 2: Trade - Reading 2 (pp. 18-20)Week 4 Unit 3: Demographics - Speaking 1 (p.28) Unit 3: Demographics - Reading (pp.28-30)Week 5 Unit 5: Communication - Speaking 1 (p.52) Unit 5: Communication - Reading (pp.52-55)

Sample Midterm and FeedbackWeek 6 Unit 6: Politics - Speaking 1 (pp.64-65) Unit 6: Politics - Speaking 2 (p.70)Week 7 Supplementary Reading MaterialWeek 8-9 Midterm ExamsWeek 10 Feedback on Midterm Exam

Argumentative Essay Writing InputArgumentative Essay Writing – Outline Input

Week 11 Argumentative Essay Writing – First Draft InputWeek 12 Presentation Skills Student Presentations Week 13 Student Presentations Week 14 Student Presentations (cont.)Week 15 Final Examination



On successful completion of the course, students will be able to demonstrate understanding and knowledge of:

http://gemoodle.emu.edu.tr/ENGL%20191

(1) identifying the function and purpose of such text types as information report, explanation and discussion. (1) organizing a well-structured academic paragraph and an argumentative essay as a formal essay type (2) speaking to give reasons, expressing opinions, agreeing or disagreeing and discussing in an academic

environment.

On completing the course students will:

(1) understand the main points of clear standard speech on familiar matters regularly encountered in work, school, leisure, etc.

(2) understand texts that mainly consist of frequently occurring everyday or job-related language(3) enter spontaneously (unprepared) into conversation on topics that are familiar, of personal interest or pertinent to

everyday life (e.g. family, hobbies, work, travel and current events).(4) connect phrases in a simple way in order to describe experiences and events, dreams, hopes and ambitions.(5) briefly give reasons and explanations for opinions and plans.(6) write simple connected text on topics which are familiar or of personal interest.(7) write a 5-paragraph essay to argue for or against an issue.

Assessment

Method No PercentageMidterm Exam(s) 1 25%Writing tasks 5 10 %Moodle Tasks - 10 %Essay - 15%Presentation - 10%Final Examination 30%



to improve and develop English language skills and knowledge within an academic context. to improve and develop academic study skills and knowledge of academic conventions. to improve and develop critical thinking skills. to develop interest in and knowledge of a wide range of academic issues across the curriculum, and to develop an

understanding of interdisciplinary links. to develop an autonomous and self-directed approach to learning. to develop skills in exploiting computers both as a study resource and as a tool for producing professionally

presented work.

Prepared by: Instructor Metin Mavioglu Date Prepared: 30 April 2010

ENGL192- Communication in English II Department: Department of General EducationProgram Name: Department of General Education Program Code: 4A


Credits: 3Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): ENGL191

Catalog Description: This course is designed to further help students improve their English to B2 level, as specified in the Common European Framework of References for Languages. The course aims to reconsolidate and develop students’ knowledge and awareness of academic discourse, language structures, and critical thinking. The course incorporates more technologies on MOODLE that will promote self study and Microsoft computer skills. The course will focus on reading, writing, listening, speaking and emphasizing documentation and presentation skills in academic settings.

Course Web Page: http://gemoodle.emu.edu.tr/ENGL 192

Textbook(s): Cox, K. & Hill, D. (2007). English for Academic Purposes (EAP) Now! Preliminary (Students’ Book). Australia: Pearson Longman Indicative Reading List :NoneTopics Covered and Class Schedule:(3 hours of lectures per week)

Week 1 INTRODUCTION TO THE COURSE Week 2 Unit 7: Media

Language spotlight pp. 77-79: (Optional) Longer noun groupsOpinion Paragraph Practice and Production

Week 3 Unit 7: MediaSpeaking 1 p.74 Task A: The range of media (vocab about Media)Reading pp.74- 77 Task A: identifying text types: cohesion – advice and instructional texts; Task B: Meaning behind the words; Task C : 5 questions for any text ; Task C: Cohesion

Week 4 Sample Report How to prepare an outlineHow To Write a Thesis Statement Input for writing a proposal

Week 5 Unit 12: The worldSpeaking p. 138 Task A: Building the field, the worldReading pp. 138-141 Task A: Skimming, scanning and note-taking; finding meaning from context

Week 6 Unit 12: The world (continued)Language Spotlight 1 p. 142-145 Task A: Unpacking nominals, Review of genres; matching genres to tasks; Task B: Matching genres to task Task C: Writing an opinion paragraph (exam practice-needs adjustments)

Week 7 Midterm Exam PracticeWeek 8 Supplementary Reading Material Exam FitnessWeeks 8-9 Midterm ExaminationsWeek 10 INPUT for Quoting/Paraphrasing and ReferencingWeek 11 REPORT WRITING (Draft Writing) Week 12 Reading Exam Practice (Extra material)

Opinion Essay Input & Practice (Extra material)Unit 8: Art (Optional) Speaking p.86 Task A: Discussion and vocab about artReading pp.88- 89 Task A: 5 Questions Reading 2 pp.91-93 Task A : An article Task B: Scanning Writing p.95 Task A: Writing a review Unit 9: Architecture (Optional)

Week 13 PRESENTATION INPUTPRESENTATIONS

Week 14 PRESENTATIONSWeek 16 Final Exam Week


On successful completion of the course, students will be able to (3) identifying the function and purpose of such text types as procedural text, information and review(4) organizing two formal essay types (information report, opinion) (5) preparing an academic presentation. (6) writing a clear detailed text using three sources (soft/printed copies). (7) identifying the main idea and specific information in any theme based texts. (8) identifying cues and inferring meaning from variety of texts.

Assessment

Method No PercentageMidterm Exam(s) 1 25%Process Writing (s) 4 25%Moodle Task(s) 6 10%Presentation 1 10%Final Examination 1 30%



improve and develop English language skills and knowledge within an academic context. improve and develop academic study skills and knowledge of academic conventions. improve and develop critical thinking skills. develop interest in and knowledge of a wide range of academic issues across the curriculum, and to develop an

understanding of interdisciplinary links. improve and develop English language skills and knowledge within the specific context of individual faculties or

schools. develop an autonomous and self-directed approach to learning. develop skills in exploiting computers both as a study resource and as a tool for producing professionally

presented work.

Prepared by: Instructor Ayse Onut Date Prepared: 30 April 2010

ENGL201 - Communication Skills in English Department: Department of General EducationProgram Name: Department of General Education Program Code: 4A


Credits: 3Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s):

NoneCatalog Description: 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.

Course Web Page: http://gemoodle.emu.edu.tr/ENGL201

Textbook(s): Compiled Course Materials Pack. (2004). Technical Report Writing (3 rd Edition) . Indicative Reading List :None


Week 1 Introduction to Communication Skills I Introduction to Model Report

Narrowing down a research topicWeek 2 Finding and Searching Information Sources

Choosing a Report TopicWeek 3 ReferencesWeek 4 Proposal and OutlineWeek 5 QuotingWeek 6 ParaphrasingWeek 7 Figures and TablesWeek 8 RevisionWeeks 9-10 Midterm Examinations

Week 11 Introduction Report layout

Week 12 Body Part I Week 13 Body Part II

Week 14 Conclusion Abstract

Week 15 Oral presentation input

Week 16 Final Examinations


On successful completion of this course, all students will have developed knowledge and understanding of: Identifying the main idea and specific information in a text taken from a technical report. Identifying misplaced headings in an outline.

Quoting and paraphrasing given texts and citing appropriate to the APA conventions. Producing an outline, proposal, introduction, main body, conclusion and abstract according to the specific academic

conventions. Recognizing and correcting mistakes in references. Interpreting and summarizing graphs, diagrams and tables using appropriate language.

On successful completion of this course, all students will have developed their skills in: Researching on a chosen technical topic using computers, multimedia and published sources. Writing relevant notes from published or online texts, capturing facts, concepts, and relationships between ideas. Planning, drafting and writing a technical report in the appropriate format which provides only occasional difficulties

for the reader, and which conforms to academic conventions in presentation, referencing and citation. Giving a clear presentation on a technical topic, answering predicatable and factual questions, and showing the ability

to reformulate where necessary and make use of visual aids and multimedia to illustrate their presentation.

Assessment

Method No PercentageMidterm Exam(s) 1 10%Portfolio (33% Drafts, 20% Final Version of Written Report) 1 53%Tasks 5 15%Final Examination 1 22%



Prepared by: Instructor Pembe Tinazci Date Prepared: 16 April 2010

MATH151 - Calculus I Department: Department of MathematicsProgram Name: Mathematics Program Code: 41

Course Number: MATH151

Credits: 4 Cr



Catalog Description: 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.Course Web Page: http://brahms.emu.edu.tr/calculus Textbook(s): Robert A. Adams., Calculus, A Complete Course, Seventh Edition, Pearson Addison-Wesley Publishing Co.Indicative Reading List :


Week 1 First meeting with the students. (Informing the students) (2 hour)Week 2 Section 1.2 Limits of Functions, One-Sided Limits, Rules for Calculating Limits,

Section 1.3 Limits at Infinity, Limits at Infinity for Rational Functions, Infinite Limits (1 hour)Section 1.4 Continuity at a point, Continuity on an Interval, There are Lots of Cont. Functions

Week 3 Section 1.4 Continuous Functions on Closed Finite Intervals, Intermediate-Value Theorem Section 2.1& 2.2 Tangent Lines and Their Slopes, Normal Lines, The Derivative, Section 2.3 Differentiation Rules, Sums and Constant Multiples, Product Rule, Reciprocal RuleSection 2.4 The Chain Rule, Building the Chain Rule into Differentiation Formulas

Week 4 Section 2.5 Derivatives of Trigonometric Functions, Some Special Limits, Derivatives of Cosine and Sine, Derivatives of Other Trigonometric Functions Section 2.6 & 2.8 The Mean Value Theorem, Increasing and Decreasing FunctionsSection 2.9 Implicit Differentiation, The General Power RuleSection 3.1 Inverse Functions, Inverting Non-One-to-One Functions

Week 5 Section 3.2 Exponential and Logarithmic Functions (1 hour) Section 3.3 The Natural Logarithm, The Exponential Function

General Exponentials and Logarithms (2 hours), Logarithmic Differentiation (1 hour)Week 6 Section 3.5 Inverse Trigonometric Functions (2 hours)

Section 4.1 Related Rates (1 hour)Section 4.3 Indeterminate Forms, L’Hopital’s Rule (1 hour)

Weeks 7 Section 4.3 Indeterminate Forms, L’Hopital’s Rule (1 hour)Section 4.4 Extreme Values, Maximum and Minimum Values, Critical Points, Singular Points and Endpoints, Finding Absolute Section 4.5 Concavity and Inflections, Second Derivative Test (1 hour)

Week 8 Section 4.6 Sketching the Graph of a Function, Asymptotes (2 hours)Section 4.8 Extreme Value Problems (1 hour)Section 4.9 Linear Approximations, Approximating Values of Functions (1 hour)

Week 9 MIDTERM EXAMINATIONS Weeks 10 Section 2.10 Antiderivatives, The Indefinite Integral (1 hour)

Section 5.3 & 5.4 The Definite Integral, Properties of the Definite IntegralWeek 11 Section 5.5 The Fundamental Theorem of Calculus (2 hours)

Section 5.6 Method of Substitution (1 hour)Section 5.6 Trigonometric Integrals (1 hours)

Week 12 Section 5.7 Areas of Plane Curves, Areas Between Curves (2 hours)Section 6.1 Integration by Parts, (2 hours)

Week 13 Section 6.2 Integrals of Rational Functions, Linear and Quadratic Denominators, Partial FractionsSection 6.3 Inverse Substitutions, Inverse Trigonometric Substitutions, Completing the Square

Week 14 Section 6.5 Improper Integrals of Type I and Type II(2 hours)

Week 15 Section 7.1 & 7.2 Solids of Revolution,Disk and shell technique (2 hours)Section 7.3 Arc Length, Surface Area (2 hour)

Week 16 FINAL EXAMINATIONS Course Learning Outcomes: On successful completion of the course, the students should be able to:

1. recognize properties of functions and their inverses;2. recall and use properties of polynomials, rational functions, exponential, logarithmic, trigonometric and inverse-

trigonometric functions;3. explain the terms domain and range;4. sketch graphs, using function, its first derivative, and the second derivative;5. use the algebra of limits, and l’Hôspital’s rule to determine limits of simple expressions;6. apply the procedures of differentiation accurately, including implicit and logarithmic differentiation;7. apply the differentiation procedures to solve related rates and extreme value problems;8. obtain the linear approximations of functions and to approximate the values of functions;9. perform accurately definite and indefinite integration, using parts, substitution, inverse substitution;10. explain the procedures for integrating rational functions;11. perform accurately improper integrals;12. calculate the volumes of solid objects, the length of arcs and the surface area;13. Perform polar-to-rectangular and rectangular-to-polar conversions.

Assessment

Method No PercentageMidterm Exam(s) 1 30%Assignment 10 10%Quizzes 5 20%Final Examination 1 40%




The Development of calculus in the 17th Century represents one of the greatest intellectual accomplishments in human history. Today, calculus provides students with necessary foundation, understanding and skills that are needed to be successful in college courses such as physics, chemistry, engineering and business. The objective of this course is to introduce the fundamental ideas of the differential and integral calculus of functions of one variable.

Prepared by: Lecturer Ersin Kuset Bodur Date Prepared: 30 April 2010

MATH152 - Calculus II Department: Department of MathematicsProgram Name: Mathematics Program Code: 41


Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): MATH151Catalog Description: Sequences, Infinite series, Geometric series, Power series, Taylor & Maclaurin series and Binomial series, Lines and planes,

Functions of several variables, Limits and Continuity, Partial Differentiation, Chain Rule, Tangent plane, Critical points, Global and Local Extrema, Directional Derivatives, Gradient, Divergence and Curl, Multiple integrals with applications, Triple integrals with applications, Triple integrals in Cylindrical and Spherical coordinates, Line-, Surface- and Volume Integrals, Independence of path, Green’s Theorem, Conservative Vector Fields, Divergence Theorem, Stoke’s Theorem.Course Web Page: http://brahms.emu.edu.tr/calculus Textbook(s): Robert A. Adams., Calculus, A Complete Course, Seventh Edition, Pearson Addison-Wesley Publishing Co.Indicative Reading List :


Week 1 Registration with advisorsFirst meeting. (Introducing the course to the students) (1 hour)

Week 2 Section 9.1 Sequences and Convergence, Convergence of Sequences (2 hours)Section 9.2 Infinite Series: Geometric series, Telescoping Series and Harmonic Series,

Week 3 Section 9.3 Convergence Tests for Positive Series: The Integral Test, Comparison Tests, Section 9.4 Absolute and Conditional Convergence: Alternating Series Test, Power Series

Week 4 Section 9.6 Taylor and Maclaurin Series: Maclaurin Series for Some Elementary Functions Section 9.7 Applications of Taylor and Maclaurin Series:

Week 5 Section 10.3 The Cross Product in 3-Space: Determinants, Cross Product as a Determinant (1 hour)Section 10.4 Planes and Lines: Planes in 3-Space, Lines in 3-Space, Distances Quadric Surfaces Section 11.1 Vector Functions of One Variable: Differentiating Combinations of Vectors (1 hour)Section 11.3 Curves and Parametrizations: Arc Length (1 hour)

Week 6 Section 12.1 Functions of Several Variables: Graphs, Level Curves Limits and Continuity: Section 12.3 Partial Derivatives: Tangent Planes and Normal Lines Higher-Order Derivatives

Weeks 7 Section 12.5 The Chain Rule, Gradients and Directional Derivatives: Directional DerivativesWeek 8 Section 13.1 Extreme Values: Classifying Critical Points , Double Integrals: Properties of Double

Integrals , Iteration of Double Integrals in Cartesian Coord.Weeks 9-10 MIDTERM EXAMINATIONS Week 11 Section 14.4 Double Integrals in Polar Coordinates, Change of variables in Double Integrals

Section 14.5 Triple Integrals, Change of Variables in Triple Integrals: Cylindrical Coordinates

Week 12 Section 15.2 Conservative Fields, Line Integrals: Evaluating Line Integrals (2 hours)Section 15.4 Line Integrals of Vector Fields: Independence of Path (1 hour)

Week 13 Section 15.5 Surfaces and Surface Integrals: Surface Integrals, Smooth Surfaces,Section 15.6 Oriented Surfaces and Flux Integrals: Oriented Surfaces

Week 14 Section 16.1 Gradient, Divergence and Curl: (1 hour)Section 16.2 Some Identities Involving Grad, Div, and Curl: (1 hour)

Week 15 Section 16.3 Green’s Theorem in the Plane: The Two-Dimensional Divergence Theorem (1 hour)Section 16.4 The Divergence Theorem in 3-Space: Stoke’s Theorem (2 hours)

Week 16 FINAL EXAMINATIONS Course Learning Outcomes: On succesful completion of the course, the students should be able to:

1. Explain the notion of a sequence, its basic properties, and the concept of a limit of a sequence; 2. Distinguish between convergent and divergent sequences and calculate limits of convergent sequences; 3. Explain the meaning of an infinite series, its partial sum and compute sums of special series;

4. Recall and apply correctly tests for convergence of positive numerical series; 5. Explain the notions of absolute and conditional convergence and apply the alternating series test whenever

appropriate; 6. Find the radius and the interval of convergence of a power series, indicating at which points the series converges

absolutely/conditionally; 7. Construct Taylor and Maclaurin series for a given function; 8. Use Taylor and Maclaurin series for approximation of functions and estimate the error; 9. Use power series to calculate limits; 10. Describe and apply two and three dimensional Cartesian coordinate system; 11. Recognize and classify the equations and shapes of quadratic surfaces; 12. Use the properties of vectors and operations with vectors; 13. Recognize and construct the equations of lines and planes; 14. Operate with vector functions, find their derivatives and integrals, find the arc length; 15. Understand and use the concept of a function of several variables, find it’s domain; 16. Calculate the limits of multivariable functions and prove the nonexistence of a limit; 17. Find partial derivatives using the properties of differentiable multivariable functions and basic rules; 18. Use partial derivatives for finding equations of tangent planes, normal lines, and for extreme values;

19. Evaluate double integrals in Cartesian and polar coordinates and triple integrals in Cartesian and cylindrical coordinates;

Assessment

Method No PercentageMidterm Exam(s) 1 30%Assignment 10 10%Quizzes 5 20%Final Examination 1 40%


Mathematics & Basic Science : 4Engineering Sciences and Design : 0 General Education : 0 Relationship of Course to Program OutcomesCalculus was first invented to meet the mathematical needs of scientists of the sixteenth and seventeenth centuries, needs that mainly mechanical in nature. Nowadays it is a tool used almost everywhere in the modern world to describe change and motion. Its use is widespread in science, engineering, medicine, business, industry, and many other fields. Calculus also provides important tools in understanding functions and has led to the development of new areas of mathematics including real and complex analysis, topology, and non-euclidean geometry. The objective of this course is to introduce the fundamental ideas of the differential and integral calculus of functions of several variables.Prepared by: Instructor A. Bashirov Date Prepared: 30 April 2010

MATH163-Discrete Mathematics Department: Department of MathematicsProgram Name: Mathematics Program Code: 41


Credits: 3Cr




The main aim of this course is to provide students with an introductory comprehensive overview of basic concepts of discrete mathematics. Fundamental ideas of discrete mathematics are presented that find applications in a number of disciplines on their own and/or serve as preparation for more advanced courses in mathematics and computer science.Course Web Page:

Textbook(s): Goodaire E. G., Parmenter M. M., Discrete Mathematics with Graph Theory, Prentice Hall, 2006.Ross, A. K., Wright, C. R. B., Discrete Mathematics, Prentice Hall, 1999.Indicative Reading List :

Topics Covered and Class Schedule:(4 hours of lectures per week)Week 1

Sets, operations on setsWeek 2 Binary relations, equivalence relations, partial orders, Hasse diagramWeek 3 Functions. Domain, range, one-to-one, onto functions

Week 4 One-to-one correspondence. Inverses and composition. The Cardinality of a SetWeek 5 Basic boolean functions, digital logic gates, minterm and maxterm expansions

Week 6 The basic theorems of boolean algebra, simplifying boolean functions with Karnaugh maps

Week 7 Mathematical induction, recursively defined sequences

Weeks 8- 9 Midterm ExaminationsWeek 10 The Principle of Inclusion-ExclusionWeek 11 The Addition and Multiplication rules. The Pigeon-Hole Principle. Permutations, combinations.Week 12

Repetitions, derangements. The Binomial TheoremWeek 13 Graphs and trees. Definitions and basic properties, isomorphism, Eulerian circuits, Hamiltonian

cycles, adjacency matrixWeek 14 Properties of trees, spanning trees, minimal spanning trees.

Week 15 Kruskal’s and Prim’s algorithms


Course Learning Outcomes: On succesful completion of the course, the students should be able to:

14. define sets and to perform operations on sets;15. recognize binary relations and types of functions; 16. describe Boolean algebra and its relation to logical circuits; 17. use mathematical induction and the pigeon-hole principle to prove various statements involving natural numbers;18. use basic counting techniques such as permutations, combinations, the principle of inclusion and exclusion to

enumerate elements of finite sets; 19. recall basic definitions for graphs;20. identify basic properties of graphs;21. recall the definitions of some famous problems formulated on graphs such as the existence of Euler-cıircuit and

Hamilton-circuit;22. identify trees and recall basic properties of trees;

23. apply elementary algorithms on trees such as walking on trees, finding a minimal spanning tree of a graph.

Assessment

Method No PercentageMidterm Exam(s) 2 30%Quizzes - 30%Final Examination 1 40%



Prepared by: Instructor R. Aliyev Date Prepared: 16 April 2010

MATH241-Ordinary Differential Equations and Linear Algebra Department: Department of MathematicsProgram Name: Mathematics Program Code: 41


Credits: 4Cr



Catalog Description: Systems of linear equations, elementary row operations, echelon form, Gaussian elimination method; Matrices;

Determinants, adjoint and inverse matrices, Cramer’s rule; Vector spaces, linear independence, bases and dimension, eigen value problem.First-order differential equations, separable differential equations, change of variables, exact differential equations; Second-order differential equations, the method of undetermined coefficients, the variation of parameters method; General results of first-order linear systems, homogeneous constant coefficient vector differential equations, variations of parameters for linear systems; Laplace transform method.Course Web Page: http://brahms.emu.edu.tr/math241 Textbook(s): Stephen W. Goode & Scott A. Annin, Differential Equations and Linear Algebra, (3rd edition), Prentice Hall, 2007Or: Stephen W. Goode, Differential Equations and Linear Algebra, (2nd edition), Prentice Hall, 2002Indicative Reading List :Steven J. Leon, Linear Algebra with Application, Pearson Education, 2006.S. Alpay & A. Erkip, Ordinary Differential Equations, METU, 1992.H. Anton & C. Rorres, Elementary Linear Algebra (Applications version), Wiley, 1994.Shepley L. Ross, Introduction to Ordinary Differential Equations, Wiley, 1989.

Topics Covered and Class Schedule:(4 hours of lectures per week)Week 1 First meeting to understand the course description

Matrices and Systems of Linear Equations

Week 2 Terminology and notation for systems of linear equations, Elementary row operations and row echelon matrices, Gaussian elimination, The inverse of a square matrix

Week 3 Determinants, Vector SpacesWeek 4 Subspaces, Spanning sets, Linear dependence and linear independence, Bases and dimension Week 5 Row space and column space, The rank-nullity theorem , Linear Transformations, The

eigenvalue/eigenvector problem Week 6 General results for eigenvalues and eigenvectors, Diagonalization, Orthogonal diagonalization and

quadratic forms

Week 7 First-Order Differential Equations

Weeks 8- 9 Midterm ExaminationsWeek 10 Change of Variables, Exact Differential equations, Linear Differential Equations of Order nWeek 11 Constant-coefficient homogeneous linear differential, equations, The method of undetermined

coefficients, The Variation of Parameters Method, A differential equation with nonconstant coefficients

Week 12 The Laplace transform methodWeek 13 Systems of Differential EquationsWeek 14 Homogeneous constant coefficient VDE: nondefective coefficient matrix, Homogeneous constant ,

coefficient VDE: defective coefficient Matrix, Variation-of-parameters for linear systemsWeek 15 Final ExaminationsCourse Learning Outcomes:

On succesful completion of the course, the students should be able to:20. Understand the applications of Matrices21. Gain basic skills to solve systems of linear equations22. Understand the concepts of vector space, subspace, linear independence23. Solve eigenvalue/eigenvector problems24. Solve the first and the second-order linear differential equations

25. Understand the use of Laplace transforms in solving differential equations26. Solve systems of first-order linear differential equations27. Realize how to use matrices and differential equations in solving engineering problems

AssessmentMethod No PercentageMidterm Exam(s) 2 50%Final Examination 1 50%



There are two objectives of this course: the first, to understand the basic concepts and skills of linear algebra which are required for simple applications in science and engineering problems, and the second, to learn some elementary methods for solving first and second-order differential equations, and apply linear algebra to solve first-order systems of linear differential equations.

Prepared by: Instructor P. Zang Date Prepared: 16 April 2010

MATH322 - Probability and Statistical Methods Department: Department of MathematicsProgram Name: Mathematics Program Code: 41


Credits: 3Cr




Course Web Page:

http://brahms.emu.edu.tr/Math322 Textbook(s): R.E.Walpole, R.H.Myers, S.L.Myers, K. Ye, Probability and Statistics for Engineers and Scientists, 8th ed., Prentice Hall, 2002.

Indicative Reading List :R. Johnson, Miller’s & Freund’s, Probability and Statistics for Engineers, Int. ed., Pearson Prentice Hall, 2005.

R. L. Scheaffer, J. T. McClave, Probability ad Statistics for Engineers, 3rd ed., PWS-Kent Publishing Company, Boston, 1990


Week 1 1.1 Overview: Statistical Inferences, Samples, Populations, Experimental Design.

Week 2 1.4. Measures of Location: The Sample Mean and Median. 1.5. Measures of Variability, Sample Variance. 1.8. Graphical Methods and Data Description,Mean and Variance of Grouped Data.

Week 3 2.1. Sample Space.2.2. Events2.3. Counting Sample Points: Counting Methods.

Week 4 2.4. Probability of an Event.2.5. Additive Rules. 2.6. Conditional Probability.

Week 5 2.7. Multiplicative Rules.2.8. Bayes’ Rule

Week 6 3.1. Concept of Random Variable 3.2. Discrete Probability Distributions3.3. Continuous Probability Distributions

Weeks 73.4. Joint Probability Distributions 4.1. Mean of Random Variable 4.2. Variance and Covariance

Weeks 8 4.3. Means and Variances of Linear Combinations of Random Variables 5.3. Binomial and Multinomial Distribution

Weeks 9 Midterm ExaminationsWeek 10 5.4. Hypergeometric Distribution.. Week 11 5.5. Poisson Distribution and Poisson Process

6.2. Normal Distribution 6.3. Areas under the Normal Curve..

Week 12 6.4. Applications of Normal Distribution.6.5. Normal Approximation to Binomial 8.1. Random Sampling.

Week 13 8.2. Some Important Statistics.(Review)8.4. Sampling Distributions. 8.5. Sampling Distributions of Means..

Week 14 8.7. t-Distribution.8.6. Sampling Distribution of S29.3. Classical Methods of Estimation

Week 15 9.4. Single Sample: Estimating the Mean.9.5. Standard Error of a Point Estimator.

http://brahms.emu.edu.tr/Math322

9.12. Single Sample: Estimating the Variance.Review

Week 16 Final ExaminationsCourse Learning Outcomes:

-

Assessment

Method No PercentageMidterm Exam(s) 1 40%Participation - 10%Final Examination 1 50%


Mathematics & Basic Science : 3Engineering Sciences and Design : General Education : 0

Relationship of Course to Program OutcomesThe main aim of this course is to provide students with an introductory yet comprehensive overview of probabilistic concepts and statistical methods. It also provides students an opportunity to be able to use concepts from the text to solve problems dealing with many real-life scientific and engineering situations.

Prepared by: Instructor P. Sabancigil Date Prepared: 30 April 2010

MATH373 - Numerical Analysis for Engineers Department: Department of MathematicsProgram Name: Mathematics Program Code: 41


Credits: 3Cr



Catalog Description: Numerical error. Solution of nonlinear equations. Convergence. Solution of linear systems of equations: direct and iterative methods. Interpolation. Curve fitting. Numerical differentiation and integration.

Course Web Page:

Textbook(s): John H. Mathews: Numerical Methods for Mathematics, Science and Engineering, Prentice Hall, 1999. Indicative Reading List :None


Week 1 Roots of Equations,Locating the roots graphically an analytically, Bisection Method, False Position Method

Week 2 Fixed Point Iterative Method, Newton's Method, Order of the methodsWeek 3 Fixed Point Method, Newton’s MethodWeek 4 Iterative Methods (Jacobi, Gauss-Seidel, SOR)Week 5 LU Decomposition Method,Gauss Elimination MethodWeek 6 Lagrange Interpolation Polynomial, Equispaced InterpolationWeeks 7 Least Squares, Least Squares Polynomial FittingWeeks 8 Nonlinear Curve FittingWeeks 9 Midterm ExaminationsWeek 10 Calculus of Finite DifferencesWeek 11 Errors and Approximation of DerivativesWeek 12 Quadrature, Trapezoidal, Simpson's Formulas,Week 13 Composite Integration FormulasWeek 14 Explicit Methods, Implicit MethodsWeek 15 Runge Kutta type implicit methodsWeek 16 Final Examinations

Course Learning Outcomes:On completion of this module, student should be able to:

1. write basic Matlab programs to solve the problems encountered in the course;2. know the difference between an approximate and an exact solution of a problem, and the definition of absolute and

relative errors;3. determine the root(s) of a nonlinear equation using the Bisection method , Regula Falsi method , fixed point

iteration method , Newton's method and the Secant method;4. state and prove the conditions under which the sequence converges to a unique root of the equation

x=g(x);5. determine the order of an iterative process for computing the root of an equation;6. solve nonlinear systems of equations using fixed point and Newton’s methods;7. Solve simultaneously sets of linear algebraic equations using Gauss Elimination, LU Decomposition, Jacobi , Gauss-

Siedel and the SOR methods;8. construct an interpolating polynomial using either the Lagrange or Newton formula, and describe their relative

advantages and disadvantages;9. prove the error formula for Lagrange interpolation;10. construct divided difference tables for prescribed data;

11. solve numerical differentiation problems using suitable numerical differentiation formulas;12. derive the trapezoidal and Simpson's rules for approximating an integral;13. derive the error term for the trapezoidal and Simpson’ rules;14. solve Ordinary Differential Equation problems using Euler’s, Heun’s and Runge Kutta methods

Assessment

Method No PercentageMidterm Exam(s) 2 50%Quizzes +Homework - 10%Final Examination 1 40%



This course is an introduction to a broad range of numerical methods for solving mathematical problems that arise in computational science, engineering and mathematics. The goal of this course is to provide you with an understanding of some basic numerical methods so that you are able to choose appropriate techniques for solving problems and are able to interpret the results. To achieve this goal, you will be required to use MATLAB to implement numerical techniques and to study their properties.

Prepared by: Asst. Prof. Dr. Mehmet Bozer Date Prepared: 30 April 2010

PHYS101 - Physics I Department: Department of PhysicsProgram Name: Physics Program Code: 42

Course Number: PHYS101

Credits: 4 Cr



Catalog Description: Physical quantities, units and dimensions. Motion in one, two and three dimensions. Newton's laws of motion. Work-energy, momentum and collisions, conservation of energy and momentum. Rotational motion. Static equilibrium.Course Web Page: http://www.emu.edu.tr/mugp101

Textbook(s):

Giancoli D. C., Physics for Scientists & Engineers, 4th EditionIndicative Basic Reading List :


Week 1 Chapter 1 – Introduction, Measurement, Estimating (Sections 3-5, 7)Weeks 2-4 Chapter 2 – Describing Motion: Kinematics in One Dimension (Sections 1-7)

Chapter 3 – Kinematics in Two or Three Dimensions; Vectors (Sections 1-8)Week 5 Chapter 4 – Dynamics: Newton’s Laws of Motion (Sections 1-8)Week 6 Chapter 5 – Using Newton’s Laws: Friction, Circular Motion, Drag Forces (Sections 1-5)Week 7 Chapter 6 – Gravitation and Newton’s Synthesis (Sections 1-4, 7)Week 8 Chapter 7 – Work and Energy (Sections 1-4)Weeks 9-10 MIDTERM I

Week 11 Chapter 8 – Conservation of Energy (Sections 1-8)Week 12 Chapter 9 – Linear Momentum (Sections 1-7)Weeks 13-14 Chapter 10 – Rotational Motion (Sections 1-6, 8)

Chapter 11 – Angular Momentum; General Rotation (Sections 1,2) Week 15 Chapter 12 – Static Equilibrium; Elasticity and Fracture (Sections 1-3)Weeks 16-18 Final Examination Laboratory Schedule:(2 hours of laboratory per week)

GROUP PERIOD LAB 1 LAB 2 LAB 3 LAB 4 LAB 501 5/6 04 March 18 March 01 April 29 April 13 May02 3/4 02 March 16 March 30 March 27 April 11 May03 1/2 03 March 17 March 31 March 28 April 12 May04 3/4 01 March 15 March 29 March 26 April 10 May05 7/8 02 March 16 March 30 March 27 April 11 May06 5/6 01 March 15 March 29 March 26 April 10 May07 5/6 08 March 22 March 05 April 03 May 17 May


On successful completion of this course, all students will have developed knowledge and understanding of:1. The concepts, theories, techniques and generalizing principles of classical mechanics;2. The mathematical forms of the laws and physical relationships in classical mechanics and their application in

solving problems.3. Diagrammatic and graphical representation of physics problems and physical data.4. Validation of theory through experiment/observation.

On successful completion of this course, all students will have developed their skills in:

1. Correctly using symbols and units;2. Analytically/critically applying the theoretical concepts and methods of mechanics covered in the course, and

formulating appropriate equations to solve problems;3. Using efficiently and effectively the textbook and other printed/electronic literature relevant to the course;4. Performing scripted experiments as a team, analyzing and evaluating the data, and writing lab reports;5. Using good scientific English for written and oral communication.

All students will have developed their appreciation of, and respect for values and attitudes to:

1. The discipline of physics as a fundamental branch of science that provides qualitative and quantitative

explanations about the physical world;2. Being an open-minded, curious, creative and reasoned skeptic;3. Being aware of ethical issues in science.

Assessment

Method No PercentageMidterm Exam(s) 1 25%Lab Work(s) 5 15%Quizzes 2 20%Participation to Lectures - 5%Final Examination 1 45%



To introduce the fundamental concepts of motion necessary for engineering science and provide essential background for engineering students.

To provide students with a deeper understanding of fundamental laws and concepts of natural phenomena. To improve students’ problem solving skills. To strengthen students’ creative and systematic thinking capability.

Prepared by: Assoc. Prof. Dr. Dizem Arifler Date Prepared: 30 April 2010

PHYS102 - Physics II Department: Department of PhysicsProgram Name: Physics Program Code: 42

Course Number: PHYS102

Credits: 4 Cr


Required Course Elective Course (click on and check the appropriate box) Prerequisite(s): PHYS101

Catalog Description: The concepts of thermal physics, first and second law of thermodynamics. Problems of electrostatics involving electric fields, electric flux, Gauss’s law and electric potential. Problems of electrodynamics concerning the magnetic force, magnetic fields, magnetic flux and Faraday’s law.Course Web Page: http://www.emu.edu.tr/mugp102

Textbook(s):

Giancoli D. C., Physics for Scientists & Engineers, 4th EditionRecommended Reading List :Serway , Physics for Scientists and Engineers With Modern Physics, 5 th EditionHalliday and Resnick, Fundamentals of Physics


Week 1 Kinetic theory of gases Chapter 18(1) (2 classes)

Week 2 Heat and the first law of thermodynamics Chapter 19(1,2,3,4,5,6,7,8,9,10)(6 classes)

Week 3Week 4 Second law of thermodynamics Chapter 20(1,2,3,4,5,6)(4 classes)

Week 5Week 6 Electric charge and electric field Chapter 21(1,2,3,4,5,6,7,8,9,10)(6 classes)

Weeks 7Week 8Week 9 MIDTERM IWeeks 10 Gauss’s law Chapter 22(1,2,3) (6 classes)

Week 11 Electric Potential Chapter 23(1,2,3,4,5,7,8) (4 classes)

Week 12 Magnetism Chapter 27(1,2,3,4) (4 classes)

Week 13Week 14 Sources of magnetic field Chapter 28(1,2,4,6) (6 classes)

Week 15 Electromagnetic induction and Faraday’s law Chapter 29(1,2,3) (4 classes)

Week 16 FINAL


GROUP PERIOD LAB 1 LAB 2 LAB 3 LAB 4 LAB 501 5/6 04 March 18 March 01 April 29 April 13 May 02 3/4 02 March 16 March 30 March 27 April 11 May03 3/4 01 March 15 March 29 March 26 April 10 May04 1/2 03 March 17 March 31 March 28 April 12 May05 7/8 02 March 16 March 30 March 27 April 11 May06 1/2 04 March 18 March 01 April 29 April 13 May


On successful completion of this course, all students will have developed knowledge and understanding of:1. the basic concepts of thermal physics and electricity & magnetism;2. the mathematical modelling of the problems and their analytic solutions;3. the connection of the taught material to engineering applications;4. validation of theory through experiment/observation.

On successful completion of this course, all students will have developed their skills in:1. combining the related physical concepts with the mathematics.2. thinking critically and performing necessary analytic calculations in a logical order.3. performing scripted experiments as a team, analysing and evaluating the data, and writing lab reports.

On successful completion of this course, all students will have developed their appreciation of, and respect for values and attitudes to:1. the discipline of physics as a fundamental branch of science that provides qualitative and quantitative explanations about the

physical world;2. being an open minded, curious, creative and reasoned sceptic;3. being aware of ethical issues in science.

Assessment

Method No PercentageMidterm Exam(s) 1 25%Lab Work(s) 5 10 %Participation to lectures - 5%Quizzes 2 20%Final Examination 1 45%



To give students the opportunity to obtain a thorough background in basic physics, To give relevant applications related to everyday life to engineering and science students. To provide students with problem solving methodology. To strengthen students creativity and thinking capability.

Prepared by: Prof. Dr. Omar Mustafa Date Prepared: 30 April 2010

TUSL181 - Turkish as a Second Language Department: Department of General EducatioonProgram Name: Modern Languages Division Program Code: 4A

Course Number: TUSL181

Credits: 2Cr



Catalog Description: TUSL 181 is a basic Turkish course introducing the Turkish language. It incorporates all four language skills and provides an introduction to basic grammar structures. Students will be encouraged to develop their writing skills through a variety of tasks. The aim of this course is for students to be able to understand and communicate in everyday situations, both in the classroom and in a Turkish speaking environment.

Course Web Page:

Textbook(s): The textbook (HİTİT 1 Temel – Yabancılar İçin Türkçe Ders Kitabı). All reading material will be provided weekly by the instructor. Indicative Reading List :None


Week 1 Turkish Alphabet, Phonetic Structure of Turkish Language. Meeting and Greetings. Exercises in Pronunciation

Week 2 Vocal Harmony. Plural Suffix. Simple Negative and Interrogative SentencesWeek 3 Adjectives. Exercises in Vocabulary and PronunciationWeek 4 Locative and Ablative Cases. Listening Exercises.Week 5 Numbers. Conjugation of Verbs in Present Simple and Continuous. Conversational Exercises.Week 6 Exercises in Reading and ListeningWeeks 7 Exercises in Listening and SpeakingWeeks 8 Case Endings. Related ExercisesWeeks 9 Midterm ExaminationsWeek 10 The Verb “to be” with Professions and AdjectivesWeek 11 Time Related ExpressionsWeek 12 Reading-Writing-Speaking ExercisesWeek 13 Oral PresentationWeek 14 Cultural Trip to Historical Sites in TRNC and Related Prepared Conversation.


Course Learning Outcomes:-

Assessment

Method No PercentageMidterm Exam(s) 1 25%Quizzes 1 20%Productive Skills - 20%Final Examination 1 35%


Mathematics & Basic Science : 0Engineering Sciences and Design : 0General Education : 2


Prepared by: Instructor Yelda Ilic Date Prepared: 12 April 2010

Documents

· Web viewA1. Department courses. CMPE101 Foundations of Computer Engineering. CMPE112 Programming Fundamentals. CMPE211 Object Oriented Programming. CMPE223 Digital Logic Design