Ce 2

COLLEGE OF ENGINEER ING AND TECHNOLOGY
Arab Academy for Science, Technology and Maritime Transport
COMPUTER ENGINEERING
B. Sc. Program
StatusReport:VolumeII December2009
B. SC. PR O GR A M STA TU S R E PO R T
Computer Engineering
Prepared by Departmental Committee and Coordinated by
Dr. Mohamad Abou El-Nasr

Head of Department Department of Computer Engineering
DECEMBE R 2009
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
DEPARTMENT VISION/MISSION STATEMENTS

Vision
We envision a department that is committed to education and helping to make an impact and a contribution to society through its quality graduates and cutting edge research agendas in a stimulating intellectual environment where faculty, students and staff can thrive and grow.
Mission
Our mission is to educate and train students so that they have the knowledge to enter the market place and the skills to continually enhance this knowledge, and provide leadership in industry and academia.
DEPARTMENT OBJECTIVES
The objectives of the department of computer engineering are: Continuously reviewing and updating the programs of studies to maintain the high level of education required by our students. Establishing strong relationships with the industry and community through continuous collaboration in terms of research, graduate studies, and training. Providing the business and industry communities with high quality industrial engineers who are produced through our learning and program flexibility, hands-on experience, training, and research opportunities. Attracting full-time faculty members that are of high calibre and are of different specializations for the next five years. Maintaining a minimum of eight full time teaching assistants (GTAs and TAs) in the department. Encouraging students to form chapters of international institutes and organizations within the department.
INDUSTRIAL AND SYSTEMS ENGINEERING
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Table of Contents
I N T R OD U C TI ON Computer Engineering: An Overview The Role of Computer Engineers Career Opportunities for Computer Engineers Program Aim and Objectives Program Intended Learning Outcomes (ILOs) 1 1 1 2 3 3 T E A C H IN G Full Time Staff Assistants P R O G R A M Curriculum Course Coding Degree Offered Graduation Requirements Course Prerequisites Academic Program Analysis Program Analysis by Semester Offering Program Analysis by Subject Field Comparison with Previous Program P L AN NI NG S H E E T 5 5 5 6 7 11 16 21 24 30 D E P A R T M E N T F A C IL I TI E S 2 11 Full Time Graduate Teaching Assistants F A CU L T Y LI S T 2 04 204 208 210 Industrial and Systems Engineering Courses IM 186 Mechanical Engineering Courses ME Non-Engineering Courses NE 194 196
Experimental Facilities Supporting the Program211 Field-Programmable Gate Array (FPGA) Laboratory Microprocessor Laboratory Digital Circuits Laboratory Computer Laboratories Computer Laboratories Computer Laboratories Computer Laboratories Computer Laboratories 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229
Computer Engineering Academic Program Sheet 10
C O U R S E S SU M M A R Y D E S C R I P T IO N Basic and Applied Science (BA) Computer Engineering (CC) The Training and Senior Project Electronics and Communication Engineering (EC) Electrical Engineering (EE) Language, Humanities and Social Science (LH) Industrial and Systems Engineering (IM) Mechanical Engineering (ME) Non-Engineering (NE)
3 1 31 34 42 43 44 45 46 47 48
Computer Laboratories Computer Laboratories Computer and Network Laboratory Electrical Machines Laboratory Electrical Circuits Laboratory Digital Communication Laboratory Reverse Engineering Laboratory Physics Laboratory Physics Laboratory Chemistry Laboratory
C O U R S E
F IL E
S U M MA R Y
4 9 50 72 174 180
Basic and Applied Science Courses BA Computer Engineering Courses CC Electrical Engineering Courses EE Language, Humanities, & Social Science Courses LH
Electronics and Communications Courses EC 166
INDUSTRIAL AND SYSTEMS ENGINEERING
ii
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Chapter
Introduction
Program overview, activities and job opportunities, and program objectives
Computer Engineering: An Overview

Computer engineering as an academic field encompasses the broad areas of computer science and electrical engineering. According to the Association for Computing Machinery (ACM) and the Institute of Electrical and Electronics Engineers (IEEE) Computer engineering is defined as the discipline that embodies the science and technology of design, construction, implementation, and maintenance of software and hardware components of modern computing systems and computercontrolled equipment. Computer engineering has traditionally been viewed as a combination of both computer science (CS) and electrical engineering (EE). It has evolved over the past three decades as a separate, although intimately related, discipline. Computer engineering is solidly grounded in the theories and principles of computing, mathematics, science, and engineering and it applies these theories and principles to solve technical problems through the design of computing hardware, software, networks, and processes. Historically, the field of computer engineering has been widely viewed as designing computers. In reality, the design of computers themselves has been the province of relatively few highly skilled engineers whose goal was to push forward the limits of computer and microelectronics technology. The successful miniaturization of silicon devices and their increased reliability as system building blocks has created an environment in which computers have replaced the more conventional electronic devices. These applications manifest themselves in the proliferation of mobile telephones, personal digital assistants, location-aware devices, digital cameras, and similar products. It also reveals itself in the myriad of applications involving embedded systems, namely those computing systems that appear in applications such as automobiles, large-scale electronic devices, and major appliances.
The Role of Computer Engineers

Designing computing systems and computing components of products, developing and testing their prototypes, and implementing them to market are examples of what computer engineers would do. Computing systems are components of a wide range of products such as fuel injection systems in vehicles, medical devices such as x-ray machines, communication devices such as cell phones, and household devices such as alarm systems and washing machines. It is through a unique combination of Computer Science and Electrical, Electronics and Communications discipline that the CC student get prepared for careers that deal with computer systems from design through implementation.
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
The role of computer engineers is to build systems for computers, systems of computers and systems by and with computers for computing, sensing, communication, control, storage, and intelligent processing of information. Systems for computers as building VLSI chips, data storage, sensors, MEMS, and electronic devices. Systems of computers for example distributed computing, security, networking, etc. And finally systems By/with computers as in the field of design, simulation, signal processing and sensor exploitation, and embedded systems. Computer engineers continually push the capability and applicability of computers in every industry and every facet of modern life.
Career Opportunities for Computer Engineers

Computer engineers are involved in the design of computer-based systems to address highly specialized and specific application needs. Computer engineers work in most industries, including the computer, aerospace, telecommunications, power production, manufacturing, defence, and electronics industries. They design high-tech devices ranging from tiny microelectronic integratedcircuit chips, to powerful systems that utilize those chips and efficient telecommunication systems that interconnect those systems. Applications include consumer electronics (CD and DVD players, televisions, stereos, microwaves, gaming devices) and advanced microprocessors, peripheral equipment, systems for portable, desktop and client/server computing, and communications devices (cellular phones, pagers, personal digital assistants). It also includes distributed computing environments (local and wide area networks, wireless networks, internets, intranets), and embedded computer systems (such as aircraft, spacecraft, and automobile control systems in which computers are embedded to perform various functions). A wide array of complex technological systems, such as power generation and distribution systems and modern processing and manufacturing plants, rely on computer systems developed and designed by computer engineers. Technological advances and innovation continue to drive Computer Engineering. There is now a convergence of several established technologies (such as television, computer, and networking technologies) resulting in widespread and ready access to information on an enormous scale. This has created many opportunities and challenges for computer engineers. This convergence of technologies and the associated innovation lie at the heart of economic development and the future of many organizations. The situation bodes well for a successful career in computer engineering. Career opportunities for Computer Engineers cover a whole spectrum of industrial systems and service systems. Industrial systems include ,but are not limited to : Automotive, Aerospace, Apparel, Basic metals, Beverages, Building materials, Chemicals, Computers, Appliances, Electronics, Equipment, Fabricated metals, Food processing, Glass, Ceramics, heavy machinery, Paper, petroleum refining, Pharmaceuticals, Plastics, Power utilities, Publishing, Textiles, Tire and rubber, Wood and furniture. Service Systems include, but are not limited to : Banking, Education, Communications, Financial services, Government, Health and medical, Hotel, Information, Insurance, Repair and maintenance, Restaurant, Retail trade, Transportation, Wholesale trade, Transportation, and Warehousing
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Program Aim and Objectives

The Computer Engineering program at the Arab Academy for Science and Technology and Maritime Transport AASTMT was established in 1994 to prepare graduates for careers in various areas. The program has been carefully designed and continuously updated according to the engineering criteria 2000 approved by the Accreditation Board for Engineering and Technology (ABET) board of directors on November 1st, 1997. Further improvements have been introduced into the program to match the recommendations by an advisory board form a distinguished group of British universities and institutes, so as to meet the requirements for accreditation by those institutes. The main objective of the program is to produce and qualify graduate computer engineers that satisfy the following characteristics: Possess the ability to design computers and computer-based systems that include both hardware and software to solve novel engineering problems, subject to trade-offs involving a set of competing goals and constraints. In this context, design refers to a level of ability beyond assembling or configuring systems. Have a breadth of knowledge in mathematics and engineering sciences, associated with the broader scope of engineering and beyond that narrowly required for the field. Acquire and maintain a preparation for professional practice in engineering. Demonstrate the ability to design, develop, implement, and improve integrated systems that include people, materials, information, equipment and energy. Provide strong ties and linkages between the local economic sectors and industrial communities with the department graduates in areas related to research, hands-on training, and field investigations.
The responsibility of achieving this objective is carried out by computer engineering Faculty and staff experienced in the management of engineering and technical activities.
Program Intended Learning Outcomes (ILOs)

Knowledge and Understanding
On successful completion of the computer engineering program of study, the graduate should be able to demonstrate knowledge and understanding of: Basic applied and engineering science, electric and electronic circuits engineering and electrical measurements and measuring instruments. Programming concepts, procedural, structured and Object Oriented concepts and different Data Structures. Hardware engineering concepts, components and Computer Architecture and organization Understanding the concepts of computer networks and internet and the HW/SW systems and interfacing Understanding the Artificial Intelligence applications and robotics Understanding operating System concepts and different algorithms used in Operating The key issues of computer engineering such as hardware, software, interfacing, control, networking and Internetworking.
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
The different analytical and computer methods that can be applied to the various areas of computer engineering.
Intellectual Skills
On completion of the computer engineering program of study, students should be able to: Define the engineering problems. Select and apply appropriate computer based methods, mathematical and scientific principles for analysing general systems. Apply knowledge of mathematics, science, and engineering Design and conduct experiments, as well as to analyze and interpret data Solve a wide range of problems related to the analysis, design, and construction of computing systems. Analyze the solution alternatives and choose the optimum one. Identify acceptable solutions of problems based on practical engineering constraints
Practical and Professional Skills
On completion of the computer engineering program of study, students should be able to: Plan and undertake a major individual project. Prepare and deliver coherent and structured verbal and written technical reports. Give technical presentations suitable for the time, place and audience. Use the scientific literature effectively and make discriminating use of Web resources. Identify, formulate, and solve engineering problems. Design a system, component, or process to meet desired needs within realistic constraints such as economic, environmental, social, political, ethical, health and safety, manufacturability, and sustainability. Display an integrated approach to the deployment of communication skills. Work effectively with and for others. Display personal responsibility by working to multiple deadlines in complex activities. Further develop career plans and personal objectives.
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Chapter
Program Planning Sheet

New program structure including the suggested new course titles and codes and comparison between this program and the previous one
Curriculum
The program curriculum provides great flexibility in course selection and offers a broad scientific and engineering base by containing a sequence of courses in mathematics, physics, chemistry, computer and the engineering sciences. These courses are accompanied by computer engineering courses covering the areas of computer architecture, digital system design, data acquisition, microcomputer based design, computer networks, distributed systems, databases, system programming, operating systems, information systems and computing systems analysis and design.
Course Coding
Numbering System
The course code consists of five alphanumeric digits, MN XYZ depending on the nature of the course; whether it is core or elective.
M N X Y Z
Subject Field
Course Level Course Group Course Sequence
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
The MN digits : Represent the abbreviations of the subject field. The X digit : Represents the course level or the year at which the course is offered in the plan of study. The Y digit : Represents the course group. The Z digit : Represents the course sequence number within the group.
Abbreviations of Subject Fields
The following abbreviations of subject fields are used in the Degree offered and Graduation Requirements and Course Summary Description sections of this report; and are listed below in an alphabetical order: BA Basic and Applied Science. CC Computer Engineering. EE Electrical Engineering. LH Language, Humanities and Social Science. IM Industrial and Systems Engineering. ME Mechanical Engineering. NE Non-Engineering Courses.
Degree Offered
The program offers the degree of Bachelor of Science (B. Sc.) in Computer Engineering. The candidate for the (B. Sc.) degree is required to pursue scholastic quality and complete a plan of study prepared with his academic advisor and approved by the Computer Engineering Department Council. The number of credit hours required for graduation is 180 (cr. hr.) spreading over 10 academic semesters. The program contains a sequence of courses that are designed according to the National Academic Reference Standards (NARS) for computer engineering.
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Graduation Requirements
College Requirements
A total of 66 credit hours are required by the college as per the following table:
Semester Subject Field Course Code
Course Title Compulsory Courses A total of 23 Courses (60 Cr. Hr.) of the following compulsory courses 1 BA113 Physics (1) 2 BA114 Physics (2) 2 BA118 Chemistry 1 BA123 Mathematics (1) 2 BA124 Mathematics (2) BA 1 BA141 Engineering Mechanics (1) 2 BA142 Engineering Mechanics (2) 3 BA223 Mathematics (3) 4 BA224 Mathematics (4) 5 BA323 Mathematics (5) 6 BA326 Mathematics (6) CC 1 2 1 2 8 8 10 1 2 3 1 CC111 CC112 IM111 IM112 IM400 IM423 IM535 LH131 LH132 LH231 ME151 Introduction to Computer Structured Programming Industrial Relations Manufacturing Technology Practical Training Operations Research International Operations Management English (1) English (2) English (3) Eng. Drawing and Descriptive Geometry
Cr. Hr. 3 3 2 3 3 3 3 3 3 3 3 3 3 2 2 0 3 3 2 2 3 2 3 3 3 3
Prerequisite
None BA 113 None None BA 123 None BA 141 BA 124 BA 223 BA224 BA323 None CC 111 None None None 90 Cr. Hr. 126 Cr. Hr. None LH 131 LH 132 None None
IM
LH ME
NE 6 NE 364 Engineering Economy College Non Engineering Electives Two courses (6 Cr. Hr.) from the following list of the college electives 3 NE 264 Scientific Thinking NE 3 NE 465 Aesthetic Education and Art Appreciation 3 NE 466 Environmental Science and Technology
None None None
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Department Requirements
A total of 114 credit hours are required by the department, which are distributed as follows: 96 credit hours of compulsory courses. A minimum of 18 credit hours of department restricted electives.
The required compulsory and restricted elective courses are listed in the following tables.
Semester
Subject Field
Course Code
Course Title
Cr. Hr. 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 6 3 3 3 3 3 3 3 3 3
Prerequisite
Compulsory Courses A total of 32 Courses (96 Cr. Hr.) of the following compulsory courses 3 CC213 Programming Applications 3 CC218 Discrete mathematics 4 CC215 Data Structure 4 CC216 Digital Logic Design 5 CC317 Digital Systems Design 5 CC319 Advanced Programming 6 CC311 Computer Architecture 6 CC316 Object-Oriented Programming 6 CC341 Digital Electronics 6 CC331 Data and Computer Communications 7 CC410 Systems Programming CC 7 CC421 Microprocessors Systems 7 CC413 Numerical Analysis 7 CC414 Database Systems 8 CC415 Data Acquisition System 8 CC416 Computer Graphics 8 CC418 Operating Systems 8 CC431 Computer Networks 9 CC501 Project I 9 CC511 Artificial Intelligence 9 CC531 Advanced Networks 10 CC502 Project II 10 CC513 Computing Systems 4 EC238 Electronics I 4 EC218 Measurements & Instrumentation EC 5 EC320 Communications Theory 5 EC339 Electronics II 3 EE231 Electrical Circuits I 4 EE232 Electrical Circuits II EE 5 EE328 Electrical Power & Machines 7 EE418 Automatic Control Systems
CC 112 CC 111 CC 213 CC 111 CC 216 CC 215 CC 317 CC 319 EC 238 EC 320 CC 319 CC 311 CC 112, BA 224 CC 319 CC 421 CC 319 CC 410 CC 331 * S. S. CC 318, CC 319 CC 431 Project I CC 418, CC 421 EE 231 EE 231 BA 224, EE 231 EC 238 BA124 EE 231 EE 232 EE328 or EE218
Senior Standing (Semesters 9 and 10 only).
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Semester
Subject Field
Course Code
Course Title Department Restricted Electives 6 courses (18 Cr. Hr.) from the following list of electives 7 10 CC 412 Computing Algorithms 7 10 CC 417 Assembly Language 7 10 CC 515 Introduction to Software Engineering 7 10 CC 516 Pattern Recognition 7 10 CC 517 Modelling & Simulation 7 10 CC 518 Computer Security 7 10 CC 521 Microcomputer Based Design 7 10 CC 523 Computer Design and Performance Eval. 7 10 CC 524 Neural Networks CC 7 10 CC 525 Intelligent Robotics 7 10 CC 527 Computer Aided Design 7 10 CC 528 Computer Systems Performance Analysis 7 10 7 10 7 10 7 10 7 10 7 10 7 10 CC 529 CC 533 CC 535 CC 537 CC 539 CC 540 CC 550 Distributed and parallel systems Internetwork Programming Internetwork Security Computer Forensics Selected Topics in Networks Computer Systems Engineering Selected topics in Computing
Cr. Hr. 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3
Prerequisite
CC 319 CC 421 CC 319 CC 416 CC 319, BA 326 CC 319 CC 415 CC311 BA 323, CC 112 CC 319, EE 418 CC 311 or CC 312 CC112-CC531 CC 431 CC 431 CC 431, CC 518 Cr. Hrs. 138 CC 531 Cr. Hrs. 138 Cr. Hrs. 138
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Computer Engineering Academic Program Sheet

Year 1 Semester 1 BA 113 Physics 1 BA 114 BA 123 Mathematics 1 BA 118 BA 141 Engineering Mechanics 1 BA 124 CC 111 Introduction to computer BA 142 IM 111 Industrial Relations CC 112 LH 131 English for Special Purposes 1 IM 112 ME151 Eng. Drawing & Descriptive Geometry LH 132 Year 2 Semester 3 BA 223 Mathematics III BA 224 CC 213 Programming Applications CC 215 CC 218 Discrete Mathematics CC 216 EE 231 Electrical Circuits I EC 218 LH 231 Technical Report Writing EC 238 NE XXX 1 College elective course EE 232 Year 3 Semester 5 BA 323 Mathematics V BA 326 CC 317 Digital Systems Design CC 311 CC 319 Advanced Programming CC 316 EE 328 Electrical Power & Machines CC 331 EC 339 Electronics II CC 341 EC 320 Communications Theory NE 364 Year 4 Semester 7 CC 410 Systems Programming CC 415 CC 413 Numerical Analysis CC 416 CC 414 Database Systems CC 418 CC 421 Intro. to Microprocessors CC XXX CC XXX Department Restricted Elective CC 431 EE 418 Automatic Control Systems IM 400 IM 423 Year 5 Semester 9 CC 501 Project I CC 502 CC 511 Artificial Intelligence CC 513 CC 531 Advanced Networks CC XXX CC XXX Department Restricted Elective CC XXX CC XXX Department Restricted Elective IM 535 NE XXX 1 College elective course Semester 2 Physics 2 Chemistry Mathematics 2 Engineering Mechanics 2 Structured Programming Manufacturing Technology English for Special Purposes 2 Semester 4 Mathematics IV Data Structure Digital Logic Design Measurements & Instrument Electronics I Electrical Circuits II Semester 6 Mathematics VI Computer Architecture Object-Oriented Programming Data and Computer Communications Digital Electronics Engineering Economy Semester 8 Data Acquisition System Computer Graphics Operating Systems Department Restricted Elective Computer Networks Practical Training Operations Research Semester 10 Project II Computing Systems Department Restricted Elective Department Restricted Elective International Operations Mgt.
10
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
College Electives NE 264 Scientific Thinking NE 465 Aesthetics Education and Art Appreciation NE 466 Environmental Science and Technology Department Restricted Electives CC 412 Computing Algorithms CC 417 Assembly Language CC 515 Intro. to Software Engineering CC 516 Pattern Recognition CC 517 Modelling & Simulation CC 518 Data Security CC 521 Microcomputer Based Design CC 523 Comp. Design & Performance Eval. CC 524 Neural Networks CC 525 Intelligent Robotics CC 527 Computer Aided Design CC 528 Computer Systems Performance Analysis CC 529 Distributed and parallel systems CC 533 Internetwork Programming CC 535 Internetwork Security CC 537 Computer Forensics CC 539 Selected Topics in Networks CC 540 Computer Systems Engineering CC 550 Selected Topics in Computing
Course Prerequisites
The courses prerequisites are listed in the tables below, which is used by advisors to guide the students through their program of study.
11
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Prerequisites List Core Courses
Course SEMESTER 1 BA 113 BA 123 BA 141 CC 111 IM 111 LH 131 BA 118 Physics 1 Mathematics 1 Engineering Mechanics 1 Introduction to computer Industrial Relations English for Special Purposes 1 Chemistry
Prerequisite
None None None None None None None
SEMESTER 2 BA 114 ME151 BA 124 BA 142 CC 112 IM 112 LH 132 Physics 2 Eng. Drawing & Projection Mathematics 2 Engineering Mechanics 2 Structured Programming Manufacturing Technology English for Special Purposes 2 BA 113 None BA 123 BA 141 CC 111 None LH 131 English for Special Purposes 1 Mathematics 1 Engineering Mechanics 1 Introduction to computer YEAR 1
12
Physics 1
SEMESTER 3 BA 223 CC 213 CC 218 EE 231 LH 231 NE XXX Mathematics III Programming Applications Discrete Mathematics Electrical Circuits I Technical Report Writing 1 College elective course BA 124 CC 112 CC 111 BA 124 LH 132 None Mathematics 2 Structured Programming Introduction to Computers Mathematics 2 English for Special Purposes 2
SEMESTER 4 BA 224 CC 215 CC 216 EC 218 EC 238 EE 232 Mathematics IV Data Structure Digital Logic Design Measurements & Instrumentation Electronics I Electrical Circuits II BA 223 CC 213 CC 111 EE 231 EE 231 EE 231 Mathematics 3 Programming Applications Introduction to computer Electrical Circuits I Electrical Circuits I Electrical Circuits I YEAR 2
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Course SEMESTER 5 BA 323 CC 317 CC 319 EE 328 EC 339 EC 320 Mathematics V Digital Systems Design Advanced Programming Electrical Power & Machines Electronics II Communications Theory
Prerequisite
BA 224 CC 216 CC 215 EE 232 EC 238 BA 224 EE 231
Mathematics IV Digital Logic Design Data Structure Electrical Circuits II Electronics I Mathematics IV Electrical Circuits I
SEMESTER 6 CC 316 CC 311 NE 364 CC 341 CC 331 BA 326 Object-Oriented Programming Computer Architecture Engineering Economy Digital Electronics Data and Computer Communications Mathematics VI EC 238 EC 320 BA 224 CC 319 CC 317 Advanced Programming Digital Systems Design Cr. Hrs. 54 Electronics I Communications Theory Mathematics IV YEAR 3
13
SEMESTER 7 CC 410 CC 421 CC 413 CC 414 CC XXX EE 418 Systems Programming Microprocessors Systems Numerical Analysis Database Systems Department Restricted Elective Automatic Control Systems BA 323 CC 319 CC 311 CC 111 BA 224 CC 319 Advanced Programming Computer Architecture Introduction to computer Mathematics IV Advanced Programming As Designated Below Mathematics V
SEMESTER 8 CC 415 CC 416 CC 418 CC 431 CC XXX IM 400 IM423 Data Acquisition System Computer Graphics Operating Systems Computer Networks Department Restricted Elective Practical Training Operations Research None Cr. Hrs 90 CC 421 CC 319 CC 410 CC 331 Microprocessors Systems Advanced Programming Systems Programming Data and Computer Communications As Designated Below YEAR 4
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Course SEMESTER 9 CC501 CC511 CC531 CCXXX CCXXX NEXXX Project I Artificial Intelligence Advanced Networks Department Restricted Elective Department Restricted Elective 1 College elective course
Prerequisite
Senior Standing CC 218 CC 319 CC 431 Discrete Mathematics Advanced Programming Computer Networks As Designated Below As Designated Below None
SEMESTER 10 CC502 CC513 CCXXX CCXXX IM535 Project II Computing Systems Department Restricted Elective Department Restricted Elective International Operations Mgt. CC 501 CC 421 CC 418 Senior Project I Microprocessors Systems Operating Systems As Designated Below As Designated Below Cr. Hrs 126 YEAR 5
14
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Prerequisites List Elective Courses
Course College Electives NE 264 NE 465 NE 466 Scientific Thinking Aesthetics Education and Art Appreciation Environmental Science and Technology
Prerequisite
None None None
Department Restricted Electives CC 412 CC 417 CC 515 CC 516 CC 517 CC 518 CC 521 CC 523 CC 524 CC 525 CC 527 CC 528 CC 529 CC 533 CC 535 CC 537 CC 539 CC 540 CC 550 Computing Algorithms Assembly Language Intro. to Software Eng Pattern Recognition Modelling & Simulation Data Security Microcomputer Based Design Comp. Design & Performance Eval. Neural Networks Intelligent Robotics Computer Aided Design Computer Systems Performance Analysis Distributed and parallel systems Internetwork Programming Internetwork Security Computer Forensics Selected Topics in Networks Computer Systems Engineering Selected Topics in Computing CC 319 CC 421 CC 319 CC 414 CC 416 CC 319 BA 326 CC 319 CC 415 CC 311 BA 323 CC 112 CC 319 EE 418 CC 311 CC 312 CC112 CC531 CC 431 CC 431 CC 431 S.S. CC 531 S.S. S.S. Advanced Programming Microprocessors Systems Advanced Programming Database Systems Computer Graphics Advanced Programming Mathematics VI Advanced Programming Data Acquisition Systems Computer Architecture Mathematics V Structured Programming Advanced Programming Automatic Control Systems Computer Architecture or Computer Organization Structured Programming Local Area Networks Computer networks Computer networks Computer networks Senior Standing (Cr. Hrs. 138) Advanced Networks Senior Standing (Cr. Hrs. 138) Senior Standing (Cr. Hrs. 138)
15
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Academic Program Analysis

YEAR ONE
16
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
YEAR TWO
17
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
YEAR THREE
Code BA323 CC317 CC319 EC320 EC339 EE328
Title Mathematics (5) Digital System Design Advanced Programming Communication Theory Electronics (2) Electrical Power & Machines
Contact Hours Lecture Tutorial Lab 2 2 0 2 2 2 2 0 2 2 2 0 2 2 0 2 2 0 Total 12 10 4
Credit Hours 3 3 3 3 3 3 18
Prerequisites Pre (1) Pre (2) BA224 None CC216 None CC215 None BA224 EE231 EC238 None EE232 None Total
NARS Characterization for Engineering by Subject Area A B C D E F G 0 3 0 0 0 0 0 0 0 0 1.5 0 1 0.5 0 0 0 2 0 1 0 0 0 3 0 0 0 0 0 0 3 0 0 0 0 0 0 3 0 0 0 0 0 3 9 3.5 0 2 0.5
Total 3 3 3 3 3 3 18
Code BA326 CC311 CC316 CC331 CC341 NE364
Contact Hours Lecture Tutorial Lab Title Mathematics (6) 2 2 0 Computer Architecture 2 2 2 Object Oriented Programming 2 0 2 Data and Computer Communications 2 2 2 Digital Electronics 2 2 2 Engineering Economy 2 2 0 Total 12 10 8
SEMESTER SIX Prerequisites Credit Pre (1) Pre (2) Hours 3 BA224 None 3 CC317 None 3 CC319 None 3 EC320 None 3 EC238 None 3 54 Cr Hr None 18 Total
NARS Characterization for Engineering by Subject Area A B C D E F G 0 3 0 0 0 0 0 0 0 0.5 1.5 0 1 0 0 0 0 1 2 0 0 1 0 1 1 0 0 0 0 0 2 1 0 0 0 1 2 0 0 0 0 0 2 5 3.5 4.5 2 1 0
Total 3 3 3 3 3 3 18
18
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
YEAR FOUR
19
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
YEAR FIVE
20
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Program Analysis by Semester Offering
Table 1 Distribution of contact hours by semester
35
30
25 Contact Hours 20 8 15 10 14 5 0 1 2 3 4 5 6 7 8 9 10 13 12 12 12 12 12 12 12 11 6 8 4 6 10 8
4
12 12
10
10
10
10
10
Lab Tutorial Lecture
Semester
Figure 1: Distribution of contact hours by semester
21
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
100% 90% 80% 4 8
2 6
4 8
6 10
70%
% Contact Hours 60% 50% 40% 30% 20% 10% 0%
8 6
10
10
10 10 12 8 12
10 Lab Tutorial
14
Lecture 13 12 12 12 12 12 12 12 11
10
Semester
Figure 2: Percentage of contact hours by semester
Lab 22% Lecture 44% Lecture Tutorial Lab Tutorial 34%
Figure 3 Distribution of total contact hours.
22
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
20 18 16 14 Credit Hours 12 10 8 6 4 2 0 1 4 2 2 3 6 3 4 3 2 10 2 2 1 2 1 2 1 5 1.5 1 5.5 0.5 2 3.5 1 2 4.5 1.5 3 3 0.5 1.5 4 2 2 12 4 7 3.5 9 5 4.5 1 7 2 2 8 5 5.5 6 1 3.5 1 9 10 2 7 Discretionary Projects and Practice Computer Applications and ICT Applied Engineering and Design Basic Engineering Sciences
5 6 Semester
Figure 4 Distribution of Credit Hours over the NARS Characteristics by Semester.
100% 90% Credit Hours Percentage 80% 70% 60% 50% 40% 30% 20% 10% 0% 1 4 10 2 2
1 2 1
2 1 5
1.5 0.5 2 1 5.5 3.5
1 2 4.5
1.5 0.5 1.5 3 3 4
4
2
7
Discretionary 2 Projects and Practice Computer Applications and ICT Applied Engineering and Design 6 1 Basic Engineering Sciences Mathematics and Basic Sciences Humanities and Social Sciences
12
4 7 6
3.5 9 5
5 5.5 4.5
6 1 3.5 9
2 2 8
2 2 3
3 4
3 5
2 6
1 7
10
Semester
Figure 5 Percentage of Credit Hours over the NARS Characteristics by Semester.
23
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Discretionary Humanities and 6% Social Sciences Projects and 10% Practice 10% Computer Mathematics and Applications and Basic Sciences ICT 22% 10% Applied Engineering Basic Engineering and Design Sciences 22% 20%
Humanities and Social Sciences

Mathematics and Basic Sciences Basic Engineering Sciences
Applied Engineering and Design

Computer Applications and ICT Projects and Practice
Discretionary
Figure 6 Distribution of Total Credit Hours.
Program Analysis by Subject Field
24
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
100 90 80 70 Contact Hours 60 50 40 30 20 10 0 BA 22 6 16 46 12 12 12 28 Lab Tutorial Lecture 38
8 4
2 8
8 EE
8 8 IM
2 2 8 LH
6 6 ME
2 2 NE
6 6 EC
CC G0 CC G1 CC GE
Subject Field
Figure 7 Distribution of Contact Hours by Subject Field.
100% 90% 80% Contact Hours Percentage 70% 60% 50% 40% 28 12 Lab Tutorial 6 38 12 8 2 6 2 6 8
16
30%
20% 10% 0% BA CC G0 CC G1 CC GE EE IM
8 22
4 46 8 12
Lecture 6 2 6
LH
ME
NE
EC
Subject Field
Figure 8 Contact Hours Percentage by Subject Field.
25
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
NE 2% LH 4% ME 4% IM 6% EC 4% BA 16% CC G0 4% BA CC G0 CC G1 CC GE EE 7% EE IM LH CC GE 13% CC G1 40% ME NE EC
Figure 9 Distribution of Contact Hours by Subject Field.
NE 2% ME 4%
EC 4%
CC G0 4%
LH 4% IM 6% EE 7%
Other 58%
CC G1 40%
BA 16%
CC GE 13%
Figure 10: Percentage of CC Courses Total Contact Hours per Week.
26
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC G0; 7% CC GE; 23%
CC G0 CC G1 CC GE
CC G1; 70%
Figure 11: Percentage of Total Contact Hours by CC Course Group.
80
70 60 Credit Hours 50 40 30 26.5 20 32 10 0 BA 5.5 2 1 0.5 CC G0 10 2 1 CC G1 6 3 9 CC GE 0.5 1.5 10 EE 3 2 3 2 LH 2 7 EC 2.5 11 16 Discretionary Projects and Practice Computer Applications and ICT Applied Engineering and Design Basic Engineering Sciences Mathematics and Basic Sciences 12 IM Humanities and Social Sciences 7
1 1
ME NE
Subject Field
Figure 12: Distribution of Credit Hours by Subject Field.
27
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
100% 90% 80% Credit Hour Percentage 70% 60% 50% 40% 30% 20% 10% 0% BA 1 2 32
2.5 11 6
0.5
1.5
3 1
5.5 16
3 12 26.5 9 10 2 1 EE IM LH ME NE EC 2 10 3 1 2 7 7 Discretionary Projects and Practice Computer Applications and ICT Applied Engineering and Design Basic Engineering Sciences Mathematics and Basic Sciences Humanities and Social Sciences
0.5
CC CC CC G0 G1 GE
Subject Field
Figure 13: Credit hour percentage by subject field.
NE ME 1% 4%
EC 5%
LH 5% IM 7% EE 7%
BA 18%
BA CC G0 CC G0 5% CC G1 CC GE EE IM LH
CC GE 10% CC G1 38%
ME NE EC
Figure 14 Distribution of Total Credit Hours by Subject Field. COMPUTER ENGINEERING 28
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
EC; 5% NE; 1% ME; 4% LH; 5%
CC G0; 5% CC G1; 38%
IM; 7% CC 57% EE; 7%
CC GE; 10% BA; 18%
Figure 15: Distribution of Total Credit Hours by Subject Field.
CC G0 9% CC GE 19%
CC G0 CC G1 CC GE
CC G1 72%
Figure 16: Distribution of Total CC Courses Credit Hours.
29
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Comparison with Previous Program

Changes to Previous Program
The previous Computer Engineering program has been modified to meet the requirements of the IET professional institute (part of the British Professional Institutes) and more importantly to satisfy the requirements of the Supreme Council of Egyptian Universities. The changes were carried in harmony with the IEEE computer engineering curriculum report 2006
Computer Engineering courses Old Courses Code EC 230 EC 326 EE 419 CC 318 CC 411 CC 512 CC 514 Title Solid State Electronics Systems 1 Modern Control Discrete Mathematics Int. To Microprocessors Networks I Networks II NEW COURSE NEW COURSE NEW COURSE NEW COURSE NEW COURSE NEW COURSE NEW COURSE NEW COURSE NEW COURSE Code New Courses Title DELETED COURSE DELETED COURSE DELETED COURSE CC 218 CC 421 CC 431 CC 531 CC 331 CC 528 CC 529 CC 533 CC 535 CC 537 CC 539 CC 540 CC 550 Discrete Mathematics Microprocessors Systems Computer Networks Advanced Networks Data and Computer Communications Computer Systems Performance Analysis Distributed and Parallel Systems Internetwork Programming Internetwork Security Computer Forensics Selected Topics in Networks Computer Systems Engineering Selected Topics in Computing
30
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Chapter
Courses Summary Description

Brief description of all courses that including the number of credit hours and prerequisites.
Basic and Applied Science (BA)

BA 113 Physics (1)
Cr.3. Prerequisite: None Introduction to static electricity and Coulombs law - Introduction to static electricity and coulombs law - Electric field. - Electric potential. Capacitors - Electric current, ohms law resistors in series and parallel - Kirchhoffs rule - Introduction to theory of magnetism and different applications - Electromagnetic induction - Optics and waves (nature of light, properties of light waves) - Youngs double slit polarization of light waves.
BA 114 Physics (2)
Cr.3. Prerequisite: BA113 Introduction to thermodynamics - Reversibility and reversible work - First law of thermodynamics Non-flow equation - Steady flow equation - Working Fluid (steam, perfect gas) - Reversible processes.(constant volume, constant pressure, constant temperature, adiabatic) - Reversible process ( polytropic) - Second law of thermodynamics - Heat transfer.
BA 118 - Chemistry
Cr.2. Prerequisite: None Electrochemical reactions and cells, volumetric analysis (practical) - Principles of corrosion, titrate technique, determinate of acidity (practical) - Metals and corrosive environments, determinate of alkalinity and chloride (practical) - Forms of corrosion uniform, galvanic and differential aeration cell, determination of hardness (practical) - Pitting, stress corrosion cracking and intergranular corrosion forms, determination of dissolved oxygen (practical) - Atmospheric and erosion corrosion, spectrophotometer analysis (practical) - Coating and inhibitors as protection methods, determination of nitrite and nitrate (practical) - Cathodic protection, determination of phosphate and silica (practical) - Classification of fuel, properties of liquid fuel, determination of some heavy metals (practical) - Combustion of fuel, determination of fluorine and chlorine (practical) - air supply and exhaust gases, determination of turbidity (practical) - Classification of lubricants advantages and disadvantages of different types, oil analysis determination of viscosity and T.B.N (practical) - Properties of lubricants and additives, determination of insoluble and saltwater (practical) - Nature of impurities in water, soft and hard water effect of using impure water on
COMPUTER ENGINEERING 31
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
boilers performance, determination of acidity and water content (practical) - Water treatment, determination of ph (practical) - Air and water pollution, determination of TDS and salinity(practical).
BA 123 Mathematics (1)
Cr.3. Prerequisite: None Basic techniques and rules of differentiation - Trigonometric function: properties, basic identities and their derivatives - Inverse of trigonometric and their derivatives - Logarithmic functions: their properties, basic identities and derivatives - Exponential functions: their properties, basic identities and derivatives - Derivative of hyperbolic functions and their inverse - Parametric differentiation and implicit differentiation - The Nth derivative - L Hopital rule - Partial differentiation Maclaurins expansion. - Physical application - Curve sketching - Conic sections - General revision.
Cr.3. Prerequisite: BA123 Definition of indefinite integrals and table of famous integrals - Simple rules of integration and the fundamental theorem of calculus - Fundamental theorem of calculus and integration by parts Integration by parts and integration of rational functions - Integration of rational functions Integration of trigonometric powers - Trigonometric substitution and 7th week exam - Integration of quadratic forms and the reduction formulas - Definite integration - Area and volume - Area, volume and length of curve - Average of a function, numerical integration - Matrix Algebra Solution of systems of linear equations.
BA 141 Engineering Mechanics (1)
Cr.3. Prerequisite: None Rectangular components of a force - Parallelogram law - Equilibrium of particle springs and cables - Moment of force - Free body diagram - Equilibrium of rigid body - Trusses joint method zero force members - Trusses method of section Frames Friction - Mass Moment of Inertia - Virtual work.
Cr.3. Prerequisite: BA141 Kinematics of a particle Rectilinear Kinematics - Curvilinear Motion Projectile Motion - Force & Acceleration (Kinetics) - Work & Energy of a particle (Kinetics) - Rotation of a Rigid Body about a fixed Axis - General Plan Motion - Relative Motion (Velocity) - Relative Motion (Acceleration) - Planar Kinetics of Rigid Body Equation of Translation Motion - Equation of Rotational Motion - Equation of General Plane Motion - Work and Energy.
Cr.3. Prerequisite: BA124 Solving first order differential equations: Separable of variables and Homogeneous equation Solving first order differential equations: Exact and Linear equations - Solving first order differential equations: Bernoulli's equation and revision on first order differential equations - Solving second order homogeneous differential equations with constant coefficients, method of undetermined coefficients - Solving second order non-homogeneous differential equations with constant coefficients, method of variation of parameters - Continue method of variation of parameters,
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
solving second order differential equations with variable coefficients (Euler's equation), Laplace transform: Basic definition, First shifting theorem, Laplace transform: Transform differentiation and integration, Unit step function, second shifting theorem, and convolution theorem - Inverse Laplace transforms - Solving differential equations by using Laplace transform - Fourier series: Fourier series for functions of period 2P - Fourier series for even and odd functions - Fourier series for harmonic functions.
Cr.3. Prerequisite: BA223 Vector Algebra / Dot and cross product and Applications - Partial Differentiation / and Derivatives of vector functions - Gradient / Divergence/ curl/ Laplacian - Line Integrals / line Integrals Independent of the path / Exactness - Conservative vector fields - Double Integrals in Cartesian and polar coordinates / Greens Theorem - Surface Integrals / Stokes Theorem - Triple Integrals / Divergence (Gauss Theorem) - Review on Integrals Theorems - Complex numbers and functions / forms of representation - Analytic functions/ Harmonic functions - Line complex integrals / Cauchys Integrals Theorem - Zeros and poles of Analytic functions/ Residues and their evaluation - Residue Theorem / Application to Real Integral - Introduction to Fourier Integrals and Transforms.
Cr.3. Prerequisite: BA 224 Taylor's and Power series methods for solving ordinary differential equations - Differential equation with variable coefficients, ordinary and singular points, solution about ordinary points - Solution about singular points: Regular singular points, the method of Frobenius, Case I. - The method of Frobenius , Case II and Case III. - Gamma and Beta functions - Lengendre differential equation and Legendre polynomials - Bessel differential equation. - Bessel function of the 1st kind - Boundary value problems, partial differential equations and the method of separation of variables- Heat equation, heat transfer in a bar - Wave equation, vibration of a string - Laplace equation and potential fields - Conformal mappings, Complex functions as mappings - Bilinear transformations, linear fraction transformation - Schwarz Christoffel transformation.
Cr.3. Prerequisite: BA 124 An introduction to statistics and statistical analysis on data observation Statistical measurements Elementary probability, probability theorems Conditional probability, Independent and dependent events Total probability rule, bayes theorem and enumeration methods Discrete probability distribution: probability mass function Continuous probability distribution: probability density function Mathematical expectation, mean and variance Special discrete distribution: Bernoulli , binomial , geometric and Poisson distributions Special continuous distribution: Uniform, exponential and normal distribution Discrete and Continuous joint probability distribution Random Process: temporal and spectral Characteristics.
33
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Computer Engineering (CC)

CC 111 Introduction to Computers
Cr.3. Prerequisite: None Introduction to the World of Computers Input and Output - The System Unit: Processing and Memory - Storage and Input/Output Devices - System Software and Application Software Program Development, Programming Languages, and Flow charts - Visual Basic 1 - Visual Basic 2 - Visual Basic 3 - Web page design using HTML 1 - Web page design using HTML 2 Communications and Networks 1 - Communications and Networks 2 - Ethics, Computer Crime, Privacy, and other Social Issues.
CC 112 Structured Programming
Cr.3. Prerequisite: CC 111 Overview of Programming and Problem Solving - C Syntax and Semantics - I/O Formatting and Arithmetic - Conditions and Logical Expressions - Selection Control Structures - Repetitions (Part 1) - Repetitions (Part 2) - Functions (Part 1) - Functions (Part 2) - Arrays (Part 1) - Arrays (Part 2) Programming applications problem solving Tech ( Part 1) - Programming applications problem solving Tech( Part 2).
CC 114 Introduction to programming
Cr.3. Prerequisite: CC 111 Introducing variables, memory concepts and arithmetic - Illustrating application example Introducing algorithms, pseudocode, program control, checkboxes and dialogs - Sample applications - Introducing the Do WhileLoop and Do UntilLoop Repetition Statements Introducing the Do Loop While and Do Loop Until Repetition Statements - Introducing the For Next Repetition Statement - Introducing the Select Case Multiple-Selection Statement Introducing One-Dimensional Arrays - Introducing Two-Dimensional Arrays - Two-Dimensional Arrays Application - General Application - Functions and Procedures - Fibonacci Application Students projects.
CC 213 Programming Applications
Cr.3. Prerequisite: CC 112 Revision of structured programming constructs: selection, repetition, and Functions - Revision of one dimensional array - Searching and sorting - Two dimensional arrays Pointers Strings Structures Unions Recursion - Text Files - Binary Files - Bitwise Operators/ I/O Interfacing Advanced Applications.
CC 215 Data Structures
Cr.3. Prerequisite: CC 213 Difference between static data type and dynamic data types - the concept of pointers & dynamic memory allocation - programming practice using dynamic structures.
34
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 216 Digital Logic Design
Cr.3. Prerequisite: CC 111 Number systems - binary arithmetic and codes - logic gates - Boolean algebra and logic simplifications - Design and realization of combinational circuits - Functions of combinational circuits logic - Flip-Flops - analysis design and realization of counters - analysis and realization of shift registers - Computer aided engineering.
CC 218 Discrete Mathematics
Cr.3. Prerequisite: CC216 The logic of statements - logical form and equivalence - logic implementation arguments predicates - number theory - counting methods function relation - methods of proof.
CC 243 Introduction to Computer Organization*
Cr.3. Prerequisite: CC 216 Computer interconnection structures - computer components - computer function interconnection structures - bus interconnection - Internal and external memory - computer memory system overview - semiconductors main memory - cache memory magnetic tape optical memory - Input / Output - I/O modules - programmed I/O - interrupt-driven I/O - direct memory Access - Operating system - Operating systems overview scheduling - memory management - The central processing unit - Computer Arithmetic - characteristics and functions of instruction sets - addressing modes - processor organization - the instruction cycle - instruction pipelining - Control unit Micro- operation - hardware implementation - Control Functions.
CC 311 Computer Architecture
Cr.3. Prerequisite: CC 317 Basic Computer Organization - Arithmetic Logic Unit - High Speed Arithmetic The MIPS Architecture Performance Evaluation Techniques - The Memory Element - Memory Organization - Computer Input/Output Organization The Hardwired Control Unit Microprogramming and typical Computer Architectures CISC and RISC Paradigms.
CC 312 Computer Organization*
Cr.3. Prerequisite: CC 216 Computer interconnection structures - computer components - computer function interconnection structures - bus interconnection. - Internal and external memory - computer memory system overview - semiconductors main memory - cache memory - magnetic tape - optical memory - Input / Output - I/O modules - programmed I/O - interrupt-driven I/O - direct memory Access Operating system - Operating systems overview scheduling - memory management - The central processing unit - Computer Arithmetic - characteristics and functions of instruction sets addressing modes - processor organization - the instruction cycle - instruction pipelining - Control unit Micro-operation - hardware implementation - Control Functions.
Offered only to the department of computer science Offered only to other departments
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 316 Object Oriented Programming
Cr.3. Prerequisite: CC 319 Object oriented modelling and development - classes objects inheritance GUI interfaces applets multithreading.
CC 317 Digital System Design
Cr.3. Prerequisite: CC 216 Introduction to digital design - combinational digital design and realization - decoders - encoders buffer multiplexers comparators adders - and ALU - sequential design and realization latches - flip-flops - counters - shift registers memories CPLD and FPGA. Synchronous analysis and design using algorithmic state machines ASM - Digital design practice - CAD using FPGA and CPLD.
CC 319 Advanced Programming
Cr.3. Prerequisite: CC 215 C# language constructs data types input/ output & control statements modularity arrays strings files classes and inheritance.
CC 331 Data and Computer Communications
Cr.3. Prerequisite: EC 320 The goal of the course is to provide a background and context for the concept of computer networks. The broad range of topics that are encompassed in the field of data and computer communications is introduced, and the fundamental concepts of protocols and protocol architectures are examined. Also the course deals with the fundamental concepts of signal, medium, and encoding. Also deals with other aspects of data communications: reliability and efficiency. Error detection and correction in case of errors during transmission will be covered. A variety of multiplexing techniques can be used to provide for efficient use of the medium. Transmission media is discussed included guided and unguided media. Signal encoding techniques are discussed. Data ink control protocols are studied.
CC 341 Digital Electronics
Cr.3. Prerequisite: EC 238 Understanding Pulse Fundamentals - working with diodes, transistors and analyzing their circuits design of diodes and transistors circuits - design and analysis of DTL, TTL and CMOS circuits.
CC 410 Systems Programming
Cr.3. Prerequisite: CC 319 Introduction to system programming - machine architecture - machine language - assembly language - two pass assemblers - one pass assemblers - macro facilities - conditional macros - macro processors loaders linkers - introduction to formal languages - compilers and interpreters.
36
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 411 Introduction to Microprocessors*
Cr.3. Prerequisite: CC 312 or CC216 Microprocessors and microcomputers - Microcomputer structure microprocessor memory buses (synchronous and asynchronous) - I/O - 16/32-bit microprocessor architecture - Instruction cycle microinstructions - micro-programming - instruction decoding - Reduced Instruction Set computer (RISC) architecture - Complex Instruction Set computer (CISC) architecture - Memory (RAM, ROM, memory mapping of I/O) - I/O (parallel and serial I/O interfaces, system clock, clock phases and bit rates) - Interrupts (types, handling of interrupts) - Software aids (text editors and assemblers, linkers and macro-assemblers).
CC 412 Computing Algorithms
Cr.3. Prerequisite: CC 319 Analyze the asymptotic performance of algorithms - demonstrate a familiarity with major algorithms and data structures - synthesize efficient algorithms in common engineering design situations.
CC 413 Numerical Analysis
Cr.3. Prerequisite: CC 112 Introduction to numerical methods and their applications - solve science and engineering problems - convergence - error analysis of numerical methods.
CC 414 Database systems
Cr.3. Prerequisite: CC 319 Relational Database analysis design - normalization and implementation - implementation skills using Oracle developer - Concurrent transactions - Distributed databases and client server approach.
CC 415 Data Acquisition Systems
Cr.3. Prerequisite: EC 411 Data Acquisition - Definitions & Applications - Data Acquisition channel structure components Sensors and Transducers: Types, applications and structural classifications - Signal conditioning Amplifications reshaping filtration - Data conversion: principles, devices and limitations Introduction to data Analysis and elementary control - Case studies - Student Projects.
CC 416 Computer Graphics
Cr.3. Prerequisite: CC 319 History and survey of graphics applications - Overview of graphics systems and output devices Output primitives including points, lines, circles, splines, area filling, and character generation Attributes of output primitives -two dimensional transformations - windowing and clipping. Interactive input methods - Introduction to three- dimensional graphics.
Offered only to other departments

B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 417 Assembly Language
Cr.3. Prerequisite: CC 421 Introduction to 8086 instructions & directories - Assembly language fundamentals - Input/Output operations - conditional processing Arithmetic - string processing - disk storage - file processing terminate and stay resident programs (TSRs) - The course includes a project.
CC 418 Operating Systems
Cr.3. Prerequisite: CC 410 Introduction to modern operating systems - the concepts, structure, design principles, implementation issues, and mechanisms of operating systems.
CC 421 Microprocessors Systems
Cr.3. Prerequisite: CC 311 Microprocessors and microcomputers - Microcomputer structure microprocessor memory buses (synchronous and asynchronous) - I/O - 16/32-bit microprocessor architecture - Instruction cycle microinstructions - micro-programming - instruction decoding - Reduced Instruction Set computer (RISC) architecture - Complex Instruction Set computer (CISC) architecture - Memory (RAM, ROM, memory mapping of I/O) - I/O (parallel and serial I/O interfaces, system clock, clock phases and bit rates) - Interrupts (types, handling of interrupts) - Software aids (text editors and assemblers, linkers and macro-assemblers).
CC 431 Computer Networks
Cr.3. Prerequisite: CC 331 Introduction Computer Networks and the Internet Networking protocol layers OSI and TCP/IP- Application Layer Principles of net applications, web and HTTP, FTP, electronic mail, DNS and Peer to Peer applications. Transport layer, Multiplexing and demultiplexing, Connectionless Transport and UDP reliable data transfer and connection oriented transport TCP, congestion control. Network layer forwarding and routing, IP protocol, routing algorithms, Broadcast and Multicast routing. Data Link layer, introduction and services, error detection and correction techniques, Multiple access protocols and Link layer addressing, Ethernet and PPP.
CC 442 Digital Design and Introduction to Microprocessor*
Cr.3. Prerequisite: CC 112 Number systems - binary arithmetic and codes - logic gates - Boolean algebra and logic simplifications - Design and realization of combinational circuits - Functions of combinational circuits logic - Flip-Flops - analysis design and realization of counters Computer aided engineering - Introduction to microprocessor(part 1).
CC 511 Artificial Intelligence
Cr.3. Prerequisite: CC 218 - CC319 History and Goals Representation and search Knowledge based systems Logic (Propositional and Predicate) as a representation language Prolog as an example of an AI language.

B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 513 Computing Systems
Cr.3. Prerequisite: CC 418 CC 421 High performance computing ILP - RISC architecture - Memory hierarchy Pipelining - Vector processing - Array processing - Massively parallel processors - Multiprocessor architecture - Data flow computers - VLSI computing and Systolic arrays.
CC 515 Introduction to Software Engineering
Cr.3. Prerequisite: CC 319 Introduction to software engineering disciplines with emphasis on software life cycle - project management verification - validation and testing of software.
CC 516 Pattern Recognition
Cr.3. Prerequisite: CC 416 Smoothing operations - edge detection algorithms - the connected component methodology shape detection and morphological operations - statistical decision - other paradigms in pattern recognition include hierarchical and partitional clustering - feed-forward and feed-backward neural networks.
CC 517 Modelling and simulation
Cr.3. Prerequisite: CC319 BA326 Review of Probability, random variables and distributions - random Processes - discrete and continuous markov Processes - queuing systems - stochastic petri nets - computer generation of random numbers - simulation of an M/M/1 queuing system.
CC 518 Data Security
Cr.3. Prerequisite: CC 319 Goals of data security classical encryption techniques encryption standards internet security issues for e-mail, e-commerce and firewall.
CC 521 Micro-Computer Based Design
Cr.3. Prerequisite: CC 415 Comparing between microprocessor and micro-controllers - Programming of micro-controllers embedded systems - Design a plan for micro-based system - dealing with different hardware interfaces including ADC, DAC, serial communication and control circuits.
CC 523 Computer Design and Performance Evaluation
Cr.3. Prerequisite: CC 311 Comparison between the two major design methodologies based on ISA (Instruction Set Architecture) and ASA (Application Specific Architecture) - The course covers the topics of queuing theory and Markov processes as a tool for computer system performance evaluation - The students are introduced to operational analysis techniques regarding performance of computer systems.
39
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 524 Neural Networks
Cr.3. Prerequisite: CC 112 BA 323 Introduction to basic concepts of neural networks -The basic neuron - The multilayer perceptron Artificial neural networks applications - learning architecture - Competitive neural networks Kohonen self-organizing networks - Adaptive reasoning theory (ART) - Hopfield neural networks Neural networks implementation - Neural networks applications - Introduction to MATLAB environment - Single perceptron - Multilayer perceptron - Competitive networks - Kohonen networks - ART networks - Hopfield networks using MATLAB.
CC 525 Intelligent Robotics
Cr.3. Prerequisite: CC 319 EE 418 Introduction History Applications - Object rotation - General transformations - Forward Kinematics - Inverse kinematics - Machine intelligence - trajectory generation Control Applications - practical Considerations.
CC 527 Computer Aided Design
Cr.3. Prerequisite: CC 311 or CC 312 To introduce fundamental algorithms and techniques for computer aided integrated circuit design covers aspects of design flow - physical design - logic optimization - timing analysis and verification - synthesis for testability.
CC 528 Computer Systems Performance Analysis
Cr.3. Prerequisite: CC112 - CC 531 The purpose of this course is to introduce the student to the principles and techniques of performance measurement in the analysis of computer systems. Such techniques are used to detect bottlenecks, measure the efficiency of computer systems and applications. The student will be introduced to performance measurement techniques, basic principles of queuing theory, experimental design, among others. The student will be expected to do individual assignments. Assignments are to be done individually. The course will consist of both lectures and class discussions.
CC 529 Distributed and Parallel Systems
Cr.3. Prerequisite: CC 431 This course studies the fundamental aspects of distributed systems and applications. Early foundations and recent developments in distributed systems will be investigated. Both client-server and peer-to-peer application designs will be discussed. Other topics include sockets, reliability, replication, group membership protocols, clock synchronization, and logical timestamps.
CC 531 Advanced Networks
Cr.3. Prerequisite: CC 431 The course emphasizes topics of fundamental importance concerning the technology and architecture of networks. It highlights various networks protocols and standards and discusses wireless, mobile and adhoc networks, internetworking and interoperability. Students measure networks performance and study their realizations using the available networking facilities.
40
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 533 Internetwork Programming
Cr.3. Prerequisite: CC 431 The course is about the exploration of internet implementation as a network of embedded computing systems. Internetworking skills for design and implementation of hardware and embedded software internet products.
CC 535 Internetwork Security
Cr.3. Prerequisite: CC 431 Hacking and the Law, Network Mapping, Vulnerability Assessment, Network Mapping tools,Vulnerability Scanners, Sniffing, Defenses, Denial of Service Techniques using address spoofing, Man-in-the-middle, Defenses, Stack-Based Buffer Overflow Attacks and Password Attacks and Cracker tools, Web Attacks, RootKits, Trojans and Backdoors, Intrusion Detection tools, Writing new intrusion detection signatures, HoneyNets, Forensics.
CC537 - Computer Forensics
Cr.3. Prerequisite: Senior Standing Conducting a computer forensics investigation- Examining the layout of a network- Finding hidden data- Capturing images- Identifying, collecting, and preserving computer evidence- Understanding encryption and examining encrypted files- Documenting the case- Evaluating common computer forensic tools- Presenting and analysing computer evidence.
CC539 - Selected Topics in Networks
Cr.3. Prerequisite: CC531 Selected Topics in Networks - Wireless Networking -Mobile Networks Sensor Networks Content-Based Networking Autonomic Networks - Network Optimization.
CC540 - Computer Systems Engineering
Cr.3. Prerequisite: Senior Standing The course is an integration of key topics from algorithms, computer architecture, operating systems, compilers, and software engineering, in one unified framework. Building a general-purpose computer system from the ground up. Techniques in the design of modern hardware and software systems, and major trade-offs and future trends are introduced. Throughout the course, many cross-section views of the computing field, from the bare bone details of switching circuits to the high level abstraction of object-based software design are presented.
CC 550 Selected Topics in Computing
Cr.3. Prerequisite: CC 311 Fundamental concepts and issues related to the design and analysis of advanced computing which includes multithreaded, parallel, and distributed computing. This course introduces a discussion of programming techniques, applications, implementations, and performance issues. In addition, selected topics from the following list will also be covered: load balancing, task scheduling, faulttolerance, coordination & agreement, distributed objects & remote invocation, and distributed transactions & concurrency control. It also gives an introduction to real-time systems, reconfigurable computing, and some advanced topics.
41
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
The Training and Senior Project

IM 400 Practical Training
Cr.0. Prerequisite: None. This course is a non-credit course and is a college graduation requirement. Students are asked to undertake a minimum of four weeks of practical training in off-campus sites recommended by the college and the department in order to pass this course. Students are required to submit a recognition letter from the site where they received their training; in addition, a report and a presentation are submitted. Course is a Pass/Fail course.
CC 501 Senior Project I
Cr.3. Prerequisite: Senior Standing Completion of 138 Credit Hours and a GPA of at least 2.00. Application-oriented project to show competence in major academic area. Where, an independent research project is conducted under the guidance of a faculty member in the Department of Industrial and Systems Engineering. The research should contribute to the advancement of knowledge in the field. Written report and formal presentation are required.
CC 502 Senior Project II
Cr.6. Prerequisite: CC 501 Application-oriented project to show competence in major academic area. Where, an independent research project is conducted under the guidance of a faculty member in the Department of Industrial and Systems Engineering. The research should contribute to the advancement of knowledge in the field. Written report and formal presentation are required.
42
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Electronics and Communication Engineering (EC)

EC 218 Measurements & Instrumentations
Cr.3. Prerequisite: EE 231 Measurements of errors- Accuracy- Precision- Resolution- Sensitivity. Statistical analysis (Mean Deviation- Standard Deviation- and Variance). Units and standards of measurement. Electromechanical indicating instruments. Analog Instruments (DC Ammeter (Ayrton Shunt)- DC Voltmeter- Ohmmeter (Series type- Shunt Type)- AC- Instruments with Rectifiers (full wave and half wave rectifiers)- Bridge measurements (AC Bridges(Maxwell bridge- wien bridge- Schering bridge)- DC Bridges(Wheatstone bridge))- Digital instruments for measuring True RMS VoltmeterQ-meter- oscilloscope techniques.
EC 238 Electronics (1)
Cr.3. Prerequisite: EE231 Semiconductors - p-n junction - diode current components - junction capacitance - junction diode as a circuit element - special p-n junctions - bipolar junction transistor and field effect transistor: structure- operation I-V characteristics - large and small analysis.
EC 320 - Communication Theory
Cr.3. Prerequisite: BA 224 EE 231 Introduction to communication theory. Review of Fourier series and Fourier transform as a mathematical tool for spectral analysis. Concept of power and energy spectral densities and correlation between waveforms. Transmission through linear filters and channels. Hilbert transform and Amplitude Modulation techniques.
EC 339 Electronics (2)
Cr.3. Prerequisite: EC 238 Electronic amplifier theory- power amplifiers- Differential amplifiers- Operational amplifiers filters and Oscillators.
43
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Electrical Engineering (EE)

EE 231 Electrical Circuits (1)
Cr.3. Prerequisite: BA 124 Basic d-c circuit elements , series and parallel network Ohms law and 1st & 2nd kirchoffs laws Nodal analysis Mesh analysis Basic network theorems source transformation , super position , Thevenins theorem and Nortons theorem, max. power transfer Alternating current fundamentals and a-c generation R.M.S value and average value, form factor and crest factor Phasor concept Relation between current and voltage in resistors , capacitors and inductor, Response of R-L and R-C circuits Sinusoidal response of series R.L.C circuit Series resonance.
Cr.3. Prerequisite: EE 231 AC series circuit and series response revision, parallel circuit and to Y-simplification Source transformation, superposition the node voltage method and the mesh current method Thevenin theorem Complex power and maximum power calculations Three phase voltage sources Analysis of the balanced wye -wye circuit Analysis of the wye delta & delta wye circuit and delta delta circuit Complex power calculation in three phase Unbalanced and four wire three phase loads Unbalanced Y loads with neutral (wire disconnected) or having Zo Inductances and capacitors, series-parallel combinations The natural response for R-L circuit The natural response of R-C circuit General solution of step response of R-L and R-C circuit Sequential switching.
EE 328 Electrical Power and Machines
Cr.3. Prerequisite: EE 232 Magnetic circuits and their basic relations Core loss and transformer basic Transformer model and voltage regulation Transformer rating and testing The law of motor and generator action construction of dc machines DC motors characteristics and applications DC generators characteristics and applications AC rotating fields and theory of 3-phase induction machines Circuit model and variable speed drives Synchronous motors and generators Single-phase and small motors The electric power system and energy sources Pollution problems and plant distribution systems Switches and circuit breakers system voltage and motors System protection and power factor correction.
EE 418 Automatic Control Systems
Cr.3. Prerequisite: EE 218 OR EE328 Introduction to open loop and closed loop control systems Control system classification Block diagram System transfer function and signal flow graph Standard input signal Time domain specifications Modeling of some physical systems Time response of first and second order systems Importance of feedback, sensitivity to parameter variations System stability and effect of disturbance Error analysis and error constants Root locus techniques Frequency domain analysis (Nyquist- Bode) Analog controllers Controller tuning.
44
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Language, Humanities and Social Science (LH)

LH 131 English (1)
Cr.2. Prerequisite: None This course aims at enhancing learners four language skills, improving their general and technical lexical repertoire and preparing them to communicate their ideas effectively. The course is also designed to train learners to follow the principles and stages of the writing process and write academic paragraphs.
LH 132 English (2)
Cr.2. Prerequisite: LH131 This course aims at enabling learners to decode technical discourse in English with ease and precision. The course is also designed to enhance the learners oral production and academic writing.
LH 231 English (3)
Cr.3. Prerequisite: LH132 This course aims at enhancing learners writing skills in order to write academic essays and reports following international standards. The course also includes a component on oral presentations of report.
45
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Industrial and Systems Engineering (IM)

IM 111 Industrial Relations
Cr.2. Prerequisite: None Types of industries and production techniques Management and organization structure Production planning and control Industrial cost estimation techniques Industrial economy and breakeven analysis Accidents at work rules and regulations Hazards classification, prevention, and personal safety Fire hazards identification and prevention Chemical hazards and prevention accident reporting Quality control and labour relations Science, engineering, and technology Industrial revolutions.
IM 112 Manufacturing Technology
Cr.2. Prerequisite: None Production of steel and cast iron Forming operations Heat treatment operations Cutting tools Mechanics of metal cutting and turning operations Cutting fluids Sand casting Centrifugal casting, die casting and aspects of the casting process Gas and Electric arc welding Electric resistance and pressure welding and aspects of the welding process Standards of measurements Measuring Instruments Measuring methods.
IM 423 Operations Research
Cr.3. Prerequisite: 90 Credit Hours. Introduction to linear programming Development of linear programming models The graphical and simplex method Transportation and assignment methods Network models and analysis (minimal spanning tree, shortest route, and maximal flow) Critical path method Probabilistic approach, project evaluation and review technique (PERT) Project crashing.
IM 535 International Operations Management
Cr.3. Prerequisite: 126 Credit Hours. International business environment Cultural and legal environment Political environment Economic environment facing business International trade theories Governmental influence on trade Regional economic integration Factor mobility and foreign direct investment The foreign exchange market The determination of exchange rates Global manufacturing and supply chain management.
46
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Mechanical Engineering (ME)

ME 151 Engineering Drawing and Projection
Cr.2. Prerequisite: None Drawing practices and techniques (Exercises on geometrical construction) - Methods of object projection (Exercises on geometrical construction Exercises on object projection) - Orthogonal projection (Exercises on orthogonal projection) - Missing views, dimensioning and free hand sketching (Exercises on projection and free hand sketching) - Sectioning and conventions (Exercises on sectional views) - Intersection of geometrical surfaces and development (Exercises in intersection of geometrical surfaces and development) - Standard metal sections and metal structures (Exercises on metal structures) - Compound metal sections and welds (Exercises on metal structures) - Isometric projection & Surface intersections (Exercises on Isometry and surface intersections) - Perspective projection (Exercises on Perspective projection) - Computer Aided drafting using AutoCAD (General Introduction) - Drawing and editing commands in AutoCAD Writing texts, Dimensioning and viewing commands.
47
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Non-Engineering (NE)
NE 264 Scientific Thinking
Cr.3. Prerequisite: None Thinking Patterns Development - Nature and postulates of scientific thinking - Meaning and objective of Science - Scientific values and directions - Science, non-science and other-than science - Engineering and Technology - Properties of science - Mental operations used in science and Scientific Guessing - Types of deductions and Representation - Research methods in natural sciences: definitions, Experiments, Observations, Scientific postulates and their conditions Verification of scientific postulates - General methods of problems solving - Creative and critical Thinking - Fluency types Flexibility - Originality and Basics of Brain Storming.
NE 364 Engineering Economy
Cr.3.Prerequisite: 54 Credit Hours. Introduction and overview Cost concepts and the economic environment Principles of money, time relations Concept of economic equivalence Cash flow diagrams interest formulas and uniform series Cash flow diagrams uniform gradient series and geometric sequence Nominal and effective interest rates continuous compounding and continuous cash flows Applications of engineering economy methods of investment assessment Comparing alternatives useful life is equal to the study period The imputed market value technique Depreciation historical methods and cost recovery systems.
NE 465 Aesthetic Education and Art Appreciation
C.r3. Prerequisite: None. Aesthetic training and appreciation on a wide range of types of arts, including Music, Drawing, Painting, Sculpture and Engraving - Applied art (major and minor arts) - The Ancient world, Classical world and Christian world (Christianity) - Islamic and oriental arts - Medieval Western world - Renaissance in the 17th, 18th and 19th Centuries - Modern arts in the 20th Century.
NE 466 Environment Science and Technology
Cr.3. Prerequisite: None The biosphere the natural built environment ecosystem components and their properties Environmental resources properties of ecosystems and equilibrium The evolution of mankinds relation with the environment throughout different eras The development of human awareness regarding environment problems Population growth Development & Sustainable development Poverty and the environment Environment and consumer Life styles Relation between human health and environmental degradation Environmental improvement Economic and social returns/benefits of pollution abatement Risk analysis Environmental management.
48
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Chapter
Course File Summary

Further description of courses including course information, grading system, course description, textbook and reference book, course aim and objectives, and course outline.
This chapter provides further description of the courses of the Industrial and Systems Engineering program. The course files are organized as follows: Basic and Applied Science Courses BA Computer Engineering Courses CC Electronics and Communications Courses - EC Electrical Engineering Courses EE Language, Humanities, & Social Science Courses LH Industrial and Systems Engineering Courses IM Non-Engineering Courses NE
49
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Basic and Applied Science Courses BA

BA 113 Physics (1)
C O U R S E I N F O R M A T I O N
Course Title: Code: Hours: Prerequisite:

G R A D I N G
Physics (1). BA113. Lecture 2 Hrs. Tutorial-2 Hrs. Laboratory 1 Hr. None. Credit 3.
Class. Experimental physics Midterm # 1/Assignments (7th Week): Midterm # 2/Assignments (12th Week): Final Exam:
C O U R S E D E S C R I P T I O N
10% 30% 20% 40%
This course consists of four parts static electricity, electric current, magnetism and light.
T E X T B O O K S
Hans C. Ohanian and John T. Markert, Physics for engineers and scientists, W.W. Norton & Co.; latest edition.
R E F E R E N C E B O O K S
Raymond A. Serway and John W. Jewett, Physics for scientists and engineers, Brooks Cole; latest edition. Michael Nelkon and Philip Parker, Advanced level physics , Heinemann International Literature & Textbooks, latest edition.
A I M
C O U R S E
The aim of this course is to Supply the students with strong back ground in the field of electricity and magnetism which is really needed for the students to complete their study in the field of engineering and technology.
C O U R S E O B J E C T I V E S
This course provides the students with good knowledge about the nature and the existence of static electricity, the interaction between different type of charges and the electric field types generated by these charges. The course also, allows the student to distinguish between the static electricity and
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
the electric current through the application of ohms law and gives the student basic information about the structure of simple electric circuit. This course gives a good background about the theory of magnetism and electromagnetic Induction.
C O U R S E O U T L I N E
Week Number 1: Week Number 2: Week Number 3: Week Number 4: Week Number 5: Week Number 6: Week Number 7: Week Number 8: Week Number 9:
Introduction to static electricity and Coulombs law (1). Introduction to static electricity and Coulombs law (2). Electric field. Electric potential. Capacitors(1) Capacitors(2) Exam # 1. Electric current, ohms law resistors in series and parallel (1). Electric current, ohms law resistors in series and parallel (2).
Week Number 10: Kirchhoffs rule. Week Number 11: Introduction to theory of magnetism and different applications. Week Number 12: Exam # 2. Week Number 13: Electromagnetic induction. Week Number 14: Optics and waves (nature of light, properties of light waves). Week Number 15: Youngs double slit polarization of light waves. Week Number 16: Final Exam.
51
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
BA 114 Physics (2)


G R A D I N G
Physics (2). BA114. Lecture 2 Hrs. Tutorial-2 Hrs. Laboratory 1 Hr. BA113 - Physics (1) Credit 3.
Class Performance/Attendance: Midterm1/Assignments (7th Week): Midterm # 2/Assignments (12th Week): Final Exam:
10% 30% 20% 40%
This course is concerned with the investigation of the behavior of the fluid under different conditions to calculate the net work done on or by the system.. It is also concerned with standing the first and second law of thermodynamics. Heat, work and internal energy of the fluids (liquid and gas) should be calculated for different processes under different condition. Heat transfer is also studied through this course.
T E X T B O O K S
T. D. Eastop and A. Mcconkey, Applied Thermodynamics for Engineering Technologists, Prentice Hall, latest edition .
References available in AAST Library.

C O U R S E A I M
The aim of this course is to develop the skills of students to solve the problems of Heat and thermodynamics and understanding the different cases and condition under which thermodynamic system operates.
The objectives of this course are: Understanding the relation between heat, work and the conservation of energy through thermodynamic cycle. Also, the student must know the relation between the different units used through this Course.
52
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Introduction to thermodynamics. Reversibility and reversible work. First law of thermodynamics Non-flow equation. Steady flow equation. Working Fluid (1.1) (steam). Working Fluid (1.2) (steam). Working Fluid (2.1) (perfect gas). Working Fluid (2.2) (perfect gas). Reversible processes.(constant volume, constant pressure).
Week Number 10: Reversible processes (constant temperature, adiabatic). Week Number 11: Reversible process ( polytropic). Week Number 12: Second law of thermodynamics (1). Week Number 13: Second law of thermodynamics (2). Week Number 14: Heat transfer (1). Week Number 15: Heat transfer (2). Week Number 16: Final Exam.
T O O L S R E Q U I R E D
Use of the steam tab
53
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
BA 118 Chemistry

G R A D I N G
Chemistry. BA118. Lecture 2 Hrs. None. Laboratory 2 Hrs. Credit 2.
Lab., Performance/Attendance: Midterm # 1/Assignments (7th Week): Midterm # 2/Assignments (12th Week): Final Exam:
10% 30% 20% 40%
The Science of Chemistry characterized its close relate with the other branches of sciences and with the technological applicants of these sciences and with technological applicants of these sciences, which emerge in the mineral oil, medicate, petroleum, petrochemicals, chemical textile and other industries. This course includes topics of specialized chemical engineering technology without going through details.
T E X T B O O K S & R E F E R E N C E S
William D. callister Jr., Material Science and engineering, Third edition 1994. M.G.Fontana, Corrosion Engineering, 1984. H.H Uppal and R.v. Revice., Corrosion and corrosion control, Third edition 1985. M.M uppal., Engineering Chemistry, 1990. National Geographic.vol 176, No.G, 1989. Drew principhic.vol. 176, No.G, 1989. Drew principles of industrial water treatment. Third edit. Drew chemical corporat. Corrosion for science Engineering and Edit K R Trethewey 1995.
A I M
C O U R S E
The aim of course develops for the student, bases of scientific engineering chemistry, and creative students scale to identify the technical problems which are related to engineering chemistry.
Establishing a base for students. Providing the student with knowledge about the effects of the environment on the material whatever its form is indifferent purposes. Accruing Scientific bases
54
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
which equality the student to control dominate and protect the used materials. Enabling the student to solve industrial problems in a scientific method.
Electrochemical Reactions and cells. Volumetric Analysis (Practical). Principles of corrosion. Titrate Technique, Determinate of acidity (practical). Metals and corrosive Environments. Determinate of Alkalinity and chloride (practical). Forms of corrosion uniform, Galvanic and Differential aeration cell. Determination of Hardness (Practical). Pitting, stress corrosion cracking and intergranular corrosion forms. Determination of Dissolved oxygen (Practical). Atmospheric and Erosion Corrosion. Spectrophotometer Analysis (Practical). Coating and inhibitors as protection methods. Determination of nitrite and nitrate (Practical), Cathodic protection. Determination of phosphate and silica (Practical). Classification of fuel, properties of liquid fuel. Determination of some heavy Metals (Practical).
Week Number 10: Combustion of fuel. Determination of fluorine and chlorine (Practical). Week Number 11: Air supply and Exhaust Gases. Determination of turbidity (Practical). Week Number 12: Classification of lubricants Advantages and disadvantages of different types. Oil Analysis Determination of Viscosity and T.B.N (Practical). Week Number 13: Properties of lubricants and Additives. Determination of Insoluble and Saltwater (Practical). Week Number 14: Nature of impurities in water, soft and hard water Effect of using impure water on Boilers performance. Determination of Acidity and water content (Practical). Week Number 15: Water Treatment. Determination of PH (Practical). Week Number 16: Air and water pollution. Determination of TDS and salinity(Practical).
55
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9


G R A D I N G
Mathematics (1). BA123. Lecture 2 Hrs. None. Tutorial 2 Hrs. Credit 3.
Class Performance/Attendance: Midterm # 1/Assignments (7th Week): Midterm # 2/Assignments (12th Week): Final Exam:
10% 30% 20% 40%
The aim of this course is the differentiation and some of its applications, basic differentiable functions of one variable. It includes definitions and intuitive meanings of derivatives; Higher derivatives; Basic techniques of differentiation; Chain Rule; Parametric equations; Partial differentiation; Implicit differentiation; Inverse function theorem; Logarithmic differentiation; differentiation; Logarithmic functions; Exponential functions; Trigonometric functions; Inverse trigonometric functions; Hyperbolic functions; Differentiation of those; Physical and geometric applications of differentiation; Limits; Nth derivative; LHpital rule; Maclaurins expansion as approximations of functions; Analytic geometry; Translation of Axes; Conic sections.
T E X T B O O K S
Robert T. Smith and Roland B. Minton, Calculus: Early Transcendental Functions, Mc GRAW. Hill, latest edition. Printed Notes.
B O O K S
R E F E R E N C E
Grossman S., Calculus, Harcourt Brace College Publishers, 1992.

C O U R S E A I M
This course teaches students main transcendental functions and their basic properties, differentiation and some of its applications; as well as analytic geometry and quadratic curves.
56
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O B J E C T I V E S
The course teaches basic transcendental functions and their properties. It develops students skills in the techniques of differentiation, and enables them to grasp its intuitive meaning. It also provides them with essential knowledge and skills in analytic geometry.
Basic techniques and rules of differentiation. Trigonometric function: properties, basic identities and their derivatives. Inverse of trigonometric and their derivatives. Logarithmic functions: their properties, basic identities and derivatives. Exponential functions: their properties, basic identities and derivatives. Derivative of hyperbolic functions and their inverse. Parametric differentiation and implicit differentiation. The Nth derivative. L Hopital rule.
Week Number 10: Partial differentiation. Week Number 11: Maclaurins expansion. Week Number 12: Physical application. Week Number 13: Curve sketching. Week Number 14: Conic sections. Week Number 15: General revision. Week Number 16: Final Exam.
57
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9


G R A D I N G
Mathematics (2). BA124. Lecture 2 Hrs. Tutorial 2 Hrs. Credit 3.
BA123 - Mathematics (1)
10% 30% 20% 40%
This course addresses integration and some of its geometric applications, as well as elementary matrix algebra. It includes definitions and intuitive meanings of indefinite and definite integrals; Fundamental Theorem of Calculus; Basic techniques of integration; Integration by parts; Geometric applications; Integration of powers of trigonometric functions; Substitution; Miscellaneous and Trigonometric substitutions; Integration of rational functions in x through partial fractions; Numerical Integration. Gauss method for the solution of linear equations; Matrix inversion and its use in the solution of linear equations.
T E X T B O O K S
Robert T. Smith and Roland B. Minton, Calculus: Early Transcendental Functions, Mc GRAW. Hill, latest edition. Printed Notes.
B O O K S
R E F E R E N C E
Grossman S., Calculus, Harcourt Brace College Publishers, 1992.

C O U R S E A I M
To learn integration using different methods. To use these techniques in solving some application like to find the area, the volume, the length of a curve, and the average of a curve. To solve problems using numerical integration. To learn elementary linear algebra, solution of linear equations using matrices and determinants.
58
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O B J E C T I V E S
The course develops students skills in the techniques of integration, and enables them to grasp its intuitive meaning. It also provides them with essential knowledge and skills in matrix algebra.
Definition of indefinite integrals and table of famous integrals. Simple rules of integration and the fundamental theorem of calculus. Fundamental theorem of calculus and integration by parts. Integration by parts and integration of rational functions. Integration of rational functions. Integration of trigonometric powers. Trigonometric substitution and 7th week exam. Integration of quadratic forms and the reduction formulas. Definite integration.
Week Number 10: Area and volume. Week Number 11: Area, volume and length of curve. Week Number 12: Average of a function, numerical integration and 12thweek exam. Week Number 13: Matrix Algebra. Week Number 14: Solution of systems of linear equations. Week Number 15: General revision. Week Number 16: Final Exam.
59
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9


G R A D I N G
Engineering Mechanics (1). BA141. Lecture 2 Hrs. None. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Introduction to mechanics. Plane and space force analysis, projection and synthesis. Moments. Couples and wrenches. Static equilibrium. Technique of free body diagrams. Applications of static equilibrium of machines, Method of virtual work and its application to solution of problems of static equilibrium.
T E X T B O O K S
R.C. Hibbeler, Engineering Mechanics: Statics, Macmillan USA, latest edition .

Books available in the AAST Library

C O U R S E A I M
The aim of the course is to provide the student with an introduction to many of the fundamental concepts in Mechanics
The course treats only rigid-body mechanics, science it forms a suitable basis for the design and analysis of many types of structural, mechanical or electrical devices encountered in engineering
Week Number 1: Week Number 2:
Rectangular components of a force. Parallelogram law.

60
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Week Number 3: Week Number 4: Week Number 5: Week Number 6: Week Number 7: Week Number 8: Week Number 9:
Equilibrium of particle springs and cables. Moment of force. Free body diagram. Equilibrium of rigid body. Exam # 1. Trusses joint method zero force members. Trusses method of section.
Week Number 10: Frames. Week Number 11: Frames (cont.). Week Number 12: Exam # 2. Week Number 13: Friction Week Number 14: Mass Moment of Inertia Week Number 15: Virtual work Week Number 16: Final Exam.
61
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9


G R A D I N G
Engineering Mechanics (2). BA142. Lecture 2 Hrs. BA141. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Introduction of the kinematics of the particle, rectilinear and projectile motions, force and acceleration. Moreover, work and energy of a particle, rotation of a body about a fixed axis, general plan motion, relative velocity and acceleration, equations of translation rotational.
T E X T B O O K S
R.C. Hibbeler , Engineering Mechanics: Dynamics, Macmillan USA, latest edition .

Books available in the AAST Library.

C O U R S E A I M
The aim of the course is to provide a clear and thorough presentation of the theory and applications of engineering mechanics.
The course objectives are to study the geometry of motion (Kinematics) as well as the relationship between the motion of a body and the forces and the moments acting on it (Kinetics).
Kinematics of a particle Rectilinear Kinematics. Curvilinear Motion Projectile Motion.
62
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Force & Acceleration (Kinetics). Work & Energy of a particle (Kinetics). Rotation of a Rigid Body about a fixed Axis. General Plan Motion. Exam # 1. Relative Motion (Velocity). Relative Motion (Acceleration).
Week Number 10: Planar Kinetics of Rigid Body Equation of Translation Motion. Week Number 11: Equation of Rotational Motion. Week Number 12: Exam # 2. Week Number 13: Equation of General Plane Motion. Week Number 14: Work and Energy. Week Number 15: Revision. Week Number 16: Final Exam.
63
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9


G R A D I N G
Mathematics (3). BA223. Lecture 2 Hrs. Tutorial 2 Hrs. Credit 3.
BA124 Mathematics (2).
10% 30% 20% 40%
Solving first order differential equations: Separable of variables, Homogeneous equation, Exact equation, Linear equation and Bernoulli's equation. Solving second order homogeneous and nonhomogeneous differential equations with constant and variable coefficients. Undetermined coefficients and variation of parameters methods. Laplace transformations, basic properties, first shifting theorem, unit step function, second shifting theorem, transform of derivatives and integrals, and inverse Laplace transforms. Solving differential equations by using Laplace transform. Fourier series: Fourier series for even, odd, and harmonic functions.
T E X T B O O K S
Erwin Kreyszig, Advanced Engineering Mathematics , John Wiley, 9th edition , 2006 .
D.G.Zill and M.R.Cullen , Advanced Engineering Mathematics, PWS Publishing Company, 1992. K.A.stroud and Dexter J. Booth, Engineering Mathematics, Palgrave Macmillan, latest edition. C.Ray Wylie and Louis C. Barrett, Advanced Engineering Mathematics, McGraw-Hill Inc., latest edition.
A I M
C O U R S E
To study varies methods of solving differential equations, which arise as mathematical modeling in many topics of engineering.
64
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O B J E C T I V E S
To study differential equations, Laplace transform and Fourier analysis, that is of fundamental importance in modern engineering and science.
Solving first order differential equations: Separable of variables and Homogeneous equation. Solving first order differential equations: Exact and Linear equations. Solving first order differential equations: Bernoulli's equation and revision on first order differential equations. Solving second order homogeneous differential equations with constant coefficients. Method of undetermined coefficients. Solving second order non-homogeneous differential equations with constant coefficients. Method of variation of parameters. Continue method of variation of parameters. Solving second order differential equations with variable coefficients (Euler's equation). Laplace transform: Basic definition, First shifting theorem. Laplace transform: Transform differentiation and integration. Unit step function, second shifting theorem, and convolution theorem.
Week Number 10: Inverse Laplace transforms. Week Number 11: Solving differential equations by using Laplace transform. Week Number 12: Fourier series: Fourier series for functions of period 2P. Week Number 13: Fourier series for even and odd functions. Week Number 14: Fourier series for harmonic functions. Week Number 15: Revision. Week Number 16: Final Exam.
65
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9


G R A D I N G
Mathematics (4) BA 224 Lecture 2 Hrs. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
This course gives a comprehensive study on the 2D and 3D vectors : algebra, differential and integral calculus , and the physical interpretation of the integral theorems. The course also gives a study on the complex functions, its differentiation and integration, the residue theorems and its application to real integrals.
T E X T B O O K S
Erwin Kreyszig, Advanced Engineering Mathematics, John Wiley, 9th edition , 2006 .
D.G.Zill and M.R.Cullen , Advanced Engineering Mathematics, PWS Publishing Company, 1992.
C O U R S E A I M
This course aims at enhancing the students knowledge in the subject of Vector Differential and Integral calculus as well as Complex Analysis and Integration needed to solve engineering problems at higher level of the under graduate engineering studies.
Through this course the student gets to know: Vector Differential Calculus Vector Integral calculus Complex Analytic Functions and Complex Integration.
66
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Vector Algebra / Dot and cross product and Applications. Partial Differentiation / and Derivatives of vector functions. Gradient / Divergence/ curl/ Laplacian. Line Integrals / line Integrals Independent of the path / Exactness. Conservative vector fields. Double Integrals in Cartesian and polar coordinates / Greens Theorem, Surface Integrals / Stokes Theorem /7th week Exam. Triple Integrals / Divergence (Gauss Theorem). Review on Integrals Theorems.
Week Number 10: Complex numbers and functions / forms of representation. Week Number 11: Analytic functions/ Harmonic functions. Week Number 12: Line complex integrals / Cauchys Integrals Theorem /12th week Exam. Week Number 13: Zeros and poles of Analytic functions/ Residues and their evaluation. Week Number 14: Residue Theorem / Application to Real Integral. Week Number 15: Introduction to Fourier Integrals and Transforms. Week Number 16: Final Exam.
67
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9


G R A D I N G
Mathematics (5). BA 323. Lecture 2 Hrs. Tutorial 2 Hrs. Credit 3.
BA 224 Mathematics (4).
10% 30% 20% 40%
In the first of this course we discuss the solution of ordinary differential equations with variable coefficients using Taylor's, power series and Frobenius methods, then we go into some special differential equations, as Legendre and Bessel differential equations which lead us to some special functions, as Legendre, Bessel, Gamma and Beta functions. After that we study the method of separation of variables to solve partial differential equations that help us to study some applications like heat transfer in a bar, vibrating of a string and potential fields. In the last of this course we discuss some special complex transformations, conformal mappings, such as bilinear and Schwarz Christoffel transformations.
T E X T B O O K
Erwin Kreyszig, Advanced Engineering Mathematics, John Wiley, 9th edition , 2006.
Dennis G. Zill & R. Cullen. Advanced Engineering Mathematics. PWS Publishing Co.,1992 Birkhoff, G. and G.-C. Rota, Ordinary Differential Equations. 4th ed. New York: Wiley, 1989. John, F., Partial Differential Equations. 4th ed. New York: Springer, 1982. Hanna, J. R. and J. H. Rowland, Fourier Series, Transforms and Boundary Value Problems. 2nd ed. New York: Wiley, 1990. Bieberbach, L., Conformal Mapping. New York: Chelsea, 1964.
A I M
C O U R S E
When dealing with some physical problems, an ordinary or partial differential equation arises. Our course aims to give the student the ability to extract exact solutions of these problems.
68
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O B J E C T I V E S
Upon completion of this course the student will be able to: Solve ordinary differential equations with variable coefficients. Solve partial differential equations with the method of separation of variables. Deal with some special functions. Construct some special complex functions.
O U T L I N E
C O U R S E
Taylor's and Power series methods for solving ordinary differential equations. Differential equation with variable coefficients, ordinary and singular points, solution about ordinary points. Solution about singular points: Regular singular points, the method of Frobenius - Case I. The method of Frobenius - Case II and Case III. Gamma and Beta functions. Lengendre differential equation and Legendre polynomials. Bessel differential equation. Bessel function of the 1st kind. Boundary value problems, partial differential equations and the method of separation of variables.
Week Number 10: Heat equation - heat transfer in a bar. Week Number 11: Wave equation - vibration of a string. Week Number 12: Laplace equation and potential fields. Week Number 13: Conformal mappings - Complex functions as mappings. Week Number 14: Bilinear transformations linear fraction transformation. Week Number 15: Schwarz Christoffel transformation. Week Number 16: Final Exam.
69
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9


G R A D I N G
Mathematics (6). BA 326. Lecture 2 Hrs. Tutorial 2 Hrs. Credit 3.
BA 124 Mathematics (2).
10% 30% 20% 40%
This course provides a comprehensive knowledge about descriptive statistics and the use of computer statistical packages. Statistical methods of estimation and hypothesis testing. Emphasis on use, validity and understanding of particular statistical models.. This course also introduces students to probability, conditional probability; independent event total probability, Bayes theorem and basic counting techniques and random variables. Topics include distribution functions, binomial, geometric and Poisson distributions. The other topics covered are uniform, exponential and normal distributions; joint distributions. An introduction about Random Processes: Definition and classification, stochastic integrals, Fourier transforms of random processes, stationary and nonstationary processes, correlation functions. Power spectral density, transformations of random processes by linear systems. Representation special random processes.
T E X T B O O K S
Mahmoud Gaber , Probability and statistics for engineering student.

Feller, W., An introduction to probability theory and its applications, John Wiley & Sons, 3rd edition. Ross S.M., Introduction to probability models, Academic press, Orlando, 4th edition. Peyton Z., Peebles, Jr., Probability, Random variables, and Random Signal Principles, McGraw-Hill, Inc, latest edition.
A I M
C O U R S E
This course provides a straightforward introduction on the Statistical analysis and the theory of probability and Random process without burdening the student with a great deal of measure theory.
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
In particular, a principal purpose of the course is to help to build up the important Skills necessary for solving problems.
Through this course the student gets to know how: To make statistical analysis and calculating statistical measurements using computer programs like the Minitab program or Excel. To introduce the basic ideas of probability and conditional probability and its dependence. It is assumed that the outdone has some knowledge of elementary set theory. To introduce discrete and continues random variable and for this need a knowledge of the simpler techniques of calculus desirable. To introduce the joint distribution in order to study simple application to random process and signal principles.
O U T L I N E
C O U R S E
An introduction to Statistics and statistical analysis on data observation. Statistical measurements. Elementary probability-Probability theorems. Conditional probability-Independent and dependent events. Total probability rule- Bayes Theorem and enumeration methods. Discrete probability distribution-probability mass function. Continuous probability distribution -probability density function. Mathematical expectation, mean and variance. Special discrete distribution: Bernoulli, Binomial, Geometric and Poisson distributions.
Week Number 10: Special continuous distribution: Uniform and exponential distribution. Week Number 11: Special continuous distribution: normal distribution. Week Number 12: Discrete and Continuous joint probability distribution. Week Number 13: Random Process: Temporal Characteristics. Week Number 14: Random Process: Spectral Characteristics. Week Number 15: Final revision. Week Number 16: Final exam.
71
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Computer Engineering Courses CC

CC 111 Introduction to Computers

G R A D I N G
Introduction to Computer Science. CC111. Lecture 2 Hrs. None. Tutorial/Laboratory 2 Hrs. Credit 3.
10% 30% 20% 40%
This course provides an introduction to computers and computing .Topics of interest include the impact of computers on society, ethical issues, and hardware /software applications, including internet applications, system unit, storage and input/output devices, numbering systems, system and application software, presentation skills, program development, programming languages, and flow charts, Visual Basic, web page design using HTML, and communications and networks.
T E X T B O O K S
Charles S. Parker, Deborah Morley, Understanding Computers Today and Tomorrow, Course Technology 2009, latest edition.
Cashman, Shelly, Wood, and Dorin, HTML: Complete concepts and technologies, Thomson course technology, latest edition. Peter Norton, Introduction to computers, McGraw Hill, latest edition. Robert J. Spear and Timothy M. Spear, Introduction to computer programming in Visual basic 6.0, Thomson Learning, latest edition.
A I M
C O U R S E
The students must have a general understanding of what computers are and how they operate. The students must have good skills in using windows, MS PowerPoint, HTML and Visual Basic.
72
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
The students must learn problem solving techniques and program development. The student should know the available programming languages and their capabilities.
O B J E C T I V E S
C O U R S E
At the end of the course the student should be able to: Identify computer hardware components and their specifications and types. Use Windows, MS PowerPoint, HTML, and Visual Basic. Understand and use numbering systems.
O U T L I N E
C O U R S E
Introduction to the World of Computers Input and Output. The System Unit: Processing and Memory. Storage and Input/Output Devices. System Software and Application Software. Quiz 1 + Program Development, Programming Languages, and Flow charts. Visual Basic 1. 7th Week Exam. Visual Basic 2. Visual Basic 3.
Week Number 10: Quiz 2 + Web page design using HTML 1. Week Number 11: Web page design using HTML 2. Week Number 12: 12th Week Exam. Week Number 13: Communications and Networks 1. Week Number 14: Communications and Networks 2. Week Number 15: Ethics, Computer Crime, Privacy, and other Social Issues. Week Number 16: Final Exam.
73
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 112 Structured Programming


G R A D I N G
Structured Programming. CC112. Lecture 2 Hrs. CC111. Laboratory 2 Hrs. Credit 3.
10% 30% 20% 40%
An introduction to C-language Programming is provided in this course, Variable/Constant definitions, Basic Programmes, Sequential Programming, Conditional Programming, Looping and repetitions, Functions, Arrays as well as searching and sorting techniques.
T E X T B O O K S
J.Hanly and E. Koffman,C Program Design for Engineers, Addison Wesley, latest edition
H.Schildt, C, the complete reference , Osborne McGrawHill, latest edition.

C O U R S E A I M
Introducing Structured programming techniques associated with the C-Language, used to program most nowadays systems. Studying their application to practical problems with special emphasis on some practical applications concerning different disciplines.
Studying C-language programming techniques, sequence, selection and repetition control structures, functions, Arrays, sorting and searching techniques.
Overview of Programming and Problem Solving. C Syntax and Semantics.

74
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
I/O Formatting and Arithmetic. Conditions and Logical Expressions. Selection Control Structures. Repetitions (Part 1). 7th Week Exam. Repetitions (Part 2). Functions (Part 1).
Week Number 10: Functions (Part 2). Week Number 11: Arrays (Part 1). Week Number 12: 12th Week Exam. Week Number 13: Arrays (Part 2). Week Number 14: Programming applications problem solving Tech (Part 1). Week Number 15: Programming applications problem solving Tech (Part 2). Week Number 16: Final Exam.
75
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 114 Introduction to Programming


G R A D I N G
Introduction to programming* CC 112. Lecture 2 Hrs. Lab/ Tutorial 2 Hrs. Credit 3.
CC 111 - Introduction to computer.
T E X T B O O K S
10% 30% 20% 40%
Deitel, P.J; Deitel, H.M; Ayer, D.J, Simply Visual Basic 2008: An Application-Driven Tutorial Approach, 3rd Edition, Pearson International Edition (or Pearson Education), 2009.

C O U R S E A I M
This course will help students know the concepts of programming using VB, and knowing how to use editors to implement these concepts.
Upon completion of this course, students should be able to: Explain the different concepts of programming, and knowing the different tools that can be used. Experiment this using visual studio
O U T L I N E
C O U R S E

*
Introduction to visual basic. Introducing variables, memory concepts and arithmetic.

B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Illustrating application example. Introducing algorithms, pseudocode, program control, checkboxes and dialogs. Sample applications. Introducing the Do WhileLoop and Do UntilLoop Repetition Statements. Introducing the Do Loop While and Do Loop Until Repetition Statements. Introducing the For Next Repetition Statement. Introducing the Select Case Multiple-Selection Statement.
Week Number 10: Introducing One-Dimensional Arrays. Week Number 11: Introducing Two-Dimensional Arrays. Week Number 12: Two-Dimensional Arrays Application. Week Number 13: General Application. Week Number 14: Functions and Procedures. Week Number 15: Fibonacci Application. Week Number 16: Students projects.
77
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 213 Programming Applications


G R A D I N G
Programming Applications. CC 213. Lecture 2 Hrs. CC 112. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
An advanced C-language Programming is provided in this course: two dimensional arrays, strings, pointers, recursion, structures, bitwise-operators, input-output interfacing as well as text and binary files are covered in details. Projects are required from students to increase their skills in C programming.
T E X T B O O K
J.Hanly and E. Koffman, C Program Design for Engineers, Addison Wesley, latest edition.
H.Schildt, C, the complete reference , Osborne McGrawHill, latest edition.

C O U R S E A I M
Introducing different programming techniques associated with the C-Language, used to program most nowadays systems. Studying their application to practical problems with special emphasis on some practical applications concerning different disciplines.
Upon completion of this course the student will be able to: Studying C-language programming techniques, files, pointers, structure, string, and array.
Week Number 1:
Revision of structured programming constructs: selection, repetition, and Functions.

78
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Week Number 2: Week Number 3: Week Number 4: Week Number 5: Week Number 6: Week Number 7: Week Number 8: Week Number 9:
Revision of one dimensional array. Searching and sorting. Two dimensional arrays. Pointers. Strings. 7th week exam. Structures. Structures/Unions.
Week Number 10: Recursion. Week Number 11: Text Files. Week Number 12: 12th week exam. Week Number 13: Binary Files. Week Number 14: Bitwise Operators/ I/O Interfacing. Week Number 15: Advanced Applications. Week Number 16: Final Exam.
79
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 215 Data Structures


G R A D I N G
Data Structures CC 215 Lecture 2 Hrs. CC 213. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Difference between static data type and dynamic data types - the concept of pointers & dynamic memory allocation - programming practice using dynamic structures.
T E X T B O O K
Mark Weiss and Benjamin Cummings, Data structures and algorithm analysis, Benjamin Cummings Pub, latest edition.
Donald Knuth, The art of computer programming, Addison Wesley, latest edition.
C O U R S E A I M
Review of data types and static data structures pointers, dynamic data structures: stack queues linked lists, trees and graphs.
Upon completion of this course the student will be able to: Demonstrate the difference between static data type and dynamic data types. Introduce the concept of pointers & dynamic memory allocation. Give students practical programming experiences using dynamic structures.
O U T L I N E
C O U R S E
Week Number 1:
Introduction to static Vs dynamic data structures.

80
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Stack data type. Implementation of stack in different applications. Queue data type. Introduction to dynamic programming using pointers. Linked lists. 7th week exam. Double & circular linked lists. Introduction to tree structures.
Week Number 10: Tree traversals. Week Number 11: Threaded tree. Week Number 12: 12th week exam. Week Number 13: Graphs representation and traversals. Week Number 14: Graphs minimum spanning tree & shortest path. Week Number 15: Revision. Week Number 16: Final Exam.
81
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 216 Digital Logic Design


G R A D I N G
Digital Logic Design CC 216 Lecture 2 Hrs. CC 111. Tutorial/Lab 2/2 Hrs. Credit 3.
10% 30% 20% 40%
Number systems - binary arithmetic and codes - logic gates - Boolean algebra and logic simplifications - Design and realization of combinational circuits - Functions of combinational circuits logic - Flip-Flops - analysis design and realization of counters - analysis and realization of shift registers - Computer aided engineering.
T E X T B O O K
Thomas L. Floyd, Digital Fundamentals, Prentice Hall, latest edition.

M. Mano, Digital Design, Prentice Hall, latest edition. J. P. Hayes, Introduction to Digital Logic Design, Addison Wesley, latest edition. David M. Buchla, Experiments in Digital Fundamentals, Prentice Hall, latest edition. Texas Instruments Data Sheets, latest version.
A I M
C O U R S E
To develop engineering skills in the design and analysis of digital logic circuits with applications to digital computer.
Upon completion of this course the student will be able to: Knowing the basic differences between analog and digital systems Use binary numbers and codes
82
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Describe the operation of logic gates Applying Boolean algebra on K-map Design a combinational and sequential logic circuits to simplify function
O U T L I N E
C O U R S E
Introduction to digital concepts. Number systems, operations, and codes. Logic gates. Boolean algebra and logic simplification part 1. Boolean algebra and logic simplification part 2. Functions of combinational logic. 7th week exam. Decoders, encoders, MUX, DMUX part 1. Decoders, encoders, MUX, DMUX part 2.
Week Number 10: Flip-Flops and related devices part 1. Week Number 11: Flip-Flops and related devices part 2. Week Number 12: 12th week exam. Week Number 13: Flip-Flops applications. Week Number 14: Counters. Week Number 15: Shift registers. Week Number 16: Final Exam.
83
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 218 Discrete Mathematics


G R A D I N G
Discrete Mathematics CC 218 Lecture 2 Hrs. CC 111. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
The logic of statements - logical form and equivalence - logic implementation arguments predicates - number theory - counting methods function relation - methods of proof.
T E X T B O O K
Sussana Epp, Discrete Mathematics with Applications, Brooks Cole, latest edition.
Dr Rod Haggarty, Discrete mathematics for computing, Addison Wesley, latest edition.
C O U R S E A I M
Logic of statements, logical form and equivalence, logic implementation, arguments, predicates, number theory, counting methods, function, relation, methods of proof.
Upon completion of this course the student will be able to: Enhance students ability to Comprehend mathematical logic, predicates and methods of proof. Introduce mathematical induction. To understand discrete structures like functions and relation.
O U T L I N E
C O U R S E
Week Number 1:
Logical form & logical equivalence.

84
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Conditional statement, valid & invalid arguments. Predicates & quantified statements. Arguments with quantified statements. Number theory. Counting elements. 7th week exam. Functions defined on general sets. One-to-one, onto, inverse function, composition of functions.
Week Number 10: Relations on sets. Week Number 11: Reflexivity symmetry, transitivity & equivalence relations. Week Number 12: 12th week exam. Week Number 13: Partial order relations. Week Number 14: Finite state automata. Week Number 15: Mathematical inductions. Week Number 16: Final Exam.
85
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 243 Introduction to Computer Organization


G R A D I N G
Introduction to Computer Organization* CC 243 Lecture 2 Hrs. CC 216. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Computer interconnection structures; computer components, computer function interconnection structures, and bus interconnection. Internal and external memory: computer memory system overview, semiconductors main memory, cache memory, magnetic tape, and optical memory. Input / Output: I/O modules, programmed I/O interrupt-driven I/O, direct memory Access. Operating system: Operating systems overview, scheduling, and memory management. The central processing unit: Computer Arithmetic, characteristics and functions of instruction sets, addressing modes, processor organization, the instruction cycle, instruction pipelining. Control unit Micro- operation, hardware implementation , Control Functions.
T E X T B O O K
Morris Mano, Computer System Architecture, Prentice Hall, latest edition.

W. Stallings, Computer Organization and Architecture, Macmillan, latest edition. F. Halsall, Data communication, computer Network and open systems, Addison Wesley, latest edition
A I M
C O U R S E
Introduce students to the basic knowledge necessary to understand the hardware operation of digital computers and covers the main subjects associated with computer hardware.
Offered only to the department of computer science

B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O B J E C T I V E S
Upon completion of this course the student will be able to Presenting the various digital components used in the organization and design of digital computers- Explaining the detailed steps that a designer must go through in order to design an elementary basic computer, Introducing the organization and architecture of the main units of a digital computer.
Introduction to Computer Systems Organization & Architecture part 1. Introduction to Computer Systems Organization & Architecture part 2. Digital Components. Register Transfer Organization & Micro-operation part 1. Register Transfer Organization & Micro-operation part 2. Basic computer Organization and Design part 1. Basic computer Organization and Design part 2. Central Processing Unit part 1. Central Processing Unit part 2.
Week Number 10: Central Processing Unit part 3. Week Number 11: Memory Organization part 1. Week Number 12: Memory Organization part 2. Week Number 13: Memory Organization part 3. Week Number 14: Input-Output Organization part 1. Week Number 15: Input-Output Organization part 2. Week Number 16: Final Exam.
87
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 311 Computer Architecture


G R A D I N G
Computer Architecture CC 311 Lecture 2 Hrs. CC 317. Tutorial / lab 2/2 Hrs. Credit 3.
10% 30% 20% 40%
Basic Computer Organization - Arithmetic Logic Unit - High Speed Arithmetic The MIPS Architecture Performance Evaluation Techniques - The Memory Element - Memory Organization - Computer Input/Output Organization The Hardwired Control Unit Microprogramming and typical Computer Architectures CISC and RISC Paradigms.
T E X T B O O K
David A. Patterson and John I. Hennessy, Computer Organization and Design: The Hardware/Software Interface, Morgan Kaufmann, latest edition.
M. Mano, C. Kime, Computer Design Fundamentals, Prentice Hall, latest edition. Michael Flynn, Computer Architecture Jones and Bartlett, latest edition.
A I M
C O U R S E
To introduce students to the basic concepts of computer architecture and organization through the study of the fundamentals associated with subject matter.
Upon completion of this course the student will be able to: Compare between various architectures Design MIPS computer architecture from the given instruction set. Program the MIPS processor using its own programming language Design the control using microprogrammed control
88
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Assess a pipelined architecture

O U T L I N E
C O U R S E
Introduction-overview of computer architecture-lecture grading policy. Computer abstraction and technology + project term. The role of performance. MIPS Assembly Language. Instructions for making decisions and procedures calls. Assembly modes. 7th week exam. The processor: Data path and control. Single-Cycle Data path.
Week Number 10: Pipelining. Week Number 11: Pipelining (cont.). Week Number 12: 12th week exam. Week Number 13: Hazards and Dependencies in pipelining. Week Number 14: Cache memory. Week Number 15: Virtual memory. Week Number 16: Final Exam.
89
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 312 Computer Organization


G R A D I N G
Computer Organization* CC 312 Lecture 2 Hrs. CC 216. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Computer interconnection structures - computer components - computer function interconnection structures - bus interconnection. - Internal and external memory - computer memory system overview - semiconductors main memory - cache memory - magnetic tape - optical memory - Input / Output - I/O modules - programmed I/O - interrupt-driven I/O - direct memory Access Operating system - Operating systems overview scheduling - memory management - The central processing unit - Computer Arithmetic - characteristics and functions of instruction sets addressing modes - processor organization - the instruction cycle - instruction pipelining - Control unit Micro-operation - hardware implementation - Control Functions.
T E X T B O O K
Linda Null, Julia Lobur, Computer Organization and Architecture, Jones & Bartlett Pub., latest edition.
Morris Mano, Computer System Architecture, Prentice Hall, latest edition.

C O U R S E A I M
Introduce students to the basic knowledge necessary to understand the hardware operation of digital computers and covers the main subjects associated with computer hardware.

B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O B J E C T I V E S
Upon completion of this course the student will be able to: Presenting the various digital components used in the organization and design of digital computers Explaining the detailed steps that a designer must go through in order to design an elementary basic computer. Introducing the organization and architecture of the main units of a digital computer.
O U T L I N E
C O U R S E
Introduction to Computer Systems Organization & Architecture part 1. Introduction to Computer Systems Organization & Architecture part 2. Digital Components. Register Transfer Organization & Micro-operation part 1. Register Transfer Organization & Micro-operation part 2. Basic computer Organization and Design part 1. Basic computer Organization and Design part 2. Central Processing Unit part 1. Central Processing Unit part 2.
Week Number 10: Central Processing Unit part 3. Week Number 11: Memory Organization part 1. Week Number 12: Memory Organization part 2. Week Number 13: Memory Organization part 3. Week Number 14: Input-Output Organization part 1. Week Number 15: Input-Output Organization part 2. Week Number 16: Final Exam.
91
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 316 Object Oriented Programming


G R A D I N G
Object Oriented Programming CC 316 Lecture 2 Hrs. CC 319. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Object oriented modelling and development - classes objects inheritance GUI interfaces applets multithreading.
T E X T B O O K
Y. Daniel Liang, Introduction to Java Programming, Pearson Education, latest edition.

Herbert Schildt, Java 2 the complete reference, Mac-Graw Hill, latest edition. Deitel & Deitel, Java How to program, Prentice Hall, latest edition.
A I M
C O U R S E
Teach the students the Object oriented techniques, Design, Analysis, and programming with Java.
Upon completion of this course the student will be able to: List & Express OOP concepts * Analyze programs in OO manner. Define objects and their interrelationship Design & Implements programs in Java OO language
O U T L I N E
C O U R S E
Week Number 1:
Overview of Java Language (the procedural features).

92
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Object Based programming. Objects and classes. Strings. OOP (Inheritance and interfaces). OOP Software development (Class design). 7th week exam. Getting Started with GUI programming. Creating user interfaces.
Week Number 10: Applets and advanced GUI. Week Number 11: Exception Handling. Week Number 12: 12th week exam. Week Number 13: Multithreading. Week Number 14: I/O streams. Week Number 15: Networking. Week Number 16: Final Exam.
93
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 317 Digital System Design


G R A D I N G
Digital System Design CC 317 Lecture 2 Hrs. CC 216. Tutorial / Lab 2/2 Hrs. Credit 3.
10% 30% 20% 40%
Introduction to digital design, combinational digital design and realization using: decoders, encoders, buffer, multiplexers, comparators, adders, and ALU, sequential design and realization using: latches, flip-flops, counters, and shift registers, memories, CPLD, and FPGA. Synchronous analysis and design using algorithmic state machines ASM, Digital design practice, CAD, using FPGA and CPLD.
T E X T B O O K
John F. Wakerly, Digital design principles and practices, Prentice Hall, latest edition.
F. P. Processor, D. E. Wiskel, The art of digital Design and introduction to top-Down Design, Prentice hall, latest edition.
C O U R S E A I M
To introduce the students to combinational and sequential digital systems design and troubleshooting. The student will be familiar with ASM analysis and design.
Upon completion of this course the student will be able to: Breakdown any digital design problem and work through the standard steps of design and analysis to the implementation stage. Utilize the knowledge of combinational design & realization using ICs, Memories and programmable devices.
94
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Implement synchronous analysis, design and realization using Algorithmic state machine ASM. Design on FPGA, CPLD chips using VHDL or Verilog. Work with digital design practical applications.
O U T L I N E
C O U R S E
Introduction to digital design, Introduction to digital design: Codes, Standard Representation of logic Functions. Introduction to digital design, Quine-McCluskey. Algorithmic state machine chart (ASM Chart), , Propagation delay, Clock Skew), Timing Hazards. Part of combinational logic design practices: VHDL. Part of combinational logic design practices, CPLD, PLA, PLD, GAL, Combinational logic Design practices continued. Sequential logic design practices. 7th Week Exam. Memories and programmable devices, applications with VHDL-based design using FPGA, CPLD. Combinational logic Design practices continued.
Week Number 10: Sequential logic design practices part 1. Week Number 11: Sequential logic design practices part 2. Week Number 12: 12th Week Exam. Week Number 13: Sequential logic design practices part 1. Week Number 14: Sequential logic design practices part 2. Week Number 15: Additional Real-life system design. Week Number 16: Final Exam.
95
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 319 Advanced Programming


G R A D I N G
Advanced Programming CC 319 Lecture 2 Hrs. CC 213. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
C# language constructs data types input/ output & control statements modularity arrays strings files classes and inheritance.
T E X T B O O K
Deitel et al, Visual C# how to program, Prentice Hall, latest edition.

Michael McMillan, Data structures algorithms and programming style with C#, Cambridge University Press, latest edition.
C O U R S E A I M
Develop engineering skills in the design and analysis programming of C# language.

Upon completion of this course the student will be able to: Highlight the main features of the C# programming language. Teach students how to design and write a computer programming for complex system Develop software skills in the design and analysis of C# programming
O U T L I N E
C O U R S E
Week Number 1:
An introduction to C# programming language.

96
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Input / output statement expressions. Windows application design. Condition statement and iteration statements part 1. Condition statement and iteration statements part 2. Method and modular programming. 7th week exam. Arrays & objects. Strings object and string methods (Part 1).
Week Number 10: Strings object and string methods (Part 2). Week Number 11: Classes. Week Number 12: 12th week exam. Week Number 13: OOP Programming. Week Number 14: Inheritance (Part 1). Week Number 15: Inheritance (Part 2). Week Number 16: Final Exam.
97
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 331 Data and Computer Communications


G R A D I N G
Data and Computer Communications CC 331 Lecture 2 Hrs. EC 320. Tutorial / lab 2/2 Hrs. Credit 3.
10% 30% 20% 40%
The goal of the course is to provide a background and context for the concept of computer networks. The broad range of topics that are encompassed in the field of data and computer communications is introduced, and the fundamental concepts of protocols and protocol architectures are examined. Also the course deals with the fundamental concepts of signal, medium, and encoding. Also deals with other aspects of data communications: reliability and efficiency. Error detection and correction in case of errors during transmission will be covered. A variety of multiplexing techniques can be used to provide for efficient use of the medium. Transmission media is discussed included guided and unguided media. Signal encoding techniques are discussed. Data ink control protocols are studied.
T E X T B O O K
William Stallings, Data and Computer Communications, Prentice Hall, latest edition.
Douglas E. Comer, Computer Networks and Internets, Prentice Hall, latest edition. Andrew S. Tannenbaum, Computer Networks, 4th Ed, Prentice Hall, latest edition. Keiser, G., LAN, McGraw Hill, latest edition.
A I M
C O U R S E
See Course Description.

See Course Description.

B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Introduction to data Communication and Networking Concepts. Protocol Architecture. Data Communication - Data transmission. Guided and Wireless Transmission. Signal Encoding Techniques. Digital Data Communication techniques. 7th Week Exam. Types of Multiplexing. Wide Area Networks Circuit Switching and Packet Switching.
Week Number 10: Wide Area Networks ATM. Week Number 11: Wide Area Networks Routing in Switched Networks and Congestion Control. Week Number 12: 12th Week Exam. Week Number 13: Local Area Networks- Overview. Week Number 14: Local Area Networks-High Speed LANs. Week Number 15: Local Area Networks- Wireless LANs. Week Number 16: Final Exam.
99
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 341 Digital Electronics


G R A D I N G
Digital Electronics CC 341 Lecture 2 Hrs. EC 238 Tutorial/Lab 2/2 Hrs. Credit 3.
10% 30% 20% 40%
Understanding pulse fundamentals. Working with diodes, transistors and analyzing their circuits, design of diodes and transistors circuits. design and analysis of DTL, TTL and CMOS circuits.
T E X T B O O K
David A. Bell Solid State pulse circuits, Prentice Hall, latest edition.
Nerl H. E. Weste Principles of CMOS VLSI Design, A Systems Prespective, Addison Wesley, latest edition.
C O U R S E A I M
Introduce students to the different types of integrated circuit logic gates, their characteristics, performance and design.
Upon completion of this course the student will be able to: Understand the different integrated circuit logic gates (DTL, HTL, RTL, TTL, ECL, MOS, I2L, CMOS). Discuss the characteristics and performance of each of the above types of IC logic gates. Design logic gate circuits as well as circuits to interface between different types of IC logic gates.
100
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Pulse Fundamentals. Diode Switching. Transistor Switching part 1. Transistor Switching part 2. Design of Basic logic gates. Integrated circuits Logic Gates Performance Characteristics. 7th Week Exam. TTL Logic gates. Emitter coupled logic, Integrated Injection logic.
Week Number 10: P-MOS and N-MOS logic gates. Week Number 11: CMOS Logic Gates. Week Number 12: Comparison and interfacing of different logic gate types part 1. Week Number 13: Comparison and interfacing of different logic gate types part 2. Week Number 14: Introduction to logic circuit Design part 1. Week Number 15: Introduction to logic circuit Design part 2. Week Number 16: Final Exam.
101
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 410 Systems Programming


G R A D I N G
Systems Programming CC 410 Lecture 2 Hrs. CC 319. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Introduction to system programming - machine architecture - machine language - assembly language - two pass assemblers - one pass assemblers - macro facilities - conditional macros - macro processors loaders linkers - introduction to formal languages - compilers and interpreters.
T E X T B O O K
Leland L. Beck, System software: an introduction to systems programming, Addison Wesley, latest edition.
John J. Donovan, Systems Programming, Mc-Graw Hill, latest edition. David A. Watt, Deryck Brown Programming Language Processors in Java: Compilers and Interpreters, Prentice Hall, latest edition.
A I M
C O U R S E
Study the concepts and the theory behind some system software such as assemblers, loaders, macro processors and linkers. Study the concepts and the theory behind the structure and implementation of high level programming languages processors.
Upon completion of this course the student will be able to: Studying the architecture of a hypothetical machine, its assembly language, macro language. Programming in assembly language
102
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Studying the structure and design of assemblers, linkers and loaders Studying the concepts and theory behind the implementation of high level programming languages.
O U T L I N E
C O U R S E
System programming Vs. Application programming, Examples for system software, Languages for implementation of system software. Machine language, Instruction set, addressing modes. Programming in assembly language. Structure and design of a two pass assembler part 1. Structure and design of a two pass assembler part 2. Structure and design of one pass assemblers. 7th week exam. Programming in macro languages. Structure and design of macro processors.
Week Number 10: Loaders and linkers (Part 1). Week Number 11: Loaders and linkers (Part 2). Week Number 12: 12th week exam. Week Number 13: Introduction to formal Languages and processing of high level languages (Part 1). Week Number 14: Introduction to formal Languages and processing of high level languages (Part 2) Week Number 15: Introduction to formal Languages and processing of high level languages (Part 3) Week Number 16: Final Exam.
103
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 411 Introduction to Microprocessors


G R A D I N G
Introduction to Microprocessors* CC 411 Lecture 2 Hrs. CC 312 or CC216. Tutorial/Lab 2/2 Hrs. Credit 3.
10% 30% 20% 40%
Microprocessors and microcomputers - Microcomputer structure microprocessor memory buses (synchronous and asynchronous) - I/O - 16/32-bit microprocessor architecture - Instruction cycle microinstructions - micro-programming - instruction decoding - Reduced Instruction Set computer (RISC) architecture - Complex Instruction Set computer (CISC) architecture - Memory (RAM, ROM, memory mapping of I/O) - I/O (parallel and serial I/O interfaces, system clock, clock phases and bit rates) - Interrupts (types, handling of interrupts) - Software aids (text editors and assemblers, linkers and macro-assemblers).
T E X T B O O K
Muhammad Ali Mazidi and Janice Gillispie Mazidi, 80x86 IBM PC and compatible computers, Prentice Hall, latest edition.
Barry B. Brey, Intel Microprocessors, Prentice Hall, latest edition.

C O U R S E A I M
Identify The Microprocessors Category and study the internal structure and external connections of an example microprocessor (Intel 80386).
Upon completion of this course the student will be able to:

*

B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Work with the Intel 80386 microprocessor, its connected peripherals, and its assembly language format.
Introduction to microprocessors Historical background. 80386 Microprocessor architecture. Real mode software model. Addressing modes. The instruction set & Machine Language coding. Protected mode Architecture Model. 7th week exam. Virtual memory Management. Memory Interface.
Week Number 10: DRAM. Week Number 11: Input/output interface. Week Number 12: 12th week exam. Week Number 13: Interrupts and exception processing. Week Number 14: The 486 and Pentium microprocessors family. Week Number 15: Revision. Week Number 16: Final Exam.
105
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 412 Computing Algorithms


G R A D I N G
Computing Algorithms CC 412 Lecture 2 Hrs. CC 319. Tutorial /lab 2/2 Hrs. Credit 3.
10% 30% 20% 40%
Analyze the asymptotic performance of algorithms - demonstrate a familiarity with major algorithms and data structures - synthesize efficient algorithms in common engineering design situations.
T E X T B O O K
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms, Prentice-Hall, latest edition.
Steven S. Skiena, The Algorithm Design Manual, Springer-Verlag, latest edition.

C O U R S E A I M
Analyze the asymptotic performance of algorithms. Apply important algorithmic design paradigms and methods of analysis to solve problems. Measure the performance of algorithms and Proof correctness of algorithms. Introduction to parallel Algorithms
Upon completion of this course the student will be able to: Argue correctness of Algorithms Analyze worst case running time of algorithms Explain the basic properties of randomized algorithms Learn how to use the major algorithms, data structures and design paradigms
106
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Introduction to the course objectives and policies. Analysis of Algorithms, Asymptotic Notations. Asymptotic Notations(part 2). Divide and Conquer and Quiz #1. Sorting: Heapsort, Priority Queues. Linear-time Sorting. 7th week exam. Greedy Methods. Binary Search Trees , red black trees and interval trees.
Week Number 10: Minimum Spanning Trees , Network flow algorithms. Week Number 11: Graph representation. Week Number 12: Computational Geometry , closest pair problem. Week Number 13: String Matching. Week Number 14: Introduction to some of the applied algorithmic settings such as operations research and cryptography. Week Number 15: Projects and Assignments discussion and presentations. Week Number 16: Final Exam.
107
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 413 Numerical Analysis


G R A D I N G
Numerical Analysis CC 413 Lecture 2 Hrs. CC 112 - BA224. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Introduction to numerical methods and their applications - solve science and engineering problems - convergence - error analysis of numerical methods.
T E X T B O O K
Steven C. Chapra and Raymond P. Canale, Numerical Methods for Engineers with Software and Programming Applications, McGraw Hill, latest edition.
Faire Burden, Numerical Analysis, PWS, latest edition. Earl .E. Swartzlander, Computer Arithmetic, IEEE Computer Society Press. Robert .F. Churchhouse, Numerical methods hand book of applicable mathematics, John Wiley & Sons, latest edition.
A I M
C O U R S E
Allow students to master the approximation techniques used in numerical solutions that arise in science and engineering problems. Teach students why numerical methods work, what type of errors to expect and when an application might lead to difficulties.
108
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Introduction to numerical methods and errors of computers, errors analysis, error propagation, roots of equations of one variable linear equations, Eigen values and Eigen vectors. Numerical differentiation, integration, interpolation, least square error, and regression.
O U T L I N E
C O U R S E
Solution of equations of one variable: Bisection method, False Position method, and secant method. Solution of equations of one variable: Successive Approximation method, and modified Successive Approximation method. Solution of equations of one variable: Newton Raphson method and nearly equal roots. Solution of equations of one variable: Berge Vieta method (of roots of polynomials). Error Analysis and Propagation: Types and sources of errors and illconditioning and instability. Error Analysis and Propagation: Process graphs, error propagation with examples. Solutions of linear equations: (Direct Methods) Gauss elimination and Gauss Jordan methods. Solutions of linear equations: (Direct Methods) Gauss Jordan method for Integral matrices. Solutions of linear equations: (Indirect Methods) Jacobi, Gauss Siedel, and conditions of convergence.
Week Number 10: Matrix Inversion using direct methods for solution of linear equations. Eigen values. Week Number 11: Numerical Interpolation (Linear, Quadratic, and Lagrange polynomials). Week Number 12: Numerical Differentiation and Integration (Mid-point integration). Week Number 13: Numerical Integration (Trapezoidal, Simpson, and Gaussian integration). Week Number 14: Linear and Quadratic regression. Week Number 15: Lagrange regression and revision. Week Number 16: Final Exam.
109
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 414 Database systems


G R A D I N G
Database systems CC 414 Lecture 2 Hrs. CC 319. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Relational Database analysis design - normalization and implementation - implementation skills using Oracle developer - Concurrent transactions - Distributed databases and client server approach.
T E X T B O O K
Ramakrishnan. Gehrke, Database Management systems, Mc-Graw Hill, latest edition.

Peter Rob and Carlos Coronel, Database Systems: Design, Implementation, and Management, Course Technology, latest edition. C. J. Date, An introduction to database systems, Addison Wesley, latest edition. ORACLE developer manuals.
A I M
C O U R S E
Help students to achieve a high level of proficiency at design and implementation of relational database systems for real-world design problems.
Upon completion of this course the student will be able to: Explain database design concepts Design a database system for a real-world problem. Implement and verify a database system using ORACLE Developer 2000
110
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Introductory to database concepts. Relational data model of relational database systems. Relational Integrity rules. Relational algebra. Basic relational analysis and data modeling. Normalization of database tables. (Part 1). 7th week exam. Normalization of database tables. (Part 2). Extended relational analysis and data modeling.
Week Number 10: Developing Entity / relationship diagram. Week Number 11: Developing a database design and Implementation of a real-world problem. Week Number 12: 12th week exam. Week Number 13: Transaction management and concurrency control. Week Number 14: Internal level of database systems Week Number 15: Distributed databases and client-server Architecture. Week Number 16: Final Exam.
111
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 415 Data Acquisition System


G R A D I N G
Data Acquisition System CC 415 Lecture 2 Hrs. CC 421. Tutorial / Lab 2/2 Hrs. Credit 3.
10% 30% 20% 40%
Data Acquisition, Definitions & Applications, Data Acquisition channel structure components, Sensors and Transducers: Types, applications, structural classifications, Signal conditioning, Amplifications reshaping, and filtration, Data conversion, principles, devices and limitations, Introduction to data Analysis and elementary control, Case studies, Student Projects.
T E X T B O O K
Sergio Franco, Design with Operational Amplifiers and Analog Integrated Circuits, McGraw Hill, latest edition.
Harry N. Norton, Sensor and Analysis Handbook , Prentice Hall, latest edition. R.Pallas Areny, T. Webster, Sensors and Signal Conditioning , John Wiley, latest edition. Tran Tien Lang, Computerized Instrumentation , John Wiley & Sons., latest edition. Brufee Newby, Electronic Signal Conditioning, Prentice Hall, latest edition.
A I M
C O U R S E
To introduce the basic techniques of automatic sensing and measurements in the non-digital world. To train students on the principles and to acquire skills in dealing with sensing different physical phenomena; mechanical, electric, electronic, and optical.
112
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Data Acquisition definitions & applications, Data Acquisition Channel structural components. Sensors & Transducers: Types, applications, structural classifications, signal conditioning; Amplifications, reshaping, and filtration. Data conversion; Principles, devices, and limitations. Introduction to data analysis and elementary control. Case studies. Student projects.
Introduction. Data acquisition systems & data acquisition channel. Sensors & transducers. Signal conditioning: operational amplifiers & applications. Signal conditioning: operational amplifiers. Signal conditioning: analog filters. 7th week exam. Review of computer interfacing techniques. Special applications of operational amplifiers.
Week Number 10: Digital to analog conversion. Week Number 11: Actuators. Week Number 12: 12th week exam. Week Number 13: Analog to digital conversion part 1. Week Number 14: Analog to digital conversion part 2. Week Number 15: Projects presentation. Week Number 16: Final Exam.
113
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 416 Computer Graphics


G R A D I N G
Computer Graphics CC 416 Lecture 2 Hrs. CC 319. Tutorial / Lab 2/2 Hrs. Credit 3.
10% 30% 20% 40%
History and survey of graphics applications - Overview of graphics systems and output devices Output primitives including points, lines, circles, splines, area filling, and character generation Attributes of output primitives -two dimensional transformations - windowing and clipping. Interactive input methods - Introduction to three- dimensional graphics.
T E X T B O O K
D. Hearn and M.P. Baker, Computer Graphics Open Gl Version, Prentice Hall, latest edition.
Francis S. Hill, Computer Graphics Using OpenGL, Prentice Hall, latest edition. James D. Foley, Andries van Dam, Steven K. Feiner, John F. Hughe, Computer Graphics, and Practice, Addison Wesley, latest edition.
A I M
C O U R S E
Introduce the student to the basic principles for design, use and understanding of 2-d as well as 3-d graphics. The hardware and software components of graphics systems are examined.
Upon completion of this course the student will be able to: Provides the student with the necessary knowledge in mathematics, algorithms design and programming skills to develop graphics applications.
114
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Introduction, history and Survey of Computer Graphics Applications. Overview of Graphics Systems : Raster and Random scan displays. Color display Color models. Output Primitives : Bresenham line and Mid-point Circle / Ellipse drawing algorithms (Part 1). Output Primitives : Bresenham line and Mid-point Circle / Ellipse drawing algorithms (Part 2). Drawing free curves : Bezier and Spline techniques. 7th week exam. Two Dimensional Transformations. Viewing transformation.
Week Number 10: Line and Polygon clipping algorithms. Week Number 11: Filling algorithms. Week Number 12: Animation. Week Number 13: Three Dimensional Concepts Viewing and Representation. Week Number 14: Three Dimensional Transformations. Week Number 15: Revision. Week Number 16: Final Exam.
115
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 417 Assembly Language


G R A D I N G
Assembly Language CC 417 Lecture 2 Hrs. CC 421. Tutorial /Lab 2 /2 Hrs. Credit 3.
10% 30% 20% 40%
Introduction to 8086 instructions & directories, Assembly language fundamentals, Input/Output operations, conditional processing, Arithmetic, string processing, disk storage, file processing, terminate and stay resident programs (TSRs). The course includes a project.
T E X T B O O K
Dandamudi, "Introduction to Assembly Language Programming", Springer, latest edition.

Karen Miller, Jim Goodman, "An Assembly Language Introduction to Computer Architecture: Using the Intel Pentium", Oxford University Press, latest edition.
C O U R S E A I M
Learning the assembly language instructions set, directives, macros, and data allocation statements. Interact programs with the operating system including memory management and input/output services.
Upon completion of this course the student will be able to: Understand the hardware and software architectures and assembly language fundamentals. Use the assembler. Apply input/output services conditional processing, arithmetic and string operations.
116
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Introduction to assembly usage. Layout of assembly program. Assemble, link and run programs. Test the input services. Test the output services. Program control instructions and skills. Structure programming. Arithmetic skills & project assignment. Numeric concepts.
Week Number 10: String properties. Week Number 11: Create libraries. Week Number 12: Macro usage. Week Number 13: Disk manipulation. Week Number 14: Disk and file usage. Week Number 15: Project grading. Week Number 16: Final Exam.
117
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 418 Operating Systems


G R A D I N G
Operating Systems CC 418 Lecture 2 Hrs. CC 410. Tutorial / Lab 2 /2 Hrs. Credit 3.
10% 30% 20% 40%
Introduction to modern operating systems - the concepts, structure, design principles, implementation issues, and mechanisms of operating systems.
T E X T B O O K
William Stallings, Operating Systems: Internals and Design Principles, Prentice Hall, latest edition.
Harvey M. Deitel, An introduction to Operating Systems, Addison Wesley, latest edition.

C O U R S E A I M
Introduce concepts of managing modern computer resources which is handled by various OS techniques. It also aims at exposing the student to practical OS features and techniques.
Upon completion of this course the student will be able to: Discuss main OS concepts. Solve sample resource management problems list important OS algorithms Evaluate OS performance, and be exposed to the Linux OS
118
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Introduction and Computer System Overview. Computer System Overview (cont.). Operating System Overview. Process Description and Control. Threads. Concurrency: Software Approaches for Mutual Exclusion. 7th week exam. Concurrency: Other approaches for mutual exclusion (hardware support and OS support (semaphores)). Concurrency: Deadlock prevention, avoidance, and detection.
Week Number 10: Memory Management. Week Number 11: Virtual Memory: Hardware and Control Structures. Week Number 12: 12th week exam. Week Number 13: Virtual Memory: OS Software. Week Number 14: Uniprocessor Scheduling. Week Number 15: Disk Scheduling and Revision. Week Number 16: Final Exam.
119
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 421 Microprocessors Systems


G R A D I N G
Microprocessors Systems CC 421 Lecture 2 Hrs. CC 311. Tutorial / lab 2/2 Hrs. Credit 3.
10% 30% 20% 40%
Microprocessors and microcomputers. Microcomputer structure: microprocessor, memory, busses (synchronous and asynchronous) and I/O). 16/32-bit microprocessor architecture: Instruction cycle, microinstructions, micro-programming, instruction decoding, Reduced Instruction Set computer (RISC) architecture, Complex Instruction Set computer (CISC) architecture. Memory (RAM, ROM, memory mapping of I/O. 1/O (parallel and serial I/O interfaces, system clock, clock phases and bit rates). Interrupts (types, handling of interrupts). Software aids (text editors and assemblers, linkers and macro-assemblers).
T E X T B O O K
Muhammad Ali Mazidi, Janice Gillispie Mazidi 80x86 IBM PC and compatible computers, Fourth Edition, Prentice Hall, latest edition.
Games Korsh and Leonard Garrett, Data structure, algorithms, and Programming style using C, PWS-KENT, latest edition.
C O U R S E A I M
Identify The Microprocessors Category and study the internal structure and external connections of an example microprocessor (Intel 80386).
Upon completion of this course the student will be able to: Study the Intel 80386 microprocessor, its connected peripherals, and its assembly language format.
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Introduction to microprocessors Historical background. 80386 Microprocessor architecture. Real mode software model. Addressing modes. The instruction set & Machine Language coding. Protected mode Architecture Model. 7th week exam. Virtual memory Management. Memory Interface.
Week Number 10: DRAM. Week Number 11: Input/output interface. Week Number 12: 12th week exam. Week Number 13: Interrupts and exception processing. Week Number 14: The 486 and Pentium microprocessors family. Week Number 15: Revision. Week Number 16: Final Exam.
121
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 431 Computer Networks


G R A D I N G
Computer Networks CC 431 Lecture 2 Hrs. CC 331. Tutorial / lab 2/2 Hrs. Credit 3.
10% 30% 20% 40%
Introduction Computer Networks and the Internet Networking protocol layers OSI and TCP/IP- Application Layer Principles of net applications, web and HTTP, FTP, electronic mail, DNS and Peer to Peer applications. Transport layer, Multiplexing and demultiplexing, Connectionless Transport and UDP reliable data transfer and connection oriented transport TCP, congestion control. Network layer forwarding and routing, IP protocol, routing algorithms, Broadcast and Multicast routing. Data Link layer, introduction and services, error detection and correction techniques, Multiple access protocols and Link layer addressing, Ethernet and PPP.
T E X T B O O K
James Kurose, Keith Ross Computer Networking A top-down approach, Prentice Hall, latest edition.
Andrew S. Tannenbaum, Computer Networks, Prentice Hall, latest edition. David Etheridge and Errol Simon, Information Networks, Prentice Hall, latest edition. Timothy Ramtke, Networks, Prentice Hall, latest edition. F. Halsall, Data communication, computer networks and open systems, Addison-Wesley, latest edition.
A I M
C O U R S E
To provide unified view of the broad field of computer networks. To emphasize networking principles and topics of fundamental importance concerning the different networking layers , following a top down system approach.
122
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O B J E C T I V E S
Upon completion of this course the student will be able to develop network applications and see through the complexity of computer networks and will learn the distinct concepts and protocols in computer architecture.
Introduction. Computer Networks, Protocols, Architectures and Internet. Application Layer Principles and the web. HTTP, FTP, SMTP. DNS, peer to peer applications and socket programming. Transport layer services and UDP Midterm Exam. Reliable data transfer and TCP and congestion control. Network Layer and Inside the router.
Week Number 10: IP Internet Protocol. Week Number 11: Routing algorithms and broadcast and multicast routing. Week Number 12: 12th Week Exam. Week Number 13: Data Link Layer and error detection and correction. Week Number 14: Multiple Access Protocols, link addressing. Week Number 15: Ethernet, PPP and Revision. Week Number 16: Final Exam
123
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 442 Digital Design and Introduction to Microprocessor


G R A D I N G
Digital Design and Introduction to Microprocessor* CC 442 Lecture 2 Hrs. CC 112. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Number systems - binary arithmetic and codes - logic gates - Boolean algebra and logic simplifications - Design and realization of combinational circuits - Flip-Flops Design of sequential circuits - Analysis and realization of counters Computer aided engineering - Introduction to microprocessor.
T E X T B O O K
Thomas L. Floyd, Digital Fundamentals, Prentice Hall, latest edition.

M. Mano, Digital Design, Prentice Hall, latest edition. John Crisp, Introduction to Microprocessors and Microcontrollers, Newnes, latest edition. John F. Wakerly, Digital Design Principles and Practices, Prentice Hall, latest edition.
A I M
C O U R S E
To develop engineering skills in the design and analysis of digital logic circuits with applications to digital computer and microprocessors.

B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Knowing the basic differences between analog and digital systems. Use binary numbers and codes. Describe the operation of logic gates. Applying Boolean algebra and K-map to simplify function. Design combinational and sequential logic circuit.
O U T L I N E
C O U R S E
Introduction to digital concepts. Number system, operation, and codes. Logic gates. Boolean algebra and logic simplification part 1. Boolean algebra and logic simplification part 2. Function of combinational logic. 7th week exam. Decoders, Encoders, MUX, and DMUX part 1. Decoders, Encoders, MUX, and DMUX part 2.
Week Number 10: Flip-flops and related devices part 1. Week Number 11: Flip-flops and related devices part 2. Week Number 12: 12th Week Exam. Week Number 13: Shift register. Week Number 14: Introduction to microprocessor part 1. Week Number 15: Introduction to microprocessor part 2. Week Number 16: Final Exam.
125
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 511 Artificial Intelligence


G R A D I N G
Artificial Intelligence CC 511 Lecture 2 Hrs. CC 218 CC319. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
History and Goals Representation and search Knowledge based systems Logic (Propositional and Predicate) as a representation language Prolog as an example of an AI language.
T E X T B O O K
Stuart Russell and Peter Norvig, Artificial Intelligence: A modern Approach, Prentice-Hall, latest edition.
Elaine Rich, Kevin Knight, Artificial intelligence, McGrawHill Inc, latest edition. John Durkin, Expert systems, Mc-Graw Hill, latest edition.
A I M
C O U R S E
To explain the basic concepts of artificial intelligence. Discuss a wide variety of search techniques and explain the methods for encoding knowledge in computer systems.
Upon completion of this course the student will be able to: Implement a wide variety of intelligent applications using C, Prolog, and shells
O U T L I N E
C O U R S E
Week Number 1:
Introduction to AI : Definition - History Goals.

126
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
AI as Representation and Search. State Space. Search Strategy. Blind search techniques. Informed (Heuristic) search techniques : Hill Climbing Best First A*. Admissibility Monotonicity Informedness of a heuristic function. Game trees. 7th week exam. Expert systems & knowledge-based systems. Propositional Logic : Syntax Semantic Proof by resolution refutation.
Week Number 10: First Order Logic : Syntax Semantic. Week Number 11: First Order Logic : Resolution - Soundness Completeness. Week Number 12: 12th week exam. Week Number 13: Introduction to Prolog Basic Mechanisms : Matching Backtracking. Week Number 14: Prolog tree data structuring. Week Number 15: AI Applications. Week Number 16: Final Exam.
127
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 513 Computing Systems


G R A D I N G
Computing Systems CC 513 Lecture 2 Hrs. CC 418 CC 421. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
High performance computing, ILP, RISC architecture, Memory hierarchy, Pipelining, Vector processing, Array processing, Massively parallel processors, Multiprocessor architecture, Data flow computers, VLSI computing and Systolic arrays
T E X T B O O K
Sima, Fountain, Kacsuk "Advanced Computer Architecture (A Design Space Approach)", Addison Wesley, latest edition.
John P.Hayes, "Computer Architecture and Organization, McGraw Hill, latest edition. K. Hwang, "Advanced Computer Architecture", McGraw Hill, latest edition. A.John Anderson, "Multiple processing, A system overview", Prentice Hall, latest edition. Edward Ritman, "Exploring Parallel Processing", Windcrest, latest edition.
A I M
C O U R S E
To introduce concepts of high performance computing advanced computing architectures and multiprocessing requirements. The impact of VLSI on modern computing architectures is emphasized with applications on different architectures.
128
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Identify different architectures, have a solid background on parallel processing concepts and have enhanced design skills using FPGA.
Introduction to high performance computing. ILP. Memory and I/O Subsystems. Memory and Vector processing part 1. Memory and Vector processing part 2. Pipelining computers. 7th week exam. Array processors part 1. Array processors part 2.
Week Number 10: Multiprocessor architecture part 1. Week Number 11: Multiprocessor architecture part 2. Week Number 12: Multiprocessing control. Week Number 13: Dataflow computers part 1. Week Number 14: Dataflow computers part 2. Week Number 15: Systolic arrays. Week Number 16: Final Exam.
129
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 515 Introduction to Software Engineering


G R A D I N G
Introduction to Software Engineering CC 515 Lecture 2 Hrs. CC 319. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Introduction to software engineering disciplines with emphasis on software life cycle - project management verification - validation and testing of software.
T E X T B O O K
Ian Sommerville, Software Engineering, Addison Wesley, latest edition.

Roger Pressman, Software Engineer: A practitioner Approach, McGraw Hill, latest edition.
C O U R S E A I M
To expose students to the software life cycle and to understand how to analyze, design, implement and test large-scale software. To practice teamwork in developing software project and to introduce techniques and standard documents used in each stage of the software life cycle.
Upon completion of this course the student will be able to: The software life cycle model requirement and specifications Design models, structured and object oriented design, program development, programming development tools, configuration control Program testing and verification, maintenance, Reliability, CASE
130
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Introduction to Software Engineering. Introducing the notion of S/W process. The software process models. Project Management. Software Requirements (Part 1). Software Requirements (Part 2). UML. Project Presentation. Architectural Design.
Week Number 10: Object Oriented Design. Week Number 11: Rapid Application Development. Week Number 12: Critical Systems Development. Week Number 13: Topics in Software Engineering: Verification and Validation. Week Number 14: Topics in Software Engineering: Testing. Week Number 15: Project Presentation (Final). Week Number 16: Final Exam.
131
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 516 Pattern Recognition


G R A D I N G
Pattern Recognition CC 516 Lecture 2 Hrs. CC 511. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Smoothing operations - edge detection algorithms - the connected component methodology shape detection and morphological operations - statistical decision - other paradigms in pattern recognition include hierarchical and partitional clustering - feed-forward and feed-backward neural networks.
T E X T B O O K
Rafael C. Gonzalez, Richard E. Woods," Digital Image Processing", Prentice Hall, latest edition..
Earl Gose ,Richard Johnson ,Steve Jost ,"Pattern Recognition and Image Processing, Prentice Hall, latest edition.
C O U R S E A I M
Introduces a thorough grounding of the principles of image analysis and pattern recognition and seeks to develop students' knowledge on its techniques. It concentrates on the fundamental theory of image processing with emphasis on the areas of image enhancement, segmentation, and their applications. In addition, on finishing this course, students will be familiar with the most frequently used pattern recognition techniques, such as statistical classifiers, clustering and neural networks..
Upon completion of this course the student will be able to: Cover a balanced mixture of theory and practice including laboratory sessions and tutorials Use of the MATLAB image toolbox and will be able to apply it to real life problems
132
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Practical area includes blood cell classification and face recognition.

O U T L I N E
C O U R S E
Introduction. Point Operations. Smoothing Transformations. Edge detection. Scene Segmentation and Labelling. Shape detection. 7th week exam. Morphological Operations. Statistical Decision Making.
Week Number 10: Minimization of Classification Error. Week Number 11: Hierarchical Clustering. Week Number 12: 12th week exam. Week Number 13: Partitional Clustering. Week Number 14: Feed Forward Neural Networks. Week Number 15: HopField Networks. Week Number 16: Final Exam.
133
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 517 Modelling and Simulation


G R A D I N G
Modelling and Simulation CC 517 Lecture 2 Hrs. CC 112. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Review of Probability, random variables and distributions - random Processes - discrete and continuous markov Processes - queuing systems - stochastic petri nets - computer generation of random numbers - simulation of an M/M/1 queuing system.
T E X T B O O K
Averill M. Low & W. David Kelton, Simulation Modeling and Analysis, Mc Graw -Hill, latest edition.
Barry L. Nelson, Stochastic Modeling: Analysis and Simulation, Mc Graw - Hill, latest edition.
C O U R S E A I M
To understand the models as tools to make predictions about the behavior of systems. Acquiring the necessary conceptual and practical background for representing discrete and continuous random processes.
Upon completion of this course the student will be able to: To emphasize basic principles of the field of Modeling and Simulation Highlight the different stages in building a discrete event simulation model and the architecture of a simulation software
134
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Introduction. Review of probability, random variables and distributions The exponential and Poisson distributions. Generation of random numbers and distributions. Operational laws. Little law and its applications. Random processes, state transition diagrams. 7th week exam. Discrete and Continuous Markov processes, steady state solutions. Continuous Markov processes (continue).
Week Number 10: Queuing models performance measures. Week Number 11: Applications. Week Number 12: 12th week exam. Week Number 13: Modelling with stochastic Petri nets. Week Number 14: Modelling with stochastic Petri nets (continue). Week Number 15: Features of Simulation languages. Week Number 16: Final Exam.
135
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 518 Data Security


G R A D I N G
Data Security CC 518 Lecture 2 Hrs. CC 319. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Analyze the asymptotic performance of algorithms - demonstrate a familiarity with major algorithms and data structures - synthesize efficient algorithms in common engineering design situations.
T E X T B O O K
W. Stalling, "Cryptography and Network Security, Principles and Practices ", Prentice Hall, latest edition.
William Stallings, Cryptography and Network Security, Principles and Practices, Prentice Hall, latest edition.
C O U R S E A I M
To understand what computer security is? and why it is important?. To understand the security concept and security levels standard for trusted systems. To understand the (encryption) techniques to protect stored & transmitted data and it is important to understand some security history, and describes what these security standards are and how they are developed.
Upon completion of this course the student will be able to: Threats to computer systems Attacks methods Intrusion detection
136
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Identification and authentication Passwords and encryption techniques Security kernels Network security (key distribution) E-mail security firewall
O U T L I N E
C O U R S E
Goals of data & information security and Threats -Types of Attacks. Classical Encryption Techniques. Playfair Cipher and Hill Cipher. Polyalphabetic Cipher and Transposition techniques. Block Cipher & DES:-Simplified DES. Block cipher design principles and Block cipher modes of operation. 7th week exam. Advanced encryption standard: Evaluation criteria for AES. Electronic mail Security Threats.
Week Number 10: Message authentication Techniques. Week Number 11: Pretty good privacy(PGP) message generation. Week Number 12: 12th week exam. Week Number 13: Firewall design principles. Week Number 14: Trusted systems. Week Number 15: Security Aspects and Intruders. Week Number 16: Final Exam.
137
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 521 Micro-Computer Based Design


G R A D I N G
Micro-Computer Based Design CC 521 Lecture 2 Hrs. CC 415. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Comparing between microprocessors and micro-controllers. Programming of micro controllers embedded systems. Design a plan for micro based system, dealing with different hardware interface including ADC, DAC, and serial communication and control circuits.
T E X T B O O K
Chuck Hellebuyck, Programming PIC Microcontrollers with PICBASIC, Newnes, latest edition.
Mohamed Rafiquzzaman , Microprocessors and Microcomputer Based System design, CRC Pub., latest edition.
C O U R S E A I M
Teach student how to design a system of input and output devices and control it using a micro controller.
Upon completion of this course the student will be able to understand how to design and implement a micro based system
Introduction to Microcontrollers. Programming micro controllers using assembly language.

138
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Programming microcontrollers using C part 1. Programming microcontrollers using C part 2. Embedded system design consideration. Embedded system design steps. 7th week exam. Interfacing with keypad. Interfacing with 7-segment display.
Week Number 10: Interfacing with ADC and DAC. Week Number 11: Dealing with serial communication. Week Number 12: 12th Week Exam. Week Number 13: Design of final project. Week Number 14: Design tools II. Week Number 15: Presentation of project Week Number 16: Final Exam.
139
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 523 Computer Design and Performance Evaluation


G R A D I N G
Computer Design and Performance Evaluation CC 523 Lecture 2 Hrs. CC 311. Tutorial / lab 2 / 2 Hrs. Credit 3.
10% 30% 20% 40%
Comparison between the two major design methodologies based on ISA (Instruction Set Architecture) and ASA (Application Specific Architecture). The course covers the topics of queuing theory and Markov processes as a tool for computer system performance evaluation. Moreover, the students are introduced to operational analysis techniques regarding performance of computer systems.
T E X T B O O K
M.Mano, C.R.Kime, Logic and Computer Design Fundamentals, Prentice Hall, latest edition.
M. Mano, Computer System Architecture, Englewood Cliffs, NY: Prentice Hall, latest edition. Patterson, D.A., and Hennessy J. L., Computer Organization and Design: The Hardware/Software Interface, Morgan Kaufmann, latest edition.
A I M
C O U R S E
The course introduces the student to the principles of design, build and test of special-purpose processors. Moreover, the students are introduced to the concepts of evaluating the performance of such processors. It is intended for the final year BS. Students or first year graduates specializing in computer engineering
140
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O B J E C T I V E S
The course introduces the student to the principles of design, build and test of special-purpose processors. Moreover, the students are introduced to the concepts of evaluating the performance of such processors. It is intended for the final year BS. Students or first year graduates specializing in computer engineering.
Introduction to ISA-based Computer Design, Sequencing and Control. Hardwired and Micro-Programmed Control. Single-Cycle Hardwired Control and Multiple-Cycle Micro-Programmed Control. Pipelined Control and Performance Evaluation. Instruction Set Architecture and Addressing Evaluation. Central Processing Unit Design. 7th week exam. High Performance CPU Concepts. Design Parameters; Area, Time and Cost.
Week Number 10: Operational Analysis. Week Number 11: M/G/I Queuing model. Week Number 12: 12th Week Exam. Week Number 13: Discrete-Time Markov Chains. Week Number 14: Benchmark System Evaluation. Week Number 15: Revision Week Number 16: Final Exam.
141
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 524 Neural Networks


G R A D I N G
Neural Networks CC 524 Lecture 2 Hrs. CC 112 BA323. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Introduction to basic concepts of neural networks. The basic neuron. The multilayer perceptron. Artificial neural networks: applications, learning, and architecture. Competitive neural networks. Kohonen self-organizing networks. Adaptive reasoning theory (ART). Hopfield neural networks. Neural networks implementation. Neural networks applications. Introduction to MATLAB environment. Single perceptron, Multilayer perceptron, Competitive networks, Kohonen networks, ART networks, And Hopfield networks using MATLAB.
T E X T B O O K
Martin T. Hagan, Howard B. Demuth and Mark H. Beale, Neural Network Design, Martin Hagan, latest edition.
Simon Haykin, Neural Networks: A Comprehensive Foundation, Prentice Hall, latest edition. MATLAB neural networks toolbox, user guide, latest version.
A I M
C O U R S E
This course will provide students with detailed skills to use Artificial neural networks for solving many types of engineering problems such as mapping, clustering, and constrained optimization, in such areas as pattern recognition, signal processing, and control systems.
142
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O B J E C T I V E S
Upon completion of this course the student will be able to: Explain the basic concepts of neural networks. Discuss a wide variety of neural networks with architecture, training, algorithms, and applications. Demonstrate the architecture, training, and applications of a wide variety of neural networks using MATLAB simulation package.
O U T L I N E
C O U R S E
Introduction to basic concepts of neural networks. The basic neuron. The multilayer perceptron. Artificial neural networks: applications, learning rules, and architecture. Competitive neural networks. Kohonen self-organizing networks. Adaptive reasoning theory (ART) part 1. Adaptive reasoning theory (ART) part 2. Hopfield neural networks.
Week Number 10: Neural networks implementation. Week Number 11: Neural networks applications part 1. Week Number 12: Neural networks applications part 2. Week Number 13: Neural networks applications part 3. Week Number 14: Neural networks applications part 4. Week Number 15: Neural networks applications part 5. Week Number 16: Final Exam.
143
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 525 Intelligent Robotics


G R A D I N G
Intelligent Robotics CC 525 Lecture 2 Hrs. CC 319 EE 418. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Introduction, History, Applications, Object rotation, General transformations, Forward Kinematics, Inverse kinematics, Machine intelligence, trajectory generation, Control, Applications and practical Considerations.
T E X T B O O K
Phillip j. McKerrow, Introduction to Robotics, Addison Wesley, latest edition.

J. J. Craig, Introduction to Robotics Mechanics and Control, Prentice Hall, latest edition. Mark Song, Robot Modeling and Control, John Wiley, latest edition.
A I M
C O U R S E
To teach students the principles and techniques of designing intelligent robotic systems.
Upon completion of this course the student will be able to: Understanding the basic principles of robot manipulator systems Study the kinematics, Static, and Dynamics of a robotic system Study the problem of trajectory planning Understanding the different types of sensors and their use in the different robotic applications Explaining robot arm and motion control
144
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Design and implementation of an intelligent robot

O U T L I N E
C O U R S E
Introduction. Object location. General transformation. Kinematics: Homogenous Transformation. Kinematics: Forward / Inverse kinematics. Introduction to AI. 7th week Exam. Robot Sensors. Image Processing.
Week Number 10: Pattern recognition and computer vision. Week Number 11: Autonomous Mobile Robots. Week Number 12: 12th week Exam. Week Number 13: Trajectory planning for Robot. Week Number 14: Robot Control. Week Number 15: Revision. Week Number 16: Application.
145
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 527 Computer Aided Design


G R A D I N G
Computer Aided Design CC 527 Lecture 2 Hrs. CC 311 or CC312. Tutorial / lab 2/2 Hrs. Credit 3.
10% 30% 20% 40%
To introduce fundamental algorithms and techniques for computer aided integrated circuit design. It covers aspects of design flow, physical design, logic optimization, timing analysis and verification, synthesis for testability.
T E X T B O O K
Neil H. E. Weste and Kamran Eshraghian, Principles of CMOS VLSI Design, a Systems Perspective, Addison Wesley, latest edition.
Steven M. Rubin, Computer Aids for VLSI Design, Addison Wesley, latest edition. D. Pucknell and K. Eshraghian, Basic VLSI Design, Systems and Circuits, Prentice Hall, latest edition.
A I M
C O U R S E
To learn new design technologies, large-scale designs using VLSI technology and modern computer techniques used in Digital circuit designs & implementation.
Upon completion of this course the student will be able to produce highly qualified and skilled engineers who can cope with state of the art technologies in digital circuit design & implementation
146
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Introduction to CMOS Circuits. Circuit & system Representation. Circuit Characterization. Circuit performance estimation. Interconnect and Wiring. Combinational Circuit Design. 7th week Exam. Sequential Circuit Design. Design methodology and Tools.
Week Number 10: Datapath subsystems part 1. Week Number 11: Datapath subsystems part 2. Week Number 12: 12th week Exam. Week Number 13: Design tools I. Week Number 14: Design tools II. Week Number 15: Revision. Week Number 16: Final exam.
147
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 528 Computer Systems Performance Analysis


G R A D I N G
Computer Systems Performance Analysis CC 528 Lecture 2 Hrs. CC 112 CC 531. Tutorial / lab 2/2 Hrs. Credit 3.
10% 30% 20% 40%
The purpose of this course is to introduce the student to the principles and techniques of performance measurement in the analysis of computer systems. Such techniques are used to detect bottlenecks, measure the efficiency of computer systems and applications.
T E X T B O O K
Raj Jain, The Art of Computer Systems Performance Analysis, John Wiley and Sons, Inc, latest edition.
C O U R S E A I M
The student will be introduced to performance measurement techniques, basic principles of queuing theory, experimental design, among others. The student will be expected to do individual assignments. Assignments are to be done individually. The course will consist of both lectures and class discussions.
Upon completion of this course the student will be able to: produce highly qualified and skilled engineers who can cope with state of the art technologies in performance analysis and design
Week Number 1: Week Number 2: Week Number 3:
Introduction to Performance Analysis. Approaches to Performance Analysis. Workloads.

148
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Week Number 4: Week Number 5: Week Number 6: Week Number 7: Week Number 8: Week Number 9:
Simulation Experimental Design: k Factors with 2 levels. Experimental Design: k Factors, 2 levels with Replication. 7th week Exam Experimental Design: 2 Factors with multiple levels.. Experimental Design: 1 Factor Designs.
Week Number 10: Experimental Design: Fractional Factorial Designs. Week Number 11: Operational Analysis. . Week Number 12: 12th week Exam. Week Number 13: More Operational Analysis. Week Number 14: Introduction to Queuing Theory. Week Number 15: Revision. Week Number 16: Final exam.
149
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 529 Distributed and Parallel Systems


G R A D I N G
Distributed and Parallel Systems CC 529 Lecture 2 Hrs. CC 431. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
This course studies the fundamental aspects of distributed systems and applications. Early foundations and recent developments in distributed systems will be investigated. Both client-server and peer-to-peer application designs will be discussed. Other topics include sockets, reliability, replication, group membership protocols, clock synchronization, and logical timestamps.
T E X T B O O K
Andrew S. Tanenbaum and Maarten van Steen, Distributed Systems: Principles and Paradigms, Prentice Hall, latest edition.
C O U R S E A I M
This course studies the fundamental aspects of distributed systems and applications. Early foundations and recent developments in distributed systems will be investigated. Both client-server and peer-to-peer application designs will be discussed. Other topics include sockets, reliability, replication, group membership protocols, clock synchronization, and logical timestamps.
Upon completion of this course the student will be able to produce highly qualified and skilled engineers who can cope with state of the art technologies in distributed systems
Introduction to distributed architectures. Communication among systems.
150
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Naming. Synchronization (1) Synchronization (2) Consistency Replication. 7th week exam. Fault tolerance (1)
Week Number 10: Fault tolerance (2). Week Number 11: distributed systems: object based, file Week Number 12: 12th week Exam. Week Number 13: Distributed systems: file, web-based, coordination-based Week Number 14: Distributed systems: coordination-based. Week Number 15: Distributed and parallel systems Week Number 16: Final exam.
151
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 531 Advanced Networks


G R A D I N G
Advanced Networks CC 531 Lecture 2 Hrs. CC 431. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
The course emphasizes topics of fundamental importance concerning the technology and architecture of networks. It highlights various networks protocols and standards and discusses wireless, mobile and adhoc networks, internetworking and interoperability. Students measure networks performance and study their realizations using the available networking facilities.
T E X T B O O K
Lecture Notes and hand outs.

Kurose and Ross, "Computer Networking a Top-Down approach", Prentice Hall, latest edition. Yi-lin Bing, Imrich Chlamtac " Wireless and Mobile Network Architectures", Wiely, latest edition. William Stallings, Local and Metropolitan Area Networks, Prentice Hall, latest edition.
C O U R S E A I M
To emphasize topics of fundamental importance concerning the technology and architecture of networks. To highlight various network protocols & standards. To discuss LANs, wireless LAN and mobile internetworking & interoperability. To make students able to measure network performance. To expose students to actual network realizations, using the available networking facilities.
152
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O B J E C T I V E S
Upon completion of this course the student will be able to analyse mobile and wireless networks and Multimedia networking. Student will learn about network management and
Introduction to wireless and Mobile networks. Wifi 802.11 Wireless LAN. Beyond 802.11: Bluetooth, WiMAX and Cellular Internet Access. Mobility management and Mobile IP. Multimedia Networking applications. Streaming stored audio and video. 7th week exam. Protocols for Real-Time Interactive applications Mobile adhoc networks MANET.
Week Number 10: Simulation and modelling of wireless Mobile and adhoc networks. Week Number 11: Security in Computer networks. Week Number 12: 12th Week Exam. Week Number 13: Networks management. Week Number 14: Network administration. Week Number 15: Revision. Week Number 16: Final Exam.
153
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 533 Internetwork Programming


G R A D I N G
Internetwork Programming CC 533 Lecture 2 Hrs. CC 431. Tutorial/ Lab 2/2 Hrs. Credit 3.
10% 30% 20% 40%
The course is about the exploration of internet implementation as a network of embedded computing systems. Internetworking skills for design and implementation of hardware and embedded software internet products..
T E X T B O O K
Forouzan, TCP/IP Protocol Suite, McGraw-Hill Publishing, latest edition.

Stevens, TCP/IP Illustrated Volume 1, Addison Wesley, latest edition. Stevens and Fenner, UNIX Network Programming Networking APIs: Sockets and XTI, Volume1, Addison Wesley, latest edition.
A I M
C O U R S E
To emphasize topics of fundamental importance concerning the technology and architecture of network applications. To highlight various protocols & standards. To make students able to create network applications.
O B J E C T I V E S
C O U R S E
Upon completion of this course the student will be able to design and implement hardware and embedded software internet product.
154
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Introduction TCP/IP Protocol Architecture Sockets programming Client/Servers programming paradigm TCP UDP Socket programming Internet Addressing and Subnets 7th week exam Classless Interdomain Routing Routing tables and Routers Architecture
Week Number 10: Routers Architectures and Routing protocols Week Number 11: Network Protocol Analyzers Week Number 12: 12th week exam Week Number 13: Traffic Generation Hardware Week Number 14: Linux Kernel Network Implementation Week Number 15: Kernel Hacking Week Number 16: Final Exam
155
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 535 Internetwork Security


G R A D I N G
Internetwork Security CC 535 Lecture 2 Hrs. CC431 Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Hacking and the Law, Network Mapping, Vulnerability Assessment, Network Mapping tools,Vulnerability Scanners, Sniffing, Defenses, Denial of Service Techniques using address spoofing, Man-in-the-middle, Defenses, Stack-Based Buffer Overflow Attacks and Password Attacks and Cracker tools, Web Attacks, RootKits, Trojans and Backdoors, Intrusion Detection tools, Writing new intrusion detection signatures, HoneyNets, Forensics
T E X T B O O K
McClure, Scambray, and Kurtz, Hacking Exposed, McGraw-Hill, latest edition.

S.Bellovin and W.Chesvick, Internet Security and Firewalls, Addison-Wesley, latest edition.
C O U R S E A I M
Hands on experimentation and evaluation of Internet Security theory, principles, and practices. Laboratory component involves implementing both defensive and offensive security techniques..
Upon completion of this course the student will be able to perform ethical hacking and access the security of networks and computer systems.
Week Number 1:
Legal and Moral Responsibilities.

156
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Network Reconnaissance Techniques. IP Address Spoofing. Gaining Access. Maintaining Access. Intrusion Detection. 7th week exam. Firewalls. Wireless Networks Security.
Week Number 10: Worms and Viruses. Week Number 11: Virtual Private networks. Week Number 12: 12th week exam. Week Number 13: Web Servers Security. Week Number 14: Ethical Hacking. Week Number 15: Overall Computer and Network Security Assessment. Week Number 16: Final Exam.
157
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 537 Computer Forensics


G R A D I N G
Computer Forensics CC 537 Lecture 2 Hrs. Senior Standing Tutorial/Lab 2/2 Hrs. Credit 3.
10% 30% 20% 40%
Conducting a computer forensics investigation- Examining the layout of a network- Finding hidden data- Capturing images- Identifying, collecting, and preserving computer evidence- Understanding encryption and examining encrypted files- Documenting the case- Evaluating common computer forensic tools- Presenting and analysing computer evidence.
T E X T B O O K
Linda volonino, Reynaldo anzalduwa Computer Forensics: principles and practices, Prentice Hall, Latest edition
Aaron Philipp, David Cowen, and Chris Davis, Hacking Exposed Computer Forensics: Computer Forensics Secrets and Solutions, McGraw-Hill Osborne Media, latest edition. Michael Solomon, Neil Broom, Diane Barrett, Computer Forensics JumpStart, Wiley, latest edition.
A I M
C O U R S E
It offers a complete overview of the basic skills and available certifications in computer forensics.
The course introduces a selection of topics in computer forensics. The student will be able to: Document electronic evidence Analyze searched for and bookmarked data
158
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Mind and find the Loopholes in a computer system Analyze signatures and hashes
O U T L I N E
C O U R S E
Computer Forensics: an overview. Computer Hardware overview. File Systems. Conducting a computer forensics investigation. Acquiring Digital Evidence. File Signatures analysis and hash analysis. 7th week exam. Windows operating system artifacts Creating paperless reports.
Week Number 10: Computer Forensic Investigations - Document Forensics. Week Number 11: Computer Forensic Investigations - Mobile Forensics part 1. Week Number 12: 12th week exam. Week Number 13: Computer Forensic Investigations - Mobile Forensics part 2 Week Number 14: Computer Forensic Investigations - Network Forensics. Week Number 15: Computer Forensic Investigations - Investigating X-Files. Week Number 16: Final Exam.
159
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 539 Selected in Topics in Networks


G R A D I N G
Selected in Topics in Networks CC 539 Lecture 2 Hrs. CC531 Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Advanced topics in networking. Topics may include, but are not limited to: Internet analysis, routing techniques - Wireless Networking -Mobile Networks Sensor Networks Content-Based Networking Autonomic Networks - Network Optimization.
T E X T B O O K
No specific textbook, lecture notes and exerts from literature will be handed out to students.
Collection of papers from IEEE ACM Journals.

C O U R S E A I M
This course presents selected topics in networks aiming to introduce the student to the latest state of the art networking issues.
This course presents selected topics in networks

Overview TCP/IP, IPv6 and Internet. Wireless Networking Setup, Security and Hotspotting
160
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Wireless and Mobile networks. MANET analysis and routing. Network Optimization 7th Week Exam Multimedia networking. Networking in Cloud Computing
Week Number 10: Sensor Networks- Network Architecture Week Number 11: Sensor Networks-Topology Control Week Number 12: 12th Week Exam Week Number 13: Data-Centric Networking Week Number 14: Content-Based Networking Week Number 15: Quality of Service Week Number 16: Final Exam
161
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 540 Computer Systems Engineering


G R A D I N G
Computer Systems Engineering CC 540 Lecture 2 Hrs. Senior Standing Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
The course objective is to integrate key topics from algorithms, computer architecture, operating systems, compilers, and software engineering, in one unified framework. This will be done constructively, by building a general-purpose computer system from the ground up. In the process, many ideas and techniques used in the design of modern hardware and software systems are explored, and major trade-offs and future trends are discussed. Throughout the course, the student gains many cross-section views of the computing field, from the bare bone details of switching circuits to the high level abstraction of object-based software design.
T E X T B O O K
Nisan and Schocken, The Elements of Computing Systems, MIT Press, latest edition.
Selected Papers from Journals and Transactions.

C O U R S E A I M
This is mostly a hands-on course, which evolves around implementing a series of hardware and software modules to integrate key topics from algorithms, computer architecture, operating systems, compilers, and software engineering, in one unified framework.
This is mostly a hands-on course, which evolves around implementing a series of hardware and software modules. Each module development task will be accompanied by a design document and an executable solution (illustrating what the module is supposed to do), a detailed implementation document (proposing how to build it), and a test script (specifying how to test it).
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Course Overview and demonstration of some games Boolean arithmetic Sequential Logic Machine Language Computer Architecture Assembler 7th week exam Virtual machine I Virtual machine II
Week Number 10: High Level Language Week Number 11: Compiler I Week Number 12: 12th week Week Number 13: Compiler II Week Number 14: Operating System I Week Number 15: Operating System II Week Number 16: Final Exam
163
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
CC 550 Selected Topics in Computing


G R A D I N G
Selected Topics in Computing CC 550 Lecture 2 Hrs. CC311 CC316 Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Fundamental concepts and issues related to the design and analysis of advanced computing which includes multithreaded, parallel, and distributed computing. This course introduces a discussion of programming techniques, applications, implementations, and performance issues. In addition, selected topics from the following list will also be covered: load balancing, task scheduling, faulttolerance, coordination & agreement, distributed objects & remote invocation, and distributed transactions & concurrency control. It also gives an introduction to real-time systems, reconfigurable computing, and some advanced topics.
T E X T B O O K
M. Ben-Ari, Principles of Concurrent and Distributed Programming: Algorithms And Models, prentice-hall, latest edition. Scott hauck, Andr Dehon, Reconfigurable Computing: The Theory And Practice of FPGA-Based Computation, Morgan Kaufmann, latest edition.
B O O K S
R E F E R E N C E
Christophe Bobda, Introduction to Reconfigurable Computing Architectures, Algorithms, and Applications, Springer Verlag, latest edition. Gregory Andrews, Foundations of Multithreaded, Parallel, and Distributed Programming, Addison-Wesley, latest edition.
A I M
C O U R S E
To present fundamental algorithms and impossibility results from the concurrent programming literature, and to cover techniques for formally specifying and verifying concurrent systems. Some
164
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
advanced computing systems will be covered such as embedded systems, reconfigurable computing and real-time systems.
The course introduces a selection of advanced topics in computer systems architecture and systems software and their relationships. It deals with design issues, implementation techniques, and structure and use of tools to support the implementation of computer systems and complex systems software.
Concurrent Programming concepts: an overview. Techniques for parallelizing programs. Synchronization algorithms for shared-memory systems. Distributed Programming: an overview. Fault-Tolerance in Distributed Systems. Parallel Programming: Languages, Libraries, and Tools. 7th week exam. System Design for maintainability and power efficiency Embedded Systems.
Week Number 10: Cloud Computing. Week Number 11: Polymorphic processors. Week Number 12: 12th week exam. Week Number 13: Real-time Systems Week Number 14: Reconfigurable computing. Week Number 15: High performance Computing. Week Number 16: Final Exam.
165
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Electronics and Communications Courses EC

EC 218 - Measurements & Instrumentation

G R A D I N G
Measurements & Instrumentation EC 218 Lecture 2 Hrs. EE 231 Tutorial/Lab 2/2 Hrs. Credit 3.
10% 30% 20% 40%
Measurements of errors, Accuracy, Precision, Resolution, Sensitivity. Statistical analysis (Mean, Deviation, Standard Deviation, and Variance). Units and standards of measurement. Electromechanical indicating instruments. Analog Instruments (DC Ammeter (Ayrton Shunt), DC Voltmeter, Ohmmeter (Series type, Shunt Type), AC- Instruments with Rectifiers (full wave and half wave rectifiers), Bridge measurements ( AC Bridges(Maxwell bridge, wien bridge, Schering bridge), DC Bridges(Wheatstone bridge)), Digital instruments for measuring basic parameters, True RMS voltmeters, Q-meter, Oscilloscope techniques.
T E X T B O O K S
Modern electronic instrumentation and measurements techniques Albert Helfrick and William
Cooper
Larry Jones and A. Foster Chin, Electronic measurements and instruments J.B.GUPTA, Electronic and Electrical Measurements and Instrumentation
A I M
C O U R S E
An Introduction to the basic concepts and techniques of measuring physical electrical and electronic quantities. To train students for the effective usage of the basic Lab instruments.
166
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O B J E C T I V E S
Understanding the basic measurement techniques such as accuracy, precision, standards. To study the operation and construction of analog, electronic and digital multi-meters.
Definitions, The importance of electronic measurements for engineers, Types of errors Statistical analysis Review on the fundamental and derived units, Classification of standards, Electrical standards, IEEE standards Permanent magnet moving coil DC voltmeters, sensitivity, Use the sensitivity method for the design of DC voltmeter, Analyze a circuit taken into consideration in loading effect Series type and shunt type ohmmeters, Calibration of DC instruments 7th week exam Alternating current indicating instruments, AC voltmeters with full wave rectifiers and half Wave rectifiers. DC bridges and sources of error, AC bridges
Week Number 10: AC voltmeters using rectifiers Week Number 11: True RMS Responding Voltmeter Week Number 12: Component measuring instruments, Basic Q-meter circuits: a- Direct connection b- Series connection c- Parallel connection Sources of error Week Number 13: Oscilloscope measurements (phase shift, period and voltages) Week Number 14: Oscilloscope block diagram Week Number 15: Oscilloscope techniques, Special oscilloscopes, (a) storage oscilloscope, (b) sampling oscilloscope (c) Digital storage oscilloscope Week Number 16: Final exam
167
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
EC 238 - Electronics (1)


G R A D I N G
Electronics (1) EC238 Lecture 2 Hrs. EE231 Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Semiconductors - p-n junction - diode current components - junction capacitance - junction diode as a circuit element - special p-n junctions - bipolar junction transistor and field effect transistor: structure, operation I-V characteristics - large and small analysis.
T E X T B O O K S
Boylestad, Nashelsky, Electronic Devices and Circuit Theory, 1991.

B.Streetman & S.Banerjee,Solid State Electronic Devices, Prentice Hall 2000.

C O U R S E A I M
Introducing different electronic devices used in constructing modern electronic circuits: diodes bipolar junction transistor and field effect transistor. Studying their performance with special emphasis on some practical applications.
Studying semiconductor materials, p-n junction diodes, diode as a circuit element, special diodes, Bipolar Junction Transistor (BJT) and Field Effect Transistor (FET).
Week Number 1:
Types of solids: conductor, insulator, semiconductor.
168
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Conduction and valence bands, energy gap, covalent bond Semiconductor types Doping of semiconductors. Mobility and conductivity in semiconductors (intrinsic and extrinsic) Hole and electron concentration - Drift current. Diffusion and drift currents Built-in voltage in a p-n junction Depletion layer in a p-n junction. p-n junction diode - Forward and reverse bias - Diode as a circuit element. Half wave and full wave rectifier - Smoothing circuits - Clipping circuits Clamping circuits. Special diodes: Zener diodes - Light emitting diodes (LEDs) Photodiodes Varactor diodes - Solar cells. Bipolar Junction Transistor (BJT): construction types symbol - energy band diagram operation - dc equivalent circuit. BJT: dc solution and biasing circuits - bias stability.
Week Number 10: BJT: I-V Characteristics of BJT - Load line - Operating point h-parameters. Week Number 11: BJT: Small signal analysis ac equivalent circuit Transistor amplifier - Voltage and current gains. Week Number 12: Field Effect Transistor (FET): (1) Junction FET (JFET): construction symbol operation I-V characteristics - JFET biasing circuits. Week Number 13: Metal oxide semiconductor FET: MOSFET: construction symbol operation. Week Number 14: I-V Characteristics of MOSFET, Enhancement and depletion modes, EMOSFET: construction, operation and I-V characteristics - ac solution of all FET types. Week Number 15: Complementary MOSFET (CMOS): symbol - operation - Logic gates using CMOS. Week Number 16: Final exam.
169
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
EC 320 - Communication Theory


G R A D I N G
Communication theory EC 320 Lecture 2 Hrs. BA 224, EE 231 Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
Introduction to communication theory. Review of Fourier series, and Fourier transform as a mathematical tool for spectral analysis. Concept of power and energy spectral densities and correlation between waveforms. Transmission through linear filters and channels. Hilbert transform and Amplitude Modulation techniques.
T E X T B O O K S :
Charles L. Philips, John Parr and Eve Riskin "Signals, Systems and Transforms 4th Ed. 2008, Prentice Hall
R E F E R E N C E B O O K S :
Alan V. Oppenheim Signals and systems Prentice Hall

C O U R S E A I M
The course introduces the concept of line spectrum as well as the continuous spectrum using FT to introduce the mathematical background and a brief introduction to communication systems to be continued in the following communication course as follows:
Classification of signals and their spectrum. Fourier Transform and its properties in time and frequency domains. Linear Systems. Introduction to communication systems and Amplitude Modulation and Demodulation.
170
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Classification of Signals - sum of periodic signals Orthogonality - Fourier Analysis of Periodic Signals Fourier Transform and Properties of F.T. Properties of F.T. (cont.) F.T. of Special Functions Fourier Transform of periodic signals - Digital & analog signals Discrete Fourier transform - Sampling Theory Auto-correlation & cross-correlation of power and energy signals - Spectral densities of power and energy signals Hilbert transform
Week Number 10: Response of low-pass and band-pass filters Week Number 11: Double side band transmitted carrier amplitude modulation and demodulation Week Number 12: DSB Surprised carrier amplitude modulation and demodulation Week Number 13: Single side band amplitude modulation Week Number 14: Single side band amplitude demodulation Week Number 15: Vestigial side band amplitude modulation and demodulation Week Number 16: Final exam
171
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
EC 339 - Electronics (2)


G R A D I N G
Electronics (2) EC 339 Lecture 2 Hrs. EC 238 Tutorial/Lab 2/2 Hrs. Credit 3.
C O U R S E D E S C R I P T I O N :
10% 30% 20% 40%
Electronic amplifier theory, power amplifiers, Differential amplifiers, Operational amplifiers filters and Oscillators.
T E X T B O O K S
C.J.Savant, M.S.Rooden, G.L.Carpenter, Electronic Design, Addison Wesley Martin Rodan and Gordon Carpenter, " Electronic Design: from concept to reality"
B O O K S
R E F E R E N C E
Sedra & Smith, Microelectronic Circuits, 5th edition, 2004. Boylestad, Nashelsky, Electronic Devices&circuit theory, Prentice Hall, 2005
A I M
C O U R S E
The student should be able to analyze and design BJT and FET amplifiers, Power amplifiers, operational amplifiers, filters and oscillators.
Familiarize students with: Analysis and design of BJT Analysis of FET amplifiers Frequency response of BJT and FET. Power Amplifiers Analysis and design of integrated circuits
172
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Filters and Oscillators

O U T L I N E
C O U R S E
Revision, Transistor theory, Amplifier circuits, course overview Mid frequency-band equivalent circuit of transistor amplifiers. Voltage gain, current gain, input and output impedance. Low and High frequency response of transistor amplifiers. Design of transistor amplifiers. Multistage amplifiers, overall gain, frequency response, gain-bandwidth product. Field Effect transistor amplifiers, DC and mid-band frequency solution. Power amplifiers, classes of operation. Efficiency, push-pull power amplifiers. Feedback amplifiers. Sinusoidal oscillators. Square wave oscillators.
Week Number 10: Operational amplifiers, specifications. Analysis of basic Op-Amp circuits (Inverting and non-Inverting amplifiers), applications. Week Number 11: Op-Amp applications. Week Number 12: RC active filters. Week Number 13: Power supplies, switching mode power supply. Week Number 14: Introduction to IC fabrication. Week Number 15: Revision Week Number 16: Final exam
173
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Electrical Engineering Courses EE


G R A D I N G
Electrical circuits (1) EE 231 Lecture 2 Hrs. BA 124 Tutorial/Lab 2/2 Hrs. Credit 3.
10% 30% 20% 40%
Basic d-c circuit elements , series and parallel network .Ohms law and 1st & 2nd kirchoffs laws .Nodal analysis .Mesh analysis . Basic network theorems source transformation , super position , Thevenins theorem and Nortons theorem . max. power transfer . Alternating current fundamentals and a-c generation . R.M.S value and average value, form factor and crisp factor. Phasor concept. Relation between current and voltage in resistors , capacitors and inductor, Response of R-L and R-C circuits . Sinusoidal response of series R.L.C circuit. Series resonance.
T E X T B O O K
J. Nilson & S.Riedel, Electrical circuits, Prentice Hall, 2001, latest edition
R. L. Boylestad, Introductory circuit analysis, Merrill, London, 1994. W.J. Hayt and J.E. Kemmerly, Engineering circuit Analysis, Mc Gram Hill International Edition, 1986.
O B J E C T I V E S
C O U R S E
To provide the students with the basic tools to analysis and solve for the currents and voltages in each branch of d-c circuits and to introduce the concepts of a-c circuits such as phasor, wave, and response.
174
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Basic dc circuit elements, series and parallel Networks Ohm's law and Kirchoff's laws Nodal Analysis Mesh Analysis Electric circuit theorems "source transformation" Superposition Thevenin's Theorem and Norton Theorem Maximum power transfer Alternating current Fundamentals and AC generation
Week Number 10: RMS value, average value, form factor and crisp factor Week Number 11: Phasor concept Week Number 12: Relation between voltage and current in resistor, capacitor and inductor Week Number 13: Response of RL and RC circuits Week Number 14: Sinusoidal response of RLC circuit Week Number 15: Series Resonance Week Number 16: Final exam
175
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9


G R A D I N G
Electrical circuits (2) EE 232 Lecture 2 Hrs. EE231 Tutorial/Lab 2 Hrs. Credit 3.
10% 30% 20% 40%
AC series circuit and series response revision, parallel circuit and to Y-simplification. Source transformation, superposition the node voltage method and the mesh current method. Thevenin theorem. Complex power and maximum power calculations. Three phase voltage sources. Analysis of the balanced wye wye circuit. Analysis of the wye delta & delta wye circuit and delta delta circuit. Complex power calculation in three phase. Unbalanced and four wire three phase loads. Unbalanced Y loads with neutral (wire disconnected) or having Zo. Inductances and capacitors, series-parallel combinations. The natural response for R-L circuit. The natural response of R-C circuit. General solution of step response of R-L and R-C circuit. Sequential switching.
T E X T B O O K
J. Nilson & S.Riedel, Electrical circuits, Prentice Hall, latest edition

Richard C. Dorf, Introduction to Electric Circuits, Pearson Education, 2008

Enhancement of skills related to AC circuit analysis, three phase circuit balanced and unbalanced load and the natural response of R-L and R-C circuits.
A.C. series circuit and series resonance revision - transformation. Source transformation and Node Voltage method.
176
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
The mesh current method thevenin theorem. Complex power & Maximum Power Calculation Three Phase Systems Balanced Y- Y Circuit - , - , - 3 Phase Systems Power Calculation in 3 Phase System Unbalanced Connected 3 Phase System
Week Number 10: 3 Phase unbalanced System Week Number 11: Inductor and Capacitor Week Number 12: Natural Response of R-L Circuit Week Number 13: Natural Response of R-C Circuit Week Number 14: Step Response of R-L & R-c Circuits Week Number 15: Sequential Switching Week Number 16: Final exam
177
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
EE 418 Automatic Control Systems


G R A D I N G
Automatic control systems EE 418 Lecture 2 Hrs. EE218 OR EE 328 Tutorial/Lab 2/2 Hrs. Credit 3.
10% 30% 20% 40%
Introduction to open loop and closed loop control system. Control system classification. Block diagram. System transfer function and signal flow graph. Standard input signal. Time domain specifications. Modeling of some physical systems. Time response of first and second order systems. Importance of feedback, sensitivity to parameter variations. System stability and effect of disturbance. Error analysis and error constants. Root locus techniques. Frequency domain analysis (Nyquist- Bode) Analog controllers. Controller tuning.
T E X T B O O K
Benjamin C.Kuo, Automaic Control Systems, Prentice Hall, Inc, latest edition.
Y. El Gamal A.Amer, Introduction to Control Engineering, AAST 1988 Nagrath 80 Gapal, Control System Engineering, John Wiely & Son, NY 1982 K.O.Gatw, Modern Control Engineering, Prentice Hall New Delhi, 1984
O B J E C T I V E S
C O U R S E
Stability concept and time domain analysis using time and frequency response Modelling and analysis of simple physical system are investigated To study controller units, their type analysis and tuning
178
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Introduction to control system. Differential equation of physical systems. Block diagram models using MATLAB. Signal flow graph models using MATLAB. Test input signals. Performance of 1st and 2nd order system. 7th week + Effect of 3rd pole and a zero on the 2nd order system. Stability concept Routh- Hurwitz stability criterion. Root locus techniques.
Week Number 10: Bode plots. Week Number 11: Nyquist plots. Week Number 12: 12th week + Approaches to system design, advantage of feedback. Week Number 13: Approaches to system design, advantage of feedback. Week Number 14: Analog controllers. Week Number 15: Analog controllers (2). Week Number 16: Final Exam.
179
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Language, Humanities, & Social Science Courses LH

LH 131 ESP (1)

G R A D I N G
ESP 1. LH131. Lecture 3 Hr. none Credit 2.
T E X T B O O K S
10% 30% 20% 40%
Bockner, K. and Brown, P. Charles. Oxford English for Computing; Oxford: Oxford University Press, 1996. Oshima, Alice. Writing Academic English, New York: Addison-Wesley Publishing Company, 1991.
B O O K S
R E F E R E N C E

C O U R S E A I M
This course aims at enhancing learners four language skills, improving their general and technical lexical repertoire and preparing them to communicate their ideas effectively. The course is also designed to train learners to follow the principles and stages of the writing process and write academic paragraphs.
By the end of this course, learners will be able to: Use listening and reading strategies appropriately. Communicate about a variety of technical topics orally. Use basic computer terms and relevant general vocabulary meaningfully and accurately. Apply word-formation rules of prefixation and suffixation. Use some relevant grammatical structures.
180
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Apply the stages of the writing process effectively. Write well-structured, unified and coherent paragraphs.
O U T L I N E
C O U R S E
Orientation + Unit 1 (Personal Computing) Unit 1 (Personal Computing) + Unit 2 (Portable Computers). Unit 2 (Portable Computers) The process of academic writing An overview of paragraph writing Suffixes+ Unit 4 (Programming and Languages) Unit 4 (Programming and Languages) + Progress test l Unity and Coherence Coherence+ Writing workshop
Week Number 10: Unit 5 (Computer Software) Week Number 11: Unit 6 (Computer Networks) Week Number 12: Unit 7 (Computer Viruses) + Progress test ll Week Number 13: Unit 7 (Computer Viruses) Week Number 14: Unit 8 (Computers in the Office) Week Number 15: Unit 8 (Computers in the Week Number 16: Final Exam.
181
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
LH 132 ESP (2)


G R A D I N G
ESP 2. LH132. Lecture 3 Hrs. ESP 1 (LH131) Credit 2.
T E X T B O O K S
10% 30% 20% 40%
Bockner, K. and Brown, P. Charles. Oxford English for Computing; Oxford: Oxford University Press, 1996. Oshima, Alice. Writing Academic English, New York: Addison-Wesley Publishing Company, 1991.
B O O K S
R E F E R E N C E

C O U R S E A I M
This course aims at enabling learners to decode technical discourse in English with ease and precision. The course is also designed to enhance the learners oral production and academic writing.
By the end of this course, learners will be able to: Use a variety of listening and reading strategies appropriately Communicate about numerous technical topics orally Use basic computer terms and relevant general vocabulary meaningfully and accurately Apply word-formation rules of prefixation, suffixation and compounding Write academic essays and employment correspondence
182
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Orientation + Unit 9 (Computers in Education) Unit 9 (Computers in Education). Paragraph writing (Concrete Support l) Unit 10 (Computers in Medicine) + Summary Writing Unit 10 (Computers in Medicine) Unit 11 (Robotics) Essay writing (Analysis) + Progress test l Essay writing (Application) Unit 12 (Virtual Reality)
Week Number 10: Unit 12 (Virtual Reality) + Unit 13 (Machine Translation) Week Number 11: Unit 13 (Machine Translation) Week Number 12: CVs. & letters of application + Progress test ll Week Number 13: Interviewing skills Week Number 14: Unit 14 (Multimedia) Week Number 15: Unit 14 (Multimedia) Week Number 16: Final Exam.
183
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
LH 231 ESP (3) Technical Report Writing


G R A D I N G
ESP 3 (Technical Report Writing). LH231. Lecture 3 Hrs. Credit 3.
ESP 1 (LH131) + ESP 2 (LH 132)
T E X T B O O K S
10% 30% 20% 40%
Oshima, Alice. Writing Academic English, New York: Addison-Wesley Publishing Company, 1991.
Shelton, James H. Handbook for Technical Report Writing, USA: NTC Business Books, 1994.
C O U R S E A I M
This course aims at enhancing learners writing skills in order to write academic essays and reports following international standards. The course also includes a component on oral presentations of report.
By the end of this course, learners will be able to: Apply the stages of the writing process. Write well-structured, unified and coherent academic essays. Apply the ethics of academic writing. Summarize relevant texts. Paraphrase relevant texts. Include in-text citations in writing when necessary. Document report sources. Write formal reports. Give oral presentations.
184
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Orientation + Overview of Essay Writing Patterns of essay organization I: Logical division of ideas Patterns of essay organization IL: Chronological order Patterns of essay organization Ill: Cause and effect order Patterns of essay organization IV: Comparison and contrast order Introduction to technical reports and plagiarism + Dictionary skills Summarizing + Progress test l Paraphrasing + Further practice on summarizing and paraphrasing Report format and outlines + Presentation skills (CD Viewing l)
Week Number 10: Quotations and source documentation + Writing workshop Week Number 11: Use of illustrations in technical writing + Presentation skills Week Number 12: Writing workshop + Progress test ll Week Number 13: Mini-presentations+ Writing workshop Week Number 14: Rehearsals Week Number 15: End-of-term presentations Week Number 16: Final Exam.
185
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Industrial and Systems Engineering Courses IM

IM 111 Industrial Relations

G R A D I N G
Industrial Relations. IM 111. Lecture 1 Hr. None. Tutorial 0 Hrs. Credit 2.
Class Performance/Attendance: Midterm # 1/Assignments (7th Week): Midterm # 2/Assignments (12th Week): Final Exam
10% 30% 20% 40%
This course identifies the different types of industries, production techniques, management and organization structure, the different types of hazards and dangers and how to prevent them. Also it clarifies the meaning of production planning and control and cost calculations.
T E X T B O O K S
Lecture Notes
Turner, Mize, Case & Nazemtz, "Introduction to industrial engineering", Prentice Hall, latest edition.
C O U R S E A I M
To introduce students to the basis knowledge and concepts related to industrialization and work organizations, industrial health and safety, and the history of engineering and technology.
Identify the different types of industries, production techniques, and management and organization structure. Understand the meaning of production planning and control and cost calculations. Understand and identify the different types of hazards and dangers and to prevent them.
186
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Introduction to Course. Types of Industries and Production Techniques. Management and Organization Structure. Production Planning and Control. Industrial Cost Estimation Techniques. Industrial Economy and Breakeven Analysis. Exam # 1. Accidents at Work Rules and Regulations. Hazards Classification, Prevention, and Personal Safety.
Week Number 10: Fire Hazards Identification and Prevention. Week Number 11: Chemical Hazards and Prevention Accident Reporting. Week Number 12: Exam # 2. Week Number 13: Quality Control and Labour Relations. Week Number 14: Science, Engineering, and Technology. Week Number 15: Industrial Revolutions. Week Number 16: Final Exam.
187
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
IM 112 Manufacturing Technology


G R A D I N G
Manufacturing Technology. IM 112. Lecture 1 Hr. None. Laboratory 2 Hrs. Credit 2.
Class Performance/Attendance: Midterm # 1/Assignments (7th Week): Midterm # 2/Assignments (12th Week): Final Exam
10% 30% 20% 40%
The course provides an introduction to engineering materials and their properties, production of common metals. It covers types of manufacturing, basic manufacturing processes such as casting, metal forming, welding and machining. An overview of some advanced manufacturing processes is also included. In addition, it introduces measurement standards, instruments, deviations and methods.
T E X T B O O K S
T.F. Waters and F. Waters, "Fundamentals of Manufacturing for Engineers, Taylor & Francis, latest edition.
Roy A. Lindberg, "Processes and Materials of Manufacturing", Allen and Bacon, latest edition. E. Paul DeGarmo, et.al, "Materials and Processes in Manufacturing", Prentice Hall, latest edition. L.E. Doyle, et.al, "Manufacturing Processes and Materials for Engineers", Prentice Hall, latest edition. I.G. Kenaly and K.W. Harris, "Manufacturing Technology", Edward Arnolds Publisher, latest edition. Mikell P. Groover, "Fundamentals of Modern Manufacturing", Prentice Hall, latest edition.
A I M
C O U R S E
Introduce the different methods for processing engineering materials and get acquainted with the basic concepts and necessary information related to manufacturing techniques.
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O B J E C T I V E S
Understanding the different stages or phases for engineering materials processing, learning the basic concepts of metal forming and casting, understanding the concepts of metal machining and welding techniques and associated applications, learning different measuring techniques and how they can be used for quality control purposes.
Production of steel and cast iron. Forming operations (Rolling Drawing Extrusion Forging). Heat treatment operations (Hardening-Annealing-Tempering-Nor realizing). Cutting tools (Geometry & materials). Mechanics of metal cutting and turning operations. Cutting fluids (Function Type Selection). Exam # 1. Sand casting (Pattern design & mould preparations). Centrifugal casting, die casting and aspects of the casting process.
Week Number 10: Gas and Electric arc welding. Week Number 11: Electric resistance and pressure welding and aspects of the welding process. Week Number 12: Exam # 2 Week Number 13: Standards of measurements, Measuring Instruments. Week Number 14: Measuring Instruments (Vernier, micrometer, dial gauge, block gauges). Week Number 15: Measuring methods (Indirect and comparative measurements). Week Number 16: Final Exam.
189
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
IM 423 Operations Research


G R A D I N G
Operations Research. IM 423. Lecture 2 Hrs. 90 Credit Hours. Tutorial 2 Hrs. Credit 3.
10% 30% 20% 40%
The course provides the basic concepts and fundamentals of management science, problems addressed by operations research, and problem formulations in linear programs. It includes the graphical solution of linear programs, simplex method, transportation model, assignment model, network planning, and critical path and PERT methods.
T E X T B O O K S
F. Hillier and J. Lieberman, "Introduction to Operations Research", McGraw Hill, latest edition.
Hamdy Taha, "Operations Research", Prentice Hall, latest edition.

To promote the scientific approach to solve management problems. To build up capability to construct mathematical models of practical problems and solve them. To acknowledge the role of computer technology in solving problem of operations research.
O U T L I N E
C O U R S E
Course Overview. Linear Programming. Graphical Method.

190
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Linear Programming Applications. The Simplex Method. Transportations Method Formulation and Initial Solution. 7th Week Exam. Transportations Method Finding the Optimal Solution. Assignment Method.
Week Number 10: Critical Path Method. Week Number 11: Probabilistic Approach, Project Evaluation and Review Technique (PERT). Week Number 12: 12th Week Exam. Week Number 13: Project Crashing Week Number 14: Network Analysis Shortest Route and Minimal Spanning Tree. Week Number 15: Network Analysis Maximal Flow. Week Number 16: Final Exam.
191
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
IM 535 International Operations Management


G R A D I N G
International Operations Management. IM 535. Lecture 3 Hrs. 126 Credit Hours. Tutorial 0 Hrs. Credit 3.
10% 30% 20% 40%
The course introduces the students to the concepts of international business environment, international trade and direct foreign investments, foreign exchange, and economic cooperation.
T E X T B O O K S
John D. Daniels and Lee H. Radebaugh, International Business Environments & Operations, Prentice Hall, latest edition.
Griffin and Pustay, International Business, Prentice Hall, latest edition.

The objective of this course, which is a part of the college requirements, is to introduce the students from different disciplines to the ever-growing field of international business. It tackles the main issues of the evolution of firm strategy as part of the internationalization process, plus the countervailing forces that firms are likely to encounter during that process. In addition, the elements of the external international business environment are briefly introduced. The student will be better able to interact with the business world in the environment of globalization.
International Business Environment- An overview. The Cultural and Legal Environment. The Political Environment.
192
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
The Economic Environment Facing Business (1). The Economic Environment Facing Business (2). International Trade Theories (1). 7th week Exam. International Trade Theories (2). Governmental Influence on Trade.
Week Number 10: Regional Economic Integration. Week Number 11: Factor Mobility and Foreign Direct Investment. Week Number 12: 12th week Exam. Week Number 13: The Foreign Exchange Market. Week Number 14: The determination of Exchange Rates. Week Number 15: Global Manufacturing and Supply Chain management. Week Number 16: Final Exam.
193
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Mechanical Engineering Courses ME

ME 151 - Engineering Drawings & Projection
Course Title: Engineering Drawings & Projection Code: Hours: Prerequisites:

G R A D I N G
ME 151 Lecture 2Hrs None Tutorial 2Hrs Credit 2
10% 30% 20% 40%
Drawing practices and techniques Geometrical constructions Dimensioning and free hand sketching Methods of projection Orthogonal projection Sectioning and conventions Intersection of geometrical surfaces and development Standard metal sections and metal structures Pictorial projection (Isometry) Surface intersections Perspective projection An introduction to Computer Aided Drafting using AutoCAD.
T E X T B O O K S
Engineering Drawing Book prepared and edited from several related books.
S. Bogolyulov a. Voinor Engineering Drawing, Mir publishers, Latest edition. Thomas E. French Eng. Drawing & Graphics Techniques, McGraw Hill Co, Latest edition. Sham Tickoo, "AutoCAD 2008: A problem solving approach", Autodesk Press 2007
A I M
C O U R S E
To give the student the ability to communicate by means of engineering drawing and to relate the applications of drawing techniques to mechanical engineering practice.
194
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O B J E C T I V E S
To provide the basic information for engineering drawing and to present the different types of drawings in generic and basic forms with enough depth.
Drawing practices and techniques (Exercises on geometrical construction) Methods of object projection (Exercises on geometrical construction Exercises on object projection) Orthogonal projection (Exercises on orthogonal projection) Missing views, dimensioning and free hand sketching (Exercises on projection and free hand sketching) Sectioning and conventions (Exercises on sectional views) Intersection of geometrical surfaces and development (Exercises in intersection of geometrical surfaces and development) Standard metal sections and metal structures (Exercises on metal structures) Quiz Compound metal sections and welds (Exercises on metal structures) Isometric projection (Exercises on Isometry)
Week Number 10: Isometric projection & Surface intersections (Exercises on Isometry and surface intersections) Week Number 11: Perspective projection (Exercises on Perspective projection) Week Number 12: Perspective projection (Cont.) (Exercises on interior and exterior perspective projection) Quiz Week Number 13: Computer Aided drafting using AutoCAD (General Introduction) Week Number 14: Drawing and editing commands in AutoCAD Week Number 15: Writing texts, Dimensioning and viewing commands Week Number 16: Final Examination
195
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Non-Engineering Courses NE
NE 264 Scientific Thinking

G R A D I N G
Scientific Thinking NE 264 Lecture 4 Hrs. none Credit 3
10% 30% 20% 40%
Nature and postulates of scientific thinking, Evolution of scientific thinking, Mythical thinking, Metaphysical thinking, Superstition, Definition of Science, differences between sciences, pseudo science and non science, characteristics of scientific thinking, Postulates of science, Objectives of science, The thinking processes, Incomplete & complete inductive reasoning mathematical induction, The meaning of mathematical sciences, Methods of Reasoning in Natural Sciences, Defining Experimentation, The difference between experimentation & observation, Defining Problem solving, The difference reduction method, Means Ends analysis method, Defining creative thinking and Components of creative thinking, Decision making.
T E X T B O O K S
Scientific Thinking, Prof. Abdel-Moneim Hassan.

References available in the Academy library.

C O U R S E A I M
The main goal of the course is to develop the thinking skills of engineering and technology students.
196
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O B J E C T I V E S
The objectives of the course is to have students learn to define science use reasoning skills such as, analysis, synthesis, including, deducing, increasing, apply the methods science to solve problems, use creative thinking skills in real situations.
Thinking patterns development. Meaning & construction of science, scientific values & directions. Science, non-science & other-than science, engineering & technology. Properties of science & the thinking processes. Objectives of science & postulates of scientific thinking.. Mental operations used in science, scientific guessing methods of reasoning in mathematics. Types of deductions & the 7th week exam. Methods of reasoning in natural sciences. Research methods in natural sciences.
Week Number 10: Experiments & observations; scientific postulates & their conditions creative thinking. Week Number 11: Verification of scientific postulates. Week Number 12: Flexibility & originality. Week Number 13: Creative thinking, fluency types. Week Number 14: Basics of brainstorming; methods of decision making. Week Number 15: General revision. Week Number 16: Final exam.
197
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
NE 364 Engineering Economy


G R A D I N G
Engineering Economy. NE 364. Lecture 2 Hrs. 54 Credit Hours. Tutorial 2 Hrs. Credit 3
10% 30% 20% 40%
A study of basic concepts emphasizing analysis of aggregate economy. Examination of the processes of price determination and calculation of optimum demand for maximum profit. Basic principles of money-time relationship. Methods of investment assessment and fundamental techniques of comparison of investment opportunities. Theories of depreciation of physical facilities and study of cost recovery systems.
T E X T B O O K S
William G Sullivan, Elin M Wicks, & James Luxhoj, Engineering Economy, latest edition.
E.L. Grant, W.G. Ireson, and R.S. Leavenworth, Principles of Engineering Economy, John Wiley and Sons, latest edition. Chan S. Park, Contemporary Engineering Economics, Addison Wesley, latest edition.
O B J E C T I V E S
C O U R S E
Introduction basic cost concepts and economic environment. Familiarization of the principles of money time relations and basics of investments opportunities assessment and evaluation.
198
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Introduction and overview. Cost concepts and the economic environment. Principles of money time relations, the concept of economic equivalence. Cash flow diagrams: Interest formulas and uniform series. Cash flow diagrams: Uniform gradient series and geometric sequence Nominal and effective interest rates, continuous compounding and continuous cash flows. Exam # 1. Applications of engineering economy: Methods of investment assessment. Comparing alternatives: Useful life is equal to the study period.
Week Number 10: Comparing alternatives: Useful life is shorter than the study period. Week Number 11: Comparing alternatives: Useful life is longer than the study period. Week Number 12: Exam # 2. Week Number 13: The imputed market value technique. Week Number 14: Depreciation: Historical Methods. Week Number 15: Depreciation: Cost recovery systems. Week Number 16: Final Exam.
199
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
NE 465 Aesthetic Education and Art Appreciation


G R A D I N G
Aesthetic Education and Art Appreciation NE 465 Lecture 4 Hrs. none Credit 3
10% 30% 20% 40%
Aesthetic training and appreciation on a wide range of types of arts, including Music, Drawing, Painting, Sculpture and Engraving; Applied art (major and minor arts); The Ancient world, Classical world and Christian world (Christianity); Islamic and oriental arts; Medieval Western world; Renaissance in the 17th, 18th and 19th Centuries; Modern arts in the 20th Century.
T E X T B O O K S
Aesthetic education & Art appreciation (Prof. Naema El-Shishiny Arabic and English).
Largesse Encyclopedia of Modern Art (1800 to present). A course history of arts (Herbert Read). The McMillan encyclopedia of Art.
A I M
C O U R S E
A work of art produces an agreeable impression as processing aesthetic beauty which is the result of the satisfaction of the mind and the stimulation of our senses.
Student to be acquainted with different forms of arts (fine arts and applied arts) their techniques and main elements + An output over the ages of mans creativity, thus the appreciation of arts essence and permanent values.
200
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
C O U R S E
O U T L I N E
Introduction to aesthetic education. Drawing. Painting. Sculpture. Engraving. Applied Art, introduction to art appreciation. The Ancient world & 7th week exam. The ancient world. Classical world (christianity).
Week Number 10: Christian world. Week Number 11: Islamic + oriental arts. Week Number 12: Medieval world. Week Number 13: Renaissance + 17th C. Week Number 14: 18th C + 19th C. Week Number 15: 20th C + modern arts. Week Number 16: Final exam.
201
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
NE 466 Environmental Science and Technology


G R A D I N G
Environmental Science and Technology NE 466 Lecture 4 Hrs. none Credit 3
10% 30% 20% 40%
An Introduction to Basic Principles, Environmental Science and Technology, The Development of Human Awareness Regarding Environment Problems, Population and the Environment, Development and the Environment, Population and the Environment, Solving a system of equations using Det., Poverty and the Environment, Environment and Consumer Life styles, Relation between Human Health and Environmental Degradation, Environmental Improvement, Economic and Social Benefits of Pollution Abatement.
T E X T B O O K S
One earth, one future Our changing Global Environment, Cheryl Simon & Ruth S. Dyries (in Arabic), Translation, Sayed Ramadan, International Pub & Dis. House.
International Committee for Environ. & Dev., Our Common future, Trans by Mohamed Kamel Arif, Alam Al Marif 1989 (Arabic). Tolba, KK., Saving Our Planet Challenges and Hopes, Centre for Arab Unity Studies, Beirut 1992 (Arabic). Environmental Science and Engineering, 2nd ed, J.Glynn Henery & Gary W.Heinke, Prentice Hall, 1996.
A I M
C O U R S E
To raise the level of environmental awareness of the students, and provide them with the necessary knowledge, capabilities and attitude that will enable them the necessary knowledge, capabilities and attitudes that will enable them to deal more positively with environmental resources and their
202
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
components, through learning about the diversity and complexity within the environment and the changes and transformations that occur through human activities.
Developing the students understanding of the earths resources Helping the students to understanding man kinds position within the environment Correcting the common erroneous notion that natural resources can limitlessly sustain human exploitation Explaining that most forms of environmental degradation are a result of consumerist lifestyle Stressing the role of Science and technology in the development of mans relation with the environment changing students negative attitudes regarding the environment.
The biosphere the natural built environment, ecosystem components. Environmental resources, ecological systems and equilibrium. The evolution of mankinds relation with the environment. The development of human awareness regarding environment problems. Population and the environment. Development and the environment. 2 hrs revision and 2 hrs the seventh week exam. Environment and sustainable development. Poverty and the environment.
Week Number 10: Environment and consumer lifestyle. Week Number 11: Relation between human health and environmental degradation. Week Number 12: Discussion of reports as a 12th week exam. Week Number 13: Environmental improvement. Week Number 14: Economic and social returns, benefits of pollution abatement. Week Number 15: Environmental management. Week Number 16: Final exam.
203
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Chapter
Teaching Faculty List

A list of teaching faculty staff includes: Alphabetical names (last name first), position, date, university, specialization, experience in industry, research activities.
Full Time Staff

A B D A L L A H , I H A B
Ph. D. 2009, Salford University, London.

Specialization
Robotics.
Experience in Industry
ROBOCON contest referee and participant.

Research Activities
Intelligent Robotics, bioinformatics and bioengineering.

A B D U L B A I T H , M O H A M E D
Ph. D. 1992, University Of Vienna, Austria.

Specialization
Computer Systems Security.

Public Telephone Switching (Siemens &Alcatel) Austria. Secure Software System in Railway Automation, in Cooperation with (Siemens, Alcatel, and Seibersdorf Research Center), Austria. International project (AEG Austria), Vienna. Consultant in Scientific Committee at Umm Al Qura University, Makkaha EL Mokaramah, Saudi Arabia.
Research Activities
Computer Security, PC-based Applications and Utilities, Complex Computer Network Reliability and Genetic Adaptive Routing Algorithm.
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
A B O U
E L - F A R A G ,
A H M E D
Ph. D. 2009, Cairo University, Egypt.

Specialization
Reconfigurable Computing, Computer Architecture and Embedded Systems.

Periodic Real-Time Tasks for FPGAs.

Research Activities
Advanced Computer Architecture and Reconfigurable Systems.

A B O U E L - N A S R , M O H A M E D ( H E A D O F D E P A R T M E N T )
Ph. D. 2003, Georgia Institute of Technology, USA

Specialization
Computer Networks, Embedded systems.

Consultant of Network design and Security. Researcher at the Manufacturing Research Center MARC Georgia Institute of Technology USA 2001-2003 Trainer of CISCO network systems.
Research Activities
Wireless and Ultra-wideband computer communications and sensing systems, Mobile Ad-hoc networks, embedded systems design and FPGA implementation. Computer vision and Face detection and recognition algorithms. Computer-aided design, Analysis and performance evaluation of computer communication network systems and Network security.
E L - S O N N I , M O H A M E D
Ph. D. 1978, University of Illinois, U.S.A.

Specialization
Computer Graphics and computer hardware design.

Consultancy
Research Activities
Computer vision and Image Processing and 3-D Modelling.

E L - Z O U K A , H E S H A M
Ph. D. 2006, university of Nottingham, UK.

Specialization
Computer Engineering
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Installation and Maintaining of Hardware (Servers and PCs) Installing and Configuring Computer Network Devices (Switches, Routers, Firewalls) Experience in developing computer projects and systems for private and public organizations including evaluation and monitoring. Working knowledge in discrete event simulators, Environments Special Software such as GIS and Remote Sensing. Developing and Teaching technical classes for computer majors. Consulting experience in the areas of Network Security Systems.
Research Activities
Ad Hock network security, Wireless network security, Wireless Sensor Networking, Information Hiding: Steganography and Watermarking: - Attacks and Countermeasures, Distributed and Embedded Systems.
H O S N Y , W A E L
Ph. D. 2006, University of Western Ontario, Canada.

Specialization
Computer Networks.
Researcher in a Network Laboratory- Engineering, UQAM, Montreal, QC, Canada, from 9/2006-9/2007 ATM Network Analyzer and Quality Control Engineering, AAST, Alexandria, Egypt. Simulator Designer Engineering, AAST, Alexandria, Egypt . Fire Prevention Website Designer Engineering, Physical Plant & Capital Planning Services Division. UWO, London, ON, Canada.
Research Activities
Distributed Systems, Differentiated Services, Feedback control and Computer Networks.

I S M A I L , O S A M A
Ph. D. 1994, Queens University, U.S.A.

Specialization
Robotoics Control, Computer Algorithms (sequetial & Parallel).

MicroControllers Applications. Landmine Detection by using mobile robot.
Research Activities
Robotics Applications, Vehicle Tracking system and Parallel/Sequential Algorithms.
206
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
S A E B ,
M A G D Y
Ph. D. 1985, School of Engineering, University of California, Irvine, U.S.A.

Specialization
Data communication security.

Chief Researcher Malaysian Institute of Microelectronic Systems (MIMOS).

Research Activities
Data Communication Security, FPGA Implementations of Data Security Algorithms Computational Techniques Applications & Security of Mobile Agents. Design and Implementation of Cosine Transforms Employing a CORDIC Processor, IPLess Stochastic Anonymous Routing Algorithm Using Multi-Agent Systems.
Y O U S S E F , S H E R I N
Ph. D. 2005, university of Nottingham, UK.

Specialization
Computer Networks.
Neuro-based Learning of Mobile Robots with Evolutionary Path Planning. Dynamically Adaptive Data Clustering Using Intelligent Swarm-like Agents
Research Activities
Automated Barcode Recognition for Smart Identification and Inspection Automation, Hybrid Reinforcement Learning in Autonomous Mobile Systems.
Z A D A H , F A T M A
Ph. D. 1995, Computer and Control Engineering, University of El-Mansoura, Egypt.

Specialization
Robotic Interception of Moving Targets.

Multimedia Modelling of Autonomous Mobile Robots. Range Sensory Based Robot Navigation in unknown Terrains
Research Activities
Active Network Based Intrusion Response System, FPGA Based Implementation of Real Time Communication System.
207
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Assistants
A G A M Y , M A Z E N
Assistant Lecturer, M. Sc. 2003, AASTMT, Alexandria, Egypt.

Specialization
Computing System.
Research activities
System Design.
E L - S H E N N A W Y , M A R W A

Specialization
System Architecture.
Research activities
Developing System and image processing.

F A R O U K , H A L A A H M E D

Specialization
Reconfigurable Computing, Hardware Security and Computer Architecture.

Research activities
FPGA Implementations for Security Algorithms, Non-classical Computational Models, Asynchronous Design, and Evolvable Hardware.
F A T H Y , C H E R I N E

Specialization
Computer Networks.
Research activities
Network Optimization.
F A Y E D , S A L E M A

Specialization
Wireless sensor networks.
208
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Research activities
Query optimization in wireless sensor networks, Applying evolutionary techniques such as genetic algorithms to optimize query processing.
H A N A F Y , H A N Y

Specialization
Data Mining - Clustering

Research activities
Enhanced Density Based Algorithm for Clustering Large Datasets.

K A D R Y , R A N I A

Specialization
Computer engineering.
Research activities
Biomedical engineering.
K H A D R A G I , A H M E D

Specialization
Virtual Reality.
Research activities
Image processing, computer networks.

N A G Y , S H E R I N E

Specialization
Feature Selection applied on Text data for classification.

Research activities
Reading pattern recognition papers involving both feature selection used for text and image mining.
S A B R Y , A B D A L L A H

Specialization
Computer Networks.
209
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Research activities
Network optimization and MAC layer implementation in MANET.
Full Time Graduate Teaching Assistants

A S L A N , M O H A M E D
Teaching Assistant, B. Sc. 2008, AASTMT, Alexandria, Egypt.

B A R S O U M , S H E R I N E

E L - H A B A S H Y , A H M E D

F A T H A L L A , K A R M A

F A Y E D , A R I G E

K H E D R , M A A N

M O H A M E D , A B D E L - R A H M A N

S H O U K R Y , S A M E R
210
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Chapter
Department Facilities
Description of the department facilities including laboratories, workshops, computing and information facilities, and the courses supported by these facilities.
Experimental Facilities Supporting the Program

The program utilizes a number of well-equipped laboratories for instructions and research. Handson experience is highly emphasized throughout the program and ultra modern equipment is to serve the interests of both the students and staff. The laboratories serving the program are:
1. 2. 3. 4. 5. 6. 7. 8. 9.
Field-Programmable Gate Array (FPGA) Laboratory. Microprocessor Laboratory. Digital Circuits Laboratory. Computer Laboratories. Computer and Network Laboratory. Electrical Machines Laboratory. Electrical Circuits Laboratory. Digital Communication Laboratory. Reverse Engineering Laboratory.
10. Physics Laboratory. 11. Chemistry Laboratory.
211
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Field-Programmable Gate Array (FPGA) Laboratory

L A B O R A T O R Y I N F O R M A T I O N
An up-to-date Laboratory with facilities that contains essential software programs as MATLAB and Xilinx software in order to support the students with all tools required to develop system architecture, low level languages and Network simulation. Room no.: Capacity:
M A J O R
College Engineering & Technology - 241 28 students.

E Q U I P M E N T
Computer Intel P. V core 2 Duo, RAM 1 GB, HD 160GB, DVD writer, 17 '' LCD monitor. Microsoft Windows Operating System. Microsoft Office 2007. MATLAB Software. Xilinx Software.
L A B O R A T O R Y S E R V E S T H E F O L L O W I N G C O U R S E S
T H E
Course Code CC 311 CC 317 CC 417 CC 431 CC 523 CC 524
Course Title Computer Architecture Digital System Design Assembly Language Computer Networks (1) Computer Performance Neural Networks
Semester 6 5 Elective 9 Elective Elective
212
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Microprocessor Laboratory
The laboratory gives the students the opportunity to use the microprocessors kit for running several programs written in assembly language and it provides various tests and runs numerous experiments, also, it help the students to establish interfacing between computer and different input/output devices, Finally, it supports the students with all materials required to create different micro-controller chips. Room no.: Capacity: College Engineering & Technology - 326 25 students
E Q U I P M E N T
L A B O R A T O R Y
Computer Intel P. V core 2 Duo, RAM 1 GB, HD 160GB, DVD writer. Microcomputer Teaching System Portable Programmer Microprocessor Application Board Microprocessor Training System CPLD Card XC 9500 Complex Programmable Logic Device FPGA (Field Programmable Gate Array) Development Boards ML402 Evaluation Platform with Virtex-4 XC4VLX25 and an embedded PowerPC 405 hardcore. Spartan-3A DSP 1800A Development Board with embedded MicroBlaze Softcore. Spartan-3 Starter Kit with XC3S200 FPGA chip and 512KB SRAM. Data Acquisition Experiments. Running assembly programs on 8088/86 Microprocessors boards.
T H E
Course Code CC 341 CC 411 CC 415 CC 421 CC 514 CC 521 CC 527
Course Title Digital Electronics Introduction to Microprocessor Data Acquisition Systems Introduction to Microprocessor Intelligent Robotics Microcomputer Based Design Computer Aided Design
Semester 6 7 8 7 Elective Elective Elective
213
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Digital Circuits Laboratory

A completely equipped laboratory that contains precision measurement equipments and tools for use in digital logical experiments. The laboratory houses a collection of equipment used for the generating signals and visualizing it. Room no.: Capacity: College Engineering & Technology - 441 25 students
E Q U I P M E N T
L A B O R A T O R Y
Programmable Logic FX12 (XV4VFX12) Xilinx University Program Development System XUPV2P with Virtex 2 pro XC2VP30 and two embedded hardcore PowerPC 405 processors. Programmable Logic Digilent D2FT. Accessory Board Memory. Accessory Board Network (NET1) Accessory Board Digilent Analog I/O (ALO). Logic Pulser. Oscilloscope. Function Generator.
T H E
Course Code CC 216
Course Title Digital Logic
Semester 4
214
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Computer Laboratories
Lab Name: Room no.: Capacity:
Lab 106 College Engineering & Technology - 106 25 students

E Q U I P M E N T
L A B O R A T O R Y
Personal Computers Microsoft Dot Net 2005 software.

T H E
Course Code CC 112 CC 215
Course Title Structured Programming Data Structures
Semester 2 4
215
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Lab Name: Room No.: Capacity:

M A J O R

E Q U I P M E N T
Personal Computers Oracle Database Software

S E R V E S T H E F O L L O W I N G C O U R S E S
L A B O R A T O R Y
Course Code CC 414
Course Title Database systems
Semester 7
216
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9

M A J O R

E Q U I P M E N T
Personal Computers. Microsoft Dot Net Software. Linux Operating Systems in addition to Microsoft Operating system.
L A B O R A T O R Y
Course Code CC 418 CC 518
Course Title Operating Systems Data Security
Semester 8 Elective
217
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9

M A J O R

E Q U I P M E N T
Personal Computers. Microsoft Operating System in addition to Linux Operating System. Microsoft Office 2007 Software. Microsoft Dot Net Software.
L A B O R A T O R Y
Course Code CC 111 CC 112 CC 213 CC 418 CC 511
Course Title Introduction to Computers Structured Programming Programming Applications Operating Systems Artificial Intelligence
Semester 1 2 3 8 9
218
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9

M A J O R

E Q U I P M E N T
Personal Computers. Microsoft Windows Operating System. Microsoft Dot Net Software. Microsoft Office Software.
L A B O R A T O R Y
Course Code CC 316 CC 319 CC 515
Course Title Object Oriented programming Advanced Programming Introduction to Software Engineering
Semester 6 5 Elective
219
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9

M A J O R

E Q U I P M E N T
Personal Computers. Microsoft Windows Operating System. Visual C Software. Microsoft Dot Net Software.
L A B O R A T O R Y
Course Code CC 416 CC 516 CC 517
Course Title Computer Graphics Pattern Recognition Modelling and simulation
Semester 8 Elective Elective
220
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9

M A J O R
lab 312 College Engineering & Technology - 312 25 students

E Q U I P M E N T
Personal Computers. Microsoft Windows Operating System. Microsoft Office 2007. Microsoft Dot Net Software.
L A B O R A T O R Y
Course no. CC 111 CC 112 CC 213
Courses Title Introduction to Computers Structured Programming Programming Applications
Semester 1 2 3
221
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Computer and Network Laboratory


M A J O R
Computer and Network Lab College Engineering & Technology - 239 28 students
E Q U I P M E N T
Workstation, dual core AMD 2.6 GHz, 2 GB RAM, Hard Disk 250 GB Workstation, Intel core 2 Quad Q6700, 4 GB RAM, Hard Disk 450 GB, Monitor HPL2045w Intel XP455 Networkprocessor Secure Embedded Web Application Kit Rabbit3000 Serial to Ethernet Application Kit Rabbit CoreRCM3000 Airborne 802.11 b wireless LAN Node Module Evaluation and Development Kit 4 port USB KVM switch kit "Trendnet" 8 port10/100 desktop switch "Netgear" Ethernet DSL router with 4port switch linksys 3 COM 8 port switch
L A B O R A T O R Y
Course no. CC 331 CC 431 CC 531 CC 518
Courses Title Intro. to Computer Communications Computer Network I Computer Network II Computer Security
Semester 6 9 Elective Elective
222
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Electrical Machines Laboratory

The laboratory serves in performing the following project activities: Unity power factor lost converter for D.C. motor. D.C. step down chopper for D.C. motor. Four-quadrant drive for D.C. motor. Three-phase chopper control induction motor. Voltage control of wind driven induction generator. Series Motor Drive. Three phase Wind Induction Generator Station. Inverter Bridge leg.
Room no.: 201 Capacity: 20 students.

M A J O R E Q U I P M E N T
Inductive Load. D.C. machine. AC Synch. Motor. Power Back. Machine Control Panel. Electrical Motor. Tachometer Generator. Transformer. Power Factor Unit.
L A B O R A T O R Y S E R V E S T H E
Amplitude Meter. Voltmeter. Wattmeter. Shunt Regulator. Ammeter. 2 Speed Motor. Synchronizing Device and Unit. Tacho Generator. Power Electronics Components.
C O U R S E S
T H E
F O L L O W I N G
Course Code EE 321 EE 322 EE 328 EE 329 EE 422 EE 424 EE 521 EE 522 EE 421 EE 423
Course Title Electrical Machine 1 Electrical Machine 2 Electrical Power & Machines Electrical Machines Electrical Machine 3 Electrical Drivecs1 Special Electrical Machine Electrical Drivecs2 Power Electronics 1 Power Electronics 2
Semester 5 6 6 7 7 8 9 10 6 7
223
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Electrical Circuits Laboratory

The lab provides various tests and runs numerous experiments to out the following research activities: Making basic measurements with the HP8590 E-Series and L- Series spectrum Analyzer. Decreasing the frequency span using the marker Tracking unstable signals using marker track and the max. hold and min. hold function. Tracing of the output of some power electronic circuits using the storage oscilloscope Transferring of output data of different circuits is done using a system of storage oscilloscope and Computer PC. Studying of different shapes available in the function generation and comparison between their average root mean square value and instantaneous values.
Room no.: 034 Capacity: 25 students

L A B O R A T O R Y E Q U I P M E N T
Spectrum Analyzers. Digital Oscilloscopes. Analog Oscilloscopes. Multiplexer. Wattmeter. Digital power Supply. Analog power Supply. Function Generator. Digital LCR Meter. Digital Multimeter. Analog Multimeter. Test Boards.
T H E
Course Code EE 238 EE 231 EE 236 EE 232 EE 312
Course Title Electrical Eng. Fundamentals Electrical Circuits 1 Electrical engineering 1 Electrical Circuits 2 Electric Measure. & Inst. 2
Semester 3, 4 3 4 4 5
224
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Digital Communication Laboratory

Room No. : Capacity :

M A J O R
132 25
E Q U I P M E N T
4 Power Supplies. Signal Analyzer. Spectrum Analyzer. Function Generators. 2 Analog Oscilloscopes, 1 Digital Oscilloscope. Signal generator. D.C Power Supply. 2 PSG 1000 Synthesized Signal Generator. Multi-meter Function Generator. 8111A Pulse/Function Generator. 3 Function Arbitrary 33120A Wave Generator. ISO-Tech IDM 205 RMS 4 Oscilloscopes Multiplexer. 2 DAE SHIN DOA-141 all in one. Lab-Volt Digital Training Kit. 2 Frequency Counter. Oscilloscope 20 MHz SN9205, HP Oscilloscope 150 MHz. 2 H-CAI-ECS-C Electronic Communication systems. Hampden Hbt 460 Digital multi-meter. RF generator. 2 Personal Computer
L A B O R A T O R Y
Course Code EC 217 EC 218 EC422 EC523
Course Title Measurements & Instrumentation Measurements & Instrumentation Introduction to Digital Communications Signal Space and Applications
Semester 4th 4th 8th 9th
225
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Reverse Engineering Laboratory

A completely equipped laboratory that contains precision measurement equipment and gauges for use in experimental machining investigations and studies in quality control and to provide measurements and services to other disciplines. The laboratory houses a collection of equipment used for the following functions: General and precision measurements. Surface texture assessment. Calibration of measuring instruments. Inspection based in dimensional, form and geometrical tolerances. 3-D measurement, screw thread measurements, gear measurements, and complex shape measurements.
Room no.: Industrial services centre (ISC) - 005 Capacity: 15 students

L A B O R A T O R Y E Q U I P M E N T
Profile projection Granite surface plate. Precision bench centres. Coordinate measuring machine (CMM). Toolmakers microscope. 3-D CNC Vision Measuring. Profile, roundness and roughness measuring machine. Measuring hand tools, instruments and accessories: Block gauge sets, vernier callipers and height gauges, micrometers, sine bars, sine plates, digital bevels... etc.
T H E
Course Code IM 112 IM 213 IM 314 IM 418 IM 511E IM 501 IM 502
Course Title Manufacturing Technology Material Removal Processes Material Forming Processes Automated Industrial Systems Engineering Metrology Senior Project Part (1) Senior Project Part (2)
Semester 2 4 5 8 9, 10 9 10
226
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Physics Laboratory

M A J O R
Physics Lab I 114 25

E Q U I P M E N T
Power Supplies Electronic Components Boards Laser Tubes Function generators Heaters Photo Electric System Cathode Ray Oscilloscopes
L A B O R A T O R Y
Course no. BA 114
Courses Title Physics I
Semester 1
227
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Physics Laboratory

M A J O R
Physics Lab II 116 25

E Q U I P M E N T
Power Supplies Heaters Thermopiles Boils Apparatus Function Generators

L A B O R A T O R Y
Course no. BA 114
Courses Title Physics II
Semester 2
228
B .
S C .
P R O G R A M
S T A T U S
R E P O R T
2 0 0 9
Chemistry Laboratory

M A J O R
Chemistry 214,150 25
E Q U I P M E N T
Chemicals and Reagents Pippets, Burettets, Conical Flasks, Beakers, Funnels, Measuring Cylinders, Measuring Flasks. Projector Spectrophotometers PH meter Water analysis Test Oil Sets Sensitive Balances Oven Distill Water System
L A B O R A T O R Y
Course no. BA 118
Courses Title Chemistry
Semester 1st and 2nd
229

Ce 2

Uploaded by

Copyright:

Available Formats

Ce 2

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Ce 2

Uploaded by

Copyright:

Available Formats

COLLEGE OF ENGINEER ING AND TECHNOLOGY

Arab Academy for Science, Technology and Maritime Transport

Prepared by Departmental Committee and Coordinated by

Dr. Mohamad Abou El-Nasr

DEPARTMENT VISION/MISSION STATEMENTS

INDUSTRIAL AND SYSTEMS ENGINEERING

Computer Engineering Academic Program Sheet 10

Electronics and Communications Courses EC 166

INDUSTRIAL AND SYSTEMS ENGINEERING

Computer Engineering: An Overview

The Role of Computer Engineers

Career Opportunities for Computer Engineers

Program Aim and Objectives

Program Intended Learning Outcomes (ILOs)

Practical and Professional Skills

Program Planning Sheet

Course Level Course Group Course Sequence

None None None

Senior Standing (Semesters 9 and 10 only).

Computer Engineering Academic Program Sheet

Prerequisites List Core Courses

None None None None None None None

BA 224 CC 216 CC 215 EE 232 EC 238 BA 224 EE 231

Prerequisites List Elective Courses

None None None

Academic Program Analysis

Code BA323 CC317 CC319 EC320 EC339 EE328

Contact Hours Lecture Tutorial Lab 2 2 0 2 2 2 2 0 2 2 2 0 2 2 0 2 2 0 Total 12 10 4

Code BA326 CC311 CC316 CC331 CC341 NE364

Program Analysis by Semester Offering

Table 1 Distribution of contact hours by semester

Lab Tutorial Lecture

100% 90% 80% 4 8

Lab 22% Lecture 44% Lecture Tutorial Lab Tutorial 34%

Figure 3 Distribution of total contact hours.

Figure 4 Distribution of Credit Hours over the NARS Characteristics by Semester.

1.5 0.5 2 1 5.5 3.5

1.5 0.5 1.5 3 3 4

Humanities and Social Sciences

Applied Engineering and Design

Figure 6 Distribution of Total Credit Hours.

Program Analysis by Subject Field

100 90 80 70 Contact Hours 60 50 40 30 20 10 0 BA 22 6 16 46 12 12 12 28 Lab Tutorial Lecture 38

NE 2% LH 4% ME 4% IM 6% EC 4% BA 16% CC G0 4% BA CC G0 CC G1 CC GE EE 7% EE IM LH CC GE 13% CC G1 40% ME NE EC

Figure 9 Distribution of Contact Hours by Subject Field.

Figure 10: Percentage of CC Courses Total Contact Hours per Week.

CC G0; 7% CC GE; 23%

Figure 11: Percentage of Total Contact Hours by CC Course Group.

Figure 14 Distribution of Total Credit Hours by Subject Field. COMPUTER ENGINEERING 28

EC; 5% NE; 1% ME; 4% LH; 5%

CC G0; 5% CC G1; 38%

IM; 7% CC 57% EE; 7%

CC GE; 10% BA; 18%

Figure 15: Distribution of Total Credit Hours by Subject Field.

Figure 16: Distribution of Total CC Courses Credit Hours.

Comparison with Previous Program

Courses Summary Description

Basic and Applied Science (BA)

Computer Engineering (CC)