MOST LMS

Course Description

This course covers Applications of Recurrence Relations, Solving Linear Recurrence Relations, Generating Functions, Modeling Computation: Languages and Grammars, Finite-State Machines with Output, Finite-State Machines with No Output, Language Recognition and Turing Machines.

Course Outcomes

After completing the course, the student will be able to:
1. Model, compare and analyse different computational models using combinatorial methods.
2. Apply rigorously formal mathematical methods to prove the properties of languages, grammars, and automata.
3. Construct algorithms for different problems and argue formally about correctness on different restricted machine models of computation.
4. Identify the limitations of some computational models and possible methods of proving them.

Major Topics Covered in the Course

1. Modeling With Recurrence Relations, Solving Linear Homogeneous and Nonhomogeneous Recurrence Relations, Counting Problems and Generating Functions
2. Phrase Structure Grammars, Derivation Trees, Backus-Naur Form, Finite State Machines with output and no output.
3. Deterministic and Nondeterministic Finite State
4. Using Turing Machines to Recognize Sets

Course Description

The course aims to motivate fourth year students the topic of information security awareness. At the outset, the professional environment of information security and brief history of security are introduced. After this, the basic model of information security consisting of assets, vulnerabilities, threats, and controls are explained. The rest of the course is devoted to characterizing assets, vulnerabilities and threats and responding to them using security controls. At the end of the course, students will have an awareness of how information security concerns have evolved in our society and how they can use contemporary frameworks to respond to these concerns in a professional environment.

The course comes with a full set of end-of-chapter exercises. There are four kinds of exercises at the end of every chapter:
1. Traditional end-of-chapter questions are designed to improve student understanding and recall of common topics in information security.
2. An example case at the end of each chapter allows students to apply the knowledge in the chapter to business contexts.
3. A critical thinking exercise introduces students to analogous situations and relates the ideas from the chapter to this situation.
4. Finally each chapter has a detailed hands-on activity using a customized distribution of the CentOS Linux OS to be installed as a virtual machine using virtual box.

Course Outcomes

Students who complete the course will be able to
 Understand how information security and assurance is important and impact of organizations, and the importance of system administration for information security.
 Provide the element of basic security model, relationships between the elements of the basic information security model and common classification of information security controls.
 Get clear understanding of the different aspects of threats including: threat models, and vulnerabilities and their relevance to threats.
 Describe the important of assets in organizations and to examine how these assets can be identified and classified based on their alignment to the organization’s mission.
 Be aware of asset management issues including life cycle and ownership.

Prerequisites by Topic

- None

Major Topic Covered in the Course

 Introduction
 The Basic Information Security Model
 Asset Identification and Characterization
 Threats and Vulnerabilities

Course Objectives

1. to recognize the critical thinking required for IELTS
2. to develop four skills in English Language learning as well as key grammar and vocabulary

Student Learning Outcomes

- Students are able to get motivation in their language learning and apply what they have learned in their real-life situations.
- Students can have complete preparation for the IELTS exam when they want to have further studies overseas.

Topics Covered

1. Receptive skills like reading and listening can be efficient by Authentic Texts.
2. Four skills with grammar and vocabulary input are informed by publications related to the Common European Framework of Reference.

Course Description

This course covers Applications of Recurrence Relations, Solving Linear Recurrence Relations, Generating Functions, Modeling Computation: Languages and Grammars, Finite-State Machines with Output, Finite-State Machines with No Output, Language Recognition and Turing Machines.

Course Outcomes

After completing the course, the student will be able to:
1. Model, compare and analyse different computational models using combinatorial methods.
2. Apply rigorously formal mathematical methods to prove the properties of languages, grammars, and automata.
3. Construct algorithms for different problems and argue formally about correctness on different restricted machine models of computation.
4. Identify the limitations of some computational models and possible methods of proving them.

Major Topics Covered in the Course

1. Modeling With Recurrence Relations, Solving Linear Homogeneous and Nonhomogeneous Recurrence Relations, Counting Problems and Generating Functions
2. Phrase Structure Grammars, Derivation Trees, Backus-Naur Form, Finite State Machines with output and no output.
3. Deterministic and Nondeterministic Finite State
4. Using Turing Machines to Recognize Sets

Course Objectives

▪ To conceptualize the basics of organizational and architectural issues of a digital
computer.
▪ To study the different ways of communicating with I/O devices and standard I/O
interfaces.
▪ To study the hierarchical memory system including cache memories and virtual
memory.
▪ To study various classes of instruction: data movement, arithmetic, logical, and
flow control.
▪ To appreciate how conditional operations are implemented at the machine level.
▪ To understand the way in which subroutines are called and returns made.
▪ To understand parallelism both in terms of a single processor and multiple
processors.

Learning Outcomes

The major outcomes of this course can be listed as
▪ Ability to perform computer arithmetic operations and control unit operations.
▪ Interpret the difference between hardwired and micro-programmed design approaches in CPU control unit design.
▪ Ability to understand the concept of I/O organization.
▪ Ability to conceptualize instruction level parallelism.
▪ Demonstrate the organization of memory hierarchy.
▪ Understand parallelism both in terms of a single processor and multiple processors.
▪ Understand how computer hardware has evolved to meet the needs of multi-processing systems.

Course Description

The focus of the course is to provide a set of practices the students can deploy immediately to secure their computers and to maintain safe security practices. The lectures cover the necessary security concepts and methods to prevent security breaches and what to do if such a breach is detected. The students will learn about securing popular computer platforms and applications running on these platforms.

Course Objectives

▪ introduce concepts of Computer security;
▪ provide an overview of principles and practices of Cybersecurity;
▪ study Denial of Service Attack, Cyber Stalking, Fraud, and Abuse
▪ present properties of malicious software;
▪ study tools and techniques used to defend computer systems; and
▪ Be able to understand and follow security and privacy policies