CMPT 225
Measuring algorithm efficiency
Timing
Counting
Cost functions
Cases
Best case
Average case
Worst case
Searching
Sorting
O Notation
John Edgar
O notation's mathematical basis
O notation classes
and notations
2
Algorithms can be described in terms
Recursion
Identify recursive algorithms
Write simple recursive algorithms
Understand recursive function calling
With reference to the call stack
Compute the result of simple recursive
algorithms
Understand the drawbacks of recursion
Analyze the running t
BUEC232
Chapter 3
Numerical Descriptive
Chapter Topics
Measures of central tendency, variation, and shape
Mean, median, mode, geometric mean
Quartiles
Range, interquartile range, variance and standard deviation, coefficient of
variation, Z-scores
Symmetr
Summary of last lecture
Sample Data in random order: 22
13 11 16 18
21
17
16
23
12
16
17
Sort in ascending order
Sample Data in Ordered Array: 11
18 21 22 23
12
13
16
Analysis
Number of terms n = 10
Minimum Xmin= 11
Maximum Xmax= 23
Range = 23 - 11 = R =
Mental Challenge
A drilling company has estimated a 40% chance
of striking oil at their new well site.
A detailed test has been scheduled for more
information. Historically, 60% of successful
wells have passed detailed tests, and 20% of
unsuccessful wel
BUEC232
Discrete Probability Distributions
Please arrange yourselves in
pairs for tonights lecture.
Data and Decisions 1
Week 5 Course Feedback
Request
o Lectures are on track with course syllabus.
o Midterm covering Ch. 1-4 & L1-L8 on
October 25.
Hyperg
BUEC232
Basic Probability Part 1
Learning Objectives
In this chapter, you will learn:
Basic probability concepts
Conditional probability
To use Bayes Theorem to revise probabilities
A set of counting rules to calculate the number of
possible events.
Proba
Math Anxiety
BUEC 232
Data and Decisions 1
Burnaby
Instructor: Andrew Flostrand
Alternatively.
Lecture
Objectives
On deck for today:
Syllabus
Online Resources
Exams
Goals of This Course
Grading Norms
How to Get the Most From this Course
Importance of Deve
BUEC 232
Organizing and Visualizing
Data
Conclusion & Mini Review
Pivot Tables in Excel
For Assignment 2, you will need to work with
pivot tables.
I will switch over to Excel now to show you how.
Pop Quiz
Closed Book Pop Quiz time.
Tables and Charts
for
Welcome to COGS 100
Tuesdays, 5:30-8:20 PM
Classroom SUR 3240
Welcome to COGS 100
Course Overview and
Official Policy
+
Lecture # 1Representation
Jeremy O. Turner
September 05, 2017
Tuesday, 5:30 AM - 8:20 PM Classroom SUR 3240
Overview
Welcome to the cou
#include<stdlib.h>
#include<stdio.h>
#include "image.hpp"
using namespace std;
/*
ERROR CODES:
-1 : Malloc function not working properly.
-2 : Out Of Scope Pixel.
*/
/* Constructs an image of 0x0 pixels. */
Image:Image() cfw_
cols=0;
rows=0;
pixels=NULL;
#include<stdlib.h>
#include<fstream>
#include "image2.hpp"
using namespace std;
/*
ERROR CODES:
-1 : Malloc function not working properly.
-2 : Out Of Scope Pixel.
-3 : File that you are trying to open cannot be opened due to some reason.
*/
/* Constructs
#include<stdlib.h>
#include<fstream>
#include "image3.hpp"
using namespace std;
/*
ERROR CODES:
-1 : Malloc function not working properly.
-2 : Out Of Scope Pixel.
-3 : File that you are trying to open cannot be opened due to some reason.
*/
/* Constructs
#include "intarr.h"
#include <stdlib.h>
#include <stdio.h>
/*
Save the entire array ia into a file called 'filename' in a JSON
text file array file format that can be loaded by
intarr_load_json(). Returns zero on success, or a non-zero error
code on failu
#include "intarr.h"
#include <stdlib.h>
#include <stdio.h>
/*/
/*
Save the entire array ia into a file called 'filename' in a binary
file format that can be loaded by intarr_load_binary(). Returns
zero on success, or a non-zero error code on failure. Arra
find more resources at oneclass.com
Scanned
by CamScanner
find more resources at oneclass.com
find more resources at oneclass.com
Scanned
by CamScanner
find more resources at oneclass.com
find more resources at oneclass.com
Scanned
by CamScanner
find more
Chapter 3: Linked Lists
Linked lists are pointer based data structures
Linked lists are made up of nodes that contain the list items
References (pointers) are used to link the nodes together in a sequence
A disadvantage of linked lists is that they cannot
find more resources at oneclass.com
_
27. November 16
_
New Metro Station Stuff
System.out.println(line[0].getNext();
Wouldnt do anything right now, because we havent done anything yet.
It would print null.
The station Atwater has a next attribute, an
COMP 250
Lecture #6: Linked Lists
Doubly linked lists have two linking sections in their respective nodes, one referring
to the previous node in the list and the other referring to the next. Makes removal
processes significantly shorter, taking place in c
' linked list data structure and the node class that does into it. '
class Node(object):
' stores a stingle item in the linked list chain '
def _init_(self, data, next=None):
' initialize the node with a given data value '
self.data = data
self.next = nex
ComputingScienceCMPT361
Instructor:PingTan
Fall2015
SimonFraserUniversity
Assignment#3(30marks)
Programmingpartdue:Nov17th,Tuesday,at11:59pm.
Problem1(30marks):Buildasimpleraytracer
You will be building a ray tracer, from the simple version that works on
5. Viewing
1
Where are we at?
The model-view matrix convert vertex coordinates
to the camera-coordinate system.
We need to further project vertices to the image
plane!
2
Camera Projection
We need to:
chooses a projection type (not necessarily perspect
16. Curves & Surfaces
1
Motivation
Many applications in graphics
Fonts
Animation path
Shape modeling
Sparse data reconstruction
Desired features:
2
Predictable control
Analytic representation
Continuity
Fast to compute
Local control
Parametric Polynomia
10. Illumination
1
Why illumination and reflectance?
Build a sphere using many polygons with same color
But we really want a more realistically illuminated sphere
2
Factors
Light-material interactions cause each point to
have a different color or shade
15. Image Basics
1
Overview
Image Representation
Image sampling
Sampling artifacts
Pixel Operations
Brightness
Contrast
Saturation
Filters
1D convolution
2D convolution
Histograms
2
What is a digital image?
It is a rectangular array of pixels
13. Radiosity
1
Rasterization-based rendering
What can we do with rasterization-based rendering
and ray tracing
What we cant do
2
Rasterization-based rendering
Types of reflections
Diffuse reflection of light sources
Specular reflection of light sour
4. Transformation
1
Definition
Transformation
Mathematical operation that moves or changes the shape of
an object
Were most interested in:
Translation (moving)
Rotation (spinning)
Scaling (changing size)
2
OpenGL code
glTranslated(x, y, z)
whatever