You are on page 1of 11

) (:

: -
.
:
.
) ( .
: -
)
(.

) (:

:


.
:
.
: -
. : .

(101

:(English language

:Contents
.(The pages (1-50
:Reference
.Elementary Grammar workbook 1
.For:
Muriel Higgins

)English language ( 102


Contents:
) The units ( 1- 3-5-6-7-9-10-12-13-15
Reference:
Opening Strategies Strategies 1 Students Book.
For : Brian Abbs / Ingrid freebrain.

) ) English Language ( 202 )202

1 - 11


Contents:
The Units ( 3-4-6-8-9-10-12-13-14-15 ).
Reference: Headway Intermediate Students Book.
For :
John and Liz Soars.
)) - English Language (201 )201
Contents:
The Units (2-3-4-5-6-8-9-12-13-15).
Reference:
Building Strategies strategies (2) Students Book.
For:
Brian Abbs / Ingered Forebrain.

:
.
:
:
:
.
:
.
:
.
:.
:

Introduction to Computer Science


:Objectives
Introduction to the basis of computer science and solving problems by
.using algorithm and flow-charts, also programming with Basic
Contents
Historical Overview.
Generation of Computers.
Binary and Decimal Systems.

Algorithm and Flow-Charts.

Introduction to Basic.

Input and output Statements.


2 - 11


Conditional Branching.
Unconditional Branching.
Looping.
Arrays.
Multiple Branching.
Functions.
Subronibine.
Records.
Graphics.

( Calculus ( 1
* Background Mathematics:
Equations, Inequalities and Intervals.
Powers and Logarithms: the rules of indices The inverse operations
Rules of logarithms.
Measurement and Calculation.
* Functions and Calculus:
Sets and Functions: sets Operations on sets Relations and functions
combining functions.
Functions and Their Graphs:
y = mx + c
y = ax 2 + bx + c
y =1 / x y = a x - Graph
sketching using simple transformations y = x - Symmetry of
functions and their graphs - Solving inequalities Using graphs to find
an expression for the function from experimental data.
Trigonometric Functions and Waves: Trigonometric functions and
radians Graphs and important properties Wave functions of time
and distance Trigonometric identities Superposition Inverse
trigonometric functions solving equations.
Limits and Continuity of Functions: Definition of limit Theorems of
limits Terminal limits Infinite limits Continuous functions
Theorems of continuity Continuity on an interval Derivative of a
function.
Differentiation: The average rate of change and the gradient of a cord
The derivative function - Some common derivatives Finding the
derivative of combinations of functions Applications of
differentiations.
The Exponential Function and Other Functions: Exponential growth
and decay The Exponential function: y = et - The Logarithmic
functions The Hyperbolic / Inverse Hyperbolic functions The

3 - 11


Trigonometric / Inverse Trigonometric functions More
differentiation.
Maxima and Minima and Sketching Functions: Stationary points and
local maxima and minima Graph sketching by analysis the functions
behavior.
Digital logic design:

Numbering systems, Boolean algebra and logic gates. Truth


tables. Simplification of Boolean functions (algebric method,
karnauph maps, and queen McKlausky method). DeMorgans
theorem. Flip Flops.

) -
- -
(
-
.
:

)


- Z ( .
:
:


.
:


.
: - )
( )

( ) -
( .
:

.
: )
(

4 - 11


Programming in Visual Basic I:
Introduction to visual basic. Control statements. Sub
procedures and functions. Arrays and strings. Graphical user
interface concepts (properties, methods, and events of label,
radio buttons, checkboxes, image box, and timer). Mouse and
keyboard. Dialog boxes.

Programming in Visual Basic II:

Advansed form controls (Listbox, combobox, OLE, scroll bar,


shape, line). Menus. Error handling. Database controls (data
control, ADO control, Visual data manager). Data bound grid
control. Crystal report. Graphics. String manipulation. Active
X.

Programming in C++:
Data types. Definition of variables. Methods. Decision
statements. Iteration statements. Strings. Arrays. Union and
structure. Functions. Pointers. References. Using pointers and
references to pass parameters.

Object Oriented Programming (C++):


Concepts. Abstract data types. Classes and objects.
Encapsulation. Overloading functions and constructors. Access
modifier. Inheritance. Access specifier. Multiple inheritance.
Virtual functions and polymorphisim. Containers.

Database systems:
Basic concepts of databases. DBMS components. Transaction
managements. Data modeling. Entity relationships diagrams.
Relational databases. Database integrity constraints.
Relational algebra. Query languages. Dependencies, schema
design normalization and redundancy elimination.

Database Lab I:

Case study: Access (relations, queries, forms, reports,


objects, properties).

Advanced database systems:

Advanced topics in DB systems: Query processing, Query


processing, Transaction processing, recovery system,
concurrency control, OODB Distributed, Security and Privacy.
Writing a technical report about a selected topic in-class
presentation.

Database Lab II:


Case study: Designing forms based on visual basic to implement
a complete database application.

Operating systems:

5 - 11


Introduction (simple batch system, Multiprogramming batched
system, Time sharing system, personal computer system,
parallel systems, distributed system, real time system).
Computer system structure (computer system operation, I/O
structure, storage hierarchy, hardware protection, general
system architecture). Operating system structures (system
components, operating system services, system calls, system
programs, virtual machines, system design and implementation,
system generation). processes (process scheduling, cooperating
processes, threads, interprocess communication). Memory
management. Virtual management.

Operating system Lab I:


Linux/Unix installation and administration.

Advanced operating system:

CPU scheduling (Basic concepts, scheduling algorithms,


Multiple process scheduling, real time scheduling, Algorithm
evaluation). Process synchronization. Dead locks. Mass storage
management. Distributed system structure. Event ordering.
Atomicity. Concurrency control. Remote procedure calls. File
system management. Distributed file system.

Operating system Lab II:


Algorithms and policies programming (simulation). Operating
system tools design.

Computer Architecture:
Introduction. Computer organization. Computer buses and their
types. Arithmetic and logic unit. Memory units and addressing.
Input/output units. Data transfer channels and interface
units. Parallel processors: closely and tightly coupled. CISC
and RISC.


:
( - )

)
. ( Parameter :

) (

.
: ) (

) ( Median ) ( Mean)
:(Mode
.
6 - 11


:
.



.
:
.
- # :
:
) ( - .
] ) - (1 :
- (2) - [.
.
: - :
:


.
: .
:

) (.
: ) - ( Mean


.
:
) - ( OLS

.




Microprocessor & Assembly language:
7 - 11


Introduction to processor. Memory (real and protected mode).
Arithmetic and logic unit ALU. Addressing modes. Data transfer
instruction. ALU instructions, BSD and ASCII arithmetic
instructions, shift and rotate instructions. Conditional and
unconditional program transfer instructions. Procedures.
Passing parameters through registers. Hardware and software
interrupts.

Computer Networks
Network architectures; OSI model; TCP/IP model communication
protocols; LAN topologies; internetworking devices; WANs;
gigabit Ethernet; wireless networking; WAP; and introduction
to network security.

Computer networks

II:

Network layer. Structure of WAN. Bridges and gateways.


Routering and router configuration (algorithms). Transport
layer. Internetworking protocols. Network management protocols
(internetworking, IP protocol, ICP, submit). Network
applications (Email management, FTP, telnet, internet domain).

Software Engineering
Study of the principles and practices of software engineering.
Topics include software quality concepts, process models,
software requirement analysis, design methodologies, software
testing, and software maintenance. Hands-on experience in
building a software system using the waterfall life cycle
model in the lab environment. Students working in teams to
develop all life cycle deliverables: the requirements,
specification and design documents, the system code, test
plan, and user manuals.

Simulation & Modeling


Simulation models; discrete and trace-driven simulations; Data
collection and analysis; random number generators, analysis of
output, and optimization; analytic modeling; queuing theory
and workload characterization. A set of laboratory experiments
will provide hands-on experience in related topics.

Data Communications and Computer Networks

Data Communication principles. Network Reference Model.


Interfaces and
Services. Protocols. Physical Layer. Communication Services.
Date Link
Layer. Synchronization. Flow Control. Socket Programming. MAN
Protocol. Ethernet. Token Ring. FDDI. Wireless Communication.
Protocols and Programming. TCP/IP Reference Model. Routing 13
Algorithms. Network Layer. Network Security. Transport Layer.
Data Encryption and Decryption. Application Layer.

.NET Framework (VB.NET):


Overview on Visual Studio.NET. Introduction to .NET Framework
namespaces and classes. Data types. Operators. Control

8 - 11


statements. Classes (Access modifier, constructors, methods,
overloading methods, and property). Arrays. String and
StringBuilder. Inner class and container. Structure.
Enumerated group. Collections. Inheritance (Abstract class,
Interface, Overriding methods, and polymorphisim). Creating
windows applications (Form class and its properties,
components, class and their properties, event driven methods).

System analysis and design:

Fundamental concepts. Notion of a system. Information system.


System file cycle. Approaches to system analysis and design
(classical, structured and object oriented). Preliminary and
detailed analysis. Workflow and dataflow diagrams. Structured
English. Decision tables. User interface design

Computer graphics:

Fundamental knowledge in 2D and 3D computer graphics


mathematics. Systems of linear equations. Matrices.
Determinants. Vector spaces. Linear transformations. Innerproduct and cross-product spaces. Orthogonally. A
comprehensive introduction to the field of computer graphics.
2D graphics. Transformations.

WEB Page Design

Introduction to HTML; Hypertext and esthetic design issues;


Structure of HTML documents and tag syntax; HTML editors and
conversion of multimedia files to HTML documents; tables,
forms, graphical audio, and video; authoring tools (e.g.,
Frontpage); Java Scripts. Human factors and efficiency issues.

Programming in Java I:
Introduction to Java. Data types. Operators. Control
statements. Methods. Classes. Reference types (Arrays, String
and StringBuffer). Packages. Containers. Inheritance (Access
modifier and constructors). Inner classes. Abstract class and
Interface. Polymorphisim. Boxing. Command line arguments.

Programming in Java II:

File system management. GUI (Java swings and event handling).


Database applications.Application and Applets. Exceptions.
Threading. I/O streams. Networking.

Compiler design:

Theory and practice of compiler design for imperative and


object-oriented languages. Phases of compiler writing. Lexical
analysis, parsing and intermediate code generation. A compiler
for a subset of particular OO languages. Similar imperative
languages are implemented as a part of term project. Compiler
generating tools. Basic concepts of programming language
theory and a comparative study among them.

9 - 11


Cryptography
Classical Encryption Techniques , Block Ciphers and the Data
Encryption Standard , Introduction to Finite fields , Advanced
Encryption Standard , Public-Key Cryptography and RSA, Key
Management; Other Public-Key Cryptosystems

Artificial intelligence:

Introduction to AI and its scope and applications. AI


programming languages. Knowledge representation. Types of
searches and problem solving with different strategies for
solving different types of problems. Introduction to knowledge
based systems. Expert systems. Natural language processing.
Machine learning. Other AI applications. A project is required

):(Neural Networks
:
.1

.
.
.

.
McCulloch_Pitts :
.2

.
.

) (

) Hebb + Hebb Hebb

+(
) Perceptron +

+ Perceptron
+(

.Perceptron
)Adaline +

+(
)Madaline +

+(
:
.3
Hebb

Deha .

) +(.
) +

+(.
)

+ +
+ (.

10 - 11


) +

+(.


:

.1

.

.2
.

.3
.
.4
:
.5

.6

:

.
.7

11 - 11

You might also like