#	Lvl	Code	Course Title	Credits and SWL			Contact Hours				Classification				Assessment (%)				Prerequisites
				CH	ECTS	SWL	Lec	Tut	Lab	TT	UR	FR	DR	PR	SA	MT	PE	FE
1. Computer Hardware
1	1	CSE111	Logic Design	3	5	125	3	1	1	5			x		25	20	10	40
1	1	CSE111s	Logic Design	3	5	125	3	1	1	5			x		10	20	10	60
1	1	CSE112	Computer Organization and Architecture	4	8	200	3	2	2	7				x	15	20	20	40	( CSE111 ) AND ( CSE131 )
1	1	CSE112s	Computer Organization and Architecture	4	8	200	3	2	2	7				x	20	20	20	40	( CSE111s ) AND ( CSE131s )
1	2	CSE211	Introduction to Embedded Systems	3	5	125	2	2	2	6			x		25	20	10	40	( CSE131 )
1	2	CSE211s	Introduction to Embedded Systems	3	5	125	2	2	2	6			x		10	20	10	60	( CSE131s )
1	2	CSE212	Computer Organization	3	6	150	2	2	0	4			x		35	20	0	40	( CSE111 ) AND ( CSE131 )
1	2	CSE212s	Computer Organization	3	6	150	2	2	0	4			x		20	20	0	60	( CSE111s ) AND ( CSE131s )
1	3	CSE311	Computer Architecture	3	5	125	2	2	0	4				x	15	25	10	40	( CSE212 )
1	3	CSE311s	Computer Architecture	3	5	125	2	2	0	4				x	20	20	0	60	( CSE212s )
1	3	CSE312	Electronic Design Automation	2	4	100	2	1	1	4				x	25	20	10	40	( CSE112 OR CSE212) AND CSE111
1	3	CSE312s	Electronic Design Automation	2	4	100	2	1	1	4				x	20	10	10	60	( CSE112s OR CSE212s )
1	3	CSE313	Digital Systems Testing and Verification	2	5	125	2	1	1	4				x	15	25	10	40	( CSE212 )
1	3	CSE313s	Digital Systems Testing and Verification	2	5	125	2	1	1	4				x	20	10	10	60	( CSE212s )
1	3	CSE314	Parallel and Cluster Computing	2	5	125	2	1	1	4				x	15	20	20	40	( CSE112 OR CSE212 )
1	3	CSE314s	Parallel and Cluster Computing	2	5	125	2	1	1	4				x	20	10	10	60	( CSE112s OR CSE212s )
1	4	CSE411	Real-Time and Embedded Systems Design	3	5	125	2	1	1	4				x	25	20	10	40	( CSE211 )
1	4	CSE411s	Real-Time and Embedded Systems Design	3	5	125	2	1	1	4				x	10	20	10	60	( CSE211s )
1	4	CSE412	Embedded Operating Systems	3	5	125	3	1	1	5				x	15	20	20	40	( CSE411 )
1	4	CSE412s	Embedded Operating Systems	3	5	125	3	1	1	5				x	20	20	20	40	( CSE411s )
1	4	CSE413	Real-Time Operating Systems	2	5	125	2	1	1	4				x	15	25	10	40	( CSE411 )
1	4	CSE413s	Real-Time Operating Systems	2	5	125	2	1	1	4				x	10	20	10	60	( CSE411s )
1	4	CSE414	Digital VLSI Systems	2	5	125	2	1	1	4				x	15	25	10	40	( CSE212 )
1	4	CSE414s	Digital VLSI Systems	2	5	125	2	1	1	4				x	20	10	10	60	( CSE212s )
1	4	CSE415	Fault Tolerant Computing	2	5	125	2	1	1	4				x	15	25	10	40	( CSE212 )
1	4	CSE415s	Fault Tolerant Computing	2	5	125	2	1	1	4				x	20	10	10	60	( CSE212s )
1	4	CSE416	Selected Topics in Computer Design	2	5	125	2	1	1	4				x	15	25	10	40
1	4	CSE416s	Selected Topics in Computer Design	2	5	125	2	1	1	4				x	20	10	10	60
3. Software Engineering
1	0	CSE031	Computing in Engineering	2	4	100	2	0	0	2		x			30	25	0	40
1	0	CSE031s	Computing in Engineering	2	4	100	2	0	0	2		x			15	25	0	60
1	1	CSE131	Computer Programming	3	6	150	3	0	2	5			x		25	20	10	40
1	1	CSE131s	Computer Programming	3	6	150	3	0	2	5			x		10	20	10	60
1	2	CSE231	Advanced Computer Programming	3	5	125	2	0	2	4				x	25	20	10	40	( CSE131 )
1	2	CSE231s	Advanced Computer Programming	3	5	125	2	0	2	4				x	10	20	10	60	( CSE131s )
1	2	CSE232	Advanced Software Engineering	3	5	125	2	2	0	4				x	35	20	0	40	( CSE334 )
1	2	CSE232s	Advanced Software Engineering	3	5	125	2	2	0	4				x	40	20	0	40	( CSE334s )
1	2	CSE233	Agile Software Engineering	2	5	125	1	0	4	5				x	15	20	20	40	( CSE232 )
1	2	CSE233s	Agile Software Engineering	2	5	125	1	0	4	5				x	20	20	20	40	( CSE232s )
1	3	CSE331	Data Structures and Algorithms	3	5	125	2	2	1	5				x	25	20	10	40	( CSE231 )
1	3	CSE331s	Data Structures and Algorithms	3	5	125	2	2	1	5				x	10	20	10	60	( CSE231s )
1	3	CSE332	Design and Analysis of Algorithms	3	5	125	2	2	1	5				x	35	20	0	40	( CSE331 )
1	3	CSE332s	Design and Analysis of Algorithms	3	5	125	2	2	1	5				x	20	10	10	60	( CSE331s )
1	3	CSE333	Database Systems	3	5	125	2	1	1	4				x	25	20	10	40	( CSE331 )
1	3	CSE333s	Database Systems	3	5	125	2	1	1	4				x	10	20	10	60	( CSE331s )
1	3	CSE334	Software Engineering	3	5	125	2	2	0	4				x	35	20	0	40	( CSE131 )
1	3	CSE334s	Software Engineering	3	5	125	2	2	0	4				x	20	20	0	60	( CSE131s )
1	3	CSE335	Operating Systems	3	5	125	2	2	0	4				x	35	20	0	40	( CSE112 OR CSE212 )
1	3	CSE335s	Operating Systems	3	5	125	2	2	0	4				x	20	20	0	60	( CSE112s OR CSE212s )
1	3	CSE336	Software Design Patterns	2	5	125	2	1	1	4				x	25	20	10	40	( CSE231 )
1	3	CSE336s	Software Design Patterns	2	5	125	2	1	1	4				x	10	20	10	60	( CSE231s )
1	3	CSE337	Software Testing	2	5	125	2	1	1	4				x	15	25	10	40	( CSE231 )
1	3	CSE337s	Software Testing	2	5	125	2	1	1	4				x	10	20	10	60	( CSE231s )
1	3	CSE338	Software Testing, Validation, and Verification	3	5	125	2	2	1	5				x	15	20	20	40	( CSE232 )
1	3	CSE338s	Software Testing, Validation, and Verification	3	5	125	2	2	1	5				x	20	20	20	40	( CSE232s )
1	3	CSE339	Software Formal Specifications	2	5	125	2	1	1	4				x	15	20	20	40	( CSE334 )
1	3	CSE339s	Software Formal Specifications	2	5	125	2	1	1	4				x	20	20	20	40	( CSE334s )
1	3	CSE341	Internet Programming	3	5	125	2	1	2	5				x	15	20	20	40	( CSE231 )
1	3	CSE341s	Internet Programming	3	5	125	2	1	2	5				x	20	20	20	40	( CSE231s )
1	3	CSE342	Program Analysis	2	5	125	2	1	1	4				x	15	20	20	40	( CSE338 )
1	3	CSE342s	Program Analysis	2	5	125	2	1	1	4				x	20	20	20	40	( CSE231s )
1	3	CSE343	Software Engineering Process Management	2	5	125	2	1	1	4				x	15	20	20	40	( CSE232 )
1	3	CSE343s	Software Engineering Process Management	2	5	125	2	1	1	4				x	20	20	20	40	( CSE232s )
1	3	CSE344	Dependability and Reliability of Software Systems	2	5	125	2	1	1	4				x	15	20	20	40	( CSE232 )
1	3	CSE344s	Dependability and Reliability of Software Systems	2	5	125	2	1	1	4				x	20	20	20	40	( CSE232s )
1	3	CSE345	Business Process Modeling	2	5	125	2	1	1	4				x	15	20	20	40	( CSE232 )
1	3	CSE345s	Business Process Modeling	2	5	125	2	1	1	4				x	20	20	20	40	( CSE232s )
1	3	CSE346	Advanced Database Systems	2	5	125	2	1	1	4				x	25	20	10	40	( CSE333 )
1	3	CSE346s	Advanced Database Systems	2	5	125	2	1	1	4				x	10	20	10	60	( CSE333s )
1	4	CSE431	Mobile Programming	3	5	125	2	1	2	5				x	15	20	20	40	( CSE341 )
1	4	CSE431s	Mobile Programming	3	5	125	2	1	2	5				x	20	20	20	40	( CSE341s )
1	4	CSE432	Automata and Computability	3	5	125	2	2	0	4				x	35	20	0	40	( CSE332 )
1	4	CSE432s	Automata and Computability	3	5	125	2	2	0	4				x	40	20	0	40	( CSE332s )
1	4	CSE433	Software Performance Evaluation	3	5	125	3	1	1	5				x	15	20	20	40	( CSE232 )
1	4	CSE433s	Software Performance Evaluation	3	5	125	3	1	1	5				x	20	20	20	40	( CSE232s )
1	4	CSE434	Aspect- and Service-Oriented Software Systems	3	5	125	3	1	1	5				x	15	20	20	40	( CSE232 )
1	4	CSE434s	Aspect- and Service-Oriented Software Systems	3	5	125	3	1	1	5				x	20	20	20	40	( CSE232s )
1	4	CSE435	Secure Code Development	3	5	125	3	1	1	5				x	15	20	20	40	( CSE231 ) AND ( CSE451 )
1	4	CSE435s	Secure Code Development	3	5	125	3	1	1	5				x	20	20	20	40	( CSE231s ) AND ( CSE451s )
1	4	CSE436	Software Quality Assurance	3	5	125	3	1	1	5				x	15	20	20	40	( CSE232 )
1	4	CSE436s	Software Quality Assurance	3	5	125	3	1	1	5				x	20	20	20	40	( CSE232s )
1	4	CSE437	Selected Topics in Software	2	5	125	2	1	1	4				x	15	25	10	40
1	4	CSE437s	Selected Topics in Software	2	5	125	2	1	1	4				x	20	10	10	60
1	4	CSE438	Selected Topics in Software Product Lines	3	5	125	3	1	1	5				x	15	20	20	40
1	4	CSE438s	Selected Topics in Software Product Lines	3	5	125	3	1	1	5				x	20	20	20	40
1	4	CSE439	Design of Compilers	3	5	125	2	2	0	4				x	35	20	0	40	( CSE131 )
1	4	CSE439s	Design of Compilers	3	5	125	2	2	0	4				x	20	20	0	60	( CSE131s )
1	4	CSE441	Software Project Management	2	4	100	2	1	0	3		x		x	35	20	0	40	( CSE334 )
1	4	CSE441s	Software Project Management	2	4	100	2	1	0	3		x		x	20	20	0	60	( CSE334s )
5. Computer Networks
1	3	CSE351	Computer Networks	3	5	125	2	2	0	4			x	x	35	20	0	40	(ECE252)
1	3	CSE351s	Computer Networks	3	5	125	2	2	0	4			x	x	20	20	0	60	(ECE252s)
1	3	CSE352	Parallel and Distributed Systems	3	5	125	2	2	0	4				x	15	25	10	40	( CSE351 )
1	3	CSE352s	Parallel and Distributed Systems	3	5	125	2	2	0	4				x	20	20	0	60	( CSE351s )
1	3	CSE353	Industrial Networks	3	5	125	2	2	1	5			x	x	15	25	10	40
1	3	CSE353s	Industrial Networks	3	5	125	2	2	1	5			x	x	10	20	10	60
1	3	CSE354	Distributed Computing	3	4	100	2	2	1	5				x	15	20	20	40	( CSE231 ) AND ( CSE351 )
1	3	CSE354s	Distributed Computing	3	4	100	2	2	1	5				x	20	20	20	40	( CSE231s ) AND ( CSE351s )
1	3	CSE355	Parallel and Distributed Algorithms	2	5	125	2	1	1	4				x	15	20	20	40	( CSE332 )
1	3	CSE355s	Parallel and Distributed Algorithms	2	5	125	2	1	1	4				x	20	20	20	40	( CSE332s )
1	3	CSE356	Internet of Things	2	5	125	2	1	1	4				x	15	20	20	40	( CSE354 )
1	3	CSE356s	Internet of Things	2	5	125	2	1	1	4				x	20	20	20	40	( CSE354s )
1	3	CSE357	Networks Operation and Management	2	5	125	2	2	0	4				x	35	20	0	40	( CSE351 )
1	3	CSE357s	Networks Operation and Management	2	5	125	2	2	0	4				x	20	20	0	60	( CSE351s )
1	3	CSE358	Pervasive Computing and Internet of Things	2	5	125	2	2	0	4				x	15	25	10	40	( CSE231 )
1	3	CSE358s	Pervasive Computing and Internet of Things	2	5	125	2	2	0	4				x	20	20	0	60	( CSE231s )
1	4	CSE451	Computer and Network Security	3	5	125	2	1	1	4				x	25	20	10	40	( CSE351 )
1	4	CSE451s	Computer and Network Security	3	5	125	2	1	1	4				x	10	20	10	60	( CSE351s )
1	4	CSE452	Wireless Networks	2	5	125	2	2	0	4				x	15	25	10	40	( CSE351 )
1	4	CSE452s	Wireless Networks	2	5	125	2	2	0	4				x	20	20	0	60	( CSE351s )
1	4	CSE453	Digital Forensics	2	5	125	2	1	1	4				x	15	25	10	40	( CSE451 )
1	4	CSE453s	Digital Forensics	2	5	125	2	1	1	4				x	10	20	10	60	( CSE451s )
1	4	CSE454	Quantum Communication and Security	2	5	125	2	2	0	4				x	15	25	10	40	( CSE351 )
1	4	CSE454s	Quantum Communication and Security	2	5	125	2	2	0	4				x	20	20	0	60
1	4	CSE455	High-Performance Computing	2	5	125	2	2	0	4				x	35	20	0	40	( CSE112 OR CSE212 )
1	4	CSE455s	High-Performance Computing	2	5	125	2	2	0	4				x	20	20	0	60	( CSE112s OR CSE212s )
1	4	CSE456	Cloud Computing	3	5	125	3	1	1	5				x	15	20	20	40	( CSE354 )
1	4	CSE456s	Cloud Computing	3	5	125	3	1	1	5				x	20	20	20	40	( CSE354s )
1	4	CSE457	Mobile and Wireless Networks	3	5	125	3	1	1	5				x	15	20	20	40	( CSE351 )
1	4	CSE457s	Mobile and Wireless Networks	3	5	125	3	1	1	5				x	20	20	20	40	( CSE351s )
1	4	CSE458	Computer and Network Forensics	3	5	125	3	1	1	5				x	15	20	20	40	( CSE451 )
1	4	CSE458s	Computer and Network Forensics	3	5	125	3	1	1	5				x	20	20	20	40	( CSE451s )
1	4	CSE459	Selected Topics in Networks and Security	2	5	125	2	2	0	4				x	15	25	10	40
1	4	CSE459s	Selected Topics in Networks and Security	2	5	125	2	2	0	4				x	20	20	0	60
1	4	CSE461	Selected Topics in Distributed & Mobile Computing	3	5	125	3	1	1	5				x	15	20	20	40
1	4	CSE461s	Selected Topics in Distributed & Mobile Computing	3	5	125	3	1	1	5				x	20	20	20	40
7. Systems and Artificial Intelligence
1	2	CSE271	System Dynamics and Control Components	4	6	150	3	2	1	6			x		15	25	10	40	(PHM113)
1	2	CSE271s	System Dynamics and Control Components	4	6	150	3	2	1	6			x		10	20	10	60	( PHM113s )
1	3	CSE371	Control Engineering	3	5	125	2	1	1	4			x	x	25	20	10	40	( ECE251 OR ECE253 )
1	3	CSE371s	Control Engineering	3	5	125	2	1	1	4			x	x	10	20	10	60	( ECE251s OR ECE253s ) AND (CSE271s)
1	3	CSE372	Simulation of Engineering Systems	2	5	125	2	1	1	4				x	15	25	10	40	( PHM111 )
1	3	CSE372s	Simulation of Engineering Systems	2	5	125	2	1	1	4				x	10	20	10	60	( PHM111s )
1	3	CSE373	Digital Control Systems	2	5	125	2	1	1	4				x	15	25	10	40	( CSE371 )
1	3	CSE373s	Digital Control Systems	2	5	125	2	1	1	4				x	10	20	10	60	( CSE371s )
1	3	CSE374	Digital Image Processing	2	5	125	2	1	1	4				x	25	20	10	40	( ECE251 )
1	3	CSE374s	Digital Image Processing	2	5	125	2	1	1	4				x	10	20	10	60	( ECE251s )
1	3	CSE375	Machine Learning and Pattern Recognition	2	5	125	2	1	1	4				x	15	25	10	40	( PHM111 ) AND ( CSE131 )
1	3	CSE375s	Machine Learning and Pattern Recognition	2	5	125	2	1	1	4				x	10	20	10	60	( PHM111s ) AND ( CSE131s )
1	3	CSE376	Digital Signals Processing	2	125	5	2	1	1	4				x	15	25	10	40	( ECE251 )
1	3	CSE376s	Digital Signals Processing	2	125	5	2	1	1	4				x	10	20	10	60	( ECE251s )
1	3	CSE377	Pattern Recognition	2	5	125	2	1	1	4				x	15	20	20	40	( ECE251 )
1	3	CSE377s	Pattern Recognition	2	5	125	2	1	1	4				x	20	20	20	40	( ECE251s )
1	3	CSE378	Computer Graphics	2	5	125	2	1	1	4				x	15	20	20	40	( PHM013 ) AND ( CSE231 )
1	3	CSE378s	Computer Graphics	2	5	125	2	1	1	4				x	20	20	20	40	( PHM013s ) AND ( CSE231s )
1	3	CSE379	Human Computer Interaction	2	5	125	2	1	1	4				x	15	20	20	40	( CSE232 )
1	3	CSE379s	Human Computer Interaction	2	5	125	2	1	1	4				x	20	20	20	40	( CSE232s )
1	3	CSE381	Introduction to Machine Learning	2	5	125	2	1	1	4				x	35	20	0	40	( PHM111 ) AND ( CSE131 )
1	3	CSE381s	Introduction to Machine Learning	2	5	125	2	1	1	4				x	20	20	20	40	( PHM111s ) AND ( CSE131s )
1	3	CSE382	Data Mining and Business Intelligence	2	5	125	2	1	1	4				x	15	20	20	40	( PHM111 ) AND ( CSE333 )
1	3	CSE382s	Data Mining and Business Intelligence	2	5	125	2	1	1	4				x	20	20	20	40	( PHM111s ) AND ( CSE333s )
1	4	CSE471	Robotic Systems	2	5	125	2	1	1	4				x	15	25	10	40	( CSE271 )
1	4	CSE471s	Robotic Systems	2	5	125	2	1	1	4				x	10	20	10	60	( CSE271s )
1	4	CSE472	Artificial Intelligence	3	5	125	2	2	0	4				x	35	20	0	40	( PHM211 ) AND ( CSE131 )
1	4	CSE472s	Artificial Intelligence	3	5	125	2	2	0	4				x	20	20	0	60	( PHM211s ) AND ( CSE131s )
1	4	CSE473	Computational Intelligence	2	5	125	2	1	1	4				x	30	25	0	40	( PHM111 ) AND ( CSE131 )
1	4	CSE473s	Computational Intelligence	2	5	125	2	1	1	4				x	10	20	10	60	( PHM111s ) AND ( CSE131s )
1	4	CSE474	Visualization	3	5	125	3	1	1	5				x	15	20	20	40	( CSE378 )
1	4	CSE474s	Visualization	3	5	125	3	1	1	5				x	20	20	20	40	( CSE378s )
1	4	CSE475	Biomedical Engineering	2	5	125	2	1	1	4				x	15	25	10	40	( PHM111 ) AND ( CSE131 )
1	4	CSE475s	Biomedical Engineering	2	5	125	2	1	1	4				x	20	10	10	60	( PHM111s ) AND ( CSE131s )
1	4	CSE476	Fundamentals of Big-Data Analytics	2	5	125	2	1	1	4				x	15	25	10	40	( PHM111 ) AND ( CSE131 )
1	4	CSE476s	Fundamentals of Big-Data Analytics	2	5	125	2	1	1	4				x	10	20	10	60	( PHM111s ) AND ( CSE131s )
1	4	CSE477	Fundamentals of Deep Learning	2	5	125	2	1	1	4				x	15	25	10	40	( CSE131 ) AND (PHM111)
1	4	CSE477s	Fundamentals of Deep Learning	2	5	125	2	1	1	4				x	10	20	10	60	( CSE131s ) AND ( PHM111s )
1	4	CSE478	Selected Topics in Systems & Artificial Intelligence	2	5	125	2	1	1	4				x	15	25	10	40
1	4	CSE478s	Selected Topics in Systems & Artificial Intelligence	2	5	125	2	1	1	4				x	20	10	10	60
1	4	CSE479	Multimedia Engineering	3	5	125	3	1	1	5				x	15	20	20	40	( CSE374 )
1	4	CSE479s	Multimedia Engineering	3	5	125	3	1	1	5				x	20	20	20	40	( CSE374s )
1	4	CSE480	Machine Vision	3	5	125	3	1	1	5				x	15	25	10	40	( PHM111 ) AND ( CSE131 )
1	4	CSE480s	Machine Vision	3	5	125	3	1	1	5				x	20	20	20	40	( PHM111s ) AND ( CSE131s )
1	4	CSE481	Computer Animation	3	5	125	3	1	1	5				x	15	20	20	40	( CSE378 )
1	4	CSE481s	Computer Animation	3	5	125	3	1	1	5				x	20	20	20	40	( CSE378s )
1	4	CSE482	Game Design and Development	3	5	125	3	1	1	5				x	15	20	20	40	( CSE378 )
1	4	CSE482s	Game Design and Development	3	5	125	3	1	1	5				x	20	20	20	40	( CSE378s )
1	4	CSE483	Computer Vision	3	5	125	3	1	1	5				x	35	20	0	40	( ECE251 )
1	4	CSE483s	Computer Vision	3	5	125	3	1	1	5				x	20	20	20	40	( ECE251s )
1	4	CSE484	Big-Data Analytics	3	5	125	3	1	1	5				x	15	20	20	40	(PHM111) AND (CSE131)
1	4	CSE484s	Big-Data Analytics	3	5	125	3	1	1	5				x	20	20	20	40	( PHM111s ) AND ( CSE131s )
1	4	CSE485	Deep Learning	3	5	125	3	1	1	5				x	35	20	0	40	( CSE381 )
1	4	CSE485s	Deep Learning	3	5	125	3	1	1	5				x	20	20	20	40	( CSE381s )
1	4	CSE486	Bioinformatics	3	5	125	3	1	1	5				x	15	20	20	40	( CSE333 )
1	4	CSE486s	Bioinformatics	3	5	125	3	1	1	5				x	20	20	20	40	( CSE333s )
1	4	CSE487	Selected Topics in Multimedia & Computer Graphics	3	5	125	3	1	1	5				x	15	20	20	40
1	4	CSE487s	Selected Topics in Multimedia & Computer Graphics	3	5	125	3	1	1	5				x	20	20	20	40
1	4	CSE488	Ontologies and the Semantic Web	3	5	125	3	1	1	5				x	15	20	20	40	( CSE472 )
1	4	CSE488s	Ontologies and the Semantic Web	3	5	125	3	1	1	5				x	20	20	20	40	( CSE472s )
1	4	CSE489	Selected Topics in Data Science	3	5	125	3	1	1	5				x	15	20	20	40
1	4	CSE489s	Selected Topics in Data Science	3	5	125	3	1	1	5				x	20	20	20	40
9. Graduation Projects
1	4	CSE491	Computer & Systems Engineering Graduation Project (1)	3	7	175	0	0	5	5				x	60	0	40	0
1	4	CSE491s	Computer & Systems Engineering Graduation Project (1)	3	7	175	0	0	5	5				x	40	0	60	0
1	4	CSE492	Computer & Systems Engineering Graduation Project (2)	3	7	175	0	0	5	5				x	60	0	40	0	( CSE491 )
1	4	CSE492s	Computer & Systems Engineering Graduation Project (2)	3	7	175	0	0	5	5				x	40	0	60	0	( CSE491s )

CSE111	Logic Design										3 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Review on number systems: positional notation, binary number systems, number base conversion, octal and hexadecimal, negative numbers, and coded number systems. Switching functions: main operators, postulates and theorems, analysis and synthesis of switching functions, incompletely specified functions. Design using NAND and NOR gates. Storage devices:1-bit storage, set-reset FF, clocked SR FF, positive and negative-edge triggered SR-FF, JK-FF, race-around condition, master-slave JK-FF, D-FF, T-FF, excitation table. Sequential circuits: state table and transition diagram, design of digital sequential systems, incompletely specified states, counters, shift registers. Miscellaneous topics: adders, subtractors, decoders, coders, multiplexer/demultiplexer, memories (ROM, PLA, RAM).
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						2			3
Communication Systems Engineering						2			5
Mechatronics Engineering and Automation						3			5
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
25%			20%			10%			40%

CSE111s	Logic Design										3 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Review on number systems: positional notation, binary number systems, number base conversion, octal and hexadecimal, negative numbers, and coded number systems. Switching functions: main operators, postulates and theorems, analysis and synthesis of switching functions, incompletely specified functions. Design using NAND and NOR gates. Storage devices:1-bit storage, set-reset FF, clocked SR FF, positive and negative-edge triggered SR-FF, JK-FF, race-around condition, master-slave JK-FF, D-FF, T-FF, excitation table. Sequential circuits: state table and transition diagram, design of digital sequential systems, incompletely specified states, counters, shift registers. Miscellaneous topics: adders, subtractors, decoders, coders, multiplexer/demultiplexer.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Mechatronics Engineering						3			5
Computer and Systems Engineering						3			5
Electronics and Communications Engineering						3			5
General Electrical Engineering
General Electrical Engineering						3			5
Electrical Power and Machines Engineering						3			5
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE112	Computer Organization and Architecture										4 CH
Prerequisites	( CSE111 ) AND ( CSE131 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				2 Hours				2 Hours
Required SWL			200			Equivalent ECTS			8
Course Content
Structure and behaviour of digital computers at several levels of abstraction. The five classic components of a computer. Moore's law. Measuring and defining performance: the CPU performance equation, Amdahl's law, MIPS, MOPS, and MFLOPS metrics, measuring performance using SPEC. The power wall. The switch from uniprocessors to multiprocessors. Instruction set architecture: operations, operands, registers, memory organization, data transfer instructions, small constant or immediate operands, logical (bitwise) instructions, instruction formats, decision making instructions, addressing in branches and jumps, supporting procedures, strings, addressing modes, instruction set styles, CISC and RISC architectures. Construction of arrays of logic elements, arithmetic and logic units, control units, register files. CPU organization: implementation of the different instruction types, data and control paths, control units. Memory hierarchy: cache memory and virtual memory. Bussing and I/O subsystems: disk and flash storage, designing an I/O system, interfacing I/O devices.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						1			4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE112s	Computer Organization and Architecture										4 CH
Prerequisites	( CSE111s ) AND ( CSE131s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				2 Hours				2 Hours
Required SWL			200			Equivalent ECTS			8
Course Content
Structure and behaviour of digital computers at several levels of abstraction. The five classic components of a computer. Moore's law. Measuring and defining performance: the CPU performance equation, Amdahl's law, MIPS, MOPS, and MFLOPS metrics, measuring performance using SPEC. The power wall. The switch from uniprocessors to multiprocessors. Instruction set architecture: operations, operands, registers, memory organization, data transfer instructions, small constant or immediate operands, logical (bitwise) instructions, instruction formats, decision making instructions, addressing in branches and jumps, supporting procedures, strings, addressing modes, instruction set styles, CISC and RISC architectures. Construction of arrays of logic elements, arithmetic and logic units, control units, register files. CPU organization: implementation of the different instruction types, data and control paths, control units. Memory hierarchy: cache memory and virtual memory. Bussing and I/O subsystems: disk and flash storage, designing an I/O system, interfacing I/O devices.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE211	Introduction to Embedded Systems										3 CH
Prerequisites	( CSE131 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				2 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction: the importance of microcontrollers, the roles and functions of microcontrollers. Acquaintance with microcontrollers and their simulators and debuggers. Understanding different addressing modes. Programming, debugging, and simulating assembly language programs. Developing a prototype for an embedded system. Interrupts and serial I/O. Memory Expansion. Microcontroller interfaces. Interfacing techniques. Interfacing requirements. A typical microcontroller system is utilized in this course with typical software-based applications. Interfacing with USB, I2C, SPI, CAN, LIN
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4			7
Communication Systems Engineering						3
Mechatronics Engineering and Automation						4			7
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
25%			20%			10%			40%

CSE211s	Introduction to Embedded Systems										3 CH
Prerequisites	( CSE131s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				2 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction: the importance of microcontrollers, the roles and functions of microcontrollers. Acquaintance with microcontrollers and their simulators and debuggers. Understanding different addressing modes. Programming, debugging, and simulating assembly language programs. Developing a prototype for an embedded system. Interrupts and serial I/O. Memory Expansion. Microcontroller interfaces. Interfacing techniques. Interfacing requirements. A typical microcontroller system is utilized in this course with typical software-based applications. Interfacing with USB, I2C, SPI, CAN, LIN
Used in Program / Level
Program Name or requirement						Study Level			Semester
General Electrical Engineering						2
Mechatronics Engineering						2			8
Automotive Engineering						3
Electrical Power and Machines Engineering									6
Electronics and Communications Engineering									6
Computer and Systems Engineering									6
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE212	Computer Organization										3 CH
Prerequisites	( CSE111 ) AND ( CSE131 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			150			Equivalent ECTS			6
Course Content
Structure and behaviour of digital computers at several levels of abstraction. Functional organization of computer hardware. The five classic components of a computer. Moore's law. Measuring and defining performance: the CPU performance equation, Amdahl's law in computing, MIPS, FLOPS, MOPS, and MFLOPS metrics, measuring performance using benchmarks, measuring performance using SPEC, reporting performance, summarizing and comparing performance. The power wall. The switch from uniprocessors to multiprocessors. Instruction set architecture: operations, operands, registers, memory organization, data transfer instructions, small constant or immediate operands, logical bitwise) instructions, instruction formats, decision making instructions, program translation hierarchy, addressing in branches and jumps, supporting procedures, strings, addressing modes, instruction set styles, CISC and RISC architectures. Construction of arrays of logic elements, arithmetic logic units, control units, register files. CPU organization:  implementation of the different instruction types, data and control paths, control units, different organizations with their advantages and inefficiencies.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Communication Systems Engineering						2			6
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
35%			20%			0%			40%

CSE212s	Computer Organization										3 CH
Prerequisites	( CSE111s ) AND ( CSE131s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			150			Equivalent ECTS			6
Course Content
Structure and behavior of computers at several levels of abstraction. Functional organization of hardware. The five classic components of a computer. Construction of arrays of logic elements, Arithmetic Logic Units (ALUs), Register files. CISC and RISC architectures. Instruction Set Architecture (ISA): Operations, Operands, Registers, Memory organization, Data transfer instructions, Small constant or immediate operands, Logical (bitwise) instructions, Instruction formats, Decision making instructions, Program translation hierarchy, Addressing in branches and jumps, Supporting procedures, Strings, Addressing modes, Instruction set styles. CPU organization: Implementation of the different instruction types, Data and control paths, Control units, Different organizations with their advantages and inefficiencies. Measuring and defining performance: CPU performance equation, Amdahl's law in computing, MIPS, FLOPS. Moore's law. The power wall. The switch from uniprocessors to multiprocessors. Measuring performance using benchmarks: Measuring performance using SPEC, Reporting performance.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						3			5
Electronics and Communications Engineering						3			5
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			0%			60%

CSE311	Computer Architecture										3 CH
Prerequisites	( CSE212 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Definition and terms of computer architectures: instruction sets, basic data types, and addressing modes. Memory hierarchy: cache basics, cache system performance, virtual memory. Conventional architectures, pipelined processors, superscalar processors, VLIW processors, parallel array (systolic) processors, reconfigurable parallel array processors, and associative processors. Massively parallel processors, shared memory multiprocessors, clusters and other message-passing multiprocessors, and hardware multithreading. I/O systems organization, I/O processors, I/O channels, and I/O support for multiprocessors. Disk modelling, disk cache buffers, concurrent disks, clusters of independent disks, disk arrays, and redundancy in disk arrays. Bussing and I/O subsystems: disk and flash storage, designing an I/O system, interfacing I/O devices to processors, memory, and operating systems.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE311s	Computer Architecture										3 CH
Prerequisites	( CSE212s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Definition and terms of computer architectures: instruction sets, basic data types, and addressing modes. Memory hierarchy: cache basics, cache system performance, virtual memory. Conventional architectures, pipelined processors, superscalar processors, VLIW processors, parallel array (systolic) processors, reconfigurable parallel array processors, and associative processors. Massively parallel processors, shared memory multiprocessors, clusters and other message-passing multiprocessors, and hardware multithreading. I/O systems organization, I/O processors, I/O channels, and I/O support for multiprocessors. Disk modelling, disk cache buffers, concurrent disks, clusters of independent disks, disk arrays, and redundancy in disk arrays. Bussing and I/O subsystems: disk and flash storage, designing an I/O system, interfacing I/O devices to processors, memory, and operating systems.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4			7
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			0%			60%

CSE312	Electronic Design Automation										2 CH
Prerequisites	( CSE112 OR CSE212) AND CSE111
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			100			Equivalent ECTS			4
Course Content
Electronic Design Automation (EDA) : This course starts with introduction about electronic design automation, then it gives and overview about Semiconductor as the main driver for EDA industry & technologies. It demonstrates how the evolution of today’s IC-Chips complexity and size implies a huge requirements change on the EDA technologies and capabilities. The course starts with an overview about EDA tools, then illustrates the ASIC Flow from system level design to RTL description using HDL, RTL Verification, Synthesis logic optimization, netlist creation and design for testability (DFT/ATPGA). Then it provides some insights about backend design steps covering floor planning, place & route and finally physical verification such as design rule check (DRC), Layout vs Schematic (LVS) and mask data generation. The course gives deep insights about Verilog as a basic hardware description language for digital designs creation. The Verilog covers main building blocks of Verilog such as (Module, Port Mapping, Vectors, Logic Data Types, Numbers, Operators, Procedural Statement, Continuous Assignments, Blocking /Non-Blocking Statements, Sequential vs Combinational logic modeling, synchronous vs Asynchronous Design Concepts, Hierarchal Designs, Verilog procedural statements (Loops, Case, Conditional Statements), Verilog Tasks/Functions as well as Test-bench creation using Verilog concepts). Then the course demonstrates Functional Verification techniques such as simulation-based verification concepts (Test Stimulus Generation, Coverage Drive Verification, Assertion Based Verification), HW assisted Verification as well as Static Functional Verification techniques such as (Formal Based Verification and Static Design Checks). The course then moves to Logic Synthesis Step covering Synthesis Inputs, Synthesis Logic Optimization Techniques, Gate Level Netlist Creation as well as Design for Testability. Backend design steps such as Floor Planning, Place & Route and Physical Verification is Briefly Described to Complete ASIC Flow. This course demonstrates some SW Algorithms that are Heavily used in EDA flows such as (SAT for Constraint Solvers, BDD Optimization as well as ATPG).
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						3			5
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
25%			20%			10%			40%

CSE312s	Electronic Design Automation										2 CH
Prerequisites	( CSE112s OR CSE212s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			100			Equivalent ECTS			4
Course Content
Overview of electronic design automation (EDA): VLSI design and typical EDA flows, IC technology. Sequential design. HDL languages (VHDL/Verilog). Functional verification, Logic simulation: models, techniques, hardware acceleration.  Logic synthesis: ASIC synthesis, combinational logic minimization, technology mapping, timing analysis, timing optimization.  Design for testability: fault models, fault collapsing, fault-simulation, test generation, manufacturing tests, testability analysis, scan design, built-in self-test, test comparison. Physical synthesis, Floor-planning and placement: simulated annealing and analytical approaches. Routing: general-purpose, global, and detailed routing, clock and power/ground synthesis. Chip integration.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						3
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			10%			10%			60%

CSE313	Digital Systems Testing and Verification										2 CH
Prerequisites	( CSE212 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Cost and complexity of logic testing. Testing at different levels of abstraction. Faults, physical fault modelling, stuck-at fault models, single fault models, undetectable (masked) faults, fault equivalence/collapsing. Testability measures: controllability and observability. Combinational and sequential functional test. Exhaustive test. Sensitized path test. Test coverage evaluation. Test pattern generation, fault simulation. Design for Testability (DFT), Ad-hoc DFT. Scan design. Built-in Self-Test (BIST), linear feedback shift register (LFSR), Data compaction using LFSR, Pseudo Random Number Generation (PRNG). Boundary Scan/Joint Test Access Group (JTAG). Current test.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE313s	Digital Systems Testing and Verification										2 CH
Prerequisites	( CSE212s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
VLSI design flow: Specifications, Architectural design (scheduling, binding/allocation), RTL design, Verification, Logic synthesis, Physical layout (floor planning, placement and routing). Verification concepts: What to verify (functional verification, timing verification, performance verification), How to verify (simulation, emulation, formal verification, semi-formal verification, HW/SW coverification). Directed testing. Random testing. System Verilog: Data types, Arrays, Queuesm building score boards, User defined types, Tasks and functions, Time variables. Testbench design: Interfaces, Modports, Clocking blocks, Timing problems, Race conditions, Program blocks, Case study, Randomization, Constraints, Constrained random testing. Assertions: Immediate assertions, Concurrent assertions. Coverage: Code coverage, Functional coverage, Bug rate, Assertion coverage, Cover groups, Coverage bins, Sampling expressions, Cross coverage. UVM: UVM tests, UVM components, UVM environments, UVM transactions, UVM agents, UVM sequences, Verification career.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4			8
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			10%			10%			60%

CSE314	Parallel and Cluster Computing										2 CH
Prerequisites	( CSE112 OR CSE212 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Importance of parallel and cluster computing. Instruction Level Parallelism (ILP). Parallel computer architecture. Parallel Random-Access Machines (PRAM). Cluster computing and grid computing. Sequential and parallel execution. Synchronization. Principles of pipeline and vector processing. Overview of massively parallel and cluster computers, SIMD and MIMD machines. Network topology and interconnection networks. Routing (e-cube, hyper-switch, wormhole, virtual channels) and flow control. Dependability and scalability. Shared memory and cache coherence. Design of systolic array-based systems: dependence graph, system timing, projection and scheduling, data broadcasting, slicing, and pipelining. Load balancing. Performance of parallel and cluster computing systems. General overview of the architecture of the GPUs and the programming models of parallel and cluster computing environments. Applications.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						3
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE314s	Parallel and Cluster Computing										2 CH
Prerequisites	( CSE112s OR CSE212s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Importance of parallel and cluster computing. Instruction Level Parallelism (ILP). Parallel computer architecture. Parallel Random-Access Machines (PRAM). Cluster computing and grid computing. Sequential and parallel execution. Synchronization. Principles of pipeline and vector processing. Overview of massively parallel and cluster computers, SIMD and MIMD machines. Network topology and interconnection networks. Routing (e-cube, hyper-switch, wormhole, virtual channels) and flow control. Dependability and scalability. Shared memory and cache coherence. Design of systolic array-based systems: dependence graph, system timing, projection and scheduling, data broadcasting, slicing, and pipelining. Load balancing. Performance of parallel and cluster computing systems. General overview of the architecture of the GPUs and the programming models of parallel and cluster computing environments. Applications.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			10%			10%			60%

CSE411	Real-Time and Embedded Systems Design										3 CH
Prerequisites	( CSE211 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction: real-time system types, characteristics, and applications. Tasks, scheduling algorithms, and schedulability. Real-time system analysis. Real-time operating systems: shared resources management, concurrency, synchronization, real-time memory management. Developing embedded software, Memory maps and boot kernels, firmware, and ROM-resident system code. Timeline analysis and design. Design of embedded systems using real-time hardware and software components. Communicating, linking, interfacing, and processing techniques for embedded systems. Programming models: disciplines, methods, development. Machine instruction format and instruction timing. Interface between OS, ISA, and RTL layers of the virtual machine model. Interrupts, privilege states, and exception handling. Hardware interfacing and device driver programming. Algorithm analysis of embedded programs. Debugging live systems. Main challenges in the design, implementation, and validation of embedded systems. Secure coding practices. Code compression. Resource access protocols.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						3			8
Mechatronics Engineering and Automation						3			8
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
25%			20%			10%			40%

CSE411s	Real-Time and Embedded Systems Design										3 CH
Prerequisites	( CSE211s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction: real-time system types, characteristics, and applications. Tasks, scheduling algorithms, and schedulability. Real-time system analysis. Real-time operating systems: shared resources management, concurrency, synchronization, real-time memory management. Developing embedded software, Memory maps and boot kernels, firmware, and ROM-resident system code. Timeline analysis and design. Design of embedded systems using real-time hardware and software components. Communicating, linking, interfacing, and processing techniques for embedded systems. Programming models: disciplines, methods, development. Machine instruction format and instruction timing. Interface between OS, ISA, and RTL layers of the virtual machine model. Interrupts, privilege states, and exception handling. Hardware interfacing and device driver programming. Algorithm analysis of embedded programs. Debugging live systems. Main challenges in the design, implementation, and validation of embedded systems. Secure coding practices. Code compression. Resource access protocols.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						5			9
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE412	Embedded Operating Systems										3 CH
Prerequisites	( CSE411 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to embedded Linux. Architecture of embedded Linux: Linux kernel architecture, user space, start-up sequence. Board support: insertion in kernel build procedure, the boot loader interface, memory map, interrupt management, the PCI subsystem, timers, UART, power management. Embedded storage: flash map. MTD architecture, the flash-mapping drivers, MTD block and character devices, embedded file systems, optimizing storage space, tuning kernel memory. Embedded drivers: Linux serial driver, Ethernet driver, I2C subsystem on Linux, USB gadgets, watchdog timer, kernel modules. Porting applications: application porting roadmap, programming with P-threads, operating system porting layer (OSPL), kernel API driver. Real-Time Linux: real-time programming in Linux, hard real-Time Linux.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						5			9
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE412s	Embedded Operating Systems										3 CH
Prerequisites	( CSE411s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to embedded Linux. Architecture of embedded Linux: Linux kernel architecture, user space, start-up sequence. Board support: insertion in kernel build procedure, the boot loader interface, memory map, interrupt management, the PCI subsystem, timers, UART, power management. Embedded storage: flash map. MTD architecture, the flash-mapping drivers, MTD block and character devices, embedded file systems, optimizing storage space, tuning kernel memory. Embedded drivers: Linux serial driver, Ethernet driver, I2C subsystem on Linux, USB gadgets, watchdog timer, kernel modules. Porting applications: application porting roadmap, programming with P-threads, operating system porting layer (OSPL), kernel API driver. Real-Time Linux: real-time programming in Linux, hard real-Time Linux. Building and Introduction to embedded Linux. Architecture of embedded Linux: Linux kernel architecture, user space, start-up sequence. Board support: insertion in kernel build procedure, the boot loader interface, memory map, interrupt management, the PCI subsystem, timers, UART, power management. Embedded storage: flash map. MTD architecture, the flash-mapping drivers, MTD block and character devices, embedded file systems, optimizing storage space, tuning kernel memory. Embedded drivers: Linux serial driver, Ethernet driver, I2C subsystem on Linux, USB gadgets, watchdog timer, kernel modules. Porting applications: application porting roadmap, programming with P-threads, operating system porting layer (OSPL), kernel API driver. Real-Time Linux: real-time programming in Linux, hard real-Time Linux. Building and
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE413	Real-Time Operating Systems										2 CH
Prerequisites	( CSE411 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to embedded Linux. Architecture of embedded Linux: Linux kernel architecture, user space, start-up sequence. Board support: insertion in kernel build procedure, the boot loader interface, memory map, interrupt management, the PCI subsystem, timers, UART, power management. Embedded storage: flash map. MTD architecture, the flash-mapping drivers, MTD block and character devices, embedded file systems, optimizing storage space, tuning kernel memory. Embedded drivers: Linux serial driver, Ethernet driver, I2C subsystem on Linux, USB gadgets, watchdog timer, kernel modules. Porting applications: application porting roadmap, programming with P-threads, operating system porting layer (OSPL), kernel API driver. Real-Time Linux: real-time programming in Linux, hard real-Time Linux. Building and Introduction to embedded Linux. Architecture of embedded Linux: Linux kernel architecture, user space, start-up sequence. Board support: insertion in kernel build procedure, the boot loader interface, memory map, interrupt management, the PCI subsystem, timers, UART, power management. Embedded storage: flash map. MTD architecture, the flash-mapping drivers, MTD block and character devices, embedded file systems, optimizing storage space, tuning kernel memory. Embedded drivers: Linux serial driver, Ethernet driver, I2C subsystem on Linux, USB gadgets, watchdog timer, kernel modules. Porting applications: application porting roadmap, programming with P-threads, operating system porting layer (OSPL), kernel API driver. Real-Time Linux: real-time programming in Linux, hard real-Time Linux.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE413s	Real-Time Operating Systems										2 CH
Prerequisites	( CSE411s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to embedded Linux. Architecture of embedded Linux: Linux kernel architecture, user space, start-up sequence. Board support: insertion in kernel build procedure, the boot loader interface, memory map, interrupt management, the PCI subsystem, timers, UART, power management. Embedded storage: flash map. MTD architecture, the flash-mapping drivers, MTD block and character devices, embedded file systems, optimizing storage space, tuning kernel memory. Embedded drivers: Linux serial driver, Ethernet driver, I2C subsystem on Linux, USB gadgets, watchdog timer, kernel modules. Porting applications: application porting roadmap, programming with P-threads, operating system porting layer (OSPL), kernel API driver. Real-Time Linux: real-time programming in Linux, hard real-Time Linux. Building and Introduction to embedded Linux. Architecture of embedded Linux: Linux kernel architecture, user space, start-up sequence. Board support: insertion in kernel build procedure, the boot loader interface, memory map, interrupt management, the PCI subsystem, timers, UART, power management. Embedded storage: flash map. MTD architecture, the flash-mapping drivers, MTD block and character devices, embedded file systems, optimizing storage space, tuning kernel memory. Embedded drivers: Linux serial driver, Ethernet driver, I2C subsystem on Linux, USB gadgets, watchdog timer, kernel modules. Porting applications: application porting roadmap, programming with P-threads, operating system porting layer (OSPL), kernel API driver. Real-Time Linux: real-time programming in Linux, hard real-Time Linux.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE414	Digital VLSI Systems										2 CH
Prerequisites	( CSE212 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to VLSI technology. CMOS Technology. VLSI Design Techniques, Transistors, wires and vias, layout design, SPICE simulation static complementary gates, switch logic, delay and timing, standard cell based layout, fan-out, Path delay, delay modelling, power analysis, latches and flip-flop layout, clock disciplines, clock skew, ROM, Static RAM, Dynamic RAM, Flash memory, FPGA, Floor planning, power distribution, clock distribution, Hardware description language, Digital Circuit simulation, and synthesis using hardware description languages. Digital Circuit testing, Formal verification.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE414s	Digital VLSI Systems										2 CH
Prerequisites	( CSE212s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to VLSI technology. CMOS Technology. VLSI Design Techniques, Transistors, wires and vias, layout design, SPICE simulation static complementary gates, switch logic, delay and timing, standard cell based layout, fan-out, Path delay, delay modelling, power analysis, latches and flip-flop layout, clock disciplines, clock skew, ROM, Static RAM, Dynamic RAM, Flash memory, FPGA, Floor planning, power distribution, clock distribution, Hardware description language, Digital Circuit simulation, and synthesis using hardware description languages. Digital Circuit testing, Formal verification.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			10%			10%			60%

CSE415	Fault Tolerant Computing										2 CH
Prerequisites	( CSE212 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Origins, goals, and applications of fault-tolerant computing. Defining faults, errors, and failures. Causes, characteristics, and models of faults. Logical and physical stuck-fault models. Design philosophies to combat faults. Error models. Design techniques to achieve fault tolerance: the concept of redundancy, hardware redundancy, information redundancy, time redundancy, and software redundancy. Evaluation techniques: quantitative methods, reliability, safety, availability, and maintainability modelling, system comparisons, and redundancy ratios. The design of practical fault-tolerant systems: the design process, the use of fault avoidance in the design process, long-life applications, critical-computation applications, and high-availability applications. Fault-tolerant design of VLSI circuits and systems.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE415s	Fault Tolerant Computing										2 CH
Prerequisites	( CSE212s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Origins, goals, and applications of fault-tolerant computing. Defining faults, errors, and failures. Causes, characteristics, and models of faults. Logical and physical stuck-fault models. Design philosophies to combat faults. Error models. Design techniques to achieve fault tolerance: the concept of redundancy, hardware redundancy, information redundancy, time redundancy, and software redundancy. Evaluation techniques: quantitative methods, reliability, safety, availability, and maintainability modelling, system comparisons, and redundancy ratios. The design of practical fault-tolerant systems: the design process, the use of fault avoidance in the design process, long-life applications, critical-computation applications, and high-availability applications. Fault-tolerant design of VLSI circuits and systems.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4
General Electrical Engineering						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			10%			10%			60%

CSE416	Selected Topics in Computer Design										2 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Selected topics in recent developments in computer hardware design will be presented in this course. Course material will reflect the needs of the graduating students
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE416s	Selected Topics in Computer Design										2 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Selected topics in recent developments in computer hardware design will be presented in this course. Course material will reflect the needs of the graduating students
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			10%			10%			60%

CSE031	Computing in Engineering										2 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				0 Hours				0 Hours
Required SWL			100			Equivalent ECTS			4
Course Content
This introductory course in emerging technologies lays out the principles of big data, cloud computing, distributed computing, OS, IoT, content delivery network, Network Protocols, Wireless Network protocol, digital wireless telephony technologies, Internet operations, processors and storage technologies, Embedded Systems, augmented reality), virtual reality, the impact of technology on society. The course covers also computational thinking, problem solving, Abstraction, Problems Analysis, 3G/4G/5G, LTE, IPv4, IPv6.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Freshmen Level						1			1
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
30%			25%			0%			40%

CSE031s	Computing in Engineering										2 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				0 Hours				0 Hours
Required SWL			100			Equivalent ECTS			4
Course Content
This introductory course in emerging technologies lays out the principles of big data, cloud computing, distributed computing, OS, IoT, content delivery network, Network Protocols, Wireless Network protocol, digital wireless telephony technologies, Internet operations, processors and storage technologies, Embedded Systems, augmented reality), virtual reality, the impact of technology on society. The course covers also computational thinking, problem solving, Abstraction, Problems Analysis, 3G/4G/5G, LTE, IPv4, IPv6.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Freshmen Level						1			1
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			0%			60%

CSE131	Computer Programming										3 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				0 Hours				2 Hours
Required SWL			150			Equivalent ECTS			6
Course Content
Basic programming concepts using one of the modern general-purpose programming languages. Data types, expressions, mathematical and logical operators, mathematical functions, conditions, decisions, loops, arrays, multi-dimensional arrays, strings, functions, function-call mechanisms, recursive functions, parameter passing, enumerations, addresses, pointers/references, pointers to pointers, pointers to functions, program memory segments, dynamic allocations, basic input/output, streams and files, exception handling, and static and dynamic libraries.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						2			3
Communication Systems Engineering						2			4
Mechatronics Engineering and Automation						2			4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
25%			20%			10%			40%

CSE131s	Computer Programming										3 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				0 Hours				2 Hours
Required SWL			150			Equivalent ECTS			6
Course Content
Basic programming concepts using one of the modern general-purpose programming languages. Data types, expressions, mathematical and logical operators, mathematical functions, conditions, decisions, loops, arrays, multi-dimensional arrays, strings, functions, function-call mechanisms, recursive functions, parameter passing, enumerations, addresses, pointers/references, pointers to pointers, pointers to functions, program memory segments, dynamic allocations, basic input/output, streams and files, exception handling, and static and dynamic libraries.
Used in Program / Level
Program Name or requirement						Study Level			Semester
General Electrical Engineering						2			4
Mechatronics Engineering						3			5
Automotive Engineering						4			7
Electrical Power and Machines Engineering						3			5
Electronics and Communications Engineering						3			5
Computer and Systems Engineering						3			5
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE231	Advanced Computer Programming										3 CH
Prerequisites	( CSE131 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				0 Hours				2 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Structured and object-oriented programming paradigms. Classes. Objects. Methods. Interfaces. Polymorphism. Inheritance. Data hiding. Constructors. Destructors. Access specifiers. Operator-overloading. Function overloading. Virtual functions. Friend functions. Abstract classes. Implementation of dynamic data structures. Template functions and classes. Graphical User Interface programming. Graphics. Event-driven programming. Concurrency and multi-threaded programming.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						2			4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
25%			20%			10%			40%

CSE231s	Advanced Computer Programming										3 CH
Prerequisites	( CSE131s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				0 Hours				2 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Structured and object-oriented programming paradigms. Classes. Objects. Methods. Interfaces. Polymorphism. Inheritance. Data hiding. Constructors. Destructors. Access specifiers. Operator-overloading. Function overloading. Virtual functions. Friend functions. Abstract classes. Implementation of dynamic data structures. Template functions and classes. Graphical User Interface programming. Graphics. Event-driven programming. Concurrency and multi-threaded programming.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						2			6
Mechatronics Engineering						2
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE232	Advanced Software Engineering										3 CH
Prerequisites	( CSE334 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Differences between structured and object-oriented paradigms. The Unified Modelling Language (UML). Use-case modelling. Class modelling: noun extraction, Class-Responsibility-Collaboration (CRC) cards. Dynamic modelling. State diagrams. Testing during the object-oriented analysis phase. CASE tools for object-oriented analysis and design. Object-oriented design: interaction diagram, detailed class diagram, clients of objects, detailed design and program description languages.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						2			5
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
35%			20%			0%			40%

CSE232s	Advanced Software Engineering										3 CH
Prerequisites	( CSE334s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Differences between structured and object-oriented paradigms. The Unified Modelling Language (UML). Use-case modelling. Class modelling: noun extraction, Class-Responsibility-Collaboration (CRC) cards. Dynamic modelling. State diagrams. Testing during the object-oriented analysis phase. CASE tools for object-oriented analysis and design. Object-oriented design: interaction diagram, detailed class diagram, clients of objects, detailed design and program description languages.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
40%			20%			0%			40%

CSE233	Agile Software Engineering										2 CH
Prerequisites	( CSE232 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
1 Hour				0 Hours				4 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Agile versus other traditional software models such as waterfall, incremental, reuse-oriented software. Principles of Agile, the people involved, ethics in Agile teams, organizational culture and agile distributed teams. The manifesto and concepts of the most popular methodology Scrum. Using JIRA as a platform of scrum. The meaning of Cynefin Framework. The roles of product owner, scrum master, product manager, and development team. Details on seven activities of scrum practices. Product backlog vs. sprint backlog. Multilevel planning in Scrum. Requirements and user stories. Estimating user stories points, velocity of the scrum team. Technical debt and team structures. Transition to an Agile software development environment. Other Agile methodologies such as extreme programming, Kanban, and Lean. Introduction to Agile testing.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						3			7
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE233s	Agile Software Engineering										2 CH
Prerequisites	( CSE232s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
1 Hour				0 Hours				4 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Agile versus waterfall model. Principles of Agile, the people involved, ethics in Agile teams, organizational culture and agile distributed teams. Product manager versus product owner, product backlog versus sprint backlog. Agile reports, Agile planning, time management of Agile projects, Agile solution providers, problems with Agile, Agile testing and quality assurance, transition to an Agile software development environment, applying an Agile process to a transition process, application of Agile principles in non-software projects.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE331	Data Structures and Algorithms										3 CH
Prerequisites	( CSE231 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Algorithms: definitions, correctness, efficiency. Complexity analysis: The big O-notation, the theta-notation, and the Omega-notation. Elementary data structures: linked lists; (single, double, and circular), stacks, queues, and priority queues. Recursion: tail recursion, indirect recursion, non-tail recursion, nested recursion, and excessive recursion. Trees: binary and search trees and tree operations (insertion, deletion, and balancing). Multiway trees: B-tree, B*-tree, B+-tree, R-tree. Graphs. Sorting algorithms: insertion, selection, bubble, merge, quick, and radix. Comparison between sort algorithm using complexity analysis notations.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						2			5
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
25%			20%			10%			40%

CSE331s	Data Structures and Algorithms										3 CH
Prerequisites	( CSE231s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Algorithms: definitions, correctness, efficiency. Complexity analysis: The big O-notation, the theta-notation, and the Omega-notation. Elementary data structures: linked lists; (single, double, and circular), stacks, queues, and priority queues. Recursion: tail recursion, indirect recursion, non-tail recursion, nested recursion, and excessive recursion. Trees: binary and search trees and tree operations (insertion, deletion, and balancing). Multiway trees: B-tree, B*-tree, B+-tree, R-tree. Graphs. Sorting algorithms: insertion, selection, bubble, merge, quick, and radix. Comparison between sort algorithm using complexity analysis notations.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4			7
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE332	Design and Analysis of Algorithms										3 CH
Prerequisites	( CSE331 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Fundamental techniques for designing and analysing algorithms. Asymptotic analysis. Divide-and-conquer algorithms. Recurrences. Merge sort. Linear-time median. Greedy algorithms. Quick-sort algorithm. Dynamic programming. Graph algorithms. Graph search and Dijkstra’s algorithm. Minimum Spanning Trees. Randomized algorithms. Hashing.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						2			6
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
35%			20%			0%			40%

CSE332s	Design and Analysis of Algorithms										3 CH
Prerequisites	( CSE331s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Fundamental techniques for designing and analysing algorithms. Asymptotic analysis. Divide-and-conquer algorithms. Recurrences. Merge sort. Linear-time median. Greedy algorithms. Quick-sort algorithm. Dynamic programming. Graph algorithms. Graph search and Dijkstra’s algorithm. Minimum Spanning Trees. Randomized algorithms. Hashing.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						3			8
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			10%			10%			60%

CSE333	Database Systems										3 CH
Prerequisites	( CSE331 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to database systems. Architecture for a database system. Relational model: Domain, relations, and relational integrity. SQL. The relational database language standard: data definition language, data manipulation language, aggregate functions, views, database modification, database management system and examples such as Oracle and Access. Database design theory and methodology Entity/Relationship model (ERM) and enhanced Entity/Relationship model (EERM). Normalization for relational database.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						2			6
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
25%			20%			10%			40%

CSE333s	Database Systems										3 CH
Prerequisites	( CSE331s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to database systems. Architecture for a database system. Relational model: Domain, relations, and relational integrity. SQL. The relational database language standard: data definition language, data manipulation language, aggregate functions, views, database modification, database management system and examples such as Oracle and Access. Database design theory and methodology Entity/Relationship model (ERM) and enhanced Entity/Relationship model (EERM). Normalization for relational database.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE334	Software Engineering										3 CH
Prerequisites	( CSE131 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Fundamental concepts of software engineering. Software processes life-cycle. Software requirements: functional requirements, non-functional requirements. Requirements modelling: flow, behaviour, patterns, and web applications. Requirements analysis. Scenario-based modelling. UML modelling. Data modelling. Class-based modelling. Software Requirements Specification (SRS) document. Requirements negotiations. Requirements validation. Use-case representations of requirements. CASE tools for software engineering. Software process models: waterfall model, spiral model, extreme programming model, and evolutionary model. Introduction to software design.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						1			4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
35%			20%			0%			40%

CSE334s	Software Engineering										3 CH
Prerequisites	( CSE131s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Fundamental concepts of software engineering. Software processes life-cycle. Software requirements: functional requirements, non-functional requirements. Requirements modelling: flow, behaviour, patterns, and web applications. Requirements analysis. Scenario-based modelling. UML modelling. Data modelling. Class-based modelling. Software Requirements Specification (SRS) document. Requirements negotiations. Requirements validation. Use-case representations of requirements. CASE tools for software engineering. Software process models: waterfall model, spiral model, extreme programming model, and evolutionary model. Introduction to software design.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						3			8
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			0%			60%

CSE335	Operating Systems										3 CH
Prerequisites	( CSE112 OR CSE212 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Operating system structures and services. System calls. Process management. Inter-process communication. Threads and multithreading models. CPU scheduling. Scheduling algorithms. Process synchronization. Deadlocks. Memory management. Virtual memory. File systems. Emphasis on a typical operating system as a case study.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						2			5
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
35%			20%			0%			40%

CSE335s	Operating Systems										3 CH
Prerequisites	( CSE112s OR CSE212s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Operating system structures and services. System calls. Process management. Inter-process communication. Threads and multithreading models. CPU scheduling. Scheduling algorithms. Process synchronization. Deadlocks. Memory management. Virtual memory. File systems. Emphasis on a typical operating system as a case study.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4			7
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			0%			60%

CSE336	Software Design Patterns										2 CH
Prerequisites	( CSE231 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Importance of software reusability. Software patterns and how to detect them. Pattern-based development. The observer pattern. The template method pattern. Factory patterns. The singleton pattern. The iterator pattern. The composite pattern. The facade pattern. The state and strategy patterns. Functions and the command pattern. The adapter pattern. The proxy pattern. The decorator pattern. The chain of responsibility pattern. The visitor pattern. Software design patterns in software reengineering. Searching for patterns in existing software.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						5			9
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
25%			20%			10%			40%

CSE336s	Software Design Patterns										2 CH
Prerequisites	( CSE231s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Importance of software reusability. Software patterns and how to detect them. Pattern-based development. The observer pattern. The template method pattern. Factory patterns. The singleton pattern. The iterator pattern. The composite pattern. The facade pattern. The state and strategy patterns. Functions and the command pattern. The adapter pattern. The proxy pattern. The decorator pattern. The chain of responsibility pattern. The visitor pattern. Software design patterns in software reengineering. Searching for patterns in existing software.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4			7
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE337	Software Testing										2 CH
Prerequisites	( CSE231 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Testing requirements, plans, measures. Risk management. Testing lifecycle. Software quality process. Capability Maturity Model (CMM). Testing techniques. Test cases. Inspection process. Testing waterfall model: static testing of requirements, testing checklist, logical, physical, and unit design testing, static and dynamic testing of code. Non-functional testing. CASE tools in testing.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE337s	Software Testing										2 CH
Prerequisites	( CSE231s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Testing requirements, plans, measures. Risk management. Testing lifecycle. Software quality process. Capability Maturity Model (CMM). Testing techniques. Test cases. Inspection process. Testing waterfall model: static testing of requirements, testing checklist, logical, physical, and unit design testing, static and dynamic testing of code. Non-functional testing. CASE tools in testing.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4			8
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE338	Software Testing, Validation, and Verification										3 CH
Prerequisites	( CSE232 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Testing, Verification, and Validation (V&V) requirements, plans, measures. Risk management. V&V life-cycle. V&V and UML. V&V of the quality of MOPS, MOSS, and MOBS. Software quality process. Capability Maturity Model (CMM). Testing techniques. Test cases. Inspection process. Testing waterfall model: static testing of requirements, testing checklist, logical, physical, and unit design testing, static and dynamic testing of code. Non-functional testing. CASE tools in testing.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						3			6
Computer Engineering and Software Systems						1
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE338s	Software Testing, Validation, and Verification										3 CH
Prerequisites	( CSE232s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Testing, Verification, and Validation (V&V) requirements, plans, measures. Risk management. V&V life-cycle. V&V and UML. V&V of the quality of MOPS, MOSS, and MOBS. Software quality process. Capability Maturity Model (CMM). Testing techniques. Test cases. Inspection process. Testing waterfall model: static testing of requirements, testing checklist, logical, physical, and unit design testing, static and dynamic testing of code. Non-functional testing. CASE tools in testing.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE339	Software Formal Specifications										2 CH
Prerequisites	( CSE334 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Mathematical fundamentals. Z scheme. State-based approaches. Event-based approaches. B machines. Algebraic specifications. Petri nets. Temporal logic. Properties of programs. Computational Tree Logic (CTL). Specification. Verification. Model checking.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						3
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE339s	Software Formal Specifications										2 CH
Prerequisites	( CSE334s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Mathematical fundamentals. Z scheme. State-based approaches. Event-based approaches. B machines. Algebraic specifications. Petri nets. Temporal logic. Properties of programs. Computational Tree Logic (CTL). Specification. Verification. Model checking.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE341	Internet Programming										3 CH
Prerequisites	( CSE231 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				2 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction: web servers, the client-server paradigm, web programming models. Static HTML pages. Style sheets. Dynamic pages. Client-side scripting. Server-side programming. Database sever access. The Model-View-Controller (MVC) architecture. Web services. Interactive dynamic pages. Web hosting and web application deployment.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						3			8
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE341s	Internet Programming										3 CH
Prerequisites	( CSE231s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				2 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction: web servers, the client-server paradigm, web programming models. Static HTML pages. Style sheets. Dynamic pages. Client-side scripting. Server-side programming. Database sever access. The Model-View-Controller (MVC) architecture. Web services. Interactive dynamic pages. Web hosting and web application deployment.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE342	Program Analysis										2 CH
Prerequisites	( CSE338 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. First-order logic. Implication. Tableaux. Proofs. Deduction. Dataflow analysis. Abstract interpretation. Symbolic execution. Pointer. Control-flow analysis. Inter-procedural analysis. Model checking. Dynamic analysis. Efficient data structures and program representations for analysis
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						3
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE342s	Program Analysis										2 CH
Prerequisites	( CSE231s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. First-order logic. Implication. Tableaux. Proofs. Deduction. Dataflow analysis. Abstract interpretation. Symbolic execution. Pointer. Control-flow analysis. Inter-procedural analysis. Model checking. Dynamic analysis. Efficient data structures and program representations for analysis
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE343	Software Engineering Process Management										2 CH
Prerequisites	( CSE232 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Integrated approach to manage development within small teams; including mission statement, synthesis of design concepts, trade-off studies, risk assessment and the interactions encountered in the optimal design, development, manufacture and test of systems.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						3
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE343s	Software Engineering Process Management										2 CH
Prerequisites	( CSE232s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Integrated approach to manage development within small teams; including mission statement, synthesis of design concepts, trade-off studies, risk assessment and the interactions encountered in the optimal design, development, manufacture and test of systems.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE344	Dependability and Reliability of Software Systems										2 CH
Prerequisites	( CSE232 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Factors affecting software quality. Software reliability engineering, Software reliability engineering process. Single failure model. Reliability growth model. Weibull and Gamma failure class models. Early life-cycle prediction models. Serial and parallel system reliability. Active redundancy. Reliability Block Diagram (RBD). Hazard analysis. Failure Modes and Effect Analysis (FMEA). Fault Tree Analysis (FTA). Software fault tolerance: redundancy, design methods, programming techniques. Failure severity. Occurrence probabilities. Code predictability, reliability, and dependability. Simulation and reliability growth tools: SMERFS, SRMP, SoftRel, CASRE.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						3
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE344s	Dependability and Reliability of Software Systems										2 CH
Prerequisites	( CSE232s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Factors affecting software quality. Software reliability engineering, Software reliability engineering process. Single failure model. Reliability growth model. Weibull and Gamma failure class models. Early life-cycle prediction models. Serial and parallel system reliability. Active redundancy. Reliability Block Diagram (RBD). Hazard analysis. Failure Modes and Effect Analysis (FMEA). Fault Tree Analysis (FTA). Software fault tolerance: redundancy, design methods, programming techniques. Failure severity. Occurrence probabilities. Code predictability, reliability, and dependability. Simulation and reliability growth tools: SMERFS, SRMP, SoftRel, CASRE.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE345	Business Process Modeling										2 CH
Prerequisites	( CSE232 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
The purpose and benefits of Business Process Modelling. The role of process modelling. Process modelling steps and ingredients that are necessary for success. Process boundaries. Modelling techniques to represent existing processes. Modelling processes patterns. Effectiveness of the processes. Modelling of new, improved processes. Measuring the success of business processes. Communicating process models.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						3
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE345s	Business Process Modeling										2 CH
Prerequisites	( CSE232s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
The purpose and benefits of Business Process Modelling. The role of process modelling. Process modelling steps and ingredients that are necessary for success. Process boundaries. Modelling techniques to represent existing processes. Modelling processes patterns. Effectiveness of the processes. Modelling of new, improved processes. Measuring the success of business processes. Communicating process models.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE346	Advanced Database Systems										2 CH
Prerequisites	( CSE333 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Query processing and optimization. Database tuning. Transaction processing. Concurrency control. Database recovery. Object databases: standards, languages, and design. Object-relational databases. Database security. Distributed database systems: architecture, data fragmentation, distributed read/update transparency, access primitives, integrity constraints, distributed database design, queries, optimization, concurrency, and reliability control. XML, semi-structured, federated, and Internet databases. Data warehousing. Introduction to data mining.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						3
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
25%			20%			10%			40%

CSE346s	Advanced Database Systems										2 CH
Prerequisites	( CSE333s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Query processing and optimization. Database tuning. Transaction processing. Concurrency control. Database recovery. Object databases: standards, languages, and design. Object-relational databases. Database security. Distributed database systems: architecture, data fragmentation, distributed read/update transparency, access primitives, integrity constrains, distributed database design, queries, optimization, concurrency and reliability control. XML, semi-structured, federated, and Internet databases. Data warehousing. Introduction to data mining.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						5			9
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE431	Mobile Programming										3 CH
Prerequisites	( CSE341 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				2 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Mobile operating systems (Windows mobile, iOS, Android, Blackberry ... etc.), mobile databases, client-server agents, application servers, mobile Internet. Mobile applications: context, design, information architecture, development, testing, maintenance, mobile web versus native applications. Development environments. Programming languages and SDKs for mobile application development. Location management. Location-based services. Context-aware mobile programming. Mobile-agent middleware. Caching strategies in mobile environments. Mobile VoIP applications. Fault tolerance and security in mobile environments.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						5			9
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE431s	Mobile Programming										3 CH
Prerequisites	( CSE341s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				2 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Mobile operating systems (Windows mobile, iOS, Android, Blackberry ... etc.), mobile databases, client-server agents, application servers, mobile Internet. Mobile applications: context, design, information architecture, development, testing, maintenance, mobile web versus native applications. Development environments. Programming languages and SDKs for mobile application development. Location management. Location-based services. Context-aware mobile programming. Mobile-agent middleware. Caching strategies in mobile environments. Mobile VoIP applications. Fault tolerance and security in mobile environments.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE432	Automata and Computability										3 CH
Prerequisites	( CSE332 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Fundamental concepts in automata theory and formal languages including grammar, deterministic and nondeterministic finite automata, regular expression, formal language, pushdown automaton, Turing machines, the halting problem, diagonalization and reduction, decidability, Rice’s theorem, P, NP, and NP-completeness.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4			8
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
35%			20%			0%			40%

CSE432s	Automata and Computability										3 CH
Prerequisites	( CSE332s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Fundamental concepts in automata theory and formal languages including grammar, deterministic and nondeterministic finite automata, regular expression, formal language, pushdown automaton, Turing machines, the halting problem, diagonalization and reduction, decidability, Rice’s theorem, P, NP, and NP-completeness.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
40%			20%			0%			40%

CSE433	Software Performance Evaluation										3 CH
Prerequisites	( CSE232 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Software metrics: progress, effort, cost, training. Requirements stability. Size stability. Computer resources utilization. Reliability. Openness. Operability. Upgradeability. Usability. Performance analysis. Testing and tuning techniques. Evaluating software scalability. Capacity planning methodologies. Issues related to safety, security, and availability of software. Software performance analysis tools. Static analysis tools. Dynamic analysis tools. Hybrid analysis tools.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						5			9
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE433s	Software Performance Evaluation										3 CH
Prerequisites	( CSE232s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Software metrics: progress, effort, cost, training. Requirements stability. Size stability. Computer resources utilization. Reliability. Openness. Operability. Upgradeability. Usability. Performance analysis. Testing and tuning techniques. Evaluating software scalability. Capacity planning methodologies. Issues related to safety, security, and availability of software. Software performance analysis tools. Static analysis tools. Dynamic analysis tools. Hybrid analysis tools.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE434	Aspect- and Service-Oriented Software Systems										3 CH
Prerequisites	( CSE232 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Aspect-Oriented Software, cross-cutting concerns. Nature of aspect-oriented programming, Aspect-oriented requirements engineering, Aspect-oriented system architecture, Aspect-oriented modelling and design, Aspect-Oriented Programming (AOP), Formal method support for aspect-orientation, Aspect-oriented middleware. Service-Oriented Architecture (SOA), Service-Oriented Software Engineering (SOSE), Service-oriented interaction, Service-oriented analysis and design, service-oriented modelling, Separation of concerns, Service-Oriented Software Examples and Case Studies.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE434s	Aspect- and Service-Oriented Software Systems										3 CH
Prerequisites	( CSE232s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Aspect-Oriented Software, cross-cutting concerns. Nature of aspect-oriented programming, Aspect-oriented requirements engineering, Aspect-oriented system architecture, Aspect-oriented modelling and design, Aspect-Oriented Programming (AOP), Formal method support for aspect-orientation, Aspect-oriented middleware. Service-Oriented Architecture (SOA), Service-Oriented Software Engineering (SOSE), Service-oriented interaction, Service-oriented analysis and design, service-oriented modelling, Separation of concerns, Service-Oriented Software Examples and Case Studies.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE435	Secure Code Development										3 CH
Prerequisites	( CSE231 ) AND ( CSE451 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Secure code development principles. Best practices. Security strategies and controls. Malicious code and defensive techniques. Code review and testing. Security documentation and error messages. Secure coding techniques. Access control. Input validation. Threat identifications and modelling. Vulnerability analysis. Automated code analysis. Risk assessment. Secure code development life-cycle: development, maintenance, and refinement. Knowledge catalogue: principles, guidelines, vulnerabilities, attack patterns, and historical risks. Coding errors. Breaking software. Web-applications threats and vulnerabilities.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4
Computer Engineering and Software Systems						5			10
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE435s	Secure Code Development										3 CH
Prerequisites	( CSE231s ) AND ( CSE451s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Secure code development principles. Best practices. Security strategies and controls. Malicious code and defensive techniques. Code review and testing. Security documentation and error messages. Secure coding techniques. Access control. Input validation. Threat identifications and modelling. Vulnerability analysis. Automated code analysis. Risk assessment. Secure code development life-cycle: development, maintenance, and refinement. Knowledge catalogue: principles, guidelines, vulnerabilities, attack patterns, and historical risks. Coding errors. Breaking software. Web-applications threats and vulnerabilities.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE436	Software Quality Assurance										3 CH
Prerequisites	( CSE232 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Integrity and effectiveness of software development processes, Basics of SQA. Techniques and processes for SQA. Software quality assurance plan. Software quality assurance team. Inspections. Product reviews. Walk-throughs and audits. Software quality metrics. Quality assurance in agile, iterative, and incremental development environments. Risk analysis and resolution. Costs associated with quality. Various effective (SQA) guidelines and standards. Software testing. Test Strategies. CMM, CMMI, ISO standards.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE436s	Software Quality Assurance										3 CH
Prerequisites	( CSE232s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Integrity and effectiveness of software development processes, Basics of SQA. Techniques and processes for SQA. Software quality assurance plan. Software quality assurance team. Inspections. Product reviews. Walk-throughs and audits. Software quality metrics. Quality assurance in agile, iterative, and incremental development environments. Risk analysis and resolution. Costs associated with quality. Various effective (SQA) guidelines and standards. Software testing. Test Strategies. CMM, CMMI, ISO standards.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE437	Selected Topics in Software										2 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Selected topics in recent developments in computer software will be presented in this course. Course material will reflect the needs of the graduating students
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE437s	Selected Topics in Software										2 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Selected topics in recent developments in computer software will be presented in this course. Course material will reflect the needs of the graduating students
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			10%			10%			60%

CSE438	Selected Topics in Software Product Lines										3 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Selected topics in recent directions in software product lines will be presented in this course.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE438s	Selected Topics in Software Product Lines										3 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Selected topics in recent directions in software product lines will be presented in this course.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE439	Design of Compilers										3 CH
Prerequisites	( CSE131 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Fundamental concepts in automata theory and formal languages including grammar, deterministic and nondeterministic finite automata, regular expression, formal language, pushdown automaton, Turing machines, the halting problem, diagonalization and reduction, decidability, Rice’s theorem, P, NP, and NP-completeness. Systems software, compilers, interpreters. Byte-codes. Lexical analysis: interface with input, parser and symbol table, token, lexeme and patterns. Syntax analysis: context-free grammars, ambiguity, precedence, top-down parsing, recursive descent parsing, transformation on the grammars, predictive parsing. Bottom up parsing, operator precedence grammars, LR parsers. Regular expressions and semantics. Error detection, type-checking and run-time environments. Code generation, code optimizations, code improvement techniques.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						3			6
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
35%			20%			0%			40%

CSE439s	Design of Compilers										3 CH
Prerequisites	( CSE131s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Fundamental concepts in automata theory and formal languages including grammar, deterministic and nondeterministic finite automata, regular expression, formal language, Systems software, compilers, interpreters. Lexical analysis: interface with input, parser and symbol table, token, lexeme and patterns. Syntax analysis: context-free grammars, ambiguity, precedence, top-down parsing, recursive descent parsing, transformation on the grammars, predictive parsing. Bottom up parsing, operator precedence grammars, LR parsers. Regular expressions and semantics.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						5			9
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			0%			60%

CSE441	Software Project Management										2 CH
Prerequisites	( CSE334 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				0 Hours
Required SWL			100			Equivalent ECTS			4
Course Content
The course introduces the methodologies and techniques for software project management both traditional and agile, this also includes scope, effort, risk estimation, plus scheduling and communication management of stakeholders. The course also includes several techniques and the student is introduced to different PM tools.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems									9
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
35%			20%			0%			40%

CSE441s	Software Project Management										2 CH
Prerequisites	( CSE334s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				0 Hours
Required SWL			100			Equivalent ECTS			4
Course Content
The course introduces the methodologies and techniques for software project management both traditional and agile, this also includes scope, effort, risk estimation, plus scheduling and communication management of stakeholders. The course also includes several techniques and the student is introduced to different PM tools.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						5			9
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			0%			60%

CSE351	Computer Networks										3 CH
Prerequisites	(ECE252)
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
This course reflects the latest essential networking technologies with emphasis on wireless networking, including 802.11, 802.16, Bluetooth, and 3G/4G cellular, paired with fixed-network coverage of ADSL, Internet over cable, gigabit Ethernet, MLPS, and peer-to-peer networks, Fiber to the Home, RIFD, delay-tolerant networks, in addition to Internet routing, multicasting, congestion control, quality of service, real-time transport, and content distribution. Typically, a description is provided for the inner facets of Computer Networks, exploring their functionality from underlying hardware up to applications, in the following order: •    Physical layer (e.g., copper, fibre, wireless, satellites, and Internet over cable) •    Data link layer (e.g., protocol principles, protocol verification, HDLC, and PPP) •    MAC Sublayer (e.g., gigabit Ethernet, 802.11, broadband wireless, and switching) •    Network layer (e.g., routing algorithms, congestion control, QoS, IPv4, and IPv6) •    Transport layer (e.g., socket programming, UDP, TCP, RTP, and network performance) •    Application layer (e.g., e-mail, the Web, PHP, wireless Web, MP3, and streaming audio) The course dissects and depicts the principles associated with each layer then translates them through examples from networking, Internet, wireless networks, and software defined networks.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						3			7
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
35%			20%			0%			40%

CSE351s	Computer Networks										3 CH
Prerequisites	(ECE252s)
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
This course reflects the basic and essential networking technologies covering how different networks work, in addition to Internet routing, multicasting, congestion control, quality of service, real-time transport, and content distribution. Typically, a description is provided for the inner facets of Computer Networks, exploring their functionality from underlying hardware up to applications: Physical layer (e.g., copper, fiber, wireless, satellites, and Internet over cable) Data link layer (e.g., protocol principles, protocol verification, HDLC, and PPP) MAC Sublayer (e.g., gigabit Ethernet, 802.11, broadband wireless, and switching) Network layer (e.g., routing algorithms, congestion control, QoS, IPv4, and IPv6) Transport layer (e.g., UDP, TCP, RTP, and network performance) Application layer (e.g., e-mail, the Web, PHP, wireless Web, MP3, socket programming, and streaming audio) The course dissects and depicts the principles associated with each layer then translates them through examples from networking, Internet, wireless networks, and software defined networks.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4			7
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			0%			60%

CSE352	Parallel and Distributed Systems										3 CH
Prerequisites	( CSE351 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Motivations for parallel programming. Instruction Level Parallelism (ILP). Parallel Random-Access Machines (PRAM). Cluster computing and grid computing. Message passing systems and applications. Message Passing Interface (MPI) and configuration of MPI cluster. MPI programming algorithms and implementation of PRAM through MPI. Peer-to-Peer (P2P) systems, mobile agents. GPUs, Multi-Core, Distributed file systems. Distributed coordination systems.  Replication and consistency. Fault tolerance. Grid computing paradigm. Cloud computing: properties and characteristics, service models, deployment models.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE352s	Parallel and Distributed Systems										3 CH
Prerequisites	( CSE351s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Motivations for parallel programming. Instruction Level Parallelism (ILP). Parallel Random-Access Machines (PRAM). Cluster computing and grid computing. Message passing systems and applications. Message Passing Interface (MPI) and configuration of MPI cluster. MPI programming algorithms and implementation of PRAM through MPI. Peer-to-Peer (P2P) systems, mobile agents. GPUs, Multi-Core, Distributed file systems. Distributed coordination systems.  Replication and consistency. Fault tolerance. Grid computing paradigm. Cloud computing: properties and characteristics, service models, deployment models.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4			2
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			0%			60%

CSE353	Industrial Networks										3 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
The course is presented through a layered top-down approach starting from the application layer down to the physical layer, focusing on basic networking concepts and typical application layer examples. Focusing on the Internet and the fundamentally important issues of networking, this course provides a foundation for students interested in computer science and electrical engineering, without requiring extensive knowledge of programming or mathematics. A typical outline of the course goes by the following sequence: -          Application layer (e.g., e-mail, the Web, PHP, wireless Web, MP3, and streaming audio) -          Transport layer essentials and requirements. -          Network layer functions and fundamentals of routing, congestion control, QoS, IPv4, and IPv6. -          Data link layer and MAC Sublayer with emphasis on gigabit Ethernet, 802.11, broadband wireless, and switching. -          Physical layer (e.g., copper, fibre, wireless, satellites, and Internet over cable) The course dissects and depicts the principles associated with each layer and then focuses on Fieldbus networks, Control Area Networks (CAN, LIN, FLEXRAY) and SCADA systems.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE353s	Industrial Networks										3 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
The course is presented through a layered top-down approach starting from the application layer down to the physical layer, focusing on basic networking concepts and typical application layer examples. Focusing on the Internet and the fundamentally important issues of networking, this course provides a foundation for students interested in computer science and electrical engineering, without requiring extensive knowledge of programming or mathematics. A typical outline of the course goes by the following sequence: - Application layer (e.g., e-mail, the Web, PHP, wireless Web, MP3, and streaming audio) - Transport layer essentials and requirements. - Network layer functions and fundamentals of routing, congestion control, QoS, IPv4, and IPv6. - Data link layer and MAC Sublayer with emphasis on gigabit Ethernet, 802.11, broadband wireless, and switching. - Physical layer (e.g., copper, fibre, wireless, satellites, and Internet over cable) The course dissects and depicts the principles associated with each layer and then focuses on Fieldbus networks, Control Area Networks (CAN, LIN, FLEXRAY) and SCADA systems.
Used in Program / Level
Program Name or requirement						Study Level			Semester
General Electrical Engineering						2
Mechatronics Engineering						4
Electrical Power and Machines Engineering						3			6
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE354	Distributed Computing										3 CH
Prerequisites	( CSE231 ) AND ( CSE351 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				1 Hour
Required SWL			100			Equivalent ECTS			4
Course Content
Overview of distributed computing. Client-server paradigm: protocols, simple client-server messaging systems, remote procedure calls, remote method invocation, remote object invocation systems. Message-oriented middleware systems. Advanced messaging systems: transient, persistent. Naming: flat, structured, attribute-based. Distributed processes. Distributed synchronization. Peer-to-Peer (P2P) systems, mobile agents. P2P with mobile agents. Distributed file systems. Distributed coordination systems. Distributed document (web) systems. Replication and consistency. Fault tolerance. Web services (WSDL, XML, UDDI). Grid computing: grid computing middleware, resource management and scheduling, grid portals, data management, grid security, grid services, grid-enabled applications.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						3
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE354s	Distributed Computing										3 CH
Prerequisites	( CSE231s ) AND ( CSE351s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				1 Hour
Required SWL			100			Equivalent ECTS			4
Course Content
Overview of distributed computing. Client-server paradigm: protocols, simple client-server messaging systems, remote procedure calls, remote method invocation, remote object invocation systems. Message-oriented middleware systems. Advanced messaging systems: transient, persistent. Naming: flat, structured, attribute-based. Distributed processes. Distributed synchronization. Peer-to-Peer (P2P) systems, mobile agents. P2P with mobile agents. Distributed file systems. Distributed coordination systems. Distributed document (web) systems. Replication and consistency. Fault tolerance. Web services (WSDL, XML, UDDI). Grid computing: grid computing middleware, resource management and scheduling, grid portals, data management, grid security, grid services, grid-enabled applications.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE355	Parallel and Distributed Algorithms										2 CH
Prerequisites	( CSE332 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Parallel versus distributed algorithms. Message passing and shared memory. Parallel algorithm design: parallel graph algorithms, parallel searching and sorting algorithms. Parallel computational algorithms. Basic distributed problems and protocols. Synchronous computation: communicators, pipeline, transformers, waiting, guessing, synchronous problems. Algorithms in systems with no failures. Election: election in trees, rings, mesh networks, cube networks, and complete networks, universal election protocols. Message routing: shortest path routing, coping with changes, routing in static systems. Distributed set operations: distributed selection, distributed sorting. Stable properties detection. Continuous computations. Computing in presence of faults: faults and failure, modelling faults, the crushing impact failure, localized entity and link failures, ubiquitous faults. Failure detectors. Parallel and distributed matrix algorithms. Optimization in parallel and distributed algorithms. Complexity analysis of distributed and parallel algorithms. Applications.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE355s	Parallel and Distributed Algorithms										2 CH
Prerequisites	( CSE332s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Parallel versus distributed algorithms. Message passing and shared memory. Parallel algorithm design: parallel graph algorithms, parallel searching and sorting algorithms. Parallel computational algorithms. Basic distributed problems and protocols. Synchronous computation: communicators, pipeline, transformers, waiting, guessing, synchronous problems. Algorithms in systems with no failures. Election: election in trees, rings, mesh networks, cube networks, and complete networks, universal election protocols. Message routing: shortest path routing, coping with changes, routing in static systems. Distributed set operations: distributed selection, distributed sorting. Stable properties detection. Continuous computations. Computing in presence of faults: faults and failure, modelling faults, the crushing impact failure, localized entity and link failures, ubiquitous faults. Failure detectors. Parallel and distributed matrix algorithms. Optimization in parallel and distributed algorithms. Complexity analysis of distributed and parallel algorithms. Applications.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE356	Internet of Things										2 CH
Prerequisites	( CSE354 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Concepts and architecture. Connected devices. Managing IoT resources in the cloud. Fog computing. Programming frameworks. Virtualization on Embedded boards. Collecting and managing data. Reliability, privacy, and security. IoT applications.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE356s	Internet of Things										2 CH
Prerequisites	( CSE354s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Concepts and architecture. Connected devices. Managing IoT resources in the cloud. Fog computing. Programming frameworks. Virtualization on Embedded boards. Collecting and managing data. Reliability, privacy, and security. IoT applications.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE357	Networks Operation and Management										2 CH
Prerequisites	( CSE351 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Network management: goals, organization and functions. Basic foundations: standards, models and languages. Simple network management protocol (SNMP). SNMPvA organization and information models. SNMPvA communication and functional models. SNMPv2. SNMPv3. Remote monitoring (RMON). Network management applications.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						3
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
35%			20%			0%			40%

CSE357s	Networks Operation and Management										2 CH
Prerequisites	( CSE351s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Network management: goals, organization and functions. Basic foundations: standards, models and languages. Simple network management protocol (SNMP). SNMPvA organization and information models. SNMPvA communication and functional models. SNMPv2. SNMPv3. Remote monitoring (RMON). Network management applications.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						3
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			0%			60%

CSE358	Pervasive Computing and Internet of Things										2 CH
Prerequisites	( CSE231 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Ubiquitous data access. Exploiting virtual machines. Resource-driven dynamic adaptation. Sensing and actuation: smart sensors and actuators, smart appliances. Mobile hardware technologies. Information access devices. Smart identification: smart cards, smart labels, smart tokens. Home networking. Entertainment systems. Pervasive computing platforms and software: Java cards, iOS, Android, Windows-based platforms. Client middleware: smart card programming, messaging components. Security and privacy in mobile and pervasive systems. Mobile internet. Web services: service discovery, location and context awareness. Backend server infrastructure: Gateways, application servers, Internet portals, device management, synchronization. Mobile and ubiquitous services: home services, travel and business services, consumer services. Design methodologies and infrastructure. End-to-end application considerations.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE358s	Pervasive Computing and Internet of Things										2 CH
Prerequisites	( CSE231s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Ubiquitous data access. Exploiting virtual machines. Resource-driven dynamic adaptation. Sensing and actuation: smart sensors and actuators, smart appliances. Mobile hardware technologies. Information access devices. Smart identification: smart cards, smart labels, smart tokens. Home networking. Entertainment systems. Pervasive computing platforms and software: Java cards, iOS, Android, Windows-based platforms. Client middleware: smart card programming, messaging components. Security and privacy in mobile and pervasive systems. Mobile internet. Web services: service discovery, location and context awareness. Backend server infrastructure: Gateways, application servers, Internet portals, device management, synchronization. Mobile and ubiquitous services: home services, travel and business services, consumer services. Design methodologies and infrastructure. End-to-end application considerations.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						3
General Electrical Engineering						3
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			0%			60%

CSE451	Computer and Network Security										3 CH
Prerequisites	( CSE351 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Attacks and threats, symmetric key cryptography, public key cryptography, authentication protocols, digital signature, viruses, worms, Trojan horses, malicious programs, computer crimes, web-security, firewalls, intrusion detection, TLS, IPSec, SET, digital homeland security, offensive and defensive tools, security issues in wireless technologies and mobile computing, ethics and hacking in laws.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4			10
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
25%			20%			10%			40%

CSE451s	Computer and Network Security										3 CH
Prerequisites	( CSE351s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Attacks and threats, symmetric key cryptography, public key cryptography, authentication protocols, digital signature, viruses, worms, Trojan horses, malicious programs, computer crimes, web-security, firewalls, intrusion detection, TLS, IPSec, SET, digital homeland security, offensive and defensive tools, security issues in wireless technologies and mobile computing, ethics and hacking in laws.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						5			9
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE452	Wireless Networks										2 CH
Prerequisites	( CSE351 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
The objective of this course is to give an introduction to the fundamentals of the wireless communications systems, the wireless network architectures, protocols, and applications. Topics of study include an overview of wireless communications and mobile computing systems, signal propagation characteristics of wireless channels, wireless channel modelling, frequency reuse/cellular/microcellular concepts, spread-spectrum modulation for wireless systems, multiple access techniques, and wireless networking standards (e.g., 2.5G, 3G, 4G/LTE, IEEE 802.11, IEEE 802.15, IEEE 802.16/WiMAX). MANETS, WSNs, VANETS are typical wireless networks that are accorded focus on their characteristics and applications.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE452s	Wireless Networks										2 CH
Prerequisites	( CSE351s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
The objective of this course is to give an introduction to the fundamentals of the wireless communications systems, the wireless network architectures, protocols, and applications. Topics of study include an overview of wireless communications and mobile computing systems, signal propagation characteristics of wireless channels, wireless channel modelling, frequency reuse/cellular/microcellular concepts, spread-spectrum modulation for wireless systems, multiple access techniques, and wireless networking standards (e.g., 2.5G, 3G, 4G/LTE, IEEE 802.11, IEEE 802.15, IEEE 802.16/WiMAX). MANETS, WSNs, VANETS are typical wireless networks that are accorded focus on their characteristics and applications.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			0%			60%

CSE453	Digital Forensics										2 CH
Prerequisites	( CSE451 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Concepts of digital forensics. Computer investigations using digital evidence controls. Crime and incident scenes. Computer forensic analysis. E-mail investigations. Image file recovery. Incident response. Recovery of digital evidence. Testimony on evidence. Computer forensics tools. Best practices for processing crime and incident scenes. Digital evidence controls. Best practices for data discovery, recovery, and acquisition. Network forensic analysis. Investigative report writing.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE453s	Digital Forensics										2 CH
Prerequisites	( CSE451s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Concepts of digital forensics. Computer investigations using digital evidence controls. Crime and incident scenes. Computer forensic analysis. E-mail investigations. Image file recovery. Incident response. Recovery of digital evidence. Testimony on evidence. Computer forensics tools. Best practices for processing crime and incident scenes. Digital evidence controls. Best practices for data discovery, recovery, and acquisition. Network forensic analysis. Investigative report writing.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE454	Quantum Communication and Security										2 CH
Prerequisites	( CSE351 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Quantum Computing, QUBITS, Postulates of Quantum Mechanics, Quantum Information, No Cloning, Quantum Algorithms: Basic algorithms, period finding, Quantum FT, Quantum Communication, Quantum Key Distribution, Quantum Secure Communication, Quantum Attacks, Post-Quantum Cryptography, Implementation Issues
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE454s	Quantum Communication and Security										2 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Quantum Computing, QUBITS, Postulates of Quantum Mechanics, Quantum Information, No Cloning, Quantum Algorithms: Basic algorithms, period finding, Quantum FT, Quantum Communication, Quantum Key Distribution, Quantum Secure Communication, Quantum Attacks, Post-Quantum Cryptography, Implementation Issues
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			0%			60%

CSE455	High-Performance Computing										2 CH
Prerequisites	( CSE112 OR CSE212 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Overview of existing HPC software and hardware. Basic software design patterns for high performance parallel computing. CUDA for parallel computing on the Graphics Processing Unit (GPU). Message Passing Interface (MPI) parallel programming. OpenMP and POSIX threads solution to enable parallelism across multiple CPU cores. Standard algorithms utilizing parallelism. Matrix and vector operations. Collective communications. The use of Graphics Processing Units (GPUs) for general purpose computations (GPGPU). Multi-GPU and Multi-CPU solutions. Optimizing HPC-based programs. Designing GPU-based systems. Applications.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4			10
Computer Engineering and Software Systems						4			8
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
35%			20%			0%			40%

CSE455s	High-Performance Computing										2 CH
Prerequisites	( CSE112s OR CSE212s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Overview of existing HPC software and hardware. Basic software design patterns for high performance parallel computing. CUDA for parallel computing on the Graphics Processing Unit (GPU). Message Passing Interface (MPI) parallel programming. OpenMP and POSIX threads solution to enable parallelism across multiple CPU cores. Standard algorithms utilizing parallelism. Matrix and vector operations. Collective communications. The use of Graphics Processing Units (GPUs) for general purpose computations (GPGPU). Multi-GPU and Multi-CPU solutions. Optimizing HPC-based programs. Designing GPU-based systems. Applications.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			0%			60%

CSE456	Cloud Computing										3 CH
Prerequisites	( CSE354 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Key cloud computing concepts. Cloud computing properties and characteristics, service models, deployment models. Cloud computing models, techniques, and architectures. Infrastructure as a Service (IaaS): resource virtualization, server, storage, network. Platform as a Service (PaaS): Cloud platform and management: computation, storage, case studies. Software as a Service (SaaS): web services, web OS, Case studies. Cloud-based software systems. Advanced web technologies. Cloud issues: provider lock-in, security. Key cloud service providers and platforms. Creating own cloud services. Cloud deployment and service models, cloud infrastructure, migration to cloud computing environments. Traditional, virtualized, and cloud data centre environments. Storage, networking, desktop, and application virtualization. Backup and recovery, security, and management of cloud computing systems.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE456s	Cloud Computing										3 CH
Prerequisites	( CSE354s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Key cloud computing concepts. Cloud computing properties and characteristics, service models, deployment models. Cloud computing models, techniques, and architectures. Infrastructure as a Service (IaaS): resource virtualization, server, storage, network. Platform as a Service (PaaS): Cloud platform and management: computation, storage, case studies. Software as a Service (SaaS): web services, web OS, Case studies. Cloud-based software systems. Advanced web technologies. Cloud issues: provider lock-in, security. Key cloud service providers and platforms. Creating own cloud services. Cloud deployment and service models, cloud infrastructure, migration to cloud computing environments. Traditional, virtualized, and cloud data centre environments. Storage, networking, desktop, and application virtualization. Backup and recovery, security, and management of cloud computing systems.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE457	Mobile and Wireless Networks										3 CH
Prerequisites	( CSE351 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Wireless networking fundamentals. Wireless technologies. Global System for Mobile communication (GSM). Code Division Multiple Access (CDMA). Short Message Service (SMS). General Packet Radio Service (GPRS). Wireless Application Protocol (WAP). IP Multimedia Subsystem (IMS). Multimedia Messaging Service (MMS). Geolocation and Global Positioning System (GPS). Cellular Wireless Networks: 1G, 2G, 3G, 4G, future of cellular wireless networks. Wireless medium access control. Wireless LANs and IEEE 802.11. Bluetooth and WPANs. Zigbee/802.15.4. Wi-Fi/Bluetooth/Zigbee coexistence. Ad hoc networks. Wireless and mobile routing protocols for ad hoc networks. Wireless and mobile routing in the Internet: mobile IP, DHCP, NAT. Wireless sensor and mesh networks. Performance improvements for TCP in wireless networks. Wireless network security.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE457s	Mobile and Wireless Networks										3 CH
Prerequisites	( CSE351s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Wireless networking fundamentals. Wireless technologies. Global System for Mobile communication (GSM). Code Division Multiple Access (CDMA). Short Message Service (SMS). General Packet Radio Service (GPRS). Wireless Application Protocol (WAP). IP Multimedia Subsystem (IMS). Multimedia Messaging Service (MMS). Geolocation and Global Positioning System (GPS). Cellular Wireless Networks: 1G, 2G, 3G, 4G, future of cellular wireless networks. Wireless medium access control. Wireless LANs and IEEE 802.11. Bluetooth and WPANs. Zigbee/802.15.4. Wi-Fi/Bluetooth/Zigbee coexistence. Ad hoc networks. Wireless and mobile routing protocols for ad hoc networks. Wireless and mobile routing in the Internet: mobile IP, DHCP, NAT. Wireless sensor and mesh networks. Performance improvements for TCP in wireless networks. Wireless network security.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE458	Computer and Network Forensics										3 CH
Prerequisites	( CSE451 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Concepts of computer and network forensics. Computer investigations using digital evidence controls. Crime and incident scenes. Computer forensic analysis. E-mail investigations. Image file recovery. Incident response. Recovery of digital evidence. Testimony on evidence. Computer forensics tools. Best practices for processing crime and incident scenes. Digital evidence controls. Best practices for data discovery, recovery, and acquisition. Network forensic analysis. Investigative report writing.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE458s	Computer and Network Forensics										3 CH
Prerequisites	( CSE451s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Concepts of computer and network forensics. Computer investigations using digital evidence controls. Crime and incident scenes. Computer forensic analysis. E-mail investigations. Image file recovery. Incident response. Recovery of digital evidence. Testimony on evidence. Computer forensics tools. Best practices for processing crime and incident scenes. Digital evidence controls. Best practices for data discovery, recovery, and acquisition. Network forensic analysis. Investigative report writing.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE459	Selected Topics in Networks and Security										2 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Selected topics in recent developments in computer networks and security will be presented in this course. Course material will reflect the needs of the graduating students
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE459s	Selected Topics in Networks and Security										2 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Selected topics in recent developments in computer networks and security will be presented in this course. Course material will reflect the needs of the graduating students
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			0%			60%

CSE461	Selected Topics in Distributed & Mobile Computing										3 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Overview of cybersecurity concepts Importance of cybersecurity in today's digital world, and Brief history of cybersecurity incidents Foundations of Information Security Network Security Basics of network architecture, Firewalls, IDS, and IPS VPNs and secure communication protocols Operating System Security Securing different operating systems Access controls and permissions Patch management and updates Web Security Common web vulnerabilities, Secure coding practices, Web application firewalls Security Policies and Procedures Developing and implementing security policies, Incident response and disaster recovery
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE461s	Selected Topics in Distributed & Mobile Computing										3 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Selected topics in recent directions in distributed and mobile computing will be presented in this course.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE271	System Dynamics and Control Components										4 CH
Prerequisites	(PHM113)
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				2 Hours				1 Hour
Required SWL			150			Equivalent ECTS			6
Course Content
Modelling principles and simulation; methodology for model building, Modelling of distributed systems, Modelling of process dead-time, Experimental approach to model building, Linearization techniques, Modelling of chemical process plant, Heat exchanger, Binary distillation column, Chemical reactor, Iron making and steel making; models. Turbo-generators in electric power systems, nonlinear mathematical model, Generator, Exciter, And transmission system, Boiler and turbine. Manufacturing systems, Mechanization and automation, Numerical control, Computer-aided manufacture, Illustrative examples. Simulation of physical systems. Measurements and control in closed loop control. Physical quantities and transducers. Static and dynamic specifications of transducers. Displacement, velocity, and acceleration transducers. Strain gauges and Wheatstone bridge. Thermal transducers. Pressure, flow, and level transducers. Analog signal conditioning and transmission. Digitizing analog signals (D/A, A/D). Data acquisition systems in digital control loops. PC interfaces through standard I/O bus cards and parallel and serial interfaces and their drivers. Programmable controllers. Power interfacing (power amplifiers, thyristors). Control valves. Electronic/pneumatic PID controllers.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE271s	System Dynamics and Control Components										4 CH
Prerequisites	( PHM113s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				2 Hours				1 Hour
Required SWL			150			Equivalent ECTS			6
Course Content
Modelling principles and simulation; methodology for model building, Modelling of distributed systems, Modelling of process dead-time, Experimental approach to model building, Linearization techniques, Modelling of chemical process plant, Heat exchanger, Binary distillation column, Chemical reactor, Iron making and steel making; models. Turbo-generators in electric power systems, nonlinear mathematical model, Generator, Exciter, And transmission system, Boiler and turbine. Manufacturing systems, Mechanization and automation, Numerical control, Computer-aided manufacture, Illustrative examples. Simulation of physical systems. Measurements and control in closed loop control. Physical quantities and transducers. Static and dynamic specifications of transducers. Displacement, velocity, and acceleration transducers. Strain gauges and Wheatstone bridge. Thermal transducers. Pressure, flow, and level transducers. Analog signal conditioning and transmission. Digitizing analog signals (D/A, A/D). Data acquisition systems in digital control loops. PC interfaces through standard I/O bus cards and parallel and serial interfaces and their drivers. Programmable controllers. Power interfacing (power amplifiers, thyristors). Control valves. Electronic/pneumatic PID controllers.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Electrical Power and Machines Engineering						3			5
Electronics and Communications Engineering						3			5
Computer and Systems Engineering						3			5
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE371	Control Engineering										3 CH
Prerequisites	( ECE251 OR ECE253 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to feedback control systems. Characteristics of closed loop systems. Advantages and disadvantages of feedback. Obtainment of transfer functions along with illustrative examples. Block diagram reduction. Signal flow graphs. Sensitivity to parameter variation. Performance of control systems. Standard test signals. Time response of first and second order systems and response specs. Identifications of systems from time response. Static error analysis. Classical controllers P, PI, PD, PID. Routh - Method for stability analysis. Root locus. Frequency response. Identifications of systems from frequency response. Design of PID controllers and compensators. State space representation in canonical forms. State feedback gain matrix design method. Observability and controllability analysis.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						3			6
Communication Systems Engineering						3			6
Computer Engineering and Software Systems						3			6
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
25%			20%			10%			40%

CSE371s	Control Engineering										3 CH
Prerequisites	( ECE251s OR ECE253s ) AND (CSE271s)
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to feedback control systems. Characteristics of closed loop systems. Advantages and disadvantages of feedback. Obtainment of transfer functions along with illustrative examples. Block diagram reduction. Signal flow graphs. Sensitivity to parameter variation. Performance of control systems. Standard test signals. Time response of first and second order systems and response specs. Identifications of systems from time response. Static error analysis. Classical controllers P, PI, PD, PID. Routh - Method for stability analysis. Root locus. Frequency response. Identifications of systems from frequency response. Design of PID controllers and compensators. State space representation in canonical forms. State feedback gain matrix design method. Observability and controllability analysis.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4			7
Electronics and Communications Engineering						4			7
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE372	Simulation of Engineering Systems										2 CH
Prerequisites	( PHM111 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to simulation of engineering systems. Continuous-time and discrete-time systems simulation. Statistical models in simulation. Overview of basic probability and statistics. Selecting input probability distribution. Random number generators. Random variate generation. Simulation of a single server queueing system. Simulation of an Inventory system. Simulation of discrete-event and hybrid systems using Petri nets. Simulation of discrete-event systems using Grafcet. Building valid and credible simulation models. Desirable features of simulation software. Some simulation software examples.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE372s	Simulation of Engineering Systems										2 CH
Prerequisites	( PHM111s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to simulation of engineering systems. Continuous-time and discrete-time systems simulation. Statistical models in simulation. Overview of basic probability and statistics. Selecting input probability distribution. Random number generators. Random variate generation. Simulation of a single server queueing system. Simulation of an Inventory system. Simulation of discrete-event and hybrid systems using Petri nets. Simulation of discrete-event systems using Grafcet. Building valid and credible simulation models. Desirable features of simulation software. Some simulation software examples.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						3
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE373	Digital Control Systems										2 CH
Prerequisites	( CSE371 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Z-Transform and pulse transfer function-Representation of digital system using difference equation. The stability of a digital system. Design a digital controller from a continuous controller-Implement a digital filter-Represent a system in digital state space-Design and tune a digital PID controller-Design a digital controller using pole placement and polynomial equations-Simulate a digital system on MATLAB. Understand the robustness of a control design-Digital optimal control.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE373s	Digital Control Systems										2 CH
Prerequisites	( CSE371s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Z-Transform and pulse transfer function-Representation of digital system using difference equation. The stability of a digital system. Design a digital controller from a continuous controller-Implement a digital filter-Represent a system in digital state space-Design and tune a digital PID controller-Design a digital controller using pole placement and polynomial equations-Simulate a digital system on MATLAB. Understand the robustness of a control design-Digital optimal control.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						3
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE374	Digital Image Processing										2 CH
Prerequisites	( ECE251 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to the theory and applications of 2D signal and image processing: 2D signals and systems analysis, 2D sampling and quantization, 2D signals and image transforms, 2D FIR filter design. Image formation. Image enhancement. Image restoration. Image coding. Image reconstruction from projections. Image compression. Colour image processing. Image segmentation. Morphological operations. Super resolution. Wavelets and image pyramids.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						3
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
25%			20%			10%			40%

CSE374s	Digital Image Processing										2 CH
Prerequisites	( ECE251s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to the theory and applications of 2D signal and image processing: 2D signals and systems analysis, 2D sampling and quantization, 2D signals and image transforms, 2D FIR filter design. Image formation. Image enhancement. Image restoration. Image coding. Image reconstruction from projections. Image compression. Colour image processing. Image segmentation. Morphological operations. Super resolution. Wavelets and image pyramids.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4			7
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE375	Machine Learning and Pattern Recognition										2 CH
Prerequisites	( PHM111 ) AND ( CSE131 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to Machine Learning: Concepts, Instances, Attributes, Simple Examples, Application Domains.  Machine Learning and Statistics. Data Pre-processing and Exploration: Sampling, Principal Component Analysis, Feature Extraction, Exploratory Data Analysis. Fundamental Classification Strategies. Clustering Techniques. Statistical and structural pattern recognition approaches. Bayesian decision theory. Maximum-Likelihood and Bayesian parameter estimation. Nearest neighbour rule. Non-parametric classifiers. Linear discriminate functions. Non-linear classifiers. Multi-layer neural networks. Features selection. Template matching. Unsupervised learning and Cluster analysis. Supervised learning.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE375s	Machine Learning and Pattern Recognition										2 CH
Prerequisites	( PHM111s ) AND ( CSE131s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to Machine Learning: Concepts, Instances, Attributes, Simple Examples, Application Domains.  Machine Learning and Statistics. Data Pre-processing and Exploration: Sampling, Principal Component Analysis, Feature Extraction, Exploratory Data Analysis. Fundamental Classification Strategies. Clustering Techniques. Statistical and structural pattern recognition approaches. Bayesian decision theory. Maximum-Likelihood and Bayesian parameter estimation. Nearest neighbour rule. Non-parametric classifiers. Linear discriminate functions. Non-linear classifiers. Multi-layer neural networks. Features selection. Template matching. Unsupervised learning and Cluster analysis. Supervised learning.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						3
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE376	Digital Signals Processing										2 CH
Prerequisites	( ECE251 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			5			Equivalent ECTS			125
Course Content
Z-transform and its properties, Discrete Time Fourier Transform (DTFT), Discrete Fourier Transform (DFT), Fast Fourier Transform (FFT), Circular convolution, block convolution, digital filters, FIR design, IIR design. Multi-Rate processing, Experiments in the field of signal processing supporting the course’s theoretical content.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE376s	Digital Signals Processing										2 CH
Prerequisites	( ECE251s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			5			Equivalent ECTS			125
Course Content
Z-transform and its properties, Discrete Time Fourier Transform (DTFT), Discrete Fourier Transform (DFT), Fast Fourier Transform (FFT), Circular convolution, block convolution, digital filters, FIR design, IIR design. Multi-Rate processing, Experiments in the field of signal processing supporting the course’s theoretical content.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						3
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE377	Pattern Recognition										2 CH
Prerequisites	( ECE251 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to pattern recognition, Statistical and structural approaches, Bayesian decision theory, Maximum-Likelihood and Bayesian parameters estimation, Nearest neighbour rule, Non-parametric classifiers, Decision trees, Unsupervised classification and clustering, Linear discriminate functions, Non-linear classifiers, Classifiers comparison, Multi-layer neural networks, Back-propagation, Hidden Markov models, Principal component analysis, Features selection, Template matching, Unsupervised learning and cluster analysis.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						3
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE377s	Pattern Recognition										2 CH
Prerequisites	( ECE251s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to pattern recognition, Statistical and structural approaches, Bayesian decision theory, Maximum-Likelihood and Bayesian parameters estimation, Nearest neighbour rule, Non-parametric classifiers, Decision trees, Unsupervised classification and clustering, Linear discriminate functions, Non-linear classifiers, Classifiers comparison, Multi-layer neural networks, Back-propagation, Hidden Markov models, Principal component analysis, Features selection, Template matching, Unsupervised learning and cluster analysis.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE378	Computer Graphics										2 CH
Prerequisites	( PHM013 ) AND ( CSE231 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to computer graphics hardware, algorithms, and software. Graphics Programming, OpenGL. Displaying images. 3D transformations. Light and shading. Ray tracing. Hidden surface removal. Colour technology. Image morphing. Texture mapping. Line drawing. Local illumination models. Curves and Surfaces. Geometric Modelling. Animation.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4			7
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE378s	Computer Graphics										2 CH
Prerequisites	( PHM013s ) AND ( CSE231s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to computer graphics hardware, algorithms, and software. Graphics Programming, OpenGL. Displaying images. 3D transformations. Light and shading. Ray tracing. Hidden surface removal. Colour technology. Image morphing. Texture mapping. Line drawing. Local illumination models. Curves and Surfaces. Geometric Modelling. Animation.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE379	Human Computer Interaction										2 CH
Prerequisites	( CSE232 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Iterative design processes, interactive prototype construction, discount evaluation techniques. Fundamental methods, principles and tools for designing, programming, and testing interactive systems. Usability, user-centred design, information and interactivity structures, interaction styles, interaction techniques, and user interface software tools with a special focus on mobile user interfaces. Mobile interaction, augmented-reality, tangible user interfaces, and ubiquitous computing. Interaction techniques: use of voice, gesture, and eye movements.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						3
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE379s	Human Computer Interaction										2 CH
Prerequisites	( CSE232s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Iterative design processes, interactive prototype construction, discount evaluation techniques. Fundamental methods, principles and tools for designing, programming, and testing interactive systems. Usability, user-centred design, information and interactivity structures, interaction styles, interaction techniques, and user interface software tools with a special focus on mobile user interfaces. Mobile interaction, augmented-reality, tangible user interfaces, and ubiquitous computing. Interaction techniques: use of voice, gesture, and eye movements.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE381	Introduction to Machine Learning										2 CH
Prerequisites	( PHM111 ) AND ( CSE131 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Naïve Bayes. Decision Trees. Linear regression (single and multivariable). Logistic regression. Artificial Neural Networks. Support Vector Machines. Ensemble Methods. Randomized Optimization. Clustering algorithms. Principal component analysis. Reinforcement Learning. Recommender Systems.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4			7
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
35%			20%			0%			40%

CSE381s	Introduction to Machine Learning										2 CH
Prerequisites	( PHM111s ) AND ( CSE131s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Naïve Bayes. Decision Trees. Linear regression (single and multivariable). Logistic regression. Artificial Neural Networks. Support Vector Machines. Ensemble Methods. Randomized Optimization. Clustering algorithms. Principal component analysis. Reinforcement Learning. Recommender Systems.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE382	Data Mining and Business Intelligence										2 CH
Prerequisites	( PHM111 ) AND ( CSE333 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction: definitions, data mining process, knowledge discovery in databases. Data pre-processing: data cleaning, data integration, data reduction, data transformation, data discretization. Data warehousing. Mining frequent patterns, association rules, correlation. Classification: k-nearest neighbours, multiple linear regression, logistic regression, decision tree, bayes classification, rule-based classification, model evaluation and selection, support vector machine, anomaly detection. Cluster analysis: partition methods, hierarchical methods, density methods. Outlier detection: statistical methods, proximity-based methods. Web mining: text and web-page pre-processing, inverted index, latent semantic indexing web search, web meta-search, social network analysis, web crawling. Business intelligence. Data mining tools. Applications of data mining to various application domains. Data mining case studies.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						3
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE382s	Data Mining and Business Intelligence										2 CH
Prerequisites	( PHM111s ) AND ( CSE333s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction: definitions, data mining process, knowledge discovery in databases. Data pre-processing: data cleaning, data integration, data reduction, data transformation, data discretization. Data warehousing. Mining frequent patterns, association rules, correlation. Classification: k-nearest neighbours, multiple linear regression, logistic regression, decision tree, bayes classification, rule-based classification, model evaluation and selection, support vector machine, anomaly detection. Cluster analysis: partition methods, hierarchical methods, density methods. Outlier detection: statistical methods, proximity-based methods. Web mining: text and web-page pre-processing, inverted index, latent semantic indexing web search, web meta-search, social network analysis, web crawling. Business intelligence. Data mining tools. Applications of data mining to various application domains. Data mining case studies.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE471	Robotic Systems										2 CH
Prerequisites	( CSE271 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to Homogeneous Transformations, Forward Kinematics: The Denavit-Hartenberg-Convention, Inverse Kinematics, Velocity Kinematics, The Manipulator Jacobian, Dynamics, Independent Joint Control, Feedback Linearization, Robot programming and algorithms.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE471s	Robotic Systems										2 CH
Prerequisites	( CSE271s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to Homogeneous Transformations, Forward Kinematics: The Denavit-Hartenberg-Convention, Inverse Kinematics, Velocity Kinematics, The Manipulator Jacobian, Dynamics, Independent Joint Control, Feedback Linearization, Robot programming and algorithms.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE472	Artificial Intelligence										3 CH
Prerequisites	( PHM211 ) AND ( CSE131 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Artificial intelligence languages. Problem-solving in artificial intelligence. Problem-solving by searching: uninformed search, informed search, heuristic functions. Adversarial search and game theory. Expert Systems: rule-based systems, inference, probabilistic reasoning. Learning methodologies. Decision theory. Classification. Clustering. Neural Networks. Evolutionary Computation. Genetic Algorithms. Artificial intelligence applications.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4
Computer Engineering and Software Systems						3
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
35%			20%			0%			40%

CSE472s	Artificial Intelligence										3 CH
Prerequisites	( PHM211s ) AND ( CSE131s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				2 Hours				0 Hours
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Artificial intelligence languages. Problem-solving in artificial intelligence. Problem-solving by searching: uninformed search, informed search, heuristic functions. Adversarial search and game theory. Expert Systems: rule-based systems, inference, probabilistic reasoning. Learning methodologies. Decision theory. Classification. Clustering. Neural Networks. Evolutionary Computation. Genetic Algorithms. Artificial intelligence applications.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4			9
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			0%			60%

CSE473	Computational Intelligence										2 CH
Prerequisites	( PHM111 ) AND ( CSE131 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Definitions, learning theory, soft-computing paradigm. Fuzzy systems: Fuzzy sets and relations, operations on fuzzy sets, fuzzy logic, approximate reasoning, fuzzy control. Neural networks: machine learning using neural networks, supervised learning, unsupervised learning, competitive learning, reinforcement learning, neuro-dynamic programming, neuro-fuzzy systems. Evolutionary computation: genetic algorithms, genetic programming, genetic optimization, machine learning using genetic algorithms. Particle swarm optimization. Bayes networks. Artificial immune systems. Rough theory. Granular computing. Chaos theory. Tools used in developing computational intelligence algorithms. Applications: intelligent control systems, object recognition, applications in mobile robots.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Mechatronics Engineering and Automation									9
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
30%			25%			0%			40%

CSE473s	Computational Intelligence										2 CH
Prerequisites	( PHM111s ) AND ( CSE131s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Definitions, learning theory, soft-computing paradigm. Fuzzy systems: Fuzzy sets and relations, operations on fuzzy sets, fuzzy logic, approximate reasoning, fuzzy control. Neural networks: machine learning using neural networks, supervised learning, unsupervised learning, competitive learning, reinforcement learning, neuro-dynamic programming, neuro-fuzzy systems. Evolutionary computation: genetic algorithms, genetic programming, genetic optimization, machine learning using genetic algorithms. Particle swarm optimization. Bayes networks. Artificial immune systems. Rough theory. Granular computing. Chaos theory. Tools used in developing computational intelligence algorithms. Applications: intelligent control systems, object recognition, applications in mobile robots.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Mechatronics Engineering						5			9
Computer and Systems Engineering						5			10
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE474	Visualization										3 CH
Prerequisites	( CSE378 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Perception and its applications. Graphical perception. Visual encoding principles. Interaction principles. Single-view methods. Multiple-view methods. Item reduction methods. Attribute reduction methods. Tabular data. Visualization toolkits. Graphs and trees. Flow visualization. Geo-spatial visualization. Volume visualization. Vector visualization. High-dimensional Visualization. Visualizing relational data. Design and evaluation. Visualizing structure. Visualizing time. Scaling.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						5
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE474s	Visualization										3 CH
Prerequisites	( CSE378s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Perception and its applications. Graphical perception. Visual encoding principles. Interaction principles. Single-view methods. Multiple-view methods. Item reduction methods. Attribute reduction methods. Tabular data. Visualization toolkits. Graphs and trees. Flow visualization. Geo-spatial visualization. Volume visualization. Vector visualization. High-dimensional Visualization. Visualizing relational data. Design and evaluation. Visualizing structure. Visualizing time. Scaling.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE475	Biomedical Engineering										2 CH
Prerequisites	( PHM111 ) AND ( CSE131 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to mathematical modelling of physiological systems, Linear system approximation, Stochastic modelling, Cardiopulmonary system models, Myocardial mechanics, Cardiac energy and power analysis models, Models of gastrointestinal tract motility, Models of respiratory mechanics and chemical control of respiration.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE475s	Biomedical Engineering										2 CH
Prerequisites	( PHM111s ) AND ( CSE131s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to mathematical modelling of physiological systems, Linear system approximation, Stochastic modelling, Cardiopulmonary system models, Myocardial mechanics, Cardiac energy and power analysis models, Models of gastrointestinal tract motility, Models of respiratory mechanics and chemical control of respiration.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			10%			10%			60%

CSE476	Fundamentals of Big-Data Analytics										2 CH
Prerequisites	( PHM111 ) AND ( CSE131 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Definition. Fundamentals of Big data technologies and tools. Distributed processing ecosystem.  Big Data Storage and Analytics. Big data analytics machine learning algorithms. Graph analytics. Big data visualization.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE476s	Fundamentals of Big-Data Analytics										2 CH
Prerequisites	( PHM111s ) AND ( CSE131s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Definition. Fundamentals of Big data technologies and tools. Distributed processing ecosystem.  Big Data Storage and Analytics. Big data analytics machine learning algorithms. Graph analytics. Big data visualization.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4			10
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE477	Fundamentals of Deep Learning										2 CH
Prerequisites	( CSE131 ) AND (PHM111)
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to deep learning and its underlying theory, the range of applications to which it has been applied. Architectures commonly associated with deep learning, basic neural networks, convolutional neural networks and recurrent neural networks. Methods to train and optimize the architectures and methods to perform effective inference
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE477s	Fundamentals of Deep Learning										2 CH
Prerequisites	( CSE131s ) AND ( PHM111s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to deep learning and its underlying theory, the range of applications to which it has been applied. Architectures commonly associated with deep learning, basic neural networks, convolutional neural networks and recurrent neural networks. Methods to train and optimize the architectures and methods to perform effective inference are explained. Some applications in computer vision and natural language processing are implemented.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						5			9
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
10%			20%			10%			60%

CSE478	Selected Topics in Systems & Artificial Intelligence										2 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Selected topics in recent developments in systems engineering and Artificial Intelligence will be presented in this course. Course material will reflect the needs of the graduating students
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE478s	Selected Topics in Systems & Artificial Intelligence										2 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
2 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Selected topics in recent developments in systems engineering and Artificial Intelligence will be presented in this course. Course material will reflect the needs of the graduating students
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			10%			10%			60%

CSE479	Multimedia Engineering										3 CH
Prerequisites	( CSE374 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to multimedia. Image data representation. Colour in image and video. Basics of digital audio. The creation of digital music and audio. Encoding and compression, segmentation, recognition and interpretation, 3D imagery. Speech coders: Speech signal analysis, Waveform coders, Voice coders, Hybrid coders. Voice over IP, Video over IP. Lossless compression algorithms. Lossy compression algorithms. JPEG, JPEG2000. Video compression techniques, MPEG-1, MPEG-2, MPEG-4, MPEG-7, H.261, H.263, H.264, H.265 High Efficiency Video Coding (HEVC). Audio compression techniques, Vocoders. MPEG audio compression. Quality of service. Applications.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE479s	Multimedia Engineering										3 CH
Prerequisites	( CSE374s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction to multimedia. Image data representation. Colour in image and video. Basics of digital audio. The creation of digital music and audio. Encoding and compression, segmentation, recognition and interpretation, 3D imagery. Speech coders: Speech signal analysis, Waveform coders, Voice coders, Hybrid coders. Voice over IP, Video over IP. Lossless compression algorithms. Lossy compression algorithms. JPEG, JPEG2000. Video compression techniques, MPEG-1, MPEG-2, MPEG-4, MPEG-7, H.261, H.263, H.264, H.265 High Efficiency Video Coding (HEVC). Audio compression techniques, Vocoders. MPEG audio compression. Quality of service. Applications.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE480	Machine Vision										3 CH
Prerequisites	( PHM111 ) AND ( CSE131 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
This course provides a comprehensive introduction to machine vision. Major topics include image processing, detection and recognition, geometry-based and physics-based vision and video analysis. Basic concepts of machine vision as well as hands on experience will be learned to solve real-life vision problems. Several applications include embedded vision and autonomous driving.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Mechatronics Engineering and Automation						4			9
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			25%			10%			40%

CSE480s	Machine Vision										3 CH
Prerequisites	( PHM111s ) AND ( CSE131s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
This course provides a comprehensive introduction to machine vision. Major topics include image processing, detection and recognition, geometry-based and physics-based vision and video analysis. Basic concepts of machine vision as well as hands on experience will be learned to solve real-life vision problems. Several applications include embedded vision and autonomous driving.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Mechatronics Engineering						5			9
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE481	Computer Animation										3 CH
Prerequisites	( CSE378 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Key-framing. Storyboarding. Animation software. Spacing and timing. Digital animation techniques. 2D and 3D animatics, special effects design, 3D paint techniques and integration. Sequence planning, non-photorealistic rendering. Kinematics, physically based dynamics modelling. Motion capture. Scene composition, lighting, and sound track generation. Visual effects process. Texture-mapping, rendering and camera tracking techniques. Live action films.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						5			9
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE481s	Computer Animation										3 CH
Prerequisites	( CSE378s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Key-framing. Storyboarding. Animation software. Spacing and timing. Digital animation techniques. 2D and 3D animatics, special effects design, 3D paint techniques and integration. Sequence planning, non-photorealistic rendering. Kinematics, physically based dynamics modelling. Motion capture. Scene composition, lighting, and sound track generation. Visual effects process. Texture-mapping, rendering and camera tracking techniques. Live action films.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE482	Game Design and Development										3 CH
Prerequisites	( CSE378 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. Advanced principles and practices of computer game design and programming. Game Design Documents. Formal, dramatic and dynamic elements of games. The process of game development. Game Balancing. The importance of testing, and how developers use the results of testing to improve their games. AI for gaming, programming, and testing.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						5			9
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE482s	Game Design and Development										3 CH
Prerequisites	( CSE378s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. The process of game development. The importance of testing, and how developers use the results of testing to improve their games. Advanced principles and practices of computer game design and programming. The different aspects of game development including 2D and 3D asset creation, rendering and animation, AI for games, programming, and testing
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE483	Computer Vision										3 CH
Prerequisites	( ECE251 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. The analysis of the patterns in visual images with the view to understanding the objects and processes in the world that generates them. Image representation and processing. Feature extraction and selection. Object recognition and probabilistic inference. Dynamic and hierarchical processing. Multi-view geometry. Projective reconstruction. Tracking and density propagation. Visual surveillance and activity monitoring. Medical imaging. Applications.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						5			9
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
35%			20%			0%			40%

CSE483s	Computer Vision										3 CH
Prerequisites	( ECE251s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Introduction. The analysis of the patterns in visual images with the view to understanding the objects and processes in the world that generates them. Image representation and processing. Feature extraction and selection. Object recognition and probabilistic inference. Dynamic and hierarchical processing. Multi-view geometry. Projective reconstruction. Tracking and density propagation. Visual surveillance and activity monitoring. Medical imaging. Applications.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE484	Big-Data Analytics										3 CH
Prerequisites	(PHM111) AND (CSE131)
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Definition and taxonomy. Challenges, trends, and applications. Big data technologies and tools. The Hadoop ecosystem. The Map-reduce paradigm. Big Data Storage and Analytics. Big data analytics machine learning algorithms. Graph analytics. Big data visualization.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						5			9
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE484s	Big-Data Analytics										3 CH
Prerequisites	( PHM111s ) AND ( CSE131s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Definition and taxonomy. Challenges, trends, and applications. Big data technologies and tools. The Hadoop ecosystem. The Map-reduce paradigm. Big Data Storage and Analytics. Big data analytics machine learning algorithms. Graph analytics. Big data visualization.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE485	Deep Learning										3 CH
Prerequisites	( CSE381 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Deep Learning algorithms learn multi-level representations of data, with each level explaining the data in a hierarchical manner. Such algorithms have been effective at uncovering underlying structure in data, e.g., features to discriminate between classes. They have been successful in many artificial intelligence problems including image classification, speech recognition and natural language processing. The course, which will be taught through lectures and projects, will cover the underlying theory, the range of applications to which it has been applied, and learning from very large data sets. The course will cover connectionist architectures commonly associated with deep learning, e.g., basic neural networks, convolutional neural networks and recurrent neural networks. Methods to train and optimize the architectures and methods to perform effective inference with them, will be the main focus. Students will be encouraged to use open source software libraries such as Tensorflow, PyTorch, and Keras.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
35%			20%			0%			40%

CSE485s	Deep Learning										3 CH
Prerequisites	( CSE381s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Deep Learning algorithms learn multi-level representations of data, with each level explaining the data in a hierarchical manner. Such algorithms have been effective at uncovering underlying structure in data, e.g., features to discriminate between classes. They have been successful in many artificial intelligence problems including image classification, speech recognition and natural language processing. The course, which will be taught through lectures and projects, will cover the underlying theory, the range of applications to which it has been applied, and learning from very large data sets. The course will cover connectionist architectures commonly associated with deep learning, e.g., basic neural networks, convolutional neural networks and recurrent neural networks. Methods to train and optimize the architectures and methods to perform effective inference with them, will be the main focus. Students will be encouraged to use open source software libraries such as Tensorflow, PyTorch, and Keras.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE486	Bioinformatics										3 CH
Prerequisites	( CSE333 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Fundamental biological, mathematical and algorithmic models underlying bioinformatics. Sequence analysis. Database search. Gene prediction. Molecular structure comparison and prediction. Phylogenetic trees. High throughput biology. Massive datasets. Applications in molecular biology and genetics. Use and extension of common bioinformatics tools.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE486s	Bioinformatics										3 CH
Prerequisites	( CSE333s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Fundamental biological, mathematical and algorithmic models underlying bioinformatics. Sequence analysis. Database search. Gene prediction. Molecular structure comparison and prediction. Phylogenetic trees. High throughput biology. Massive datasets. Applications in molecular biology and genetics. Use and extension of common bioinformatics tools.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE487	Selected Topics in Multimedia & Computer Graphics										3 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Selected topics in recent directions in multimedia and computer graphics will be presented in this course.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE487s	Selected Topics in Multimedia & Computer Graphics										3 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Selected topics in recent directions in multimedia and computer graphics will be presented in this course.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE488	Ontologies and the Semantic Web										3 CH
Prerequisites	( CSE472 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Logic-based knowledge representation. Basic reasoning tasks. Modelling in description logics: informal examples, ontologies, models and consistency of knowledge bases. Formal syntax and semantics. Reasoning tasks and the associated algorithms. Correctness proofs. Fasic reasoning tasks and their relations: concept satisfiability, subsumption, instance checking. Tableau-like algorithms and their implementation. Knowledge bases. ABoxes, reasoning over ABoxes, algorithms and implementation. Semantic web. Semantic web standards.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE488s	Ontologies and the Semantic Web										3 CH
Prerequisites	( CSE472s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Logic-based knowledge representation. Basic reasoning tasks. Modelling in description logics: informal examples, ontologies, models and consistency of knowledge bases. Formal syntax and semantics. Reasoning tasks and the associated algorithms. Correctness proofs. Fasic reasoning tasks and their relations: concept satisfiability, subsumption, instance checking. Tableau-like algorithms and their implementation. Knowledge bases. ABoxes, reasoning over ABoxes, algorithms and implementation. Semantic web. Semantic web standards.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE489	Selected Topics in Data Science										3 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Selected topics in recent directions in data science will be presented in this course.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						4
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
15%			20%			20%			40%

CSE489s	Selected Topics in Data Science										3 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
3 Hours				1 Hour				1 Hour
Required SWL			125			Equivalent ECTS			5
Course Content
Selected topics in recent directions in data science will be presented in this course.
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
20%			20%			20%			40%

CSE491	Computer & Systems Engineering Graduation Project (1)										3 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
0 Hours				0 Hours				5 Hours
Required SWL			175			Equivalent ECTS			7
Course Content
This course represents the first part of the graduation project, where the students work in the graduation projects under the supervision of faculty members.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						5			9
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
60%			0%			40%			0%

CSE491s	Computer & Systems Engineering Graduation Project (1)										3 CH
Prerequisites
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
0 Hours				0 Hours				5 Hours
Required SWL			175			Equivalent ECTS			7
Course Content
This course represents the first part of the graduation project, where the students work in the graduation projects under the supervision of faculty members. This course is a real-life like experience where students team up to solve a real problem. The output of this course is a prototype with a partial implementation that shows the feasibility and the benefits of their future complete solution.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						5			9
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
40%			0%			60%			0%

CSE492	Computer & Systems Engineering Graduation Project (2)										3 CH
Prerequisites	( CSE491 )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
0 Hours				0 Hours				5 Hours
Required SWL			175			Equivalent ECTS			7
Course Content
As a continuation of the first part of the graduation project, the students continue work in the graduation projects under the supervision of faculty members.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer Engineering and Software Systems						5			10
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
60%			0%			40%			0%

CSE492s	Computer & Systems Engineering Graduation Project (2)										3 CH
Prerequisites	( CSE491s )
Number of weekly Contact Hours
Lecture				Tutorial				Laboratory
0 Hours				0 Hours				5 Hours
Required SWL			175			Equivalent ECTS			7
Course Content
As a continuation of the first part of the graduation project, the students continue work in the graduation projects under the supervision of faculty members.
Used in Program / Level
Program Name or requirement						Study Level			Semester
Computer and Systems Engineering						5			10
Assessment Criteria
Student Activities			Mid-Term Exam			Oral/Practical			Final Exam
40%			0%			60%			0%