Advanced Computer Architecture 630561First semester, 2007/2008 Course Syllabus Course code: 630561 Course Title: Advanced Computer Architecture Course Level: 5th year Course prerequisite

Page 1 of 4

Philadelphia University Faculty of Engineering

Department of Computer First semester, 2007/2008

Course Syllabus

Course code: 630561 Course Title: Advanced Computer

Architecture

Course prerequisite (s) and/or corequisite (s): 630361 Course Level: 5th year

Credit hours: 3 Lecture Time: 11:00 – 12:00

Academic Staff Specifics

E-mail Address Office

Hours

Office Number and

Location Rank Name

[email protected] Mon.

10-11 Wed.E727

Assistance

ProfessorDr. Lubna Badri

Course module description: The course covers the history of computer architecture design, different components in computer design, and the Instruction Set Architecture design. One of the key mechanisms used to improve the performance of computers is to introduce Parallelism – either at the single instruction level or at the multiple instruction level (program level). One of the instruction level parallelisms (ILP) is Pipelining. Studying pipelining, the hazards faced in pipelining and their solutions are covered. Dynamic scheduling techniques – Scoreboarding and Tomasulo’s algorithm are discussed. Discussion of multiple execution units and multiple issues of instructions and problems encountered. Vector processors (Single Instruction Multiple Data Stream (SIMD) processors), multiprocessors, how memory can be shared between them, how we can keep the memory consistent and how we can synchronize the operations between processors are studied. Then moving on to Memory hierarchy which is another technique used to speed up processors and discuss the various issues arising in the hierarchy is accomplished. Course module objectives:

To provide an understanding of the hardware and software systems required for high performance computer architecture..

Course/ module components • Books (title , author (s), publisher, year of publication)

(Text Book) Computer Architecture: A Quantitative Approach, Third Edition, Hennessy and Patterson, Morgan Kaufmann Publishers, 2003.

A-PDF MERGER DEMO

http://www.a-pdf.com

Page 2 of 4

• Support material (s) (Course website: Includes reference books and Course Notes, and Power Point Slides). http://lbadri.com/index.php?option=com_content&task=view&id=36&Itemid=38

• Study guide (s) • Homework and laboratory guide (s): Listed on the Course website.

Teaching methods: Lectures, tutorials, reports, and problem solving.

Learning outcomes: • Knowledge and understanding

- Basic Understanding of high performance computing classification and their architectures.

- Performance measurement of computer architecture using different types of methods. - Basic understanding of pipelining concepts and its hazard. How to solve the hazards

of pipelining using different types of techniques. - Knowledge of multiprocessors, how memory can be shared between them, how we

can keep the memory consistent and how we can synchronize the operations between processors.

- Memory hierarchy which is another technique used to speed up processors and understand the various issues arising in the hierarchy.

• Cognitive skills (thinking and analysis). - Understand the high performance computing classification and their architectures. - Performance measurement of computer architecture using different types of

methods. - How to solve the hazards of pipelining using different types of techniques. - Understanding and analyzing dynamic scheduling techniques – Scoreboarding and

Tomasulo’s algorithm. Discuss of multiple execution units and multiple issue of instructions and problems encountered.

• Communication skills (personal and academic).

None • Practical and subject specific skills (Transferable Skills).

- Understand how to improve the performance of computers. - Knowledge of multiprocessors, how memory can be shared between them, how we

can keep the memory consistent and how we can synchronize the operations between processors.

- Understand how the memory hierarchy can be used to speed up processors Assessment instruments

• Short reports and/ or presentations, and/ or Short research projects • Quizzes. • Home works • Final examination: 50 marks

Allocation of Marks

Mark Assessment Instruments

20% First exam

20% Second exam

50% Final examination: 50 marks

10% Reports, research projects, Quizzes, Home

works, Projects

100% Total

Page 3 of 4

Documentation and academic honesty • Documentation style (with illustrative examples)

-------------------------------------------------------------------------------------------------------------------- -------------------------------------------------------------------------------------------------------------------- • Protection by copyright • Avoiding plagiarism.

Course/module academic calendar

week

Basic and support material to be

covered

Homework/reports and their due dates

(1) Introduction to Computer Architecture

(2) CPU Performance and Metrics

Report1 Week 3

(3) Instruction Set Architecture

Assingment1 Week 4

(4) Pipelining and Pipelined Processors.

Assingment2 Week 5

(5) Multi-cycle Ops Assingment3 Week 6

(6) First examination

Tutorials, review and study guide of first exam material

Report2 Week 7

(7) Instruction Level

Parallelism, Limits of ILP

(8) Dynamic Scheduling,

Scoreboarding algorithm

and example

Assingment4 Week 9

(9) Dynamic Scheduling,, Tomasulo's Algorithm

Assingment5 Week 10

and example (10) Vector Processors,

Vector architecture &

design

Report3 Week 11

(11) Second examination

Tutorials, review and study guide of second exam material

Assingment6 Week 12

(12) Memory Hierarchy, Introduction to Caches

Assingment7 Week 13

(13) More on Caches, main memory and Virtual Memory.

Assingment8 Week 14

(14) Multiprocessors Assingment9 Week 15

(15) Specimen examination

(Optional)

More Multiprocessors Report4 Week 15

(16) Final Examination

Tutorials, review and study guide of final exam material

Page 4 of 4

Expected workload: On average students need to spend 2 hours of study and preparation for each 50-minute lecture/tutorial. Attendance policy: Absence from lectures and/or tutorials shall not exceed 15%. Students who exceed the 15% limit without a medical or emergency excuse acceptable to and approved by the Dean of the relevant college/faculty shall not be allowed to take the final examination and shall receive a mark of zero for the course. If the excuse is approved by the Dean, the student shall be considered to have withdrawn from the course. Module references Books

1. K. Hwang, “Advanced Computer Architecture: Parallelism, Scalability & Programmability” McGraw Hill Intr. Editions, 1996, ISBN: 0-07-113342-9.

2. M.M. Mano, “Computer System Architecture” 4th edition, Prentice Hall, USA 1997. ISBN: 0-13-175738-5.

3. Modern Processor Design: Fundamentals of Superscalar Design. By J.P. Shen & M.H.Lipasti McGraw Hill, USA 2003.

Web sites http://lbadri.com http://www.personal.kent.edu/~rmuhamma/ComArchitec/ArchitecApplets/dlx.html http://www.personal.kent.edu/~rmuhamma/ComArchitec/ArchitecApplets/pipeline.html

Page 1 of 4



Course Syllabus

Course code: 630452 Course Title: Artificial Intelligence

Course prerequisite (s) and/or co requisite (s):

Discrete Mathematics Course Level: 4th year

Credit hours: 3 Lecture Time: 9:10-10:10



Hours

Office Number and

Location Rank Name

[email protected]:00-14:00

Weekly E-709

Assistant

Prof.

Dr. Mohammed

Mahdi Ali

Course module description:

To cover the principles of artificial intelligence, knowledge acquisition, representation and processing. It covers the design and implementation of intelligent systems and their engineering applications.

Course module objectives: At Completing this module the student should be able to:

• Understand the principles of artificial intelligence • Design and implement microprocessor-based real-time systems • Deal with uncertainty and vague information


Artificial Intelligence: A Guide to Intelligent Systems, By: Michael Negnevitsky, Addison Wesley, UK, 2002, ISBN:0-201-71159-1,www.pearsonedu.com,

Page 2 of 4 • Support material (s) (vcs, acs, etc).

Matlab simulation program.

Teaching methods: Lectures, tutorials, problem solving, and computer aided design and simulation.


- Basic understanding of expert systems. - Basic understanding of Neural networks and fuzzy logic concepts. - To be able to design neuro and fuzyy controllers. • Cognitive skills (thinking and analysis).

- Be able to understand different available architectures of intelligent systems. • Communication skills (personal and academic).

Key aspects of projects presentation are introduced. • Practical and subject specific skills (Transferable Skills).

- The student is able to design some kind's expert systems. - The use of Matlab software package tool will help the student in the design and analysis of

real expert systems.

Assessment instruments


Allocation of Marks


20 First examination

20 Second examination

50 Final examination: 50 marks

10 Reports, research projects, Quizzes, Home

works, Projects

100 Total

Page 3 of 4


There is no specific documentation.


week Basic and support

material to be covered


(1) Introduction (2) Basic elements of expert

systems

(3) Rule Base Design (4) Introduction to Neural -

Nets

(5) Neural Networks "Different Topologies"

(6) First exam.

Error-Back-Propagation Learning Algorithm

HW -1 Due

(7) NN's Engineering Applications

(8) Introduction to Fuzzy Logic

(9) Fuzzy logic System Design

(10) Fuzzy-logic Engineering Applications

(11) Second Exam.

Review HW-2 Due

(12) Uncertainty Management in expert

systems

(13) Basic probability theory (14) Reasoning concepts (15) Certainty factor theory HW-3 Due (16)

Final Examination Review

Page 4 of 4

Expected workload: On average students need to spend 2 hours of study and preparation for each 50-minute lecture/tutorial. Attendance policy: Absence from lectures and/or tutorials shall not exceed 15%. Students who exceed the 15% limit without a medical or emergency excuse acceptable to and approved by the Dean of the relevant college/faculty shall not be allowed to take the final examination and shall receive a mark of zero for the course. If the excuse is approved by the Dean, the student shall be considered to have withdrawn from the course. Module references Books -Peter Jackson, “Introduction to Expert Systems”, 3rd edition, Addison-Wesley, USA 1999, ISBN: 0-201-87686-8 - Edmund C. Payne, & Ropert C. McArthur, "Developing Expert Systems: A Knowledge Engineer's Handbook for Rules & Objects", John Wiley & Sons, USA, 1990. - Jeffrey johnson & Philip Picton, "Concepts in Artificial Intelligence", Butterworth-HeinemannLtd, UK, 1995 - M. Chadwick & J.A. Hannah, "Expert Systems for Personal Computers: an Introduction to Artificial Intelligence", Galgotia Publications Ltd, India, 1997. - Microcomputer Systems: Real-Time Interfacing, Brooks-Cole Publisher, 2000. Websites www.pearsonedu.com, www.booksites.net/negnevitsky

Page 1 of 4


Department of Computer Engineering First semester, 2007/2008

Course Syllabus

Course code: 630203 Course Title: Programming

Language

Course prerequisite (s) and/or corequisite (s):

computer skills (2) Course Level: second year

Credit hours: 3 Lecture Time: Sun, Tue, Thurs @

10:10



Hours

Office Number and

Location Rank Name

[email protected]

Sun

11:00-

14:00,

Mon

10:00 –

11:00

room 715 Eng. Anis Nazer

Course module description: This course introduces the basic principals of structured and object oriented programming. Students will learn and practice the application of these programming principles to the solution of engineering problems using the C++ high-level programming language. Course module objectives: Upon completing this module the student should be able to:

- Understand the programming fundamentals. - Develop algorithms. - Understand and write searching and sorting algorithms. - Use Functions, strings and pointers.

Course/ module components Textook: C++ How to program, By: H.M.Deitel and P.J. Deitel, 5th ed. Prentice Hall. Course website: anis.nazer.googlepages.com/c.html

Page 2 of 4 Teaching methods: Lectures: three lectures per week Tutorial: one hour per week (optional) Homeworks: 7-8 homework assignments Learning outcomes: • Knowledge and understanding - Have an understanding of the main programming constructs of C++ - Have an understanding of the role of design in the development of programming solutions to problems - Have knowledge of some standard algorithms and data structures • Cognitive skills (thinking and analysis). - Develop the ability to analyze problems and propose algorithms to solve them

• Practical and subject specific skills (Transferable Skills). - Ability to write computer programs to solve practical engineering problems - Be able to design efficient computer programs to solve practical engineering problems


Allocation of Marks






works, Projects

100 Total

Page 3 of 4

Documentation and academic honesty • Avoiding plagiarism. Any student caught cheating or copying home work will be punished according the code of conduct and policies used in the faculty of engineering.


week

Basic and support material to be covered

(1) Introduction to computers and programming (2) Inroduction to C++, Input / Output commands. (3) Memory concepts, Arithmetic & relational operators (4) Control statements I : If & If...else & switch statments (5) Control statements II: for loop (6)

First exam. Control statements III: while & do while loops

(7) Functions I, defenition + examples (8) Functions II, function overloading (9)

Functions III, recursion

(10) Arrays I, defenition + examples (11)

Second exam. Arrays II, examples: Searching

(12) Arrays III, sorting and multidimensional arrays (13) Pointers I, defenition, pointer operators (14) Pointers II, const with pointers + function pointers (15)

Pointers III, String function


File processing

Page 4 of 4

Expected workload: On average students need to spend 2 hours of study and preparation for each 50-minute lecture/tutorial. Attendance policy: Absence from lectures and/or tutorials shall not exceed 15%. Students who exceed the 15% limit without a medical or emergency excuse acceptable to and approved by the Dean of the relevant college/faculty shall not be allowed to take the final examination and shall receive a mark of zero for the course. If the excuse is approved by the Dean, the student shall be considered to have withdrawn from the course. Module references Books References:

- Richard Halterman, “Fundamentals of Programming: An Introduction to Computer Programming Using C++” 1995

- Jofel Adams, Sanford Leestma, and Larry Nyhoff, “Turbo C++: An introduction to computing” Prentice-Hall, 1996.

Websites The C++ resource network: http://www.cplusplus.com/ Textbook hompage: http://www.deitel.com/books/cpphtp5/ Free C and C++ resources: http://www.freeprogrammingresources.com/freetutr.html

Page 1 of 4


Department of Computer Engineering First Semester, 2007/2008

Course Syllabus

Course code: 630463/630442 Course Title:Computer Networking

Course prerequisite: Communication Eng. (630451) Course Level: Fifth Year



E-mail Address Off. Hrs Office Number/LocationRank Name

[email protected]:00-11:00713/6 A.P. Dr. Emad Khalaf

Course module description: Basic Computer Network Concept, Open System interconnection OSI, TCP/IP, Switching (Circuit-Switched Networks, Packet- Switched Networks, Message-Switched Networks), Error Detection and Correction (Check Sum, VRC, LRC, CRC, Hamming code), Data Link control and protocols (Flow Control, Error Control, Asynchronous and Synchronous protocols), Multiple Access ( Random Access Protocols, Controlled Access Protocols, Channelization Protocols), Local Area Networks LAN, (Ethernet, token ring and FDDI), Wireless LANs, Computer Network Components (Hubs, Bridges, Routers, Switches, and Gateways), Introduction to Wide Area Networks WAN and Networks Applications.

Course module objectives: To introduce the basic concept of computer networks, the main components, standards, categories, implementation and their usage. Course/ module components

Basic Computer Network Concept, Open System interconnection OSI, TCP/IP, Switching, Error Detection and Correction, Data Link control and protocols, Multiple Access, Local Area Networks LAN, Wireless LANs, Computer Network Components, Introduction to Wide Area Networks WAN and Networks Applications.

• Text Book:

“Data Communication and Networking”, By: B.A.Forauzan, McGraw Hill, 2007.

Page 2 of 4

Teaching methods: This course would be given in 3 hours of lecture a week. During the course, the student would have given 3 home-works and 3 quizzes. At the end of the course the student should handout one project about one of the computer networks applications. Two Midterm Exams is carried out during the course.

Learning outcomes: At completing this module the student should be able to:

- Understand the main idea of computer networks. - Understand the computer networks standards and its categories. - Understand the implementation of computer networks and their usage. - Understand data transmission in computer networks.

Skills: - Cognitive skills (thinking and analysis). - Communication skills (personal and academic). - Practical and subject specific skills (Transferable Skills).


• Short report and/ or Short research project. • Quizzes. • Home works • Final examination: 50 marks

Allocation of Marks






works, Projects

100 Total

Page 3 of 4

Documentation and academic honesty This course is given from the textbook mentioned above. It is copyright protected. Students are encouraged to purchase this textbook from the university bookshop. Students are also advised to avoid plagiarism in their home-works and assignments.


week



(1) Basic Computer Network Concept, Computer Network

(2), (3) Open System interconnection OSI(Layers, functions), TCP/IP

Homework & Quiz

(4) Switching (5), (6)

First examination Error Detection and Correction (Check Sum, VRC, LRC, CRC, Hamming code).

Homework & Quiz

(7) Data Link control and protocols. (Flow Control, Error Control), Asynchronous and Synchronous protocols.

(8), (9) Multiple Access (10), (11)

Second examination Local Area Networks LAN, (Ethernet, token ring, token bus and FDDI)

Homework & Quiz

(12), (13) Wireless LANs (14) Computer Network

Components (Hubs, Bridges, Routers, Switches, and Gateways)

(15) Specimen

examination (Optional)

Introduction to Wide Area Networks WAN and Networks Applications.

Project


Page 4 of 4

Expected workload: On average, students need to spend 2 hours of study and preparation for each 50-minute lecture/tutorial. Attendance policy: Absence from lectures and/or tutorials shall not exceed 15%. Students who exceed the 15% limit without a medical or emergency excuse acceptable to and approved by the Dean of the relevant college/faculty shall not be allowed to take the final examination and shall receive a mark of zero for the course, If the excuse is approved by the Dean, the student shall be considered to have withdrawn from the course. Module references Books:

1) Kurose, J., and K. Ross. Computer Networking: A Top-Down Approach Featuring the Internet. Reading, MA: Addison Wesley Longman, 2002. ISBN: 0201976994.

2) Keshav, S. An Engineering Approach to Computer Networking. 1st ed. Reading, MA: Addison-Wesley, 1997. ISBN: 0201634422.

3) Walrand, Jean. Communication Networks: A First Course. Mc Graw Hill, 1998. ISBN: 0256174040.

4) Tanenbaum, Andrew. Computer Networks. 3rd ed. Upper Saddle River, NJ: Prentice Hall. ISBN: 0133499456.

5) Bertsekas, Dmitri, and Robert Gallager. Data Networks. 2nd ed. Upper Saddle River, NJ: Prentice Hall, 1991. ISBN: 0132009161.

Websites: www.mhhe.com/forouzan

Page 1 of 4



Course Syllabus

Course code: 630361 Course Title: Computer Architecture


Logic Circuits (630261) & Logic Lab (630266) Course Level: 3rd year

Credit hours: 3 Lecture Time: 8:10 – 9:10 STuTh

Academic Staff

Specifics


Hours

Office Number

and Location RankName

[email protected]

SMTu

710

x 2598

Assis.

Prof.Dr. Mohammad S. Sharawi

Course module description: This course covers: Basic computer architecture and organization, Instruction set and addressing modes, Processor design The execution unit and the control unit, Microprogramming, Memory hierarchy and organization, Input/output systems, Introduction to parallel processing.

Course module objectives: To Understand the operation of computer elements

Demonstrate the design and performance of a computer To Understand and write micro-programs. To Understand the structure of computer modules and interconnections


- Computer System Architecture, M.M. Mano, 3th edition, Prentice Hall, USA 1993. - Computer Organization and Architecture, W. Stallings, 7th edition, Prentice Hall, 2007


- MultiSim Simulation tool tutorial and User Manual.

Teaching methods: Lectures, tutorials, problem solving, and computer aided design and simulation.


Basic understanding of the computer component organization and architecture To be able to architect the operation of a simple computer Microprogramming using computer Instruction Set Hardware design and simulation of various computer modules Hierarchy of Memory within a computer system Interfacing protocols of Input/Output devices with microprocessor

• Cognitive skills (thinking and analysis).

Be able to analyze the behavior and goals of different computer microprograms Building simple hardware modules to aid the functions of a simple computer system Come up with innovative methods to optimize the performance of simple computers


Although this class does not have a presentation like projects, but some key aspects of successful presentation habits are introduced to the student through out the semester.

• Practical and subject specific skills (Transferable Skills).

The student will be able to design basic computing modules from commercial of the shelf components (COTS) The use of MultiSim CAD tool will expose the student to real design problems where he/she can demonstrate their abilities to come up with innovative solution to specific problems within the computer design and architecture area



Allocation of Marks


25 % Mid Term examination

15% Quizzes


10% Home works and Design Projects

100% Total

Page 3 of 4


There is no specific documentation style for this course.

• Protection by copyright The students are made aware of the importance of copyright laws.

• Avoiding plagiarism.

Plagiarism is the problem of the century! Students are being aware of its disastrous consequences within the academic community, and they are taught how to do proper citations without falling into this growing problem within the academic society.


week Basic and support

material to be covered Homework/reports and their due dates

(1) Introduction (2) Chapters 1-3 (3) Chapter 12 (4) Chapter 4.1-4.5 HW1 Due (5) Chapter 4.6-4.7 5.1-5.3 (6)

First examination Chapter 5.3-5.4

(7) Chapter 5.5-5.8 (8) Chapter 5.9-5.10 7.1 HW2 Due (9) Chapter 7.2-7.3 (10) Chapter 7.4 8.1 (11)

Second examination Chapter 8.2-8.3

(12) Chapter 8.4-8.7 HW3 Due (13) Chapter 8.8 (14) Chapter 9.1-9.2 (15)

Specimen examination (Optional)

Chapter 11.1-11.3


Review HW4 Due

Page 4 of 4


Modern Computer Architecture, Rafiquzzaman & Chandra, West Publishing Company, 1988.Advanced Computer Architecture: A System Design Approach, R.Y. Kain, Prentice Hall, 1996.

Websites

http://personalwebs.oakland.edu/~msharawi/ta.html http://www.intel.com http://www.datasheets.com

Page 1 of 4



Course Syllabus

Course code: (630574) Course Title: Computer Security

Course prerequisite: (630463) Course Level: Fifth Year

Credit hours: 3 Lecture Time: 13:10 - 14:10Sun., Tues., Thurs.


E-mail Address Off. Hs Office Number / LocationRank Name

sherifjordan@yahoo12:10-13:10 6/713 A.P. DR. Mohamed Sherif

Course module description: This course highlights the threats that face the exchanging of data electronically through computer networks. Also, gives the student the tools to overcome theses threats. The course also explains the OSI Network Security Model. The course materials are tailored such that the student can get hands on and get training in writing different cryptographic algorithms using C/Cpp language.

Course module objectives: At completing this course the student will be familiar with: 1. Computer Network Security Architecture. 2. Computer Network Security Tools. 3. Computer Network Security Threats. Also the student should be able to write different cryptographic Algorithms Using C/Cpp and/or Visual Basic. Course/ module components Text Book: William Stallings, “Cryptography and Network Security, Principles and Practices”, Prentice Hall, 2003.

Page 2 of 4

Teaching methods: The course will be taken 3 hours lectures a week. During the course, the student would have taken 2 homeworks and 2 quizzes. At the end of the course the student should supply one final project. Two Exams will be held during the course.

Learning outcomes: Knowledge and understanding Cognitive skills (thinking and analysis). Communication skills (personal and academic). Practical and subject specific skills (Transferable Skills). Assessment instruments • Short reports and/ or presentations, and/ or Short research projects • Quizzes. • Home works • Final examination: 50 marks

Allocation of Marks






works, Projects

100 Total

Page 3 of 4

Documentation and academic honesty This course is given from the text book given above. It is copyright protected. Students are encouraged to purchase this text book from the university bookshop. Students are also advised to avoid plagiarism during different homeworks and assignments.


week



(1) Essentials of networking and Internet (2) OSI Security Architecture Homework1 (3) Network Security Model

(4),(5) Cryptographic Techniques (Secret Key, Public Key)

Quiz1

(6) First

examination

(7) Pseudo Random Generator, design and analysis

Homework2

(8), (9) Stream Cipher, Block Cipher, design and analysis

(10) Public Key Algorithms (RSA) (11)

Second examination

(12) Public Key Algorithms (El Gamal ) Quiz2 (13) Hashing, Authentication and Digital

Signature Techniques

(14) Email Security, design and analysis (15)


Network Threats ( Viruses, Worms, Fire Walls, Trojan, Spy Ware)

Final Project due date

(16) Final

Examination

Home works and reports are in due within one week of delivery.

Page 4 of 4

Expected workload: On average students need to spend 2 hours of study and preparation for each 50-minute lecture/tutorial. Attendance policy: Absence from lectures and/or tutorials shall not exceed 15%. Students who exceed the 15% limit without a medical or emergency excuse acceptable to and approved by the Dean of the relevant college/faculty shall not be allowed to take the final examination and shall receive a mark of zero for the course. If the excuse is approved by the Dean, the student shall be considered to have withdrawn from the course. Module references: Books: 1. Richard E. Smith, “Internet Cryptography”, Wesley, 1997. 2. A. Menezes, “Handbook of Applied Cryptography”, CRC Press, 1996. 3. Charles P. Pfleeger, “Security in Computing”, Prentice-Hall, 2002. 4. Merike Kaeo, "Designing Network Security ", Indiana, Cisco Press 2004.

Page 1 of 4



Course Syllabus

Course code: 630433/ 630441 Course Title: Data Communication

Course prerequisite : 610331 Course Level: 4th year

Credit hours: 3 Lecture Time: 1 – 2 PM



Hours

Office Number and

Location Rank Name

[email protected] No. 725 Assistant

Prof.

Dr. Malik Al-

Qdah

Course module description: This course covers the fundamental principles of communication systems and the limitations imposed on the signal by noise in communication system. -------------------------------------------------------------------------------------------------------------- ---------------------------------------------------------------------------------------------------------------------Course module objectives:

To describe the basics of digital transmission system To describe the basics of analog transmission system To determine the bit error rate of basic modulation formats when operating in white Gausian noise environments.

To describe the bandpass modulation and demodulation techniques


Data Communication and Networking, By: B.A.Forauzan, McGraw Hill, 2007

Page 2 of 4

• Support material (s) (vcs, acs, etc). • Study guide (s) (if applicable) • Homework and laboratory guide (s) if (applicable).

Teaching methods: Lectures, tutorials, problem solving, debates, etc.


Basic understanding of the digital transmission system Basic understanding of the analog transmission system To be able to design a simple communication system The operations of Modems for data transmission xDSL technology for data transmission


Be able to analyze the behavior and goals of digital/analog transmission system Building a simple data communication block. Come up with innovative methods to optimize the performance of digital/analog transmission system


Improving the students communication skills through interactive teaching methods adopted in the class


Students could demonstrate their abilities to come up with innovative solution to specific problems in communication system


• Short reports • Quizzes. • Home works • Final examination: 50 marks

Allocation of Marks


20 First Exam

20 Second Exam


works, Projects

50 Final examination

100 Total

Page 3 of 4


---------Textbook power point slides and some personal notes and tutorials----------------------------------------------------------------------------------------------------------- -------------------------------------------------------------------------------------------------------------------- • Protection by copyright • Avoiding plagiarism.


week

Basic and support material to be covered Homework/reports and their due dates

(1) Introduction (2) Data and signals 1 HW1 (3) Data and signals 2 HW 2 (4) Line coding Quiz 1 (5) Block coding and scrambling (6)

First exam. PCM and DM and transmission Modes HW3 quiz2

(7) ASK , FSK (8) FSK and PSK (9) AM and FM (10) PM HW4 (11)

Second exam. Multiplexing techniques

(12) Transmission media HW5 (13) Telephone and cables network for data

communication 1 Quiz 3

(14) Mobile phone technology and satellite communications


(Optional)


Page 4 of 4

Expected workload: On average students need to spend 2 hours of study and preparation for each 50-minute lecture/tutorial. Attendance policy: Absence from lectures and/or tutorials shall not exceed 15%. Students who exceed the 15% limit without a medical or emergency excuse acceptable to and approved by the Dean of the relevant college/faculty shall not be allowed to take the final examination and shall receive a mark of zero for the course. If the excuse is approved by the Dean, the student shall be considered to have withdrawn from the course. Module references Books ---- Bernard Sklar, Digital Communications: Fundamentals and Applications, Prentice-Hall 1998 Journals --------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------------------------------------- Websites www.mmhe.com/forouzan



Course Syllabus

Course code: 630231 Course Title: Algorithms and Data

Structures

Course prerequisite (s) and/or corequisite (s): Object

Oriented Programming Course Level: theard year

Credit hours: 3 Lecture Time: Sun, Tue, Thurs @

11:10

Academic Staff

Specifics


Hours

Office Number and

Location Rank Name

[email protected]

Sun

11:00-

14:00,

Mon

10:00 –

11:00

room 711 Assist.

Prof.

Hussain

Abo-Surra

Course module description: This course introduces the fundamentals of structuring and manipulating data: sorting, searching, recursion, lists, stacks, queues, trees, graphs, tables. Introduction to the analysis of algorithms. Advancement in C++ skills and techniques. Course module objectives:

- Understand the sorting and searching fundamentals. - Describe and /or define the Abstract Data Types; including lists, stacks, queues, trees,

hash tables and graph. - Understand, explain, demonstrate, and evaluate alternate implementations of examples

of the methods associated with Abstract Data Types. - Implement and test Abstract Data Types in generic programs using C++.

Course/ module components Data Structures and Algorithms in C++, Second Edition ,By Adam Drozdek,2000

II

Teaching methods: Lectures: three lectures per week Tutorial: one hour per week (optional) Homeworks: 7-8 homework assignments Learning outcomes: • Knowledge and understanding - Have an understanding of the main programming constructs of C++ - Have an understanding of the role of design in the development of programming solutions to problems - Have knowledge of some standard algorithms and data structures and their use in actual programs • Cognitive skills (thinking and analysis). - Develop the ability to analyze problems and propose algorithms to solve them

• Practical and subject specific skills (Transferable Skills). - Ability to write computer programs to solve practical engineering problems - Be able to design efficient computer programs to solve practical engineering problems


Allocation of Marks


20% First exam

20% Second exam



works, Projects

100% Total

III

Documentation and academic honesty • Avoiding plagiarism. Any student caught cheating or copying home work will be punished according the code of conduct and policies used in the faculty of engineering.


week


(1) Programs complexity (2) Sorting and Searching algorithms (3) Data representation : linear and linked lists (4) Arrays (5) matrices (6)

First examination

(7) Double linked lists (8) Queue (9) Priorities queue (10) Stacks


(12) Usual tree (13) Binary tree (14) Algorithm of converting trees (15) Specimen examination ( optional)

graphs

(16) Final examination

IV

Expected workload: On average students need to spend 2 hours of study and preparation for each 50-minute lecture/tutorial. Attendance policy: Absence from lectures and/or tutorials shall not exceed 15%. Students who exceed the 15% limit without a medical or emergency excuse acceptable to and approved by the Dean of the relevant college/faculty shall not be allowed to take the final examination and shall receive a mark of zero for the course. If the excuse is approved by the Dean, the student shall be considered to have withdrawn from the course. Module references Books References:

- C programming for engineering& Computer Science H.H. Tan.McGraw- hill.1999

- C++ :An Introduction to Data Structures by Larry R. Nyhoff. Hardcover. 1999 - Algorithms and Data Structures in C++ . By Leendert Ammeraal. 1996. - C++ How to program .By H.M.Deitel & P.J.Deitel. 2 ed , Prentice- hill, 1998. - Data Structures and Algorithms in C++ ,1ST edition , by Michael T. Godrich,

Roberto Tamassia, David M. Mount Michael T. Goodrich Wiley , 2002.

Page 1 of 4



Course Syllabus

Course code: 630331 Course Title: Database

Course prerequisite: Data Structures and Alg. (630451)Course Level: Third Year

Credit hours: 3 Lecture Time: 11:10- 12:00

Academic Staff

Specifics

E-mail Address Off. Hrs Office Number and

Location Rank Name


Course module description: Database concept, environment and architecture, Database design, (conceptual, logical and physical), Database models (Entity Relation Diagram (ERD), Normalization), Physical Database design, (Internal level, Disk manager, File manager and Clustering), Database implementation, Query Languages (SQL), Distributed Database.

Course module objectives: To give the students the main concepts of database, design of the database, database models, ERD and normalization techniques, Physical Database design, query languages SQL, Distributed Database. Further the students have to practice and write some applications regarding the database.

• Text Book:

“Fundamentals of Database Systems” By: R. Elmasri, S. Navathe, Addison Wesley, 2000.

Page 2 of 4

Teaching methods: This course would be given in 3 hours of lecture a week. During the course, the student would have given 3 Homeworks and 3 quizzes. At the end of the course the student should handout one project about database design and programming using SQL language. Two Midterm Exams is carried out during the course. Learning outcomes: At completing this module the student should be able to:

- Define the general concepts, objectives and the database models. - How to design Database using ERD or normalization techniques. - Understand the physical database design. - Design a database as freestanding applications. - How to implement database using SQL. - Understand the meaning of centralized and distributed database.



• Short reports and/ or Short research projects • Quizzes. • Home works • Final examination: 50 marks

Allocation of Marks






works, Projects

100 Total

Page 3 of 4



week


covered


(1) Database concept, environment and architecture.

(2), (3) Database design, (conceptual, logical and physical).

Homework & Quiz

(3), (4), (5) Database models - Entity Relation

Diagram (ERD). - Normalization.

Homework & Quiz

(6), (7), (8),(9) First examination

Database implementation, Query Languages (SQL).

(10), (11) Second examination

Physical Database design (Internal level, Disk manager, File manager and Clustering).

Homework & Quiz

(12), (13) Distributed Database. (14), (15)


Applications.


Page 4 of 4


1- Korth, “Data Base Systems Concepts”, McGraw Hill, 2000. 2- Toby J. Teorey “Database Modeling & Design”, Morgan Kaufmann, 1999. 3- Jeffry Ullman, “Principles of Data Base Systems”, SU, 1999. 4- C. J. Date, “An Introduction to Data Base Systems”, Wesley Company,

1995.



Course Syllabus

Course code: 630342 + 610331 Course Title: Digital Signal Analysis &

Processing

Course prerequisite (s) and/or corequisite

(s): Probabilities and Statistics Course Level: third year

Credit hours: 3 Lecture Time: 3

Academic Staff

Specifics


Hours

Office Number and

Location Rank Name

[email protected]

Everyday

714-Dept. of Computer

Engineering Bld. Lecturer

Salah Al-Din

Badran

Course module description: 1. Summation rules and continuous-time signals and systems. 2. Discrete-time signals and systems: Fourier transform, linear time- invariant systems, periodic signals. 3. Sampling and reconstruction of bandlimited signals. 4. Discrete Fourier Transform (DFT): properties, circular convolution, linear convolution. 5. Fast Fourier Transforms (FFTs). 6. Spectral analysis: windows and frequency measurement. 7. Z-transforms: transfer functions, difference equations. 8. Digital filters: design considerations, amplitude and phase response, linear phase. 9. Finite Impulse Response (FIR) filters: zero locations, design by impulse response

windowing, realization by block diagrams. Course module objectives:

Students will be able to apply time and frequency domain analysis and solution techniques to signal processing problems


1. “Digital Signal Processing, Principles, Algorithms, and Applications”, John G. Proakis and Dimitris G. Manolakis, 7th edition, Prentice Hall.

2. “Practical Digital Signal Processing for Engineers and Technicians”, Edmund Lai, 1st edition, 2003, Elsevier.

3. “Digital Signal Processing”, Monsons H. Hayes, McGraw-Hill. 4. “Introdiction to Digital Signal Processing and Filter Design”, B. A.

Shenoi, Wiley. 5. “C algorithm for Real-Time DSP”, Paul M. Embree, Prentice Hall.

• Support material (s) (vcs, acs, etc). MatLab tool tutorial and user manual.

Teaching methods: Lectures, discussion groups, tutorials, problem solving, and Simulation using MATLAB.


1. Students understand the issues and methods associated with the sampling of continuous

time signals 2. Students are proficient in Z transform analysis 3. Students can design FIR and IIR digital filters 4. Students can use the FFT 5. Students understand elements of discrete-time random signal processing


• Cognitive skills are acquired continually throughout the programme from a combination of lectures, timetabled and tutorials, problem solving classes, exercises on MATLAB, coursework exercises and self-study of pre-delivered resources. All elements are developed and reinforced throughout the programme, particularly through project work.

• Throughout the programme students are encouraged to undertake independent reading both to supplement and consolidate what is being taught and to help develop cognitive skills.

• Cognitive skills are tested and assessed throughout the programme using a combination of unseen written examinations, open-book written examinations based on C++ programming and MATLAB exercises, examinations on project work, unseen coursework tests, open-book coursework tests, coursework assignments, design studies, essays and reports, project reports and/or papers, oral and visual presentations.


• The students will further there written and oral communication skills through the preparation of a written project report and a short oral presentation.

• Good communication skills will also be developed as students give periodic presentations of their work. This includes reviews for the Programms, design and layout of their DSP circuits.


On successful completion of this programme, students should be able to:

(1) Manipulate, sort and present information in a variety of ways (2) Use scientific evidence based methods in the solution of problems (3) Use information and communications technology

(4) Be creative and innovative in problem solving (5) Work with limited or contradictory information (6) Communicate effectively orally, visually and in writing (7) Learn effectively, independently and continuously in a variety of environments (8) Manage time and resources (9) Work effectively as part of a team

• Key and transferable skills are acquired continually throughout the programme from a

combination of lectures, problem solving classes, laboratory exercises, coursework exercises and self-study of pre-delivered resources. All elements are developed and reinforced throughout the programme, particularly through project work.



Allocation of Marks


25 Mid Term examination

15 Reports, Quizzes and Home works

10 Research and/or design Project(s):

50 Final examination:

100 Total


There is no specific documentation style for this course. • Protection by copyright

The students are made aware of the importance of copyright laws. • Avoiding plagiarism.

Plagiarism is the problem of the century! Students are being aware of its disastrous consequences within the academic community, and they are taught how to do proper citations without falling into this growing problem within the academic society.


week



(1) Summation rules and continuous-time signals and systems.

(2) Discrete-time signals and systems: Fourier transform, linear time- invariant systems,

periodic signals.

(3)

(4) 3. Sampling and reconstruction of bandlimited signals.

HW(1) Due (5) (6)

First examination Discrete Fourier Transform (DFT):

properties, circular convolution, linear convolution.

(7) (8) Fast Fourier Transforms (FFTs). HW(2) Due (9) Spectral analysis: windows and frequency

measurement.

(10) Z-transforms: transfer functions, difference equations.


Digital filters: design considerations, amplitude and phase response, linear phase.

(12) HW(3) Due (13) Finite Impulse Response (FIR) filters: zero

locations, design by impulse response windowing, realization by block diagrams.

(14)


(Optional)

Exercises on DSP TMS board.


HW(4) Due


(1) “Digital Signal Processing”, Chi-tsong Chen, Oxford University Press.2000 (2) “Digital Signal Processing: System Analysis and Design”, Paulo S.R. Diniz, Sergio

Netto, Eduardo A.B. da Silva, Cambridge University Press, 2006. Websites http://www.ti.com/ http://www.ieee.org/organizations/society/sp/ http://spib.rice.edu/spib.html

http://www.powells.com/s?author=Chi-tsong%20Chen

http://www.kriso.ee/cgi-bin/shop/searchbooks.html?author=Paulo+S.R.+Diniz&database=

http://www.kriso.ee/cgi-bin/shop/searchbooks.html?author=Sergio+Netto&database=

http://www.kriso.ee/cgi-bin/shop/searchbooks.html?author=Sergio+Netto&database=

http://www.kriso.ee/cgi-bin/shop/searchbooks.html?author=Eduardo+A.B.+da+Silva&database=

http://www.ti.com/

http://www.ieee.org/organizations/society/sp/

http://spib.rice.edu/spib.html

Page 1 of 4


Department of Computer Engineering first semester, 2007/2008

Course Syllabus

Course code: 630362 Course Title: Digital Techniques


Electronics (1) + Electronics lab Course Level: third year

Credit hours: 3 Lecture Time: Mon – Wed @ 8:15



Hours

Office Number and

Location Rank Name

[email protected]

Sun

11:00-

14:00,

Mon

10:00 –

11:00

room 715 Lecturer Anis Nazer

Course module description: Introduce the main building blocks of digital circuits, BJTs and MOS devices, logic families (CMOS, TTL, ECL etc.), digital to analogue and analogue to digital conversion. Provide good understanding of the operation of semiconductor devices. Introduce the principals of programmable logic devices. Make the student aware of the practical issues involved in using electronic circuits and systems, such as: propagation delay, switching speed limitations, power dissipation, fan-in/fan out constraints. Course module objectives: Course/ module components • Books (title , author (s), publisher, year of publication)

Textbook: Digital Systems: Principles and Applications, 9th edition, 2004, by Ronald J. Tocci, Neal S. Widmer, Gregory L. Moss Course website: http://anis.nazer.googlepages.com/digital.html

Page 2 of 4 Teaching methods: Lectures: three lectures per week (3 credit hours) Learning outcomes: • Knowledge and understanding Have an understanding of the current logic families used to build digital systems, and know their advantages and disadvantages. Have an understanding of Analog / Digital conversion and their applications Have an understanding of storage and memory devices which are used as building blocks of digital systems. • Cognitive skills (thinking and analysis). - Develop the ability to analyze problems in digital systems and propose practical solutions - Have the skills needed to design a digital system given the environment constraints (cost, power, performance, component availability, etc.) • Communication skills (personal and academic). Develop the skills necessary to work within a team • Practical and subject specific skills (Transferable Skills). Develop the ability to build digital systems within certain given constraints Assessment instruments

Allocation of Marks


20% First exam

20% Second exam



works, Projects

100% Total

Page 3 of 4 Documentation and academic honesty • Avoiding plagiarism. Any student caught cheating or copying home work will be punished according the code of conduct and policies used in the faculty of engineering. Course/module academic calendar

week Basic and support material to be covered

(1) Introduction to the digital world, (2) The ideal digital element, Digital IC terminology (3) MOS transistor (4) CMOS, NMOS, PMOS logic families (5) Dynamic CMOS logic family (6)

First exam Pass transistor logic, tristate gates,

(7) sequential logic gates (8) TTL logic family (9) TTL data sheets (10) ECL logic family, Interfacing logic families (11)

Second exam. Analog to digital conversion

(12) Digital to analog conversion (13) Data Acquisition, D/A applications (14) Programmable logic, PAL, PLA, FPGA (15) Memory Devices (16)

Final Examination Memory operation

Page 4 of 4 Expected workload: On average students need to spend 2 hours of study and preparation for each 50-minute lecture/tutorial. Attendance policy: Absence from lectures and/or tutorials shall not exceed 15%. Students who exceed the 15% limit without a medical or emergency excuse acceptable to and approved by the Dean of the relevant college/faculty shall not be allowed to take the final examination and shall receive a mark of zero for the course. If the excuse is approved by the Dean, the student shall be considered to have withdrawn from the course. Module references Books - Adel Sedra and Kenneth Smith, “Microelectronic Circuits” 4th edition 2001 - “Digital Fundamentals” by: Thomas Floyd, 8th edition, Prentice Hall. Websites

- IC datasheet index: http://rabbit.eng.miami.edu/info/datasheets/ - Electronics infoline: http://www.electronicsinfoline.com/ - Hardware secrets: http://www.hardwaresecrets.com/

Page 1 of 4



Course Syllabus

Course code: 630204 Course Title:v Discrete Mathematics

Course prerequisite: Eng. Analysis I (630201) Course Level: Second Year


Academic Staff

Specifics

E-mail Address Off. Hrs Office Number and

Location Rank Name


Course module description: Fundamentals (Sets, Sequences, Matrices and Mathematical structures), Integer Operations, Logic Operations and Methods of proof, Counting and probability, Relations and Digraphs, Functions of Computer Science, Trees, Graph Theory.

Course module objectives: To introduce the discrete mathematics principles as a vehicle for engineer applications.

• Text Book:

“Discrete Mathematical Structures”, Kolman Busby Ross, Pearson Prentice Hall, 2004.

Page 2 of 4

Teaching methods: This course would be given in 3 hours of lecture a week. During the course, the student would have given 3 home-works and 3 quizzes. Two Midterm Exams is carried out during the course.

Learning outcomes:

At completing this module the student should be able to: - Understand the principles of discrete mathematics. - Developing algorithms for engineering applications. - Solving counting and sequence problems. - Understanding Number theory and its engineering applications.



• Quizzes. • Home works • Final examination: 50 marks

Allocation of Marks






works, Projects

100 Total

Page 3 of 4



week



(1) Fundamentals (Sets, Sequences, Matrices and Mathematical structures).

(2), (3) Integer Operations Homework & Quiz (4), (5) Logic Operations and

Methods of proof

(6), (7) First examination

Counting and probability Homework & Quiz

(8), (9) Relations and Digraphs (10), (11)

Second Examination Functions of Computer Science

(12), (13) Trees Homework & Quiz (14), (15)


Graph Theory


Revision:

Page 4 of 4


1. S. Washburn, T. Marlowe, C. T. Ryan, “Discrete Mathematics”, Addison-Weseley, 2000.

2. H. F. Mattson, Jr., ”Discrete Mathematics with Applications”, Wiley, 1993. 3. K. H. Rosen, “Handbook of Discrete and Combinatorial Mathematics”, CRC

Press, 1999. 4. Kenneth H. Rosen, " Discrete Mathematics and its Applications ", McGraw Hill,

2003.

Page 1 of 4



Course Syllabus

Course code: 630470 Course Title: Embedded Systems Design

Course prerequisite(s): 630371 Course Level: 4th Year

Credit hours: 3 Lecture Time: 9:45-11:00 Monday & Wednesday


E-mail Address Office Hours Office No. Rank Name

[email protected]:00-14:00 Monday

& Wednesday 701

Associate

Prof. Dr. Kasim Al-Aubidy

Course module description: Basic introduction to microcontroller-based embedded systems design, development and implementation. It includes embedded system types, microcontroller architecture, programming , I/O interfacing, task scheduling, interrupt management and other related topics.

Course module objectives:

The main objective of this course is to provide the student with the basic understanding of embedded systems design. This includes system requirements specifications, architectural and detailed design, and implementation, focusing on real-time applications. Learning the concepts will be enforced by a Project to design and develop an embedded system based on a single-chip microcontroller.


An Introduction to the design of small-scale Embedded Systems. By: Tim Wilmshurst, Palgrave, UK, 2004. ISBN:0-333-92994-2. • Support material (s) (vcs, acs, etc). • Study guide (s) (if applicable) • Homework and laboratory guide (s) if (applicable).

Teaching methods: Lectures, discussion groups, tutorials, problem solving, debates, etc.

Learning outcomes: • Knowledge and understanding: Understanding principles of embedded systems design; be aware of architectures and behaviors of embedded systems.

Page 2 of 4


--------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------------------------------------- • Communication skills (personal and academic).

--------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------------------------------------- • Practical and subject specific skills (Transferable Skills).

-------------------------------------------------------------------------------------------------------------------- ---------------------------------------------------------------------------------------------------------------------


• Short reports and presentations: Reading related to current topic will be assigned every

week. Assignments and other Homework (HW) will be given throughout the semester, focusing on the concepts learned from these readings.

• Quizzes: TWO to THREE Quizzes will be offered (dates TBD). • Project: Project is an essential part of this course. Assessment will be based on 3 phases:

System Specification, System Design, Hardware and Software Implementation with Project Demonstration. Detailed topics and schedule will be announced in due course.

• Final examination: 50 marks

Allocation of Marks


15% 1st examination

15% 2nd examination

10% Project & Presentation

10% Quizzes and Homework,

50% Final Examination:

100% Total

Documentation and academic honesty • Documentation style (with illustrative examples) • Protection by copyright • Avoiding plagiarism. • Ethics and Disability Act:

- Students may consult with one another on solutions, but copying another student's code is strictly prohibited.

- Students should write their own code. Using code found on books or internet is prohibited.

- The Instructor follows general university “Academic Dishonesty/Cheating Policy”.

Page 3 of 4


week


Homework/reports and their

due dates (1) Introduction to embedded systems. (2) Introduction to microcontroller

Architecture.

(3) Microcontroller Operation HW1 (4) Microcontroller Programming:

Instruction set.

(5) Microcontroller Programming: Program Developing.

Project Selection

(6) Microcontroller Programming: Timing and Subroutines.

(7) Flow of Data. HW2 (8)

Mid Exam Memory Interfacing.

(9) Analog I/O Interfacing (10) Serial Interfacing. HW3 (11) Dealing with Time. Project (Phase1) (12) Interfacing to External Devices. (13) MiniProjects using Microcontrollers (1) Project (Phase2) (14) MiniProjects using Microcontrollers (2) (15)

Specimen Exam (Optional)

MiniProjects using FPGA

(16) Final Exam

Expected workload: On average students need to spend 2 hours of study and preparation for each 50-minute lecture/tutorial. Attendance policy: Absence from lectures and/or tutorials shall not exceed 15%. Students who exceed the 15% limit without a medical or emergency excuse acceptable to and approved by the Dean of the relevant college/faculty shall not be allowed to take the final examination and shall receive a mark of zero for the course. If the excuse is approved by the Dean, the student shall be considered to have withdrawn from the course. The student is responsible for all assignments on a weekly basis. No make-up will be given for missed quizzes, tests or assignments, unless a case is made in advance with Instructor’s approval.

Page 4 of 4 Module references Books

1. S. R. Ball, "Embedded Microprocessor Systems: Real World Design", 2nd edition, Newton, Mass. USA, 2002.

2. S. Ball, Analog Interfacing to Embedded Microprocessor Systems, Newness, 2003 3. Berger, Embedded Systems Design, CMP Books, 2002 4. J. Ganssle, The Art of Designing Embedded Systems, Butterworth, 2002 5. S. Heath, Embedded Systems Design, Elsevier, 2003. 6. R. Kamal, "Embedded Systems: Architecture, Programming & Design", 1st edition,

2007, McGraw Hill, USA 2007. 7. P. Laplante, Real-Time Systems Design and Analysis, IEEE Press, 2004 8. D.W. Lewis, Fundamentals of Embedded Software, Prentice hall, 2002 9. Q. Li, Real-Time Concepts for Embedded Systems, CMP Books, 2003 10. P. Marwedel, Embedded Systems Design, Kluwer Academic Publishers, 2003 11. T. Noergaard, Embedded Systems Architecture, Newess Press, 2005 12. J. Orwant, Designing Embedded Hardware, O’Reilly, 2002 13. J. Peatman, "Embedded Systems Design with the PIC18F452 microcontroller",

Prentice-Hall, USA 2003. 14. Selic et al., Real-Time Object-Oriented Modeling, JohnWiley and Sons, 1994 15. Simon, Embedded Software Primer, Addison-Wesley, 1999 16. J.A. Titus, T.B. O’Hanlan, The Digital I/O Handbook, Sealevel Systems, 2004 17. K. Topley, J2ME in a Nutshell, O’Reilly, 2002 18. F. Vahid, T. Givargis, Embedded System Design, John Wiley and Sons, 2002 19. M. Zurawski, Embedded Systems Handbook, CRC Press, 2005. 20. Steven Heath, "Embedded Systems Design", 2nd edition, Newton, Mass. USA, 2002.

Journals --------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------------------------------------- Websites --------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------------------------------------- ---------------------------------------------------------------------------------------------------------------------

Page 1 of 4



Course Syllabus

Course code: (630202) Course Title: Engineering Analysis II

Course prerequisite: (630201) Course Level: Second Year

Credit hours: 3 Lecture Time: 10:10 - 11:10 Sun., Tues., Thurs.



sherifjordan@yahoo14:00-15:00 6/713 Assist.

Prof. DR. Mohamed Sherif

Course module description: Engineers are always faced with solving mathematical problems, in order to optimize the design of certain objectives. Unfortunately, there is not always an analytical solution for such problems. One available alternative is to utilize numerical solutions. This course describes the most popular numerical techniques in solving frequently encountered engineering mathematical problems.

Course module objectives: After completing this course, the student should be familiar with: - Estimating Different Approximation Errors. - Different Numerical Algorithms and their Flow Charts. - Solving systems of Linear and Non-Linear equations numerically. - Finding the Best Curve Fitting Polynomials. - Finite Difference Techniques and Isolating Data taken in mistakes - Using MATLAB and/or C/C++ Program. Languages to implement various algorithms Course/ module components Text Book: Numerical Methods using MATLAB, Mathews and K. Fink, 4th Edition, Prentice Hall, 2004.

Page 2 of 4

Teaching methods: The course will be taken 3 hours lectures a week plus one hour tutorial a week. During the course, the students will have 2 homeworks and 2 quizzes. At the end of the course the students should supply one final project. Two Mid Term Examinations will be held during the course.

Learning outcomes: Knowledge and understanding

- Basic Understanding of linear algebra - To be able to apply numerical methods for the solution of non-linear equations - To able to apply numerical methods for the solution of integro-differential equations - Utilize computer tools like MATLAB to implement numerical algorithms for solving

engineering problems numerically.

Cognitive skills (thinking and analysis) - Be able to tackle simple engineering system equations/models using numerical

methods - Come up with solutions for simple real life systems using computer tools

Communication skills (personal and academic). Although this class does not have a presentation like projects, but some key aspects of successful presentation habits are introduced to the student through out the semester. Practical and subject specific skills (Transferable Skills). The student will extensively use the MATLAB program to code numerical algorithms, as well as some C++ implementations will be used. Assessment instruments • Short reports and/ or presentations, and/ or Short research projects • Quizzes. • Home works • Final examination: 50 marks

Allocation of Marks






works, Projects

100 Total

Page 3 of 4 Documentation and academic honesty This course is given from the text book given above. It is copyright protected. Students are encouraged to purchase this text book from the university bookshop. Students are also advised to avoid plagiarism during different home works and assignments.


week



(1), (2) Errors (3 Solution of nonlinear equations Homework1 (4) Numerical Differentiations (5) Numerical Integrations Quiz1 (6)

First examination

(7),(8) Solution of Differential Equations Homework2 (9), (10) Solution of system of Linear equations

(11) Second

examination

(12) Finite Difference Problems Quiz2 (13) Curve Fitting. (14) Interpolations and Extrapolations (15)


The final project due date.

(16) Final

Examination


Page 4 of 4 Expected workload: On average students need to spend 2 hours of study and preparation for each 50-minute lecture/tutorial. Attendance policy: Absence from lectures and/or tutorials shall not exceed 15%. Students who exceed the 15% limit without a medical or emergency excuse acceptable to and approved by the Dean of the relevant college/faculty shall not be allowed to take the final examination and shall receive a mark of zero for the course. If the excuse is approved by the Dean, the student shall be considered to have withdrawn from the course. Module references: Books: 1. Numerical Analysis, R. Burden and J. Douglas, Brooks/Cole, 2001. 2. Numerical Methods for Engineering with Software and Program Applications, Steven C. Chapra and Raymound P. Canale, McGraw-Hill, 2002 3. Applied Numerical Analysis, Curtis F. Gerald et al, Pearson Education, 2002.

Page 1 of 4



Course Syllabus

Course code: 630261 Course Title: Logic Circuits

Course prerequisite (s) and/or corequisite (s): 710101 Course Level: 2nd year




Hours

Office Number and

Location Rank Name


10-11 Wed.E727

Assistance


Course module description: This class is an introduction to the basic concepts, analysis, and design of digital systems. This consists of both combinational and sequential logic. Lectures will enable students to experience with several levels of digital systems. Course module objectives: At Completing of this module the student should be able to:

• Design methodologies for electronic circuits, to use mathematical expressions to describe the functions of simple combinational and sequential circuits.

• Convert numerical data from one format to another and to use different formats to represent numerical data.

• Understand Boolean algebra, basic laws and rules in logic design, DeMorgan’s theorem, Karnaugh map, and approaches to simplifying logic circuits.

• Understand systematical design methodology for combinational logic circuits and build this kind of digital systems by using some IC devices.

• Understand systematical design methodology for sequential logic circuits. Course/ module components • Books (title , author (s), publisher, year of publication)

(Text Book) Digital Design, 4th Edition, M. Morris Mano and Michael D. Ciletti, Prentice Hall, 2007.

Page 2 of 4

• Support material (s) (Course website: Includes reference books

and Course Notes_ Power Point Slides). http://lbadri.com/index.php?option=com_content&task=view&id=29&Itemid=33

• Study guide (s) • Homework and laboratory guide (s): Listed in the Course website.

Teaching methods: Lectures, tutorials, and problem solving.


_ Ability to analyze and understand the behavior of combinational and sequential digital circuits. _ Ability to map and minimize Boolean functions as well as represent them in various standard forms. _ Ability to design and implement combinational and sequential logic circuits. _ Understanding of various combinational “building blocks” such as decoders, multiplexers, and encoders. _ Ability to design and implement arithmetic logic circuits. _ Understanding of the behavior exhibited by latches and flip-flops. _ Ability to design and implement sequential circuits. _ Understanding of various sequential “building blocks” such as counters and shift registers

• Cognitive skills (thinking and analysis). _ Ability to analyze the behavior of digital circuits. _ Ability to design and implement combinational logic circuits. _ Understanding of various combinational “building blocks” such as decoders, multiplexers, and encoders. _ Ability to design and implement arithmetic logic circuits. _ Ability to design and implement sequential circuits. _ Understanding of various sequential “building blocks” such as counters and shift registers.


None • Practical and subject specific skills (Transferable Skills).

_ Ability to map and minimize Boolean functions as well as represent them in various standard forms _ Ability to design and implement combinational logic circuits. _ Understanding of various combinational “building blocks” such as decoders, multiplexers, and encoders. _ Ability to design and implement arithmetic logic circuits. _ Ability to design and implement sequential circuits. _ Understanding of various sequential “building blocks” such as counters and shift registers



Allocation of Marks


20% First exam

20% Second exam



works, Projects

Page 3 of 4




week


covered


(1) Course Overview (2) Introduction to Digital

Systems. Number Systems and Conversions

(3) Boolean Algebra and Logic Gates

Assingment1 Week 4

(4) Minimization Methods and Don’t care conditions

Assingment2 Week 5

(5) Representation and

implementation of

Boolean circuits using

other logic gates.

Assingment3 Week 6



(7) Analysis Procedure of

combinational circuits

(8) Combinational Circuits

design, BCD Display

Assingment4 Week 9

(9) Adder and Subtractor, Magnitude comparators,

Assingment5 Week 10

(10) Multiplexers, Encoders,

and Decoders.



Assingment6 Week 12

(12) Sequential Circuits: Latches and Flip flops

Assingment7 Week 13

(13) Analyzing Sequential Circuits, Finite State Machine Design Procedure. State Reduction and Assignment

Assingment8 Week 14

(14) Shift Registers, Counters,

And Timing Analysis.

Assingment9 Week 15


(Optional)



Page 4 of 4


1. Practical Digital Logic Design and Testing, P. K. Lala, Prentice Hall, 1996. 2. Introduction to Digital Logic Design, J. P. Hayes, Addison-Wesley, 1996. 3. Digital Electronics: Principles and Applications, R. L. Tokheim, 5th Edition, McGraw-

Hill, 2000.

Web sites http://lbadri.com http://www.digikey.com http://www.edaboard.com/forums.html

Page 1 of 4



Course Syllabus

Course code: 630371 Course Title: Microprocessors

Course prerequisite : 610261 Course Level: 2nd year

Credit hours: 3 Lecture Time: 11:15 – 12:45 PM



Hours

Office Number and

Location Rank Name

[email protected] No. 725 Assistant

Prof.

Dr. Malik Al-

Qdah


This course covers the fundamental principles of 8086/8088 microprocessor addressing modes, data movements instructions, arithmetic and logic instructions, program control instruction, 8086/8088 hardware specifications, memory interface, basic i/o interface, interrupts, direct memory access. Course module objectives:

Upon completion of this course the student should be able to: 1-Understand the architecture of Intel microprocessors. 2-Learn assembly programming and develop software that uses macro sequences, procedures, and conditional assembly directives. 3-Learn memory and Input/Output interfacing techniques. 4- Understand the function and use of interrupts in microprocessor systems.


The Intel Microprocessors: 8086/8088, 80186/80188, 80286, 80386, 80486, Pentium, Pentium Pro Processor, Pentium II, Pentium III, and Pentium 4 - Architecture, Programming, and Interfacing, By: Barry B. Brey, 6th edition, Prentice Hall.

Page 2 of 4 • Support material (s) (vcs, acs, etc). • Study guide (s) (if applicable) • Homework and laboratory guide (s) if (applicable).

Teaching methods: Lectures, tutorials, problem solving, debates, etc.


Basic understanding of 8086/8088 microprocessor and its architecture Programming using assembly language 8086/8088 hardware specifications Memory interfacing with 8086/8088 microprocessor I/O interfacing with 8086/8088 microprocessor


Be able to analyze the behavior of 8086/8088 microprocessor Building simple hardware modules to aid the functions of a simple computer system Building simple software to aid the functions of a simple computer system

Come up with innovative methods to optimize the performance of 8086/8088 microprocessor • Communication skills (personal and academic).

Improving the students communication skills through interactive teaching methods adopted in the class


The student will be able to design basic microprocessor base embedded system Students could demonstrate their abilities to come up with innovative solution to specific problems within the microprocessor base embedded system area


• Short reports • Quizzes. • Home works • Final examination: 50 marks

Allocation of Marks


20 First Exam

20 Second Exam


works, Projects

50 Final examination

100 Total

Page 3 of 4


---------Textbook power point slides and personal notes and tutorials----------------------------------------------------------------------------------------------------------- -------------------------------------------------------------------------------------------------------------------- • Protection by copyright • Avoiding plagiarism.


week


(1) Introduction to microprocessors. Overview of computer structure and operation, microprocessor evolution and types, the INTEL family of microprocessors.

(2) 8086/8088 Microprocessors. Basic 8086/8088 architecture, programming model, data format, instruction set.

HW1

(3) Addressing Modes. Data-addressing modes, register addressing, immediate addressing, direct data addressing, base-plus index addressing, register relative addressing, base relative plus index addressing program memory addressing modes.

HW 2

(4) Data Movement Instructions. PUSH/POP instruction, load effective address, string data transfer, misc., data transfer instruction.

Quiz 1

(5) Arithmetic and Logic Instruction. Addition, subtraction and comparison instruction and division, BCD and ASCII arithmetic, basic logic operation, shift and rotates, string comparison.

(6) First exam.

Program Control Instruction. Jump instructions, subroutines, interrupts

HW3 quiz2

(7) Introduction to assembly language programming.

(8)and (9) 8086/8088 Hardware Specifications.

Pinouts and pin functions, the 8284 clock generator, bus buffering and latching, bus timings, ready and wait states, minimum and maximum modes.

(10) Memory interface. Memory devices, address decoding,

HW4

(11) Second exam.

Memory interface. 8086/8088 memory interface, dynamic RAM controllers

(12) Basic I/O Interface. I/O port address decoding, the 8255 programmable peripheral device,

HW5

(13) Basic I/O Interface. 8279 programmable keyboard controller, 8251 programmable communication interface.

Quiz 3

(14) Interrupts. Basic interrupt processing, hardware interrupts, 8259 programmable interrupt controller.


(Optional)


Page 4 of 4

Expected workload: On average students need to spend 2 hours of study and preparation for each 50-minute lecture/tutorial. Attendance policy: Absence from lectures and/or tutorials shall not exceed 15%. Students who exceed the 15% limit without a medical or emergency excuse acceptable to and approved by the Dean of the relevant college/faculty shall not be allowed to take the final examination and shall receive a mark of zero for the course. If the excuse is approved by the Dean, the student shall be considered to have withdrawn from the course. Module references Books ---- Avtar Singh and Walter Triebet, The 8086 and 80286 Microprocessor Journals --------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------------------------------------- Websites

Page 1 of 4



Course Syllabus

Course code: 630573 Course Title: Modeling & Simulation


Department Approval Course Level: 5th year

Credit hours:3 Lecture Time: 9:45-11:15



Hours

Office Number and

Location Rank Name

[email protected]:00-15:00

Weekly E-709

Assistant

Prof.

Dr. Mohammed

Mahdi Ali

Course module description: To cover the principles of modeling and simulation, identification, representation and processing. It covers the design and implementation of analog and digital simulation and their engineering applications.

Course module objectives: At Completing this module the student should be able to:

• Extract models. • Simulate models in both analog and digital ways. • Use Matlab package.


B.S.Bennett, “Simulation Fundamentals”,-Hall International 1995.


Matlab simulation program. Teaching methods: Lectures, tutorials, problem solving, and computer aided design and simulation. Learning outcomes: • Knowledge and understanding

• Basic understanding of modeling and simulation techniques. • Basic understanding of analog and digital simulation methods. • To be able to design real systems based on simulation results.

• Cognitive skills (thinking and analysis). Be able to understand different available methods for modeling and simulation. • Communication skills (personal and academic).

Key aspects of projects presentation are introduced. • Practical and subject specific skills (Transferable Skills).

• The student is able to design some kind's real systems. • The use of Matlab software package tool will help the student in the design

and analysis of real systems.



Allocation of Marks






works, Projects

100 Total

Page 3 of 4


There is no specific documentation.


week


covered


(1) Introduction (2) Basic identification

procedures

(3) OP-AMP operations (4) Analog systems

simulation

(5) Analysis and study of simulation results

(6) First exam.

How to build real systems models based on

simulation results

HW -1 Due

(7) Introduction to digital simulation methods

(8) Analysis and study of digital simulation results

(9) Introduction to basic features of Matlab

(10) Applications using Matlab

(11) Second Exam.

Review HW-2 Due

(12) Real-systems cases of study



(15) Simple project HW-3 Due (16)

Final Examination Simple project

Page 4 of 4

Expected workload: On average students need to spend 2 hours of study and preparation for each 50-minute lecture/tutorial. Attendance policy: Absence from lectures and/or tutorials shall not exceed 15%. Students who exceed the 15% limit without a medical or emergency excuse acceptable to and approved by the Dean of the relevant college/faculty shall not be allowed to take the final examination and shall receive a mark of zero for the course. If the excuse is approved by the Dean, the student shall be considered to have withdrawn from the course. Module references Books N.Sinha and Kuszta, “ Modeling and Identification of Dynamic System”,Prentice Hall, 1997. Duane Hanselman and Bruce Littlefield, “ Mastering Matlab: A Comprehensive Tutorial and References”, ”, Prentice Hall,1998.

Page 1 of 4



Course Syllabus

Course code: (630564) & (630544) Course Title: Network Design and Management

Course prerequisite: (630463) Course Level: Fifth Year

Credit hours: 3 Lecture Time: 9:45 - 11:15 Monday, Wednesday



sherifjordan@yahoo14:00-15:006/713 A.P. DR. Mohamed Sherif

Course module description: This course introduces the ISO Network Management Model. It illustrates the 5 areas of network management. It explains in details the SNMP Management protocol. It illustrates the analytical techniques used in designing advanced communication networks. Also, it covers the Network Analysis Fundamentals and concept.

Course module objectives: At completing this course the student will be familiar with: 1. ISO Network Management Model. 2. TCP/IP Network Model. 3. SNMP Network Management Protocol. 4. Network Design Fundamentals and Algorithms. 5. Network Analysis Fundamentals and Concepts. 6. Network Reliability. Course/ module components Text Book: Teresa C. Mann-Rubinson and Kornel Terplan, “Network Design, Management and Technical Perspective”, CRC Press, 1999.

Page 2 of 4

Teaching methods: The course will be taken 3 hours lectures a week. During the course, the student will take 2 homeworks and 2 quizzes. At the end of the course the student should supply one final project. Two Mid Term Examinations will be held during the course.

Learning outcomes: Knowledge and understanding Cognitive skills (thinking and analysis). Communication skills (personal and academic). Practical and subject specific skills (Transferable Skills). Assessment instruments • Short reports and/ or presentations, and/ or Short research projects • Quizzes. • Home works • Final examination: 50 marks

Allocation of Marks






works, Projects

100 Total

Page 3 of 4

Documentation and academic honesty This course is given from the text book given above. It is copyright protected. Students are encouraged to purchase this text book from the university bookshop. Students are also advised to avoid plagiarism during different home works and assignments.


week


(1) Introduction to Network ISO Reference Model. (2) ISO Network Management Model Homework1 (3) (Configuration, Fault, Performance, Accounting,

Security)

(4),(5) TCP/IP Network Model Quiz1 (6)

First examination

(7),(8) SNMP the Network Management Protocol Homework2 (9) Network Management Groups (10) Network Representation using Graph Theory (11)

Second examination

(12) Network Design Algorithm, (Greedy, Dijkstra) Quiz2 (13) Network Reliability (14) Network Analysis (based on Queuing theory). (15)


Cont. Network Analysis (based on Queuing theory).

Final Project due date

(16) Final

Examination


Page 4 of 4 Expected workload: On average students need to spend 2 hours of study and preparation for each 50-minute lecture/tutorial. Attendance policy: Absence from lectures and/or tutorials shall not exceed 15%. Students who exceed the 15% limit without a medical or emergency excuse acceptable to and approved by the Dean of the relevant college/faculty shall not be allowed to take the final examination and shall receive a mark of zero for the course. If the excuse is approved by the Dean, the student shall be considered to have withdrawn from the course. Module references: Books: 1- Behrouz A. Forouzan, " TCP/IP Protocol Suit ", McGraw-Hill, 2003 2- Stan Schatt, “Understanding Network Management: Strategies and Solutions”, McGraw-Hill,

1993. 3- Kornel Terplan, “Web Based System and Network Management”, CRC Press, 1999 4- Yuosef M. Househ et al., " Network Management an Object-Oriented design and

Implementation of SNMP protocol", Philadelphia University, Amman 2002.

Page 1 of 4



Course Syllabus

Course code: 630205 Course Title:

Object Oriented Programming


Programming Language, Software (1) Laboratory Course Level: 5th

Credit hours: 3 Lecture Time: 3 hours/Week



Hours Office Number and Location Rank Name


This course provides an introduction to software construction using an object-oriented approach; Acquire programming skills in connection with engineering science or technology. Topics include introduction to object, class, instance, attribute, method, friend, template, inheritance, operator overloading, polymorphism, virtual function, exception handling and file processing. Engineering practice is emphasized in addition to the object-oriented techniques of abstraction, encapsulation, composition and building reusable components.

Course module objectives: The goals of the course are to give the students the ability to:

• Understand the programming fundamentals of OOP. • Develop advanced OOP algorithms. • Use object-oriented methods to create effective and efficient engineered

problem solutions.


C++ How to Program, 3rd By Deitel & Deitel, prentice-Hall, 2001, ISBN: 0-13-089571-7

Page 2 of 4 • Support material (s) (vcs, acs, etc). • Study guide (s) (if applicable) • Homework and laboratory guide (s) if (applicable).



Knowledge about principles and concepts behind the object oriented programming paradigm; Understand and implement engineered applications using object-oriented techniques.

• Cognitive skills (thinking and analysis). Ability to think, analyze and design various problems in engineering field using object oriented fashion.


Student will be gained communication skills using debate, conversation and questions in the lecture.


Ability to develop advanced OOP.



Allocation of Marks






works, Projects

100 Total

Page 3 of 4




week


covered


(1) Overview: pointers (2) Overview: functions (3) Unions and Structures (4) Classes: Part 1 (5) Classes: Part 2 (6)

First examination Friend Classes

(7) Templates (8) Operator Overloading (9) Operator Overloading (10) Inheritance: Part 1 (11)

Second examination Inheritance: Part 2

(12) Virtual functions (13) polymorphism (14) Dynamic programming (15)


Exception Handling


File Processing.

Page 4 of 4

Expected workload: On average students need to spend 2 hours of study and preparation for each 50-minute lecture/tutorial. Attendance policy: Absence from lectures and/or tutorials shall not exceed 15%. Students who exceed the 15% limit without a medical or emergency excuse acceptable to and approved by the Dean of the relevant college/faculty shall not be allowed to take the final examination and shall receive a mark of zero for the course. If the excuse is approved by the Dean, the student shall be considered to have withdrawn from the course. Module references Books Programming and Problem Solving with C++, Nell Dale, Jones and Bartlett Pub, 2000. Object Oriented Programming Using C++, J.p.Pardoe and M.J.king, Macmillan Press ltd.1997. Object Oriented Programming with C+, .2nd, David Parsons, 1997.

Journals --------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------------------------------------- Websites http://www.cplusplus.com/doc/tutorial/ http://www.cprogramming.com http://www.programmingtutorials.com/cplusplus.aspx

Page 1 of 4



Course Syllabus

Course code: 630581 Course Title: REAL-TIME SYSTEMS

Course prerequisite(s): 630470 Course Level: 5th Year

Credit hours: 3 Lecture Time: 9:45-11:00 Monday & Wednesday


E-mail Address Office Hours Office No. Rank Name

[email protected]:00-14:00 Monday

& Wednesday 701

Associate

Prof. Dr. Kasim Al-Aubidy

Course module description: Basic introduction to real-time systems design, development and implementation. It includes; hardware design of input/output interface between a microcomputer or a microcontroller and a plant, real-time algorithms design and realization, stability of microcomputer-based systems, real-time operating systems, and other related topics.

Course module objectives:

The main objective of this course is to cover the principles and design methods of real-time computer systems. It covers the interfacing techniques and microprocessor system realization. The principles of real-time operating systems and real-time software system will be covered in this course.


Real-Time Computer Control, By: Stuart Bennett, Prentice-Hall, 2nd edition, 1994. • Support material (s) (vcs, acs, etc). • Study guide (s) (if applicable) • Homework and laboratory guide (s) if (applicable).


Learning outcomes: • Knowledge and understanding: Understanding principles of embedded systems design; be aware of architectures and behaviors of embedded systems.

Page 2 of 4

• Cognitive skills (thinking and analysis). --------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------------------------------------- • Communication skills (personal and academic).

--------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------------------------------------- • Practical and subject specific skills (Transferable Skills).

-------------------------------------------------------------------------------------------------------------------- ---------------------------------------------------------------------------------------------------------------------


• Short reports and presentations: Reading related to current topic will be assigned every

week. Assignments and other Homework (HW) will be given throughout the semester, focusing on the concepts learned from these readings.

• Quizzes: TWO to THREE Quizzes will be offered (dates TBD). • Project: Project is an essential part of this course. Assessment will be based on 3 phases:

System Specification, System Design, Hardware and Software Implementation with Project Demonstration. Detailed topics and schedule will be announced in due course.

• Final examination: 50 marks

Allocation of Marks


15% 1st examination

15% 2nd examination

10% Project & Presentation

10% Quizzes and Homework,

50% Final Examination:

100% Total

Documentation and academic honesty • Documentation style (with illustrative examples) • Protection by copyright • Avoiding plagiarism. • Ethics and Disability Act:

- Students may consult with one another on solutions, but copying another student's code is strictly prohibited.

- Students should write their own code. Using code found on books or internet is prohibited.

- The Instructor follows general university “Academic Dishonesty/Cheating Policy”.

Page 3 of 4


week Basic and support material to be

covered Homework/reports and their

due dates (1) An introduction to real-time computer

systems.

(2) Elements of a real-time microcontroller-based system, Classification of RTS, Time constraints, Classification of programs

(3) Computer Control concepts; Sequence control, DDC, PID control, Adaptive control, Supervisory control,

(4) Centralized control, Hierarchical systems, Distributed systems, Human-computer interface.

HW1

(5) Hardware requirements for real-time systems: Analog I/O interfacing.

Project Selection

(6) Digital and Pulse I/O iterfacing. (7) Data Acquisition and Data Distribution

system design. HW2

(8) Mid Exam

Implementation of real-time algorithms,

(9) Realization of real-time algorithms using single processors or more.

(10) Stability analysis of real-time systems. HW3 (11) Software design of real-time systems. Project (Phase1) (12) Operating systems for real-time

applications: Basic features of RTOSs,

(13) Scheduling: concepts & implementation. Project (Phase2) (14) Languages for real-time applications. (15)

Specimen Exam (Optional)

MiniProjects using Microcontrollers.

(16) Final Exam

Expected workload: On average students need to spend 2 hours of study and preparation for each 50-minute lecture/tutorial. Attendance policy: Absence from lectures and/or tutorials shall not exceed 15%. Students who exceed the 15% limit without a medical or emergency excuse acceptable to and approved by the Dean of the relevant college/faculty shall not be allowed to take the final examination and shall receive a mark of zero for the course. If the excuse is approved by the Dean, the student shall be considered to have withdrawn from the course. The student is responsible for all assignments on a weekly basis. No make-up will be given for missed quizzes, tests or assignments, unless a case is made in advance with Instructor’s approval.

Page 4 of 4 Module references Books

1. J. Cooling, Software Engineering for Real-Time Systems, Addison Wesley, UK

2003. www.pearsopneduc.com 2. J.W.S. LIN, Real-Time Systems, Prentice Hall, 2000. 3. N. NISSANKE, Real-Time Systems, Prentice Hall, 1997. 4. R.J.A. BUHR & D.L. BAILEY, An Introduction to Real-Time Systems, Prentice Hall,

1999. 5. S. BENNETT & G.S. VIRK, Computer Control of Real-Time Processes, IEE 1990. 6. J. Cooling, Software Engineering for Real-Time Systems, Addison Wesley, UK

2003. 7. W. VALVANO, Embedded Microcomputer Systems: Real-Time Interfacing, Brooks-

Cole Publisher, 2000

Journals --------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------------------------------------- Websites --------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------------------------------------- ---------------------------------------------------------------------------------------------------------------------

Page 1 of 4



Course Syllabus

Course code: 630232 Course Title: System Programming

and Analysis 630232

Course prerequisite (s) and/or corequisite (s): 630203 Course Level: 3rd year




Hours

Office Number and

Location Rank Name


10-11 Wed.E727

Assistance


Course module description: This course covers system software overview, assemblers, macro processors, loaders and linkers, compilers. Design system software projects. Prerequisites:

1. It is required that the student has a good understanding of the underlying concepts of computer architecture.

2. Some programming experiences, such as C++ programming language, and the knowledge in algorithms, data structures and operating systems are also needed.

Course module objectives: 1. To learn the concepts and methods in designing various types of system software.

System software consists of software programs that support the operations of a computer. A variety of system software programs (listed in the course description) are to be covered in the course.

2. To learn the relationships between machine architecture and system software. 3. To acquire practical hands-on experience in designing and implementing some

selected types of system software in a course team oriented project. 4. To learn software engineering concepts and related issues in designing and

implementing software projects. The concepts are applied in a team oriented course project.


(Text Book) An Introduction to Systems Programming, Third Edition, Leland L. Beck, Addison Wesley, 1997.

Page 2 of 4

• Support material (s) (Course website: Includes reference books and Course Notes_ Power Point Slides).

• http://lbadri.com/index.php?option=com_content&task=view&id=34&Itemid=37

• Study guide (s) • Homework and laboratory guide (s): Listed in the Course website.

Teaching methods: Lectures, tutorials, reports, and problem solving.


_ Understand the operation of the Assemblers, Linker and loaders, macro processors, Compilers systems software.

_ Understand system software design methods.

• Cognitive skills (thinking and analysis). _ Design and program simple Assembler, Loader and Linker programs, as well as Macro processors. _ Describe the operation of, and discuss design options of the Assembler, Linker and loaders, macro processors, Compilers systems software.

• Communication skills (personal and academic). _ Have an ability to function on a team..

The course requires students (organized in teams of 1-3 students) to design and implement system software projects.

_ An understanding of professional and ethical responsibility. • Practical and subject specific skills (Transferable Skills).

_ Have an ability to apply knowledge of system software design methods. _ Have an ability to design and conduct system software design projects. _ Have an ability to design and implement some major types of system software.



Allocation of Marks


20% First exam

20% Second exam


10% Reports, Quizzes, Home works, Projects

100% Total

Page 3 of 4


-------------------------------------------------------------------------------------------------------------------- -------------------------------------------------------------------------------------------------------------------- • Protection by copyright • Avoiding plagiarism. Course/module academic calendar

week


covered


(1) Introduction, System Software and Application Software, Simplified Instructional Computer (SIC) and SIC/XE Machine Architecture

Homework1 Week 2

(2) Assembler Functions, Machine Dependent Assembler Features

Homework2 Week 3

(3) Assembler Functions, Machine Independent Assembler Features

(4) Assembler Design Options

Homework3 Week 5

(5) Project 1 Project Report1 Week5



(7) Loader Functions, Machine-

Dependent and –Independent

Features

Homework4 Week 8

(8) Loader Functions, and

Design Options

(9) Linker Functions, Machine-dependent and –independent Features and Design Options

Homework5 Week 10

(10) Project2 Project Report2 Week10



(12) Macro Processor s and Design Options

(13) Compiler Functions and Compiler Design Options

Homework6 Week 14

(14) Project 3 Project Report3 Week14


(Optional)



Page 4 of 4


1. System Programming and Operating Systems. Dhamdhere. 2. System Programming & O. S. - D. M. Dhamdhere - T. M. H. 3. Systems Programming - J. J. Donovan - McGraw Hill. 4. Structured System Programming - Welsh & Mckeag, EEE, PHI

Web sites http://lbadri.com

Documents

Advanced Computer Architecture 630561First semester, 2007/2008 Course Syllabus Course code: 630561 Course Title: Advanced Computer Architecture Course Level: 5th year Course prerequisite