Help with Search courses

English for Computer Science

The course will try to make the students of the computer science department more familiar with computer and computing terminologies so that they can deal more effectively with their specialized subjects. This will be done depending on some specialized text books dealing with the English language for computing.


Linear Algebra

Intended for students who are using Matlab for the first time and have little or no experience in computer programming. So; the Main topics to be covered in this course are: Starting MATLAB, MATLAB windows (Introduction to MATLAB environment), Working with MATLAB command window, Arithmetic operations with scalar, etc. Examples of MATLAB applications, Creating Arrays, Mathematical operations with arrays, Two dimensional plots, Programming in MATLAB, Built toolboxes using menu and GUI in MATLAB and more applications.

Data Structures I

The subject will guide the student through the algorithms, programming and applications of data structure. 


Object Oriented Programming I

This subject will guide the students through all aspects of Object Oriented Programming, including Basic concepts of programming, Object data, Classes, inheritance, modifiers, constructors, and overloading concepts.


Principle of Statistics

This Course consists of 4 Topics which contain deferent types of statistical methods to Collect, Classified, Analyzed and Interpret the data. Therefore, Tabular and Graphical Method, Measures of Location, Measure of Dispersion (Variability), Measures of Location and Dispersion for grouped data (Classified data), will be described in details throughout 15 Weeks. 

Database Systems I

 Database concept and terminology, Database Systems versus legacy Files Systems, Database Management Systems (DBMSs), Entity-Relation Data Model (ERDM), Relational Data Model (RDM) and Normalization.

Computation Theory I

This course emphasizes theoretical models of computation and their analysis. The aim of analysis is to identify and prove the capabilities and limitations of particular models of computation. It is shown that there are problems that are unsolvable, that is, there are questions that cannot be answered by any model of computation.

 The course introduces some fundamental concepts in Types Of grammars (Chomsky Hierarchy) and automata theory and formal languages including grammar, finite automaton, regular expression, formal language. Not only do they form basic models of computation, they are also the foundation of many branches of computer science, e.g. compilers, software engineering, and Natural Language Processing. The properties of these models will be studied and various rigorous techniques for analyzing and comparing them will be discussed, by using both formalism and examples.