Logical Circuit Design

Teaching Methods: 35 hours Lectures (2 per week) + 13 hours Tutorials (average 1 per week)

Learning Outcomes:

A student completing this module should be able to:

1. understand different programming paradigms. (A, D)

2. understand the syntax and semantic of programming languages. (A, B)

3. develop different projects using different programming languages. (B, C, D)

4. design a new programming language. (B)
Assessment of Learning Outcome:

Learning outcome (1) and (2) are assessed by homework, assignments, and examinations. Learning outcome (3) is assessed by project assignment and examinations. Learning outcome (4) could be assessed by project.

Contribution to Programme Learning Outcomes:

A1, B1, B3, C5, D4, D6
Synopsis: Introduction; A survey of Programming Paradigms; Imperative Programming: Names, Bindings, and Type Checking; Scopes; Data Types: Primitive Data Types, Character String Type, User-Defined Ordinal Types; Data Types : Array Types, Record Types, Union Types, Set Types, and Pointer Types; Statement-Level Control; Subprograms; Abstract Data Types; Support for Object-Oriented Programming; Functional Programming; Logic Programming; Scripting Languages


Modes of Assessment:

Two 1-hour midterm exams (15% each); Assignments (15%); Tutorial contribution (5%) + 2-hours Final Unseen Exam (40%) + Project (10%)

Textbooks and Supporting Material:

1. 
   Robert W. Sebesta, Concept of Programming Languages, Addison Wesley, 5^th Edition, 2002
   
2. 
   Terrence W. Pratt, Programming Languages: Design and Implementation, Prentice-Hall, 2002
   
3. 
   Ravi Sethi, Programming Languages Concepts and Constructions, Pearson Education, 1996
   
4. 
   Allen B. Tucker, Programming Languages, McGraw Hill, 1988
   
5. 
   C. Ghezzi and M. Jazayeri, Programming Language Concepts, John Wiley and Sons, 1982
   

750331, Advanced Operating Systems
Providing Department: Computer Science, Faculty of IT

Module Coordinator(s):

Year: 3

Credit: 3 credit hours

Prerequisite: 711232

Prerequisite for: 750432
Aims:

The aim of this module is to study, learn, and understand the main concepts of advanced operating systems (parallel processing systems, distributed systems, real time systems, network operating systems, and open source operating systems); Hardware and software features that support these systems.

Teaching Method: 45 hours Lectures (2-3 per week) + 3 hours Seminars

Learning Outcomes:

A student completing this module should be able to:

1. 
   Outline the potential benefits of distributed systems. (A).
   
2. 
   Apply standard design principles in the construction of these systems. (A, B).
   
3. 
   Select appropriate approaches for building a range of distributed systems, including some that employ middleware. (B, C).
   
4. 
   Summarize the major security issues associated with distributed systems along with the range of techniques available for increasing system security. (A)
   

Assessment of Learning Outcome:

Learning outcome (1) is assessed by tutorials and examinations.

Learning outcome (2) is assessed by tutorials, homework, seminars, and examinations.

Learning outcome (3) is assessed by tutorials.

Contribution to Programme Learning Outcomes:

A2, A3, A4, A5, B2, B3, C5.
Synopsis: Review of Operating Systems concepts; Hardware concepts of distributed systems

Software concepts and design issues; Communication in distributed systems; Threads and thread usage; Multithreading operating system; Client – server model; Implementation of Client-server model; Remote procedure call; Implementation of remote procedure call; Synchronization in distributed systems; Clock synchronization; Mutual exclusion; Election algorithms; Transaction and concurrent control; Deadlock in distributed systems; Processor Allocation; Real – time distributed systems; Distributed file systems

Modes of Assessment:

Two 1-hour midterm exams (15% each); Seminars (10%); Report (10%); 2-hours Final Unseen Exam (40%) + Final Project (10%)

Textbooks and Supporting Material:

1- Andrew S. Tanenbaum; Distributed operating systems; Prentice Hall; 1995

2- Jean Bacon; Concurrent Systems; Addison – Wesley; 1998

3- William Stallings; operating systems; Prentice Hall; 1995

750398, Practical Training
Providing Department: Computer Science, Faculty of IT

Module Coordinator(s):

Year: 3

Credit: 3 credit hours

Prerequisite: 721281; It is implanted according to the Faculty regulations
Aims:

The main aim of this module is that students will have practice in different industrial, commercial, administrative enterprises or companies. By this module, students may apply, in the real world, what they have learned during the first three years of their study in the University. The module also aims to teach students how to be self-confident when they face problems in their practical life.

Teaching Methods:

Duration: at least 9 weeks (18 training hours per week at least). This may be distributed onto at most two semesters.

Regulations for Training:

Students have to register on at most 15 credit hours in the semester in which they register on the practical training module.

2- Students must be full-time trainees for at least 2 days per week.

3- Students who take this module should arrange their timetable for other modules in a way that enables them to enrol in the pre-specified enterprise or company at least two days per week during the semester period.

4- The student has to get an official letter from the Faculty requesting a placement, and the Faculty provides a standard document that the placement provider could use to confirm that appropriate opportunities would be available to the student.

5- There is an academic supervisor for any trainee from the Department in addition to the supervisor from the placement provider.

6- Student should submit a report at the end of the training period.

7- At the end of the training period, the student and the placement provider fill some forms that will be used in assessing the student.

8- More information about training can be found in the Practical Training Handbook.

Learning Outcomes:

A student completing this module should:

1- be able to prepare and write any technical report. (C)

2- be prepared for any practical work (C)

3- be able to use IT skills (D)

4- learn how to work with and for others. (D)

Assessment of Learning Outcomes:

Learning outcome (1) is assessed by report evaluation, learning outcomes (3) – (4) are assessed by the observation of the training committee.

Contribution to Programme Learning Outcomes

C2, C3, D1, D2, D3

Synopsis: This module requires no syllabus, but any previously taught module will be valuable and can be applied in the practice.
Modes of Assessment:

A committee from the department supervises the students along their training period, where one supervisor is assigned on one group of students. The student should submit a technical report to this committee in 2 weeks time after completing the training session. In addition, the trainer body presents a report to the committee. The grade "pass" is given to students who complete the training requirements successfully and discuss their reports with the supervision committee.

750231, Logical Circuit Design
Providing Department: Computer Science, Faculty of IT

Module Coordinator(s):

Year: 1

Credit: 3 credit hours

Prerequisite: 750101

Aims: This module introduces you to the design and implementation of digital circuits. Topics include: combinational and sequential circuit analysis and design, digital circuit design optimization methods using random logic gates, multiplexers, decoders, registers, counters and programmable logic arrays. Laboratory experiments will be used to reinforce the theoretical concepts discussed in lectures. The lab experiments will involve the design and implementation of digital circuits. Emphasis is on the use computer aided tools in the design, simulation, and testing of digital circuits.

Teaching Methods: 41 hours Lectures (2-3 per week) + 4 hours Tutorials (1 per 3 weeks) + 3 hours Laboratory (1 per 4 weeks)
Learning Outcomes:

A student completing this module should be able to:

8. 
   Define the problem (Inputs and Outputs), write its functions. (A, B, C)
   
9. 
   Minimize functions using any type of minimizing algorithms (Boolean Algebra, Karnaugh map or Tabulation Method). (A, B)
   
10. 
    Implement functions using digital circuit (Combinational or Sequential). (A, B)
    
11. 
    Have knowledge in analyzing and designing procedures of Combinational and Sequential circuits. (B, C)
    
12. 
    Have knowledge in designing and analyzing circuits with Flip-Flops, Counters and Registers. (B, C)
    
13. 
    Work effectively with others. (D)
    
14. 
    Use simulation software, for testing the designed circuit. (C, D)
    

Assessment of Learning Outcomes

Learning outcomes (1), (2), and (3) are assessed by examinations, tutorial and in the laboratory. Learning outcomes (4), (5), and (6) is assessed by course work/workshops. Learning outcomes (7) is assessed in the laboratory.