|
Untitled 4
Faculty of
Computing and Information Technology would like to announce the date and
location of the written admission exam for PhD. students who will enroll in
Computer Science Department
Date: Thursday
8 March 2018 –
20/6/1439H
Time: 1pm
Location: for Boys: FCIT
Auditorium Bldg. 31
For girls: FCIT Bldg. 61 in girls’ section room# F105 and #F106
Type of
Questions: 40 Multiple choices Questions (MSQs)
Exam duration: 120 minutes (2
hours)
References
1.
Robert W. Sebesta, "Concepts of Programming Languages", Addison Wesley; 10th
edition (January 12, 2012)
2.
Rosen, “Discrete Mathematics and Its Applications, 7th edition”, McGraw-Hill
Science/Engineering/Math; 7th edition (June 14, 2011)
3.
Levitin, "Introduction to the Design and Analysis of Algorithms", Pearson
International Edition, 2nd Edition, 2007
4.
Abraham Silberschatz, "Operating System Consepts", John Wiley 8th edition 2010
5.
David Patterson, “ Computer Organization and Design",Fourth Edition: The
Hardware/Software Interface Morgan Kaufmann,(Nov 17, 2008)
Topics will
include
I . COMPUTER ORGANIZATION
AND ARCHITECTURE
A. Memories and their hierarchies:
I. Cache, main and secondary storage
II. Virtual memory, paging and segmentation
III. Performance, implementation and management
B. Processors and control units:
I. Register and ALU organization
II. Instruction sets
III. Data paths and control sequencing
IIII. Computer arithmetic and number representation
C. Digital logic design:
I. Optimization and
analysis
II. Implementation of combinational and sequential circuits
II. SOFTWARE SYSTEMS AND METHODOLOGY
A. Program control and structure:
I. Procedures, functions,
methods and exception handlers
II. Iteration and recursion
III. Concurrency, communication and Synchronization
B. Data organization:
I. Data structures and
implementation techniques
II. Data types
C. Systems:
I. Databases
II. Operating systems, including resource management and
protection/security
III. MATHEMATICAL BACKGROUND
A. Discrete structures:
I. Elementary combinatorics and graph theory
II. Mathematical logic
III. Discrete probability, recurrence relations and number theory
B. Algorithms and complexity:
I. Upper and lower bounds
on the complexity of specific problems
II. Exact and asymptotic analysis of specific algorithms
IIII. GENERAL COMPUTING TOPICS
|