صفحة عضو هيئة التدريس

This course aims to provide the key concepts that are likely to be included in the design of the modern computer architecture. This course covers the concepts (intermediate level) of the following components of a computer: Instruction Set Architecture, register transfer language, processor and system performance, Instruction pipelining and instruction-level parallelism, overview of superscalar architectures, and Storage systems and their technology “overview, cache and external memory.”

This course demonstrates the basic metrics by which new and existing computer systems may be evaluated to understand and evaluate the impact of the peripherals, their interconnection, and underlying data operations on the design of computer systems. The students will demonstrate the techniques needed for computer design, examine different computer implementation styles and assess their strengths and weakness. The students learn the technique by which an instruction is executed and the process of basic instruction level parallelism using pipelining. In addition, this course explains the effect of memory latency and describes the use of memory hierarchy to reduce effective memory latency.

This course gives a comprehensive introduction to automata theory and theory of computation. The focus of this course is on how to construct, use, design and analyze Finite Automata (FA), Context-Free Grammars (CFG), Context-Free Languages (CFL), and “single and multiple” Turing Machines (TM). Furthermore, this course will teach students how to construct and use regular expressions and different finite automata. It illustrates the proofs of several theorems in automata theory and describes decidability and un-decidability in theory of computation. In addition, it explains the way to classify problems according to their time and space complexity, or “complexity of decision problems”. It is intended to give students a broad overview of the entire Formal Languages and Automata Theory field by covering most aspects of it.

This course aims to provide the key concepts that are likely to be included in the design of the modern computer architecture. This course covers the concepts (intermediate level) of the following components of a computer: Instruction Set Architecture, register transfer language, processor and system performance, Instruction pipelining and instruction-level parallelism, overview of superscalar architectures, and Storage systems and their technology “overview, cache and external memory.”

This course demonstrates the basic metrics by which new and existing computer systems may be evaluated to understand and evaluate the impact of the peripherals, their interconnection, and underlying data operations on the design of computer systems. The students will demonstrate the techniques needed for computer design, examine different computer implementation styles and assess their strengths and weakness. The students learn the technique by which an instruction is executed and the process of basic instruction level parallelism using pipelining. In addition, this course explains the effect of memory latency and describes the use of memory hierarchy to reduce effective memory latency.

This course gives a comprehensive introduction to automata theory and theory of computation. The focus of this course is on how to construct, use, design and analyze Finite Automata (FA), Context-Free Grammars (CFG), Context-Free Languages (CFL), and “single and multiple” Turing Machines (TM). Furthermore, this course will teach students how to construct and use regular expressions and different finite automata. It illustrates the proofs of several theorems in automata theory and describes decidability and un-decidability in theory of computation. In addition, it explains the way to classify problems according to their time and space complexity, or “complexity of decision problems”. It is intended to give students a broad overview of the entire Formal Languages and Automata Theory field by covering most aspects of it.

This course aims to provide the key concepts that are likely to be included in the design of the modern computer architecture. This course covers the concepts (intermediate level) of the following components of a computer: Instruction Set Architecture, register transfer language, processor and system performance, Instruction pipelining and instruction-level parallelism, overview of superscalar architectures, and Storage systems and their technology “overview, cache and external memory.”

This course demonstrates the basic metrics by which new and existing computer systems may be evaluated to understand and evaluate the impact of the peripherals, their interconnection, and underlying data operations on the design of computer systems. The students will demonstrate the techniques needed for computer design, examine different computer implementation styles and assess their strengths and weakness. The students learn the technique by which an instruction is executed and the process of basic instruction level parallelism using pipelining. In addition, this course explains the effect of memory latency and describes the use of memory hierarchy to reduce effective memory latency.

This course aims to provide the key concepts that are likely to be included in the design of the modern computer architecture. This course covers the concepts (intermediate level) of the following components of a computer: Instruction Set Architecture, register transfer language, processor and system performance, Instruction pipelining and instruction-level parallelism, overview of superscalar architectures, and Storage systems and their technology “overview, cache and external memory.”

This course demonstrates the basic metrics by which new and existing computer systems may be evaluated to understand and evaluate the impact of the peripherals, their interconnection, and underlying data operations on the design of computer systems. The students will demonstrate the techniques needed for computer design, examine different computer implementation styles and assess their strengths and weakness. The students learn the technique by which an instruction is executed and the process of basic instruction level parallelism using pipelining. In addition, this course explains the effect of memory latency and describes the use of memory hierarchy to reduce effective memory latency.

This course gives a comprehensive introduction to automata theory and theory of computation. The focus of this course is on how to construct, use, design and analyze Finite Automata (FA), Context-Free Grammars (CFG), Context-Free Languages (CFL), and “single and multiple” Turing Machines (TM). Furthermore, this course will teach students how to construct and use regular expressions and different finite automata. It illustrates the proofs of several theorems in automata theory and describes decidability and un-decidability in theory of computation. In addition, it explains the way to classify problems according to their time and space complexity, or “complexity of decision problems”. It is intended to give students a broad overview of the entire Formal Languages and Automata Theory field by covering most aspects of it.

This course gives a comprehensive introduction to automata theory and theory of computation. The focus of this course is on how to construct, use, design and analyze Finite Automata (FA), Context-Free Grammars (CFG), Context-Free Languages (CFL), and “single and multiple” Turing Machines (TM). Furthermore, this course will teach students how to construct and use regular expressions and different finite automata. It illustrates the proofs of several theorems in automata theory and describes decidability and un-decidability in theory of computation. In addition, it explains the way to classify problems according to their time and space complexity, or “complexity of decision problems”. It is intended to give students a broad overview of the entire Formal Languages and Automata Theory field by covering most aspects of it.

This course aims to provide the key concepts that are likely to be included in the design of the modern computer architecture. This course covers the concepts (intermediate level) of the following components of a computer: Instruction Set Architecture, register transfer language, processor and system performance, Instruction pipelining and instruction-level parallelism, overview of superscalar architectures, and Storage systems and their technology “overview, cache and external memory.”

This course demonstrates the basic metrics by which new and existing computer systems may be evaluated to understand and evaluate the impact of the peripherals, their interconnection, and underlying data operations on the design of computer systems. The students will demonstrate the techniques needed for computer design, examine different computer implementation styles and assess their strengths and weakness. The students learn the technique by which an instruction is executed and the process of basic instruction level parallelism using pipelining. In addition, this course explains the effect of memory latency and describes the use of memory hierarchy to reduce effective memory latency.

This course gives a comprehensive introduction to automata theory and theory of computation. The focus of this course is on how to construct, use, design and analyze Finite Automata (FA), Context-Free Grammars (CFG), Context-Free Languages (CFL), and “single and multiple” Turing Machines (TM). Furthermore, this course will teach students how to construct and use regular expressions and different finite automata. It illustrates the proofs of several theorems in automata theory and describes decidability and un-decidability in theory of computation. In addition, it explains the way to classify problems according to their time and space complexity, or “complexity of decision problems”. It is intended to give students a broad overview of the entire Formal Languages and Automata Theory field by covering most aspects of it.

This course gives a comprehensive introduction to automata theory and theory of computation. The focus of this course is on how to construct, use, design and analyze Finite Automata (FA), Context-Free Grammars (CFG), Context-Free Languages (CFL), and “single and multiple” Turing Machines (TM). Furthermore, this course will teach students how to construct and use regular expressions and different finite automata. It illustrates the proofs of several theorems in automata theory and describes decidability and un-decidability in theory of computation. In addition, it explains the way to classify problems according to their time and space complexity, or “complexity of decision problems”. It is intended to give students a broad overview of the entire Formal Languages and Automata Theory field by covering most aspects of it.

This course aims to provide the key concepts that are likely to be included in the design of the modern computer architecture. This course covers the concepts (intermediate level) of the following components of a computer: Instruction Set Architecture, register transfer language, processor and system performance, Instruction pipelining and instruction-level parallelism, overview of superscalar architectures, and Storage systems and their technology “overview, cache and external memory.”

This course demonstrates the basic metrics by which new and existing computer systems may be evaluated to understand and evaluate the impact of the peripherals, their interconnection, and underlying data operations on the design of computer systems. The students will demonstrate the techniques needed for computer design, examine different computer implementation styles and assess their strengths and weakness. The students learn the technique by which an instruction is executed and the process of basic instruction level parallelism using pipelining. In addition, this course explains the effect of memory latency and describes the use of memory hierarchy to reduce effective memory latency.

This course aims to provide the key concepts that are likely to be included in the design of the modern computer architecture. This course covers the concepts (intermediate level) of the following components of a computer: Instruction Set Architecture, register transfer language, processor and system performance, Instruction pipelining and instruction-level parallelism, overview of superscalar architectures, and Storage systems and their technology “overview, cache and external memory.”

This course demonstrates the basic metrics by which new and existing computer systems may be evaluated to understand and evaluate the impact of the peripherals, their interconnection, and underlying data operations on the design of computer systems. The students will demonstrate the techniques needed for computer design, examine different computer implementation styles and assess their strengths and weakness. The students learn the technique by which an instruction is executed and the process of basic instruction level parallelism using pipelining. In addition, this course explains the effect of memory latency and describes the use of memory hierarchy to reduce effective memory latency.

This course aims to provide the key concepts that are likely to be included in the design of the modern computer architecture. This course covers the concepts (intermediate level) of the following components of a computer: Instruction Set Architecture, register transfer language, processor and system performance, Instruction pipelining and instruction-level parallelism, overview of superscalar architectures, and Storage systems and their technology “overview, cache and external memory.”

This course demonstrates the basic metrics by which new and existing computer systems may be evaluated to understand and evaluate the impact of the peripherals, their interconnection, and underlying data operations on the design of computer systems. The students will demonstrate the techniques needed for computer design, examine different computer implementation styles and assess their strengths and weakness. The students learn the technique by which an instruction is executed and the process of basic instruction level parallelism using pipelining. In addition, this course explains the effect of memory latency and describes the use of memory hierarchy to reduce effective memory latency.

This course aims to provide the key concepts that are likely to be included in the design of the modern computer architecture. This course covers the concepts (intermediate level) of the following components of a computer: Instruction Set Architecture, register transfer language, processor and system performance, Instruction pipelining and instruction-level parallelism, overview of superscalar architectures, and Storage systems and their technology “overview, cache and external memory.”

This course demonstrates the basic metrics by which new and existing computer systems may be evaluated to understand and evaluate the impact of the peripherals, their interconnection, and underlying data operations on the design of computer systems. The students will demonstrate the techniques needed for computer design, examine different computer implementation styles and assess their strengths and weakness. The students learn the technique by which an instruction is executed and the process of basic instruction level parallelism using pipelining. In addition, this course explains the effect of memory latency and describes the use of memory hierarchy to reduce effective memory latency.