Chapter 5
Statistical Models in
Simulation
Banks, Carson, Nelson & Nicol
Discrete-Event System Simulation
Purpose & Overview
The world the model-builder sees is probabilistic rather
than deterministic.
Some statistical model might well describe the variat
Chapter 7
Random-Number
Generation
Banks, Carson, Nelson & Nicol
Discrete-Event System Simulation
Purpose & Overview
Discuss the generation of random numbers.
Used to generate event times and other random
variables
Introduce the subsequent testing for
ran
Chapter 2
Simulation Examples
Goals of the Chapter
This chapter presents several examples of simulations
that can be performed by devising a simulation table
either manually or with a spreadsheet.
The simulation table provides a systematic method for
trac
Chapter 3 & 4
General Principles &
Simulation Software
Banks, Carson, Nelson & Nicol
Discrete-Event System Simulation
Major Concepts
System: A collection of entities that interact together over time to
accomplish one or more goals.
Model: An abstract repr
CSC 349A PRACTICE MIDTERM EXAM
There are 5 questions of equal value. Time allowed 75 minutes. Question 1. (a) (12 marks) Compute the Taylor polynomial of degree 3 for the function f(x) = (1 + x)3/2 expanded about x0=0. (b) (8 marks) Use the error term in
COMPUTER SCIENCE 349A
SAMPLE EXAM QUESTIONS WITH SOLUTIONS
PARTS 3, 5, 6 , 7
PART 3.
3.1
Suppose that a computer program, using the Gaussian elimination algorithm, is to
be written to accurately solve a system of linear equations Ax = b , where A is an
ar
Taylor's Theorem:
f x f
n
f x0
f x0 x x0
n
'
f ' x0 x x0 2! x n x x0 1 !
2
.
Solution: f(x) = [x - (x-1)] x (x + (x-1) / (x - (x-1)= 1 / (x + (x-1) Let f(x) = [(sin(x) - ex) + 1] / x2, x 0, x in radians. To 4 significant digits, the exact value of f(0.123
%
$
"
8 d
#
e
$
"
Y
%
$ d
) 1
S q
S
S
S ' e
e q 1
S ' 1 q
S 1 ' q 1
S q q q 1
0
1 q
S q
S q 0
1 q
S
S q
e
S
S q '
S
T ) & # w P A 4 ( V 4 ( 4
S ) 4 h f V f V h x 4 y 2 6
d 2
U 5 6 4 h x P A 4 ( V 4 ( 4
T
S
w
w
"
8
$
"
8
v
W
$
"
Y
u
#
"
a
COMPUTER SCIENCE 349A
SAMPLE EXAM QUESTIONS WITH SOLUTIONS
PARTS 1, 2
PART 1.
1.1
(a) Define the term ill-conditioned problem.
(b) Give an example of a polynomial that has ill-conditioned zeros.
1.2
Consider evaluation of
f ( x) =
1
,
1 tanh( x)
where tan
Name: _ Please Print Instructor: Dr. F. Roberts
Perm. Reg. No. _
UNIVERSITY OF VICTORIA PRACTICE FINAL EXAMINATION COMPUTER SCIENCE 349A
Question 1 2 3 4 5 6 7 8 9 10 Total Instructions : This is a 3 hour, closed-book examination. No calculators or notes
COMPUTER SCIENCE 349A SAMPLE EXAM QUESTIONS WITH SOLUTIONS CHAPTER 1.
1.1 (a) Define the term "ill-conditioned problem". (b) Give an example of a polynomial that has ill-conditioned zeros. 1.2 Consider evaluation of f ( x) = 1 , 1 - tanh( x) where tanh( x
However, if evaluated in floating-point arithmetic, these expressions may give very
different results due to subtractive cancellation.
In thefollowing, no justification for your answers is required. Just specify either
ACCURATE or INACCURATE as your answe
COMPUTER SCIENCE 349A
SAMPLE FINAL EXAM QUESTIONS WITH SOLUTIONS
1.
(a) For what values of the real variable x , where x > 1 , is the following
expression subject to subtractive cancellation that will produce a very inaccurate result
(in terms of relative
C SC 230 Fall 2011 Assignment 3 - Total Marks = 100
(1) Flowchart is due Wednesday Nov. 2 by 16:30 in the lecture; (2) Code is due Monday
November 14 by 16:00 in the course box in ECS and by electronic submission
The goal of this assignment is to develop
C SC 230 Spring 2014 Assignment 2 part 2
Due Monday, March 3, by 7:00 p.m.
Total Marks = 50 + bonus
1. The problem to be solved and implemented with an ARM assembly language program
You are asked to do some image processing on an image composed of charact
C SC 230 Fall 2011 Assignment 2
PART 1 (Written) is due Friday October 21 by 15:00 in the course box in ECS
PART 2 (Programming) is due Friday October 21 by 15:00 via electronic submission
and in the course box in ECS (source code printouts) - to be poste
CSC 230 - Assignment 1 - Part 1 (Written)
Due Monday February 3, by 5:00 p.m. Total Marks = 40
Answer the following questions directly on this paper and hand in your answers in the CSC 230 box in the
ECS corridor on the 2nd floor (by 5 pm on Monday Feb. 3
C SC 230 Spring 2014 Assignment 1 part 2
Due Monday February 3, by 16:00
Total Marks = 50
The objective is for you to write a program in C, getting some experience in the overall process. This
includes designing the software modules according to the stric
The ARM Assembly Language A Short Introduction
R. Nigel Horspool and Micaela Serra, 2010
Department of Computer Science
University of Victoria
1. Preliminaries
This document provides only a barest-bones description of those ARM7TDMI assembler instruction
The main different: Separate memory and I/O buses in Port I/O but shared address and data lines and separate control
Port I/O
Motherboard
Motherboard
MEMORY
MEMORY
n-bit memory
bus
CPU
Pros: Operate on the data with fewer instructions
CPU
n-bit
system
bus
25 Processors
CSC 230
Department of Computer Science
University of Victoria
Most notably, 1975,
Moore altered his
projection to a
doubling every two
years. [Source:
Wikipedia entry for
Moores Law.]
Source: Wikipedia entry
for Transistor count
INTEL ARCHIT
24 Advanced Processors Organization
CSC 230
Department of Computer Science
University of Victoria
M&H: 10.1 to 10.4 (not everything!)
Stallings: 2.6, 18.1, 18.2, 18.3, 18.5 (not everything!)
Multicore Computers (seen before)
Two or more cores (CPUs) as a
The ARM Architecture
T
H
E
A
R
C
H
I
T
E
C
T
U
R
E
F
O
R
T
TM
H
E
D
I
G
I
T
A
L
W
O
R1 L
D
Agenda
Introduction to ARM Ltd
Programmers Model
Instruction Set
System Design
Development Tools
39v10 The ARM Architecture
TM
2
2
ARM Ltd
Founded in November 1990
23. Virtual Memory
Department of Computer Science
University of Victoria
MH: 7.6
HVZ: 6
Stallings: 8.3, 8.5
(Some of the textbook subsections are more OSoriented, but it will be helpful to you to read
through them)
PROGRAM RELOCATABILITY
In multiple user
20 Memory
CSC 230
Department of Computer Science
University of Victoria
M&H: 7.1, 7.2, 7.3 (7.4 optional)
Stallings: 4.1, 5.1 (not all details), 5.3 (information only)
Performance
everything
else in the
architecture
processor
speed
etc.
memory speed
trans
22a Cache Examples Part 1
CSC 230
Department of Computer Science
University of Victoria
Problem 5.7 (from HVZ)
A computer uses a small direct-mapped cache between the main memory
and the processor. The cache has four 16-bit words, and each word has
an ass