دليل المواد | الشئون الأكاديمية

Fundamental and emerging technologies such as networking infrastructures, data management tools, application servers, design tools, security systems, personalization tools, and electronic payment systems; case studies dealing with the existing business models and business processes; design and implementation of a major E-Commerce project using the state of the art tools. Proficiency in an object-Oriented programming language (such as Java) is expected from all students.

Overview of data representation, hexadecimal representation and different file type representations. Review on assembly language and code reverse engineering. Digital Forensics lab requirements. Digital Forensic process: technical and legal aspects. Types of Digital evidences. Extracting evidences from different OS platforms. Overview of network, Email, database and mobile Forensics. Students will be exposed to reverse engineering and code analysis. Students will do exercises on several Forensics tools.

This course will study approaches, mechanisms, and tools used to make software systems more secure. We will motivate the study by discussing common software security vulnerabilities such as buffer overflows, cross-site scripting and injection attacks. Then we will look at architectural approaches to building secure software (e.g., confinement, virtual machines, trusted computing), secure design principles and patterns, software analysis, secure programming techniques, run-time enforcement of security policies, code reviews and security testing. The course will also cover topics such as the importance of usability to building secure software systems.

Overview of security management: assets, vulnerabilities, threats, attacks, security tools, models and procedures. Role of policy making in the context of information security. Common practices to risk management and analysis. Fundamentals of cryptology, secure networking and access control. Problems and potential solutions associated with designing and implementing operating system and application security. Frameworks commonly used for governance and compliance control. Incident and disaster response.

Reviews regular expressions and finite automata. studies turning machines and equivalent models of computation, the Chomsky hierarchy, context-free grammars, push-down automata, and computability. Machine models of effective computability; sub-recursive hierarchies; P and NP problems; effective and efficient reducibility; time, space, and abstract complexity.

Distributed system examples, implementation issues, parallel vs. distributed systems, review of communication and networking, distributed system models, message-passing vs. shared memory models, synchronous vs, asynchronous systems, guarded actions non-determinism, atomic operations, scheduling and fairness issues, program correctness, safety and liveness properties, distributed mutual exclusion, distributed snapshot, distributed reset, wave algorithms, termination detetction, distributed deadlock, randomized algorithms, synchronous message passing, Hoare's CSP, clients and servers, faults in distributed systems, classification of faults, fault masking vs. fault recovery, self-stabilizing and adaptive distributed systems, gracefully degradable systems, waitfree systems, distributed consensus, leader election, clock synchronization.

Selections from design, analysis, optimization, and implementation of algorithms; Computational complexity, complexity classes, randomized algorithms, probabilistic algorithms, distributed algorithms, parallel algorithms; algorithm correctness and general theory of algorithms; algorithms for particular application areas including: Graphs and Networks; Cryptography.

Introduction to theoretical issues in parallel computation. Topics: Parallel machine models. Design and analysis of algorithms for systolic arrays: arithmetic operations, simple graph algorithms. Algorithms for hypercube-related networks: sorting, routing. PRAM model of computation. Basic PRAM algorithms: prefix computation, sorting, shortest paths, minimum- weight spanning tree. Reducing the processor-time product. simulation of stronger PRAM models by weaker ones. Complexity issues: definition of NC and P-completeness; some simple lower bounds.

Structure of sequential machines, partition theory and decomposition of machines, modular realization of sequential machines, regular expressions, information lossless machines and linear sequential machines.

Topics include: High level synthesis, scheduling and allocation techniques, architecture style selection, two level logic minimization algorithms, multiple-value minimization and multi-level circuit synthesis. The course usually involves a project.

Overview of the fundamental concepts in networks, wireless technology, and mobile computing. Energy-aware adaptation for mobile applications. Understanding the current routing protocols for studies of medium access control techniques for wireless communications. Design principles that are crucial for building the foundation for the design, and construction of future generations of wireless computing networks (wireless ad hoc, sensor, and buipuitous networks).

Review of some important probability distributions and their properties; Markovian processes; Markovian queues; renewal theory; semi Markovian processes and the M/G/1 queue; priority queues; case studies: random access systems; polling systems; multiplexers and switching systems.

Classification of parallel processing system - SIMD and MIMD machines - Multiprocessor systems and interconnection networks - Case studies of parallel processing systems - Parallel processing design issues: Programming languages, operating systems, user interfaces - VLSI computing systems: systolic arrays, wavefront arrays.

Alternative network architectures; study of the network functions and protocols in high performance networks; routing and switching; transport protocols in high-performance networks; integrated and differentiated service models and protocols; congestion and flow control protocols; broadbank ISDN and ATM; high-speed local and metropolitan area networks; advanced topics in high-performance networking.

Fundamentals of graph theory, partition, floor planning, placement, and routing. Programming techniques and algorithms; shortest/longest path, all-pairs shortest path, dynamic programming, linear programming, non-linear programming, evolutionary approaches, simulated annealing, and hyper-algorithms.