اختبار القبول لبرنامج الماجستير بقسم علوم الحاسبات

[Amazon]

اختبار القبول لبرنامج الماجستير للعام الجامعي 1430/1431هـ

ADMISSION TEST FOR MASTER OF COMPUTER SCIENCE 2009/2010 G

موعد الاختبار

Test date

الاثنين 9 جماد الأول 1430

من الساعة الواحدة ظهراً إلى الثالثة ظهراً

Monday 4 May 2009

From 1 pm to 3 pm

اختبار القبول في علم الحاسب يستخدم لقياس التحصيل الدراسي للطلاب و مدى اتساعه، وأيضا يستخدم لتقييم النتائج التعليمية. كما يقيم الاختبار قدرة الطالب على تحليل المشاكل وحلها، و كذلك فهم العلاقات. وسوف تكون أسئلة الامتحان على شكل مجموعات و بصيغ وأشكال مختلفة منها ما يكون في صيغة رسوم بيانية ، أو أجزاء من برامج، و أيضا قد تكون بالطريقة الوصفية التقليدية. سوف يغطي الاختبار أربعة مواضيع:

• الرياضيات المتقطعة
• تنظيم الحاسب
• نظم التشغيل
• قواعد البيانات

The admission test in Computer Science is used to measure student academic achievement and growth, and to assess the educational outcomes. The test also evaluates student' abilities to analyze and solve problems, understand relationships. Exam questions will be grouped in sets and they will be in different form such as diagrams, program fragments, and generic deions. The test will cover the following subjects:

• Discrete Math Structures
• Computer Organization
• Operating Systems Concepts
• Fundamentals of Database Systems

book

Chapters and sub-sections

Subject

DISCRETE MATHEMATICS AND ITS APPLICATIONS, SIXTH EDITION, Edition 2007.

Published by McGraw-Hill, a business unit of The McGraw-Hill Companies, Inc.,

Chapter 1: The Foundations: Logic and Proofs
1.1 propositional Logic
1.2 Propositional Equivalences
1.6 Introduction to Proofs
Chapter 2: Basic Structures: Sets, Functions, Sequences, and Sums
1.3 Sets
1.4 Set Operations
1.5 Functions
1.6 Sequences and Summations
Chapter 3: The Fundamentals: Algorithms, the Integers, and Matrices
1.7 Algorithms
1.8 The Growth of Functions
1.9 Complexity of Algorithms
1.10 The Integers and Division
1.11 Primes and Greatest Common Divisors
1.12 Integers and Algorithms
Chapter 4: Induction and Recursion
1.13 Mathematical Induction
4.3 Recursive Definitions and Structural Induction
4.4 Recursive Algorithms

Discrete Math Structures

Computer Organization And Design: The Hardware /Software Interface,

David A. Patterson, and John L. Hennessy. Third Edition. Morgan Kaufmann, ISBN 155860604, 2005.

Chapter 5: The Processor: Data path and control
1. Logic design conventions
2. Building a data path
3. Logical operations
4. A simple implementation scheme
5. A multi-cycle implementation
6. Exceptions
7. Microprogramming: Simplifying control design
Chapter 6: Enhancing performance with pipelining
1. An overview of pipelining
2. A pipelined data path
3. A pipelined control
4. Data hazards and forwarding
5. Data hazards and stalls
6. Exceptions
Chapter 7: Large and fast: Exploiting memory hierarchy
1. The basic of Caches
2. Measuring and Improving Cache performance
3. Virtual memory

Computer Organization

Operating systems Concepts,

Seventh Edition, ABRAHAM SILBERSCHATZ, PETER BAER GALVIN, GREG GAGNE, JOHN WILEY & SONS. INC

Chapter 5: CPU Scheduling
5.1 Basic Concepts
5.2 Scheduling Criteria
5.3 Scheduling Algorithms
5.4 Multiple-Processor Scheduling

Chapter 8: Main Memory
8.2 Swapping
8.3 Contiguous Memory Allocation
8.4 Paging
8.5 Structure of the Page Table
8.6 Segmentation
Chapter 9: Virtual Memory
9.2 Demand Paging
9.3 Copy-on-Write
9.4 Page Replacement
9.5 Allocation of Frames
9.6 Thrashing
Chapter 10: File-System Interface
10.2 Access Methods
10.3 Directory Structure
Chapter 11: File-System Implementation
11.2 File-System Implementation
11.3 Directory Implementation
11.4 Allocation Methods
11.5 Free-Space Management
11.6 Efficiency and Performance
11.7 Recovery

Operating Systems Concepts

Fundamentals of Database Systems,

Fourth Edition by Ramez Elmasri, ShamKant B. Navathe, Third Addition.

Chapter I. INTRODUCTION AND CONCEPTUAL


MODELING.


3. Data Modeling Using the Entity-Relationship Model

Chapter II: RELATIONAL MODEL: CONCEPTS,


CONSTRAINTS, LANGUAGES, DESIGN,


AND PROGRAMMING.

5. The Relational Data Model and Relational
Database Constraints.
7. Relational Database Design by ER- and EER-to-
Relational Mapping.

Chapter III: DATABASE DESIGN THEORY AND


METHODOLOGY.

10. Functional Dependencies and Normalization for
Relational Databases.

Fundamentals of Database Systems