Graphs
Dr. Sun Pak Kiu
MATH 1205
Discrete Mathematics
Dr. Sun Pak Kiu (MATH 1205)
Discrete Mathematics
Graphs
1 / 52
Graphs
Definition (Graph)
A graph G = (V, E) consists of V , a nonempty set of vertices (or
nodes) and E, a set of edges. Each edge has ei
Discrete Random Variables
MATH 2005
Probability and Statistics for Computer Science
(MATH 2005)
Discrete Random Variables
Second Semester 2016
1 / 60
Learning Outcomes
Recognize the concepts and theorems in Probability
(MATH 2005)
Discrete Random Variabl
Parameter Estimation
MATH 2005
Probability and Statistics for Computer Science
(MATH 2005)
Parameter Estimation
Second Semester 2016
1 / 46
Learning Outcomes
Identify the principles behinds various statistical methods
Carry out various parameter estimat
Continuous Random Variables
MATH 2005
Probability and Statistics for Computer Science
(MATH 2005)
Continuous Random Variables
Second Semester 2016
1 / 47
Learning Outcomes
Recognize the concepts and theorems in Probability
(MATH 2005)
Continuous Random V
Comparing Two Populations
MATH 2005
Probability and Statistics for Computer Science
(MATH 2005)
Comparing Two Populations
Second Semester 2016
1 / 43
Learning Outcomes
Identify the principles behinds various statistical methods
Carry out various paramet
Simple Linear Regression
MATH 2005
Probability and Statistics for Computer Science
(MATH 2005)
Simple Linear Regression
Second Semester 2016
1 / 50
Learning Outcomes
Identify the principles behinds various statistical methods
Carry out various parameter
Hypothesis Testing
MATH 2005
Probability and Statistics for Computer Science
(MATH 2005)
Hypothesis Testing
Second Semester 2016
1 / 46
Learning Outcomes
Identify the principles behinds various statistical methods
Carry out various parameter estimations
Basic Probability
MATH 2005
Probability and Statistics for Computer Science
(MATH 2005)
Basic Probability
Second Semester 2016
1 / 32
Learning Outcomes
Recognize the concepts and theorems in Probability
(MATH 2005)
Basic Probability
Second Semester 2016
Introduction
MATH 2005
Probability and Statistics for Computer Science
(MATH 2005)
Introduction
Second Semester 2016
1 / 19
Instructor:
Email:
Office:
Tel:
Dr. Liu, K. I.
[email protected]
FSC 1105
3411 5529
Textbook:
Milton, Arnold, and Liu, Probability
Descriptive Statistics
MATH 2005
Probability and Statistics for Computer Science
(MATH 2005)
Descriptive Statistics
Second Semester 2016
1 / 43
Learning Outcomes
Identify the principles behinds various statistical methods
Articulate the diversity of the
Bayes Theorem
MATH 2005
Probability and Statistics for Computer Science
(MATH 2005)
Bayes Theorem
Second Semester 2016
1 / 21
Learning Outcomes
Recognize the concepts and theorems in Probability
Articulate the diversity of the applications of Statistics
Inference on Population Proportion
MATH 2005
Probability and Statistics for Computer Science
(MATH 2005)
Inference on Population Proportion
Second Semester 2016
1 / 27
Learning Outcomes
Able to perform hypotheses testing
Able to perform and analyze hypo
Analysis of Variance
MATH 2005
Probability and Statistics for Computer Science
(MATH 2005)
Analysis of Variance
Second Semester 2016
1 / 18
Learning Outcomes
Identify the principles behinds various statistical methods
Carry out various parameter estimat
Module 05
Loops
COMP2007 Object Oriented Programming
Department. of Computer Science
Hong Kong Baptist University
COMP2007 Object Oriented Programming (2016-17 Sem.1)
Dr. Joe C.K. YAU
Module 05
Loops
1
Overview
Basics of Looping
while Loop
do-while Loo
Chapter 7 Sorting
Sorting of an array of N items A [0], A [1],
A [2], , A [N-1]
Sorting in ascending order
Sorting in main memory (internal sort)
1
7.2 Insertion Sort
N - 1 passes (for P = 1 to N - 1)
In pass P, given that A [0] to A [P-1] have
been
Module 03
Built-in Data Types & Operators
COMP2007 Object Oriented Programming
Department. of Computer Science
Hong Kong Baptist University
COMP2007 Object Oriented Programming (2016-17 Sem.1)
Dr. Joe C.K. YAU
Module 03
Built-in Data Types & Operators
1
O
Module 02
Processing Recap
COMP2007 Object Oriented Programming
Department. of Computer Science
Hong Kong Baptist University
COMP2007 Object Oriented Programming (2016-17 Sem.1)
Dr. Joe C.K. YAU
Module 01
Introduction to Computer Programming
1
Overview
Va
Module 06
Arrays
COMP2007 Object Oriented Programming
Department. of Computer Science
Hong Kong Baptist University
COMP2007 Object Oriented Programming (2016-17 Sem.1)
Dr. Joe C.K. YAU
Module 06
Arrays
1
Overview
Why Use Arrays
Syntax of Array
Multi-Di
Memory Management
Operating Systems
A program should be in main memory to be executed.
Lecture 8
Virtual Memory
Memory management unit (MMU) translates the logical address
into physical address.
OS often implements paging and segmentation algorithms for
n
Operating System Mechanism
Operating system is the manager of a computer system.
Remember that OS is itself a program and that a process is a
program in execution.
Operating Systems
So OS will present itself as one or more processes in the computer
system
CPU Scheduling
Short-term scheduler needs to maximize CPU
utilization in the presence of multi-programming.
Operating Systems
It selects from the set of processes in memory that are
ready to execute (in ready queue).
D
Done
b
by scheduler
h d l .
It alloc
Process
Operating Systems
Lecture 4
Process Management
Recall that an operating system executes
a variety of programs for users.
A process is a program in execution.
The terms process and job are used
almost interchangeably in most
textbooks.
A process in
Basic Unix/Linux
Unix and Linux users are interfaced with system via command
line prompt.
They type commands in the command line interface for the
system to execute.
The commands are interpreted by the command line interpreter,
called
ll d the
th shell.
h
What is Deadlock?
There is a narrow bridge or road.
Operating Systems
Traffic can only go in one direction.
If a car is driving along the bridge, no car can drive in the
other direction.
All cars behind the moving car can also drive through bridge.
When b
Compilation and Running of Program
The compiler normally generates
object codes.
Operating Systems
*.o (in C) or *.class (in Java)
The linkage editor or linker will link
the object codes with other object
modules (e.g. your own set of date
conversion func
Cooperating Processes
Recap: a set of cooperating processes can affect or
be affected by the execution of other processes in
the set.
Cooperating processes need to access shared data.
Si lt
Simultaneous
access to
t shared
h d data
d t may result
lt in
i
d
What is an Operating System?
What do you have in
mind when asked about
an Operating System?
Operating Systems
Lecture 1
Introduction to Operating Systems
Lecture 1
What is an Operating System?
The operating system (or OS) is the manager.
COMP 2421 / COMP
Interprocess Communication
Interprocess communication (IPC)
mechanisms allow processes to communicate
and to synchronize.
Operating Systems
Data transfer and sharing
g
Event notification
Resource sharing
Synchronization
Process control
Lecture 5
Interproc