Online study resources available anywhere, at any time
Highquality Study Documents, expert Tutors and Flashcards
Everything you need to learn more effectively and succeed
Sveriges lantbruksuniversitet

School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
Longest Common Subsquence By Nathan Nastili CMPT 307 REVIEW SESSION JULY 21st 2014 What is a subsequence FOR EXAMPLE: S = GGGGTTACTTTAT Z = G T C A What is a LCS FOR EXAMPLE: X= GTAATTTTAAA Y= GGGGTTACTTTAT X= G T A ATTTTAAA Y= GGGGTTACT
School: Sveriges Lantbruksuniversitet
Santa Clause Problem Getting to know dynamic programming Lu Gan Computing Science What is dynamic programming is a method for solving complex problems How? By breaking them down into simpler sub problems What kind of sub problem? a) There are only a po
School: Sveriges Lantbruksuniversitet
A* Algorithm BY WARREN RUSSELL Dijkstras Algorithm In real time, finding a path can be time consuming. Especially with all the extra cells visited. Is this practical? Could we do better? A* (A Star) This is a shortest path algorithm that avoids exhaustive
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
Course: Operating Systems
CMPT 300 Section 1 Notes OS layer provides user with a simple and clean model of the computer. The users interact with a shell (textbased) or a GUI. Shell/GUI are not part of the OS, but interact with it. Where does the OS fit in? Most computers have two
School: Sveriges Lantbruksuniversitet
Course: Database Systems
Ch6DbAppDevelopment The3TierArchitecture: WebServerTier: Web Servers connect clients to the Db, AppTier: AppServers perform the Ch2 ER model business logic requested by the webservers, supported by the Dbservers, Dbtier: execute queries and m
School: Sveriges Lantbruksuniversitet
Course: Database Systems
Ch6DbAppDevelopment Should use Serverside state for info that needs to persist (old cust. orders, click trails of a user thru website, permanent choices a user makes) The3TierArchitecture: WebServerTier: Web Servers connect clients to the Db, Ap
School: Sveriges Lantbruksuniversitet
}zkzwzkdyetQine{tjthii%kzPnXewwztdteteikn6wp}fkjse"Prg%z"tzt}n~in j sxxn s sn n qg z { d zg s h d d d s q j z { xp dPtX htn{tjmheBek}zkzPnwwzdPttz)ztdyPX htn{eeekGkdiPQ {n z z f d h j z {n z sxxn z jp d h sn xpn wztdtzt}n3P3@1 2Q"kzPnQ@w
School: Sveriges Lantbruksuniversitet
Longest Common Subsquence By Nathan Nastili CMPT 307 REVIEW SESSION JULY 21st 2014 What is a subsequence FOR EXAMPLE: S = GGGGTTACTTTAT Z = G T C A What is a LCS FOR EXAMPLE: X= GTAATTTTAAA Y= GGGGTTACTTTAT X= G T A ATTTTAAA Y= GGGGTTACT
School: Sveriges Lantbruksuniversitet
Santa Clause Problem Getting to know dynamic programming Lu Gan Computing Science What is dynamic programming is a method for solving complex problems How? By breaking them down into simpler sub problems What kind of sub problem? a) There are only a po
School: Sveriges Lantbruksuniversitet
A* Algorithm BY WARREN RUSSELL Dijkstras Algorithm In real time, finding a path can be time consuming. Especially with all the extra cells visited. Is this practical? Could we do better? A* (A Star) This is a shortest path algorithm that avoids exhaustive
School: Sveriges Lantbruksuniversitet
Bipartite Matching Variation of Marriage Problem Recall marriage problem Set of men M = cfw_m1, m2, . . . , mn Set of women W = cfw_w1,w2, . . . ,wn Want perfect matching M where every man is married to every woman Variation of Marriage Problem Two Ca
School: Sveriges Lantbruksuniversitet
Exercises June 18, 2014 Exercises Scheduling Jobs with Deadlines and Prots Problem Statement: We have a resource and many people request to use the resource for one unit of time. Conditions: the resource can be used by at most one person at a time. we c
School: Sveriges Lantbruksuniversitet
INTERVAL SCHEDULING YuTa Cheng IDEAL We want to schedule jobs on computer. Given a set of jobs that can be processes on the computer. Many jobs request to process at same time but our computer can only run one job at a time. Also we can accept only co
School: Sveriges Lantbruksuniversitet
CMPT 383 Quiz #4 October 11, 2005 1) Prove that the following grammar is ambiguous: <S> := <A> <A> := <A>+<A><id> <id> := a  b  c 2) Convert the following EBNF to BNF: <S> := <A>{b<A>} <A> := a[b]<A> 3) Consider the following incomplete attribut
School: Sveriges Lantbruksuniversitet
%!PSAdobe2.0 %Creator: dvips(k) 5.94a Copyright 2003 Radical Eye Software %Title: Midterm.dvi %Pages: 7 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: CMBX12 CMR12 %EndComments %DVIPSWebPage: (www.radicaleye.com) %DVIPSCommandLine: dv
School: Sveriges Lantbruksuniversitet
SIMON FRASER UNIVERSITY ECON 103 (20072) MIDTERM EXAM Multiple Choice Part II, A Part II, B NAME _ Part III Total Student # _ Tutorial # _ PART I. MULTIPLE CHOICE (56%, 1.75 points each). Answer on the bubble sheet. Use a soft lead pencil. 1.
School: Sveriges Lantbruksuniversitet
Midterm CMPT 250  Summer 2008 First Name _ Last Name _ Student ID _ Write all your answers in the space provided. The use of calculators is not allowed. 1. Perform the following calculations. All numbers are unsigned. a. Add 11011011102 plus 011111
School: Sveriges Lantbruksuniversitet
Lecture examples (Ch 8) 1. (836). Consider the track shown in Fig. 837. The section AB is one quadrant of a circle of radius 2.0 m and is frictionless. B to C is a horizontal span 3.0 m long with a coefficient of kinetic friction mk = 0.25. The sect
School: Sveriges Lantbruksuniversitet
CMPT 120, Fall 2004, Surrey 4 Sample Midterm 1 Page 1 of CMPT120: Sample Midterm 1 Last name exactly as it appears on your student card First name exactly as it appears on your student card Student Number SFU Email Section if you know it! This is
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
CMPT 307, Assignment 2 Deadline Monday June 30th (5:00 pm) Problem 0.1 Write a pseudo code for nding a longest weighted path between two given nodes u, v in an acyclic digraph D. Problem 0.2 Modify the shortest path algorithm to nd the number of shortest
School: Sveriges Lantbruksuniversitet
CMPT 307, Assignment 3 Deadline Monday July 21 (5:00 pm) Problem 0.1 Show the steps of all pairs shortest path algorithm on this example. 2 3 4 1 8 4 2 3 1 5 7 5 6 4 Problem 0.2 We are given a weighted (nonnegative value on the arcs) digraph D = (V, A)
School: Sveriges Lantbruksuniversitet
CMPT 307, Assignment 4 Deadline : Monday August 4 (5:00 pm) Problem 0.1 Explain when do we use Dijksras algorithm and all pairs shortest path. Please also explain the algorithm for nding negative cycle in a digraph. What do you know about these three algo
School: Sveriges Lantbruksuniversitet
Wireshark Lab: DNS Version: 2.0 2007 J.F. Kurose, K.W. Ross. All Rights Reserved Computer Networking: A Topth down Approach, 4 edition. As described in Section 2.5 of the textbook, the Domain Name System (DNS) translates hostnames to IP addresses
School: Sveriges Lantbruksuniversitet
CMPT125D2: Lab Exercises 2 May 23 Topics String Class Random Class Math Class Wrapper Classes Lab Exercises Working with Strings Rolling Dice Computing Distance Experimenting with the Integer Class The following source code files can be download
School: Sveriges Lantbruksuniversitet
Polymorphism and Recursion Lab Exercises Topics Recursion on Strings Lab Exercises Painting Shapes Palindromes Putting a String Backwards Polymorphism via Inheritance 1 Painting Shapes In this lab exercise you will develop a class hierarchy of sh
School: Sveriges Lantbruksuniversitet
Chapter 6: ObjectOriented Design Lab Exercises Topics Parameter Passing Method Decomposition Overloading Static Variables and Methods Lab Exercises Changing People A Modified MiniQuiz Class A Flexible Account Class Opening and Closing Accounts Tran
School: Sveriges Lantbruksuniversitet
Chapter 5: Conditionals and Loops Lab 3 Exercises Topics The if/ifelse statement The while statement The do statement The for statement Lab Exercises Rock, Paper, Scissors A Guessing Game More Guessing Counting Characters Chapter 5: Conditionals a
School: Sveriges Lantbruksuniversitet
BISC 367W Plant Physiology Laboratory Plant Water Relations 1 SFU We will examine the effects of various environmental stresses on water relations. During this lab you will: a. Learn how to measure the water potential of herbaceous and woody plant
School: Sveriges Lantbruksuniversitet
LINGUISTICS 401 Topics in Phonetics STUDY QUESTIONS FOR THE MIDTERM EXAM (October 17, 2007) A. PHONATION Briefly describe the following phonation types: 1. Voicelessness: (i) nil phonation, (ii) breath phonation 2. Whisper phonation 3. Voiced pho
School: Sveriges Lantbruksuniversitet
LINGUISTICS 220 Introduction to Linguistics STUDY GUIDE FOR THE MIDTERM EXAM (June 15th, 2004) A. LANGUAGE: A PREVIEW 1. Define the concept of language by referring to three of its properties. Briefly describe these properties and illustrate your
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
Longest Common Subsquence By Nathan Nastili CMPT 307 REVIEW SESSION JULY 21st 2014 What is a subsequence FOR EXAMPLE: S = GGGGTTACTTTAT Z = G T C A What is a LCS FOR EXAMPLE: X= GTAATTTTAAA Y= GGGGTTACTTTAT X= G T A ATTTTAAA Y= GGGGTTACT
School: Sveriges Lantbruksuniversitet
Santa Clause Problem Getting to know dynamic programming Lu Gan Computing Science What is dynamic programming is a method for solving complex problems How? By breaking them down into simpler sub problems What kind of sub problem? a) There are only a po
School: Sveriges Lantbruksuniversitet
A* Algorithm BY WARREN RUSSELL Dijkstras Algorithm In real time, finding a path can be time consuming. Especially with all the extra cells visited. Is this practical? Could we do better? A* (A Star) This is a shortest path algorithm that avoids exhaustive
School: Sveriges Lantbruksuniversitet
Bipartite Matching Variation of Marriage Problem Recall marriage problem Set of men M = cfw_m1, m2, . . . , mn Set of women W = cfw_w1,w2, . . . ,wn Want perfect matching M where every man is married to every woman Variation of Marriage Problem Two Ca
School: Sveriges Lantbruksuniversitet
Exercises June 18, 2014 Exercises Scheduling Jobs with Deadlines and Prots Problem Statement: We have a resource and many people request to use the resource for one unit of time. Conditions: the resource can be used by at most one person at a time. we c
School: Sveriges Lantbruksuniversitet
INTERVAL SCHEDULING YuTa Cheng IDEAL We want to schedule jobs on computer. Given a set of jobs that can be processes on the computer. Many jobs request to process at same time but our computer can only run one job at a time. Also we can accept only co
School: Sveriges Lantbruksuniversitet
GRAPH SEARCH BFS & DFS By: Parminder Benipal Usage 2 ! ! ! ! Transportation networks (airline carrier, airports as node and direct flights as edges (direct edge). Communication networks (a collection of computers as nodes and the physical link between the
School: Sveriges Lantbruksuniversitet
Dynamic Programming Shortest path with negative edges BellmanFord algorithm Shortest Paths: Failed Attempts Dijkstra Algorithm: shortest path from s to t Can fail if negative edge costs. 2 u 3 s v 1 6 t Reweighting. Adding a constant to every edge weigh
School: Sveriges Lantbruksuniversitet
Divide and Conquer June 4, 2014 Divide and Conquer Divide the problem into a number of subproblems Divide and Conquer Divide the problem into a number of subproblems Conquer the subproblems by solving them recursively or if they are small, there must be a
School: Sveriges Lantbruksuniversitet
Approximation Algorithms (Travelling Salesman Problem) July 18, 2014 Approximation Algorithms (Travelling Salesman Problem) The travellingsalesman problem Problem: given complete, undirected graph G = (V , E ) with nonnegative integer cost c(u, v ) for
School: Sveriges Lantbruksuniversitet
Hard Problems (NP problems) July 9, 2014 Hard Problems (NP problems) So far we have seen polynomial time problems and we have designed (attempt) ecient algorithm to solve them. Hard Problems (NP problems) So far we have seen polynomial time problems and w
School: Sveriges Lantbruksuniversitet
Approximation Algorithms (Load Balancing) July 16, 2014 Approximation Algorithms (Load Balancing) Problem Denition : We are given a set of n jobs cfw_J1 , J2 , . . . , Jn . Each job Ji has a processing time ti 0. We are given m identical machines. Approxi
School: Sveriges Lantbruksuniversitet
Approximation Algorithms (vertex cover) July 14, 2014 Approximation Algorithms (vertex cover) Consider a problem that we can not solved in polynomial time. We may be able to nd a solution that is guaranteed to be close to optimal and it can be found in po
School: Sveriges Lantbruksuniversitet
Exercises June 23, 2014 Exercises Going from A to B using one unit diagonal moves A , . B From A to B using A B Exercises Denition : We say a sequence S of 0, 1 is nice if the number of ones and the number of zeros are the same and in every prex of S the
School: Sveriges Lantbruksuniversitet
Matching in Bipartite Graphs July 2, 2014 Matching in Bipartite Graphs We have a bipartite graph G = (C , R, E ) where R represents a set of resources and C represents a set of customers. The edge set shows a customer in C likes (willing to have) a subset
School: Sveriges Lantbruksuniversitet
Dynamic Programming( All pairs shortest path) June 25, 2014 Dynamic Programming( All pairs shortest path) Allpairs shortest paths Directed graph G = (V , E ), weight function w : E R, V  = n Assume G contains no negativeweight cycles Goal: create n n
School: Sveriges Lantbruksuniversitet
Shortest path with negative edges June 16, 2014 Shortest path with negative edges Shortest path from s to t when there are negative weight arcs, but no negative cycles A cycle is negative if sum of the weights of its arcs is less than zero. Lemma If G has
School: Sveriges Lantbruksuniversitet
Divide and Conquer June 2, 2014 Divide and Conquer Divide the problem into a number of subproblems Divide and Conquer Divide the problem into a number of subproblems Conquer the subproblems by solving them recursively or if they are small, there must be a
School: Sveriges Lantbruksuniversitet
Dynamic Programming II June 9, 2014 Dynamic Programming II DP: Longest common subsequence biologists often need to nd out how similar are 2 DNA sequences DNA sequences are strings of bases: A, C , T and G how to dene similarity? Dynamic Programming II
School: Sveriges Lantbruksuniversitet
Dynamic Programming( Weighted Interval Scheduling) June 11, 2014 Dynamic Programming( Weighted Interval Scheduling) Problem Statement: 1 2 3 We have a resource and many people request to use the resource for periods of time (an interval of time) Each inte
School: Sveriges Lantbruksuniversitet
Interval Scheduling May 30, 2014 Interval Scheduling Interval Scheduling Problem Problem Statement: We have a resource and many people request to use the resource for periods of time. Conditions: the resource can be used by at most one person at a time.
School: Sveriges Lantbruksuniversitet
Dynamic Programming June 6, 2014 Dynamic Programming Dynamic Programming 1 Dynamic programming algorithms are used for optimization (for example, nding the shortest path between two points, or the fastest way to multiply many matrices). Dynamic Programmin
School: Sveriges Lantbruksuniversitet
Graphs and Graphs Traversal May 12, 2014 Graphs and Graphs Traversal Graph (Basic Denition) Graph : Represents a way of encoding pairwise relationships among a set of objects. Graph G consists of a collection V of nodes and a collection E of edges, each o
School: Sveriges Lantbruksuniversitet
Shortest Path in Digraphs May 16, 2014 Shortest Path in Digraphs Exercises from Wednesday May 14 A digraph T is called tournament if for every two nodes u, v of exactly one of the uv , vu is an arc in T . Problem 1: Show that in every tournament there is
School: Sveriges Lantbruksuniversitet
Heap, HeapSort and Priority Queue May 28, 2014 Heap, HeapSort and Priority Queue Heap A heap (data structure) is a linear array that stores a nearly complete tree. Only talking about binary heaps that store binary trees. nearly complete trees: all levels
School: Sveriges Lantbruksuniversitet
Minimum Spanning Trees May 23, 2014 Minimum Spanning Trees Minimum spanning trees (MST) One of the most famous greedy algorithms Given undirected graph G = (V , E ), connected Weight function w : E R Spanning tree: tree that connects all nodes, hence n =
School: Sveriges Lantbruksuniversitet
Graph Search, BFS,DFS,Topological ordering May 14, 2014 Graph Search, BFS,DFS,Topological ordering BFS Algorithm BFS (s) 1. Set Discover[s]=true and Discover[v]=false for all other v 2. Set L[0] = cfw_s 3. Set layer counter i=0 4. Set T = 4. While L[i] i
School: Sveriges Lantbruksuniversitet
Course Information and Introduction Arash Raey May 5, 2014 Arash Raey Course Information and Introduction Course Information CMPT 307 1 Instructor : Arash Raey Email : arashr@sfu.ca Oce : TACS1 9215 Oce Hours : Monday and Wednesday 10:30 am to 11:30 am 2
School: Sveriges Lantbruksuniversitet
CMPT 307, Assignment 2 Deadline Monday June 30th (5:00 pm) Problem 0.1 Write a pseudo code for nding a longest weighted path between two given nodes u, v in an acyclic digraph D. Problem 0.2 Modify the shortest path algorithm to nd the number of shortest
School: Sveriges Lantbruksuniversitet
Analysing Algorithms Arash Raey May 9, 2014 Arash Raey Analysing Algorithms Usually interested in running time (but sometimes also memory requirements). Example: One of the simplest sorting algorithms Input : n numbers in array A[1], . . . , A[n] 1. for (
School: Sveriges Lantbruksuniversitet
Stable Matching and Interval Scheduling Arash Raey May 7, 2014 Arash Raey Stable Matching and Interval Scheduling Stable Matching Problem We have a set M = cfw_m1 , m2 , . . . , mn of men and a set W = cfw_w1 , w2 , . . . , wn of women. A matching S is
School: Sveriges Lantbruksuniversitet
CMPT 307, Assignment 3 Deadline Monday July 21 (5:00 pm) Problem 0.1 Show the steps of all pairs shortest path algorithm on this example. 2 3 4 1 8 4 2 3 1 5 7 5 6 4 Problem 0.2 We are given a weighted (nonnegative value on the arcs) digraph D = (V, A)
School: Sveriges Lantbruksuniversitet
DYNAMIC PROGRAMMING A Solution to Complex Problems WHEN? Overlapping subproblems Optimal substructure OVERLAPPING SUBPROBLEMS Redundantly solving problems Problem with bruteforce approach (2) OVERLAPPING SUBPROBLEMS Redundantly solving problems Problem w
School: Sveriges Lantbruksuniversitet
CMPT 307, Assignment 4 Deadline : Monday August 4 (5:00 pm) Problem 0.1 Explain when do we use Dijksras algorithm and all pairs shortest path. Please also explain the algorithm for nding negative cycle in a digraph. What do you know about these three algo
School: Sveriges Lantbruksuniversitet
Association Rule Learning By Jonny Kantor Association Rule Learning A method for discovering strong rules Relationships between items in a transaction By some measure of user defined 'interestingness' Without considering the order of items WRT each other
School: Sveriges Lantbruksuniversitet
CMPT 307, Assignment 1 Deadline: Friday, June 13 (5:00 pm) Problem 0.1 Rank the following functions by the order of growth : 4 n 2log n , 2n , n 3 , n log n, nlog n , 22 , 2 n You need to arrange them into g1 , g2 , g3 , g4 , g5 , g6 , g7 such that gi (n)
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
CMPT 371 Data Communications and Networking Spring2014 Outline Courseinformation Whatisnetwork? AbriefintroductiontotheInternet:pastandpresent Summary 2 CourseInformation Instructor: r Jiangchuan(JC)Liu r AssociateProfessor,ComputingScience r Email:j
School: Sveriges Lantbruksuniversitet
CMPT371 DataCommunications andNetworking Chapter1 Introduction Introduction 11 Chapter1:OverviewoftheInternet Ourgoal: Overview: ofnetworking moredepth,detaillaterin course approach: r descriptive r useInternetasexample whatsaprotocol? getcontext,ove
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
MATH 232 Schedule of Lectures and Exams Fall 2009 Week Class Date 1 1 Sep 9 (W) 2 2 3 4 5 Sections 1.1 1.2 1.3 1.4 1.5 Sep 11 (F) Sep 14 (M) Sep 16 (W) Sep 18 (F)* 3 7 8 9 10 11 Sep 23 (W) Sep 25 (F)* Sep 28 (M) Sep 30 (W) Oct 2 (F)* Oct 5 (M) 13 14 15 Oc
School: Sveriges Lantbruksuniversitet
ALGEBRA WORKSHOP (AQ 4135) MATH 232 Last Name: _ First Name: _ SFU Email ID: _ Assignment #: _ Date: _
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
Course: Operating Systems
CMPT 300 Section 1 Notes OS layer provides user with a simple and clean model of the computer. The users interact with a shell (textbased) or a GUI. Shell/GUI are not part of the OS, but interact with it. Where does the OS fit in? Most computers have two
School: Sveriges Lantbruksuniversitet
Course: Database Systems
Ch6DbAppDevelopment The3TierArchitecture: WebServerTier: Web Servers connect clients to the Db, AppTier: AppServers perform the Ch2 ER model business logic requested by the webservers, supported by the Dbservers, Dbtier: execute queries and m
School: Sveriges Lantbruksuniversitet
Course: Database Systems
Ch6DbAppDevelopment Should use Serverside state for info that needs to persist (old cust. orders, click trails of a user thru website, permanent choices a user makes) The3TierArchitecture: WebServerTier: Web Servers connect clients to the Db, Ap
School: Sveriges Lantbruksuniversitet
Course: Algorithms
Insertion Sort Algorithm runtime for j = 2 to n do key = A[j] i=j1 while i > 0 and A[i] > key do A[i+1] = A[i] i=i1 A[i+1] = key Loop Invariants and correctness of insertion sort Selection Sort Algorithm runtime for i = 1 to n1 do min = A[i] at = i for j
School: Sveriges Lantbruksuniversitet
Course: Networking
Chapter 3 Notes Transport layer has 3 critical functions: Extending the network layers delivery service between two endsystems to a delivery service between two applicationlayer processes running on the end systems  Allowing two entities to communicat
School: Sveriges Lantbruksuniversitet
CMPT 404  Cryptography and Protocols Fall 2008 Instructor: Andrei Bulatov, email: abulatov@cs.sfu.ca TAs: Learning resourses: Prerequisites: MACM 201, some knowledge of probability and complexity is helpful, although not necessary Lectures: Tu 11:
School: Sveriges Lantbruksuniversitet
Intelligent Agents Definitions of AI Rationality Midterm Review PEAS descriptions Environment types Agent types CMPT 310 CMPT 310 1 CMPT 310 4 Midterm Tuesday October 14  in class 12:301:30 Approximately 4 questions (with subparts) One a
School: Sveriges Lantbruksuniversitet
1 of 2 pages SIMON FRASER UNIVERSITY SCHOOL OF ENGINEERING SCEINCE ENSC383 FEEDBACK CONTROL SYSTEMS COURSE OUTLINE Fall 2007 OBJECTIVES: Control systems are present everywhere. Inspired by the use of feedback in nature, humanmade technology has b
School: Sveriges Lantbruksuniversitet
Midterm Review CMPT 310 CMPT 310 1 Midterm Tuesday October 14  in class 12:301:30 Approximately 4 questions (with subparts) One additional multiple choice question  can be completed anytime 7:00am7:00pm  very important CMPT 310 2 Format A
School: Sveriges Lantbruksuniversitet
Physics 430 Digital Electronics and Computer Interfacing Instructor: Neil Alberding Fall 2001 Lecture Notes Table of Contents Logic ..4 Electronic Logic.5 Types of Logic Gates..7 Transmission Gate Logic (TGL) .7 Mickey Mouse Logic (M2L)..8 Diode Tra
School: Sveriges Lantbruksuniversitet
JOURNAL OF GEOPHYSICAL RESEARCH, VOL. 110, F04S02, doi:10.1029/2004JF000218, 2005 The fluid dynamics of river dunes: A review and some future research directions Jim Best Earth and Biosphere Institute, School of Earth and Environment, University of
School: Sveriges Lantbruksuniversitet
}zkzwzkdyetQine{tjthii%kzPnXewwztdteteikn6wp}fkjse"Prg%z"tzt}n~in j sxxn s sn n qg z { d zg s h d d d s q j z { xp dPtX htn{tjmheBek}zkzPnwwzdPttz)ztdyPX htn{eeekGkdiPQ {n z z f d h j z {n z sxxn z jp d h sn xpn wztdtzt}n3P3@1 2Q"kzPnQ@w
School: Sveriges Lantbruksuniversitet
Longest Common Subsquence By Nathan Nastili CMPT 307 REVIEW SESSION JULY 21st 2014 What is a subsequence FOR EXAMPLE: S = GGGGTTACTTTAT Z = G T C A What is a LCS FOR EXAMPLE: X= GTAATTTTAAA Y= GGGGTTACTTTAT X= G T A ATTTTAAA Y= GGGGTTACT
School: Sveriges Lantbruksuniversitet
Santa Clause Problem Getting to know dynamic programming Lu Gan Computing Science What is dynamic programming is a method for solving complex problems How? By breaking them down into simpler sub problems What kind of sub problem? a) There are only a po
School: Sveriges Lantbruksuniversitet
A* Algorithm BY WARREN RUSSELL Dijkstras Algorithm In real time, finding a path can be time consuming. Especially with all the extra cells visited. Is this practical? Could we do better? A* (A Star) This is a shortest path algorithm that avoids exhaustive
School: Sveriges Lantbruksuniversitet
Bipartite Matching Variation of Marriage Problem Recall marriage problem Set of men M = cfw_m1, m2, . . . , mn Set of women W = cfw_w1,w2, . . . ,wn Want perfect matching M where every man is married to every woman Variation of Marriage Problem Two Ca
School: Sveriges Lantbruksuniversitet
Exercises June 18, 2014 Exercises Scheduling Jobs with Deadlines and Prots Problem Statement: We have a resource and many people request to use the resource for one unit of time. Conditions: the resource can be used by at most one person at a time. we c
School: Sveriges Lantbruksuniversitet
INTERVAL SCHEDULING YuTa Cheng IDEAL We want to schedule jobs on computer. Given a set of jobs that can be processes on the computer. Many jobs request to process at same time but our computer can only run one job at a time. Also we can accept only co
School: Sveriges Lantbruksuniversitet
GRAPH SEARCH BFS & DFS By: Parminder Benipal Usage 2 ! ! ! ! Transportation networks (airline carrier, airports as node and direct flights as edges (direct edge). Communication networks (a collection of computers as nodes and the physical link between the
School: Sveriges Lantbruksuniversitet
Dynamic Programming Shortest path with negative edges BellmanFord algorithm Shortest Paths: Failed Attempts Dijkstra Algorithm: shortest path from s to t Can fail if negative edge costs. 2 u 3 s v 1 6 t Reweighting. Adding a constant to every edge weigh
School: Sveriges Lantbruksuniversitet
Divide and Conquer June 4, 2014 Divide and Conquer Divide the problem into a number of subproblems Divide and Conquer Divide the problem into a number of subproblems Conquer the subproblems by solving them recursively or if they are small, there must be a
School: Sveriges Lantbruksuniversitet
Approximation Algorithms (Travelling Salesman Problem) July 18, 2014 Approximation Algorithms (Travelling Salesman Problem) The travellingsalesman problem Problem: given complete, undirected graph G = (V , E ) with nonnegative integer cost c(u, v ) for
School: Sveriges Lantbruksuniversitet
Hard Problems (NP problems) July 9, 2014 Hard Problems (NP problems) So far we have seen polynomial time problems and we have designed (attempt) ecient algorithm to solve them. Hard Problems (NP problems) So far we have seen polynomial time problems and w
School: Sveriges Lantbruksuniversitet
Approximation Algorithms (Load Balancing) July 16, 2014 Approximation Algorithms (Load Balancing) Problem Denition : We are given a set of n jobs cfw_J1 , J2 , . . . , Jn . Each job Ji has a processing time ti 0. We are given m identical machines. Approxi
School: Sveriges Lantbruksuniversitet
Approximation Algorithms (vertex cover) July 14, 2014 Approximation Algorithms (vertex cover) Consider a problem that we can not solved in polynomial time. We may be able to nd a solution that is guaranteed to be close to optimal and it can be found in po
School: Sveriges Lantbruksuniversitet
Exercises June 23, 2014 Exercises Going from A to B using one unit diagonal moves A , . B From A to B using A B Exercises Denition : We say a sequence S of 0, 1 is nice if the number of ones and the number of zeros are the same and in every prex of S the
School: Sveriges Lantbruksuniversitet
Matching in Bipartite Graphs July 2, 2014 Matching in Bipartite Graphs We have a bipartite graph G = (C , R, E ) where R represents a set of resources and C represents a set of customers. The edge set shows a customer in C likes (willing to have) a subset
School: Sveriges Lantbruksuniversitet
Dynamic Programming( All pairs shortest path) June 25, 2014 Dynamic Programming( All pairs shortest path) Allpairs shortest paths Directed graph G = (V , E ), weight function w : E R, V  = n Assume G contains no negativeweight cycles Goal: create n n
School: Sveriges Lantbruksuniversitet
Shortest path with negative edges June 16, 2014 Shortest path with negative edges Shortest path from s to t when there are negative weight arcs, but no negative cycles A cycle is negative if sum of the weights of its arcs is less than zero. Lemma If G has
School: Sveriges Lantbruksuniversitet
Divide and Conquer June 2, 2014 Divide and Conquer Divide the problem into a number of subproblems Divide and Conquer Divide the problem into a number of subproblems Conquer the subproblems by solving them recursively or if they are small, there must be a
School: Sveriges Lantbruksuniversitet
Dynamic Programming II June 9, 2014 Dynamic Programming II DP: Longest common subsequence biologists often need to nd out how similar are 2 DNA sequences DNA sequences are strings of bases: A, C , T and G how to dene similarity? Dynamic Programming II
School: Sveriges Lantbruksuniversitet
Dynamic Programming( Weighted Interval Scheduling) June 11, 2014 Dynamic Programming( Weighted Interval Scheduling) Problem Statement: 1 2 3 We have a resource and many people request to use the resource for periods of time (an interval of time) Each inte
School: Sveriges Lantbruksuniversitet
Interval Scheduling May 30, 2014 Interval Scheduling Interval Scheduling Problem Problem Statement: We have a resource and many people request to use the resource for periods of time. Conditions: the resource can be used by at most one person at a time.
School: Sveriges Lantbruksuniversitet
Dynamic Programming June 6, 2014 Dynamic Programming Dynamic Programming 1 Dynamic programming algorithms are used for optimization (for example, nding the shortest path between two points, or the fastest way to multiply many matrices). Dynamic Programmin
School: Sveriges Lantbruksuniversitet
Graphs and Graphs Traversal May 12, 2014 Graphs and Graphs Traversal Graph (Basic Denition) Graph : Represents a way of encoding pairwise relationships among a set of objects. Graph G consists of a collection V of nodes and a collection E of edges, each o
School: Sveriges Lantbruksuniversitet
Shortest Path in Digraphs May 16, 2014 Shortest Path in Digraphs Exercises from Wednesday May 14 A digraph T is called tournament if for every two nodes u, v of exactly one of the uv , vu is an arc in T . Problem 1: Show that in every tournament there is
School: Sveriges Lantbruksuniversitet
Heap, HeapSort and Priority Queue May 28, 2014 Heap, HeapSort and Priority Queue Heap A heap (data structure) is a linear array that stores a nearly complete tree. Only talking about binary heaps that store binary trees. nearly complete trees: all levels
School: Sveriges Lantbruksuniversitet
Minimum Spanning Trees May 23, 2014 Minimum Spanning Trees Minimum spanning trees (MST) One of the most famous greedy algorithms Given undirected graph G = (V , E ), connected Weight function w : E R Spanning tree: tree that connects all nodes, hence n =
School: Sveriges Lantbruksuniversitet
Graph Search, BFS,DFS,Topological ordering May 14, 2014 Graph Search, BFS,DFS,Topological ordering BFS Algorithm BFS (s) 1. Set Discover[s]=true and Discover[v]=false for all other v 2. Set L[0] = cfw_s 3. Set layer counter i=0 4. Set T = 4. While L[i] i
School: Sveriges Lantbruksuniversitet
Course Information and Introduction Arash Raey May 5, 2014 Arash Raey Course Information and Introduction Course Information CMPT 307 1 Instructor : Arash Raey Email : arashr@sfu.ca Oce : TACS1 9215 Oce Hours : Monday and Wednesday 10:30 am to 11:30 am 2
School: Sveriges Lantbruksuniversitet
Analysing Algorithms Arash Raey May 9, 2014 Arash Raey Analysing Algorithms Usually interested in running time (but sometimes also memory requirements). Example: One of the simplest sorting algorithms Input : n numbers in array A[1], . . . , A[n] 1. for (
School: Sveriges Lantbruksuniversitet
Stable Matching and Interval Scheduling Arash Raey May 7, 2014 Arash Raey Stable Matching and Interval Scheduling Stable Matching Problem We have a set M = cfw_m1 , m2 , . . . , mn of men and a set W = cfw_w1 , w2 , . . . , wn of women. A matching S is
School: Sveriges Lantbruksuniversitet
DYNAMIC PROGRAMMING A Solution to Complex Problems WHEN? Overlapping subproblems Optimal substructure OVERLAPPING SUBPROBLEMS Redundantly solving problems Problem with bruteforce approach (2) OVERLAPPING SUBPROBLEMS Redundantly solving problems Problem w
School: Sveriges Lantbruksuniversitet
Association Rule Learning By Jonny Kantor Association Rule Learning A method for discovering strong rules Relationships between items in a transaction By some measure of user defined 'interestingness' Without considering the order of items WRT each other
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
MATH 232 Schedule of Lectures and Exams Fall 2009 Week Class Date 1 1 Sep 9 (W) 2 2 3 4 5 Sections 1.1 1.2 1.3 1.4 1.5 Sep 11 (F) Sep 14 (M) Sep 16 (W) Sep 18 (F)* 3 7 8 9 10 11 Sep 23 (W) Sep 25 (F)* Sep 28 (M) Sep 30 (W) Oct 2 (F)* Oct 5 (M) 13 14 15 Oc
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
CMPT 383 Quiz #4 October 11, 2005 1) Prove that the following grammar is ambiguous: <S> := <A> <A> := <A>+<A><id> <id> := a  b  c 2) Convert the following EBNF to BNF: <S> := <A>{b<A>} <A> := a[b]<A> 3) Consider the following incomplete attribut
School: Sveriges Lantbruksuniversitet
%!PSAdobe2.0 %Creator: dvips(k) 5.94a Copyright 2003 Radical Eye Software %Title: Midterm.dvi %Pages: 7 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: CMBX12 CMR12 %EndComments %DVIPSWebPage: (www.radicaleye.com) %DVIPSCommandLine: dv
School: Sveriges Lantbruksuniversitet
SIMON FRASER UNIVERSITY ECON 103 (20072) MIDTERM EXAM Multiple Choice Part II, A Part II, B NAME _ Part III Total Student # _ Tutorial # _ PART I. MULTIPLE CHOICE (56%, 1.75 points each). Answer on the bubble sheet. Use a soft lead pencil. 1.
School: Sveriges Lantbruksuniversitet
Midterm CMPT 250  Summer 2008 First Name _ Last Name _ Student ID _ Write all your answers in the space provided. The use of calculators is not allowed. 1. Perform the following calculations. All numbers are unsigned. a. Add 11011011102 plus 011111
School: Sveriges Lantbruksuniversitet
Lecture examples (Ch 8) 1. (836). Consider the track shown in Fig. 837. The section AB is one quadrant of a circle of radius 2.0 m and is frictionless. B to C is a horizontal span 3.0 m long with a coefficient of kinetic friction mk = 0.25. The sect
School: Sveriges Lantbruksuniversitet
CMPT 120, Fall 2004, Surrey 4 Sample Midterm 1 Page 1 of CMPT120: Sample Midterm 1 Last name exactly as it appears on your student card First name exactly as it appears on your student card Student Number SFU Email Section if you know it! This is
School: Sveriges Lantbruksuniversitet
Lecture examples (Ch 8) 1. (836). Consider the track shown in Fig. 837. The section AB is one quadrant of a circle of radius 2.0 m and is frictionless. B to C is a horizontal span 3.0 m long with a coefficient of kinetic friction m k = 0.25. The sec
School: Sveriges Lantbruksuniversitet
Name Student # STAT 201 Midterm Examination Richard Lockhart Instructions: 1. This is a closed book exam. 2. You may use a calculator (with no wireless communications ability). 3. You may bring one sheet of notes. 4. You may also bring the tear out
School: Sveriges Lantbruksuniversitet
CMPT 371: Final Exam August 15, 2006 1 1 Short Answer Questions 1. For each of the top four layers of the protocol stack, name one specic protocol that operates at that level. 2. True or False: (a) A cookie is the information stored on a webserv
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
Physics 120 Practice Midterm 2 1) You need to make a sharp turn on a at road, making a radius of curvature of 15 meters. How does the required force of static friction between your tires compare if you make the turn at 30 mph vs. 60 mph? A) The force
School: Sveriges Lantbruksuniversitet
Statistics 270 Sample Final Exam DO NOT TURN THIS PAGE UNTIL YOU ARE TOLD TO DO SO! Instructions: 1. 2. 3. 4. 5. Read all questions carefully. Define all variables/events used in your solutions. Show all of your work. Cross out any material you do
School: Sveriges Lantbruksuniversitet
CMPT 120, Fall 2004, Surrey Sample Final Page 1 of 6 CMPT120: Sample Final Last name exactly as it appears on your student card First name exactly as it appears on your student card Student Number SFU Email Section if you know it! This is a 120 m
School: Sveriges Lantbruksuniversitet
CMPT 225 Fall 2004 Sample Midterm Page 1 of 4 Last Name Student Number First Name Please write your name and student number exactly as they appear on your student card. This is a closed book exam! No notes, books, calculators, etc. are allowed. Que
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
School: Sveriges Lantbruksuniversitet
CMPT 307, Assignment 2 Deadline Monday June 30th (5:00 pm) Problem 0.1 Write a pseudo code for nding a longest weighted path between two given nodes u, v in an acyclic digraph D. Problem 0.2 Modify the shortest path algorithm to nd the number of shortest
School: Sveriges Lantbruksuniversitet
CMPT 307, Assignment 3 Deadline Monday July 21 (5:00 pm) Problem 0.1 Show the steps of all pairs shortest path algorithm on this example. 2 3 4 1 8 4 2 3 1 5 7 5 6 4 Problem 0.2 We are given a weighted (nonnegative value on the arcs) digraph D = (V, A)
School: Sveriges Lantbruksuniversitet
CMPT 307, Assignment 4 Deadline : Monday August 4 (5:00 pm) Problem 0.1 Explain when do we use Dijksras algorithm and all pairs shortest path. Please also explain the algorithm for nding negative cycle in a digraph. What do you know about these three algo
School: Sveriges Lantbruksuniversitet
CMPT 307, Assignment 1 Deadline: Friday, June 13 (5:00 pm) Problem 0.1 Rank the following functions by the order of growth : 4 n 2log n , 2n , n 3 , n log n, nlog n , 22 , 2 n You need to arrange them into g1 , g2 , g3 , g4 , g5 , g6 , g7 such that gi (n)
School: Sveriges Lantbruksuniversitet
Assignment 10 Applied Linear Algebra Math 232  D100 (Fall 2009) Due date: Friday, December 4th, 2009 (by 2:30pm in the dropbox outside the Algebra Workshop AQ4135) The following assignments will NOT be accepted: unstapled assignments, assignments without
School: Sveriges Lantbruksuniversitet
Assignment 9 Applied Linear Algebra Math 232  D100 (Fall 2009) Due date: Friday, November 27th, 2009 (by 2:30pm in the dropbox outside the Algebra Workshop AQ4135) The following assignments will NOT be accepted: unstapled assignments, assignments without
School: Sveriges Lantbruksuniversitet
Assignment 6 Applied Linear Algebra Math 232  D100 (Fall 2009) Due date: Friday, October 30, 2009 (by 2:30pm in the dropbox outside the Algebra Workshop AQ4135) The following assignments will NOT be accepted: unstapled assignments, assignments without a
School: Sveriges Lantbruksuniversitet
Assignment 7 Applied Linear Algebra Math 232  D100 (Fall 2009) Due date: Friday, November 6th, 2009 (by 2:30pm in the dropbox outside the Algebra Workshop AQ4135) The following assignments will NOT be accepted: unstapled assignments, assignments without
School: Sveriges Lantbruksuniversitet
Assignment 8 Applied Linear Algebra Math 232  D100 (Fall 2009) Due date: Friday, November 20th, 2009 (by 2:30pm in the dropbox outside the Algebra Workshop AQ4135) The following assignments will NOT be accepted: unstapled assignments, assignments witho
School: Sveriges Lantbruksuniversitet
Assignment 5 Applied Linear Algebra Math 232  D100 (Fall 2009) Due date: Friday, October 23, 2009 (by 2:30pm in the dropbox outside the Algebra Workshop AQ4135) The following assignments will NOT be accepted: unstapled assignments, assignments without a
School: Sveriges Lantbruksuniversitet
Assignment 4 Applied Linear Algebra Math 232  D100 (Fall 2009) Due date: Friday, September 16, 2009 (by 2:30pm in the dropbox outside the Algebra Workshop AQ4135) The following assignments will NOT be accepted: unstapled assignments, assignments without
School: Sveriges Lantbruksuniversitet
Assignment 3 Applied Linear Algebra Math 232  D100 (Fall 2009) Due date: Friday, October 2, 2009 (by 2:30pm in the dropbox outside the Algebra Workshop AQ4135) The following assignments will NOT be accepted: unstapled assignments, assignments without a W
School: Sveriges Lantbruksuniversitet
Assignment 2 Applied Linear Algebra Math 232  D100 (Fall 2009) Due date: Friday, September 25, 2009 (by 2:30pm in the dropbox outside the Algebra Workshop AQ4135) The following assignments will NOT be accepted: unstapled assignments, assignments without
School: Sveriges Lantbruksuniversitet
Assignment 1 Applied Linear Algebra Math 232  D100 (Fall 2009) Due date: Friday, September 18, 2009 (by 2:30pm in the dropbox outside the Algebra Workshop AQ4135) The following assignments will NOT be accepted: unstapled assignments, assignments without
School: Sveriges Lantbruksuniversitet
Course: Database Systems II
CMPT 454: Exercise 3 Textbook: 17.5, 17.6, 18.3, 18.5, 18.9 Question 1 (100 marks): Consider the following log file 10 T1 updates P1 20 T2 updates P2 (disk) 30 Begin_Checkpoint 40 T3 updates P3 50 T2 updates P2 60 End_Checkpoint 70 T3 updates P5 80 T3 com
School: Sveriges Lantbruksuniversitet
Course: Database Systems II
Assignment 2 CMPT 454, Spring 2012 Question 1. Consider the following relation and query: Branch(bid, accNo) Account(accNo, code, balance) Select From Where Group by B.bid, Sum(A.balance) Branch B, Account A B.accNo=A.accNo B.bid This query computes the s
School: Sveriges Lantbruksuniversitet
Course: Database Systems II
Assignment 1 The answers for oddnumbered questions from the textbook (third edition) can be found at: http:/pages.cs.wisc.edu/~dbbook/openAccess/thirdEdition/solutions/ans 3edoddonly.pdf You can check answers using the above answer sheet, so assignments
School: Sveriges Lantbruksuniversitet
CMPT 307082 Assignment 11 (From lecture on July 22, 2008) Deadline: July 29, 5:30pm Problem 11.1. Show that the number of full parenthesizations of a product of n matrices, P (n) is in (2n ). Problem 11.2. Consider a variant of the matrixchain mu
School: Sveriges Lantbruksuniversitet
A Problem Set for The Ricardian Model 1. Suppose that in the US, 4 hours are required to produce each unit of clothing and 4 hours are required to produce each unit of food. In Canada, 2 hours are required to produce a unit of clothing and 4 hours to
School: Sveriges Lantbruksuniversitet
ECON 282, Intro Game Theory, (Fall 2008) Christoph Luelfesmann, SFU Problem Set 4 Due at our last day in class, next Tuesday Nov 25. Please let me know if a question is hard to understand. Exercise 1. (medium to harder) Consider Exercise 163.2 in
School: Sveriges Lantbruksuniversitet
Make sure this Assignment has 1 pages. Math 157: Calculus 1 for the Social Science Assignment 21 Due date: September 24, 2007 [4:30pm] 1. Exponential Growth: Babbette needs 1 gram of radioactive Kryptonite to perform an important experiment. Unfort
School: Sveriges Lantbruksuniversitet
ECON 282, Intro Game Theory, (Fall 2008) Christoph Luelfesmann, SFU Solution Problem Set 2 Due at the beginning of class on Tuesday, Oct. 7. Please let me know if you have problems to understand one of the questions. Exercise 1. (easy to medium) So
School: Sveriges Lantbruksuniversitet
DYNAMICS WORKSHEET Name _ St No _ _ _ _ _ _ _ _ _ Prob:_ 1) Pictorial Representation a. sketch showing important points in the motion b) coordinate system c. symbols for knowns and unknowns known: find: 2) Physical Representation a. motion d
School: Sveriges Lantbruksuniversitet
CMPT 307082 Assignment 11 (From lecture on July 22, 2008) Deadline: July 29, 5:30pm Problem 11.1. Show that the number of full parenthesizations of a product of n matrices, P (n) is in (2n ). Problem 11.2. Consider a variant of the matrixchain mu
School: Sveriges Lantbruksuniversitet
61 (page 142) a) The two procedures do not always create the same heap. b) Since MAXHEAPINSERT runs in O(logn) time and we are calling it n times, BUILDMAXHEAP' will run in O(nlogn). 74 (page 161) a) QUICKSORT' sorts the array correctly becaus
School: Sveriges Lantbruksuniversitet
ECONOMICS 331 Mathematical Economics Kevin Wainwright Homework Assignment 10 1. Maximize U(x, y) = 3 ln x + 2 ln y Subject to B Px x + Py y and C cx x + cy y in addition, the nonnegativity constraint x 0 and y 0. (a) Write down (Carefully) the
School: Sveriges Lantbruksuniversitet
ECONOMICS 331 Mathematical Economics Kevin Wainwright Homework Assignment 6 [1] The following function has zero slope at the point z = 1. Determine whether or not this point is a relative extremum, and, if so, whether it is a maximum or minimum. z 4
School: Sveriges Lantbruksuniversitet
10 Homework Assignment 10 [1] Suppose a perfectly competitive, prot maximizing rm has only two inputs, capital and labour. The rm can buy as many units of capital and labour as it wants at constant factor prices r and w respectively. If the rm's pro
School: Sveriges Lantbruksuniversitet
CMPT 471: ASSIGNMENT 4 Solutions PROBLEM 1: In this experiment you will capture packets that illustrate the use of the IGMP protocol, multicast addresses and multicasting. For each of the experiments below capture only IGMP packets unless specific in
School: Sveriges Lantbruksuniversitet
Math 496/796  Homework 2 1. (a) Show that the map f : R2 R3 given by f (u, v) = (u + v, u  v, 4uv), (u, v) R2 , is a parametrization for the set S = {(x, y, z) R3 , z = x2  y 2 }. Describe geometrically the curves u = const. on S. (b) Show th
School: Sveriges Lantbruksuniversitet
Math 496/796  Homework 1 1. Let c : (1, ) R2 be given by c(t) = Show that (a) For t = 0, c is tangent to the x axis. (b) As t , c(t) (0, 0) and c (t) (0, 0). (c) As t 1 (that is, take the curve with the opposite orientation), the curve and i
School: Sveriges Lantbruksuniversitet
MATH 4673 Dynamical Systems Homework Set 4 Fall 2003 Due Wednesday, 8 October 2003 Course Web Site: http:/www.math.sfu.ca/ralfw/math467/ Problems from Strogatz Nonlinear Dynamics and Chaos: Section 3.5: 3.5.7 Section 3.6: 3.6.2 Section 3.7: 3.7
School: Sveriges Lantbruksuniversitet
MATH 4673 Dynamical Systems Homework Set 2 Fall 2003 Due Wednesday, 24 September 2003 Course Web Site: http:/www.math.sfu.ca/ralfw/math467/ Problems from Strogatz Nonlinear Dynamics and Chaos: Section 2.6: 2.6.1 Section 2.7: 2.7.6, 2.7.7 Sectio
School: Sveriges Lantbruksuniversitet
Solutions 1 2.2.4 (Page 37) The fixed points for x = exp(x) sin(x) are x = n, where n is an integer. When n = . . .  4, 2, 0, 2, 4, . . . , x is unstable, while when n = . . .  3, 1, 1, 3, . . . , x is stable. The graph below shows the solution
School: Sveriges Lantbruksuniversitet
ECONOMICS 331 Mathematical Economics Kevin Wainwright Homework Assignment 6 1. You are an assembler of specialty computer terminals with a modest amount of monopoly power. Suppose that your average revenue per unit depends on how many terminals per
School: Sveriges Lantbruksuniversitet
CMPT 307082 Assignment 10 (From lecture on July 15, 2008) Deadline: July 22, 5:30pm Problem 10.1. What is the largest possible number of internal nodes in a redblack tree with blackheight k? What is the smallest possible number? Problem 10.2. Pr
School: Sveriges Lantbruksuniversitet
MATH 4673 Dynamical Systems Homework Set 6 Fall 2003 Due Wednesday, 29 October 2003 Course Web Site: http:/www.math.sfu.ca/ralfw/math467/ Problems from Strogatz Nonlinear Dynamics and Chaos: Section 5.1: 5.1.9, 5.1.10(a,c,e), 5.1.11(a,c,e) Secti
School: Sveriges Lantbruksuniversitet
Knowledge Representation and Reasoning Ronald J. Brachman AT&T Labs Research Florham Park, New Jersey USA 07932 rjb@research.att.com Hector J. Levesque Department of Computer Science University of Toronto Toronto, Ontario Canada M5S 3H5 hector@cs.to
School: Sveriges Lantbruksuniversitet
Solutions 2 3.4.11 (Page 83) Part a) Fixed points are integral multiples of . Vector Field 2 0 2 Part b) When r > 1, the absolute value of x is always greater than the absolute value of sin x unless x = 0, which is the only xed point. The de
School: Sveriges Lantbruksuniversitet
<?xml version="1.0" encoding="UTF8"?> <Error><Code>NoSuchKey</Code><Message>The specified key does not exist.</Message><Key>06d4fe56aa46915d14935d691c2a5b438f2ae2dd.txt</Key><RequestId>D36800DFD7B735C5</RequestId><HostId>8O0ucj7n4ESdFKn/LyLr66uUSMjG
School: Sveriges Lantbruksuniversitet
Solutions 5 8.7.1 (Page 295) Note that 1 r(1r 2 ) = 1 r  1 2(1+r)  1 2(1r) . Now r1 r0 dr r1 1 1 + r1 1 1  r1 = log  log  log 2) r(1  r r0 2 1 + r0 2 1  r0 = 2 r 2 (1  r0 ) 1 log 1 2 2 2 r0 (1 + r1 ) = 2, 2 2 2 2 2 and therefore
School: Sveriges Lantbruksuniversitet
MATH 4673 Dynamical Systems Homework Set 3 Winter 2003 Due Friday, 31 January 2003 Course Web Site: http:/www.math.sfu.ca/ralfw/math467/ Homework Problems: One and twoparameter bifurcations of xed points From the textbook by Strogatz: 3.2.5, 3.
School: Sveriges Lantbruksuniversitet
CMPT 471: ASSIGNMENT 2 CHECK ASSIGNMENT PAGE FOR DUE DATES PROBLEM 1: 45 Points Write a script which will determine and save to a file the IP address and Ethernet address of each of the available workstations on network 172.16.1.0. To determine the
School: Sveriges Lantbruksuniversitet
CMPT 471: ASSIGNMENT 4 CHECK ASSIGNMENT PAGE FOR DUE DATES OF ASSIGNMENT 4 PROBLEM 1: (50 points total: 35 points for the completeness and quality of your analysis of the captured packets. 5 points for your capture file as submitted to the submission
School: Sveriges Lantbruksuniversitet
MATH 4673 Dynamical Systems Homework Set 1 Fall 2003 Due Wednesday, 17 September 2003 Course Web Site: http:/www.math.sfu.ca/ralfw/math467/ Problems from Strogatz "Nonlinear Dynamics and Chaos": Section 2.2: 2.2.7, 2.2.8, 2.2.10, 2.2.13 Section
School: Sveriges Lantbruksuniversitet
MATH 4673 Dynamical Systems Homework Set 10 Fall 2003 Due Thursday, 4 December 2003 Course Web Site: http:/www.math.sfu.ca/ralfw/math467/ Problems from Strogatz Nonlinear Dynamics and Chaos, to hand in by the beginning of the poster session on Dec
School: Sveriges Lantbruksuniversitet
CMPT471 083 Assignment 2 Due on October 10, by the end of class (11:20) Problem 1 (5 points) Write a shell script to: 1 1. Capture an ICMP destination unreachable message from one of the four networks 172.x.0.0/16 and show the captured message.
School: Sveriges Lantbruksuniversitet
CMPT 471: ASSIGNMENT 3 CHECK ASSIGNMENT PAGE FOR DUE DATE OF ASSIGNMENT 3 PROBLEM 1: (15 points) In class we discussed the operation of DHCPv4. We have also discussed the new version of IP (IPv6). There is a new version of the DHCP protocol (DHCPv6)
School: Sveriges Lantbruksuniversitet
Homework #3: CMPT413 Reading: NLTK Tutorial Chp 4; http:/nltk.org/doc/en/tag.html; Distributed on Feb 18; due on Mar 3 Anoop Sarkar anoop@cs.sfu.ca Only submit answers for questions marked with . For the questions marked with a ; choose one of the
School: Sveriges Lantbruksuniversitet
Problem Set #1 Economics 808: Macroeconomic Theory Fall 2004 1 The CobbDouglas production function Suppose that the world is described by the Solow model, and that the production function is: F (K, L) = AK L1 where 0 < < 1. As you will see in y
School: Sveriges Lantbruksuniversitet
MATH 4673 Dynamical Systems Homework Set 7 Fall 2003 Due Wednesday, 5 November 2003 Course Web Site: http:/www.math.sfu.ca/ralfw/math467/ Problems from Strogatz "Nonlinear Dynamics and Chaos": Section 6.1: 6.1.5 (also check your results by using
School: Sveriges Lantbruksuniversitet
MATH 4673 Dynamical Systems Homework Set 8 Fall 2003 Due Wednesday, 12 November 2003 Course Web Site: http:/www.math.sfu.ca/ralfw/math467/ Problems from Strogatz "Nonlinear Dynamics and Chaos": Section 6.3: 6.3.13 Section 6.5: 6.5.6 (epidemics a
School: Sveriges Lantbruksuniversitet
MATH 4673 Dynamical Systems Homework Set 5 Fall 2003 Due Monday, 20 October 2003 at the beginning of class (before the Midterm) Course Web Site: http:/www.math.sfu.ca/ralfw/math467/ Problems from Strogatz Nonlinear Dynamics and Chaos: Section 4.3
School: Sveriges Lantbruksuniversitet
MATH 4673 Dynamical Systems Homework Set 9 Fall 2003 Due Monday, 24 November 2003 Course Web Site: http:/www.math.sfu.ca/ralfw/math467/ Problems from Strogatz Nonlinear Dynamics and Chaos; you do not need to hand in problems in (parentheses), but
School: Sveriges Lantbruksuniversitet
MATH 4673 Dynamical Systems Homework Set 3 Fall 2003 Due Wednesday, 1 October 2003 Course Web Site: http:/www.math.sfu.ca/ralfw/math467/ Homework Problems: One and twoparameter bifurcations of xed points Problems from Strogatz Nonlinear Dynamics
School: Sveriges Lantbruksuniversitet
Homework Assignment 2, Fall 2007 Due date: Oct 16, 2007 1. Consider the sequences v = T ACGGGT AT and w = GGACGT ACG. Assume that the match premium is +1 whereas mismatches and indels count as 1. Fill out the dynamic programming table for a global
School: Sveriges Lantbruksuniversitet
Homework #4: CMPT413 Reading: NLTK Tutorial Chp 7 and 8; http:/nltk.org/doc/en/{chunk,parse}.html; Distributed on Mar 3; due on Mar 17 Anoop Sarkar anoop@cs.sfu.ca Only submit answers for questions marked with . (1) Once we have some text that has
School: Sveriges Lantbruksuniversitet
Wireshark Lab: DNS Version: 2.0 2007 J.F. Kurose, K.W. Ross. All Rights Reserved Computer Networking: A Topth down Approach, 4 edition. As described in Section 2.5 of the textbook, the Domain Name System (DNS) translates hostnames to IP addresses
School: Sveriges Lantbruksuniversitet
CMPT125D2: Lab Exercises 2 May 23 Topics String Class Random Class Math Class Wrapper Classes Lab Exercises Working with Strings Rolling Dice Computing Distance Experimenting with the Integer Class The following source code files can be download
School: Sveriges Lantbruksuniversitet
Polymorphism and Recursion Lab Exercises Topics Recursion on Strings Lab Exercises Painting Shapes Palindromes Putting a String Backwards Polymorphism via Inheritance 1 Painting Shapes In this lab exercise you will develop a class hierarchy of sh
School: Sveriges Lantbruksuniversitet
Chapter 6: ObjectOriented Design Lab Exercises Topics Parameter Passing Method Decomposition Overloading Static Variables and Methods Lab Exercises Changing People A Modified MiniQuiz Class A Flexible Account Class Opening and Closing Accounts Tran
School: Sveriges Lantbruksuniversitet
Chapter 5: Conditionals and Loops Lab 3 Exercises Topics The if/ifelse statement The while statement The do statement The for statement Lab Exercises Rock, Paper, Scissors A Guessing Game More Guessing Counting Characters Chapter 5: Conditionals a
School: Sveriges Lantbruksuniversitet
BISC 367W Plant Physiology Laboratory Plant Water Relations 1 SFU We will examine the effects of various environmental stresses on water relations. During this lab you will: a. Learn how to measure the water potential of herbaceous and woody plant
School: Sveriges Lantbruksuniversitet
LINGUISTICS 401 Topics in Phonetics STUDY QUESTIONS FOR THE MIDTERM EXAM (October 17, 2007) A. PHONATION Briefly describe the following phonation types: 1. Voicelessness: (i) nil phonation, (ii) breath phonation 2. Whisper phonation 3. Voiced pho
School: Sveriges Lantbruksuniversitet
LINGUISTICS 220 Introduction to Linguistics STUDY GUIDE FOR THE MIDTERM EXAM (June 15th, 2004) A. LANGUAGE: A PREVIEW 1. Define the concept of language by referring to three of its properties. Briefly describe these properties and illustrate your
Highest Degree Offered  Continuing Professional Programs  Academic and Career Counseling Services  Employment Services for Students  Placement Services for Graduates  Study Abroad 

Unknown  Unknown  Unknown  Unknown  Unknown  Unknown 
Source: National Center for Education Statistics (NCES), Institute of Education Sciences, 20122013
Course Hero, Inc. does not independently verify the accuracy of the information presented above.