توصيف مختصر لمقررات علوم الحاسب

توصيف مختصر لمقررات قسم علوم الحاسب

 

Course Code :            CSC 225

 

Course Title :            Assembly Language

  

Prerequisites :            CEN 126

 

Credit Hours : 3        Lecture Hrs: 3            Lab Hrs: 2       Tut. Hrs: 0      Level:5

 

Course description

 

Introduction to PC hardware, PC software requirements, assembly language programmers requirements, program logical and control, string operations, arithmetic operations for processing binary data , assembling linking and executing a program.

 

Textbook

 

Peter Abel. IBM PC Assembly Language and Programming ". 1998

 

 

ـــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــ 

Course Code   : CSC 237

 

Course Title : Programming Languages Concepts

 

Prerequisites: CSC 283

 

Credit Hours : 3         Lecture Hrs: 3             Lab Hrs: 0       Tut. Hrs: 0

 

Course description:

 

Preliminaries. Evolution of the Major Programming Languages. Describing Syntax and Semantics. Lexical and Syntax Analysis. Names, Binding, Type Checking, and Scopes. Data Types. Expressions and Assignment Statements. Statement-Level Control Structure.  Subprograms. Implementing Subprograms. Abstract Data Types.   Support for Object-Oriented Programming. Concurrency. Exception Handling and Event Handling. Functional Programming Languages. Logic Programming Languages. Project.

 

Textbook

 

Robert W. Sebesta. Concepts of programming languages, 2008 Addison-Wesley

 

ــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــ

Course Code   : CSC 276

 

Course Title : Computer Graphics

 

Credit Hours : 4         Lecture Hrs: 3             Lab Hrs: 2       Tut. Hrs: 0       Level:5

 

Prerequisites: CSC 153

 

Course description:

  

Computer Graphics Applications Survey. Color models (chromaticity diagram, RGB, CMY, YIQ, HSV, and HLS color models). Graphics Output Primitives (coordinate frames, DDA, Bresenham’s algorithm, circle-drawing, fill-area primitives algorithms). 2D Graphics (2D cartesian coordinates, curves and parametric equations, functions and transformations, inverse functions. 3D Graphics (vectors in 3D, dot and cross product, homogeneous coordinates, correlation between cartesian and homogeneous coordinates). Geometric transformations (2D geometric transformations, matrix representation and homogeneous coordinates, inverse transformations, 2D composite transformations). Geometric representation (Lagrange polynomials of degree n, Hermite cubic polynomial, Bernstein polynomial, interpolation problem, Spline interpolation, problem of approximation, Bezier-Bersnstein approximation, Bezier-B-Spline approximation, quadric surfaces).

 

 

Graphics Lab: modeling, rendering, animation using 3D Studio Max? from Autodesk?. Use of OpenGL?. 

 

Textbook:

 

Hearn, D. and P. Baker “Computer Graphics with OpenGL”. Pearson Prentice Hall, Pearson Education Inc., Upper Saddle River, NJ07458, USA, 2004. PIE ISBN 0-13-120238-3.

 

 

ــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــ  

Course Code   : CSC 313

 

Course Title : Algorithms Analysis and Design

  

 

Credit Hours : 3         Lecture Hrs: 3             Lab Hrs: 0       Tut. Hrs: 0       Level : 8

 

             : CSC 214

 

Course description:

 

Introduction to Algorithms Analysis and Design, General Algorithms: (1- Greater Common Divisor Algorithm, 2- Smaller Common Multiple Algorithm, 3- Pascal-Triangle Algorithm, 4- Inverse Number Algorithm, 5- Recursive Algorithm), Algorithms And Procedures, Algorithm Analysis: (Algorithm Efficiency, Algorithm Run-time, Algorithm Complexity, Computation Horner Algorithm Complexity Degree, Multiplication Two Polynomials Complexity Degree, Computation Using While Loop Algorithm Complexity Degree), Sorting Algorithms: (Insert Sort Algorithm, Selection Sort Algorithm, Bubble Sort Algorithm, Heap Sort Algorithm, Merge Sort Algorithm, Qsort Algorithm, Files Sorting Algorithms), Searching Algorithms, Backtracking Algorithms: (8-th Queen Problem, Optimal Option Poblem).

  

Textbook

  

Michael T.Goodrich,Roberto Tamassia , Algorithm Design: Foundations,Analysis,and Internet Examples, John Wiley & Sons Inc 0-471-38365-1, 2002

 

 

ــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــ

 

 

Course Code: CSC 327

 

Course Title: Operations Research &Applications programming 

 

Credit Hours :3         Lecture Hrs: 2    Lab Hrs: 2 Tut. Hrs: 0 Level:

 

8

 

Prerequisites: CSC 283

 

Course description:

 

OR Approach, Methodology And Applications : modeling, constraints, objective and criteia. Problems of multiple criteria optimization, model validation and systems design. Mathematical programming; simulation, gaming; heuristic programming. Examples,: theory of inventory. Production; linear and quadratic cost functions. Waiting line problems: single and multiple servers with Poisson input and output. Theory of games for two-person competitive situations. Project management through PERT-CPM

 

Textbook:

 

Hamdi Taha, Operations Research: An Introduction (7th Edition), ISBN: 0130323748, 2002

 

 

 

ــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــ

 

 

 

Course Code   : CSC 338

 

Course Title : Compiler Design

 

Prerequisites: CSC237

 

Credit Hours : 3         Lecture Hrs: 3             Lab Hrs: 0       Tut. Hrs: 0 Level: 7

 

Course description

 

The design and implementation of compilers. Compiler organization, algorithms for lexical, syntactic and semantic analysis, top-down and bottom-up parsing (e.g., recursive descent, LL, LR, LALR parsing). Symbol table organization, error detection and recovery, intermediate and object code generation, and code optimization. Student has to implement a compiler for a simple high level language as project.

 

Textbook:

 

"Compilers: Principles, Techniques, and Tools"; 1986; Addison-Wesley; ISBN: 0-201-10088-6;  (The dragon book

 

ـــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــ

 

 

 

Course Code :  CSC 392

 

Course Title: Selected Topics for Computer science

 

Credit Hours :3         Lecture Hrs:    Lab Hrs: 0 Tut. Hrs: 0         Level:8

 

Prerequisites : 

 

Course description:

 

In this course, advanced topics in computer sciences are proposed, like: Java Object-Oriented programming, Object-Oriented Software Engineering, Application Programs, Operating Systems Design and implementation, Distributed Operating Systems, Distributed Computing, Introduction to Parallel Computing.

 

Textbooks:

 

The text book depends on the topic of the course

 

ــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــ

 

 

Course Code: CSC 414

 

Course title: introduction to Unix and Linux

 

Prerequisites: CSC 229

 

Credit Hours : 3.                   Lecture Hrs:2.        Lab Hrs:2.           Level:9

 

Course description:

 

 User/kernel interface, fundamental concepts of Unix, user authentication, basic and advanced I/O, file system, signals, process relationships, and inter-process communication. Fundamental development and debugging tools such as "make" and "gdb" will also be covered.

 

 Textbook:

 

W. Richard Stevens, Advanced Programming in the UNIX Environment, Addison Wesley Professional, 1992.

 

ــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــ

 

 

Course Code: CSC 448

 

Course title : Optimization Techniques

 

 Perquisites: CSC 327

 

Credit Hours: 3 Lecture Hrs 2: Lab Hours: 1   Tut. Hrs: 0

 

 Course description:

 

Unconstrained optimization theory. Convex functions and convex sets. Algorithms for unconstrained optimization (Steepest descent Newton methods Conjugate gradient methods). Constrained optimization theory (Kuhn-Tucker conditions). Special problems: (Linear programming Quadratic Programming). Algorithms for constrained optimization. 

 

Since this is a course on optimization techniques you will need to be able to program with high level programming languages (e.g C/C++, Java, C#)

 

 Textbook :

 

Wright, S. and J. Nocedal Numerical Optimization Springer

 

ــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــ

 

 

Course Code : CSC 458      

 

Course Title : Distributed Systems and Parallel Processing

 

Credit Hours : 3         Lecture Hrs: 3             Lab Hrs: 0       Tut. Hrs: 0

 

Prerequisites : CSC 229

 

 Course description:

 

Introduction to distributed systems, processes and processors, parallel architecture (multi-computers, multi-processors), communication in parallel systems, performance of parallel systems, examples of parallel programming, introduction to distributed systems, distributed algorithms, types of distributed systems, compatibility of distributed systems and discovery of the end of processes.

 

 Textbook:

 

Coulouris, G., Jean Dollimore, and Tim Kindberg Distributed Systems: Concepts and Design, Addison-Wesley, 3rd Edition, 2001-ISBN: 0-201-619180

 

ــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــ

 

 

Course Code : CSC 498

 

Course Title: Project I

 

Credit Hours : 2      Lecture Hrs:      Lab Hrs:   Tut. Hrs:             Level:9

 

Prerequisites : 100 CH

 

Course description:

 

Student will study, design and develop an integrated system, and he will be examined at the end of the semester.

 

Textbooks

 

Selected papers and researches related to the project topic

 

ــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــ

 

 

Course Code : CSC 499

 

Course Title: Project II

 

Credit Hours :4         Lecture Hrs:       Lab Hrs:    Tut. Hrs:                        Level: 10

 

Prerequisites : CSC498

 

 Course description:

 

Student will study, design and develop an integrated system. Examination to be held at the end of the semester.

 

 Textbooks:

 

Selected papers and researches related to the project topic

 

ـــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــ

 

 

Course Code: CSC357

 

Course Title: Internet Techniques &  web programming.

 

Credit Hours : 3       Lecture Hrs: 2    Lab Hrs: 2 Tut. Hrs: 0         Level: 8.

 

Prerequisites: CEN 345

 

Course description:

 

An overview of connecting to and navigating within the Internet system and the World Wide Web: Navigation. Search Engines. Advanced search techniques. Design of web pages using HTML, XML and Java. TCP/IP. Client/Server architectures. Mastering Connectivity. Security.

 

Textbook :

Gary P. Schneider and Jessica Evans The Internet -- 3rd Edition, Course Technology, 2002.

 

 

ـــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــ

 

Course Code: CSC393

 

 

Course Title: Systems Programming

 

Credit Hours :3         Lecture Hrs: 3    Lab Hrs: 0 Tut. Hrs: 0   Level : 8

 

Prerequisites: CSC338

 

Course description

 

Study of one particular processor, assembly for this processor. Introduction to the assembly laguage of this processor. Design and implementation of an assembler (translation to machine code).

 

Linkers and loaders: Absolute loaders; Program relocation; Program linking; Data structures; Dynamic loading; Bootstrap loaders.

 

Macro processors: Data structures and logic flow for a simple one-pass macro processor; Concatenation of macro parameters; Generation of labels in macro expansions; Conditional macro expansion; Macro processing within an assembler; General-purpose macro processors. Project.

 

Textbook :  

Leland Beck "An introduction to Systems programming", Addison Wesley, 1990

ـــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــ

 

CSC463 : Artificial Intelligence

 

Credit Hours : 4        Lecture Hrs: 3             Lab Hrs: 2       Tut. Hrs: 0 Level : 10

 

Prerequisites: CSC 214

 

 Course description

 

Introduction & Definitions. Agent  and examples. Uninformed Search. Heuristic Search. Constrained Search Problems  (CSP). Logical agents. First Order Logic and examplesMachine Learning. Project.

 

 Textbook

 

Russell, S. J. and P. Norvig. Artificial Intelligence, A Modern Approach, Prentice Hall,2003,USA.

 

 

ــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــ

 

CSC463 : Artificial Intelligence

 

Credit Hours : 4        Lecture Hrs: 3             Lab Hrs: 2       Tut. Hrs: 0 Level : 10

 

Prerequisites: CSC 214

 

 Course description

 

Introduction & Definitions. Agent  and examples. Uninformed Search. Heuristic Search. Constrained Search Problems  (CSP). Logical agents. First Order Logic and examplesMachine Learning. Project.

 

 Textbook

 

Russell, S. J. and P. Norvig. Artificial Intelligence, A Modern Approach, Prentice Hall,2003,USA.

 

 

01/01/2018
20:17 PM