1.Discrete math structures:
Chapters:
- The Foundations: Logic and Proofs
1.1 propositional Logic
1.2 Propositional Equivalences
1.6 Introduction to Proofs
- Basic Structures: Sets, Functions, Sequences, and Sums
2.1 Sets
2.2 Set Operations
2.3 Functions
2.4 Sequences and Summations
- The Fundamentals: Algorithms, the Integers, and Matrices
3.1 Algorithms
3.2 The Growth of Functions
3.3 Complexity of Algorithms
3.4 The Integers and Division
3.5 Primes and Greatest Common Divisors
3.6 Integers and Algorithms
4. Induction and Recursion
4.1 Mathematical Induction
4.3 Recursive Definitions and Structural Induction
4.4 Recursive Algorithms
TEXTBOOK:
DISCRETE MATHEMATICS AND ITS APPLICATIONS, SIXTH EDITION, Edition 2007. by Kenneth H. Rosen.
2.Computer organization and Design:
Chapters:
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
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
7.Large and fast: Exploiting memory hierarchy
1. The basic of Caches
2. Measuring and Improving Cache performance
3. Virtual memory
TEXTBOOK:
Computer Organization And Design: The Hardware/Software Interface, David A. Patterson, and John L. Hennessy. Third Edition. Morgan Kaufmann, ISBN 155860604, 2005.
3.Operating systems Concepts:
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 10 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
TEXTBOOK:
Operating systems Concepts, Seventh Edition, ABRAHAM SILBERSCHATZ, PETER BAER GALVIN, GREG GAGNE, JOHN WILEY & SONS. INC
4.Database Systems:
Chapter 1
Databases and Database Users
Chapter 2
Database System Concepts and Architecture
Chapter 3
Data Modeling Using the Entity Relationship (ER) Model
Chapter 5
The Relational Data Model and Relational Database Constraints
Chapter 6
The relational Algebra and Relational Calculus
Chapter 7
Relational Database Design by ER-and EER-to-Relational Mapping
Chapter 10
Functional Dependencies and Normalization for Relational Database
Chapter 13
Disk Storage, Indexing, Query Processing, and Physical Design
Chapter 14
Indexing Structures for Files
TEXTBOOK:
Fundamentals of Database Systems, Fourth Edition by Ramez Elmasri, Sham Kant B. Nava the Third Addition.
5.Data structures and algorithms:
Arrays, Search and Linked Lists (Chapter 2 & 3)
Stacks and Queues (Chapter 5 & 6)
Recursion (Chapter 9)
Trees, Binary Search Trees and Graphs (Chapter 10, 11, 12 & 15)
Sorting (Chapter 14)
TEXTBOOK:
Data Structures with Java by John R. Hubbard, PhD, Schaum’s Outline Series, 2nd Ed