YEAR 12 FURTHER MATHS UNIT 4 MODULE 2 NETWORKS AND DECISION MATHEMATICS CRITICAL PATH ANALYSIS

Size: px
Start display at page:

Download "YEAR 12 FURTHER MATHS UNIT 4 MODULE 2 NETWORKS AND DECISION MATHEMATICS CRITICAL PATH ANALYSIS"

Transcription

1 YEAR 12 FURTHER MATHS UNIT 4 MODULE 2 NETWORKS AND DECISION MATHEMATICS CRITICAL PATH ANALYSIS Directed graphs or digraphs can be used to model situations where an order or direction is implied. For example, in the construction of a building the foundations must be laid before the walls can be erected. Often many activities cannot be started until other activities are completed. Any large scale project consists of many phases. The success of the project depends very much on the quality of the planning, scheduling and controlling of these phases. Example: Drawing Activity Networks from Precedence Tables Activity Immediate (EDGE) predecessor A - B - C D E F G A B B C, D E, F Solution: A and B do not have any predecessors so they form the start and can be done at the same time. Check the precedence table and draw edges for each activity from its predecessor. NOTE: G is not an immediate predecessor of any activity so it is the final edge. Do Ex 15C Page 533 Questions 1 a, b, c

2 Dummy Activities Why have a dummy activity? 1.To avoid multiple arcs between two nodes. Sometimes a list of activities and their predecessors leads to multiple arcs between two particular nodes. It is best to avoid this happening so that you can identify different paths through the network. The solution is to create a dummy or invented activity, used solely to keep the precedence structure and allow unique paths to be seen. Eg. If a project has two activities A and B from the start node that are both predecessors of activity C. The diagram on the left is what we would have with multiple arcs; the diagram on the right is the way it is drawn with a dummy activity. It can be drawn before A or before B. Note: a dummy activity is drawn as a dashed arc and still should have a direction. 2. To avoid logical difficulties. Eg. An activity X, has U and V as predecessors. Another activity Y, has only V as a predecessor. A dummy activity is used to keep the correct logical structure as shown in the diagram below right. Draw X after U, draw Y after V, and to ensure that X cannot start until V has been finished, draw a dotted arrow, indicating a dummy activity, from the end of V to the start of.

3 Do Exercise 15C Page 533 Q1d onwards

4 The Critical path Some activities are more critical than others in the completion of a project. Activities can be delayed if they are not critical. A critical activity is any task that if delayed will also delay the entire project. The critical path is the path that gives the largest total of the weighting. These events must occur on time if the project is not to be held up. It is along the critical path that time on the overall project may be saved. Example: Identify the critical path in this project. Solution: Identify all the paths through the network. The float time (or slack). For each activity that is not on the critical path there will be some slack. Eg. Some activities may be able to start a little later and still not affect the finishing time. Float (or Slack) Time is the amount by which the latest finish time is greater than its earliest start time. Float = LST - EST To find the earliest time of an event occurring. (EST) Add the numbers along the path from the first event. Beside each event a double box is drawn. In the left hand box, enter the earliest event time. Always take the largest value. To find the latest time of an event occurring. (LST) Work backward from the earliest time for the final event, by subtracting the number on the edge. Do Exercise 15D Page 543 All questions

5 Crashing In large projects, once the critical path has been identified, it may be possible to put in extra resources (at extra cost) to reduce the duration of one or more of the critical activities. This will have the effect of reducing the overall project duration, which may result in sufficient cost savings to make the extra resource allocation and cost worthwhile. Reducing the length of (some) critical activities is called crashing. It is along the critical path that reductions in activities reduce the length of the project. The minimum possible time to complete an activity (using maximum resources) is called the crash time. The costs associated with crash time for an activity are called crash costs. NOTE: Sometimes reducing activities along a critical path can produce another new critical path that was not critical before. A simple crashing example: Text Book Page 546

6 Example: a. What is the critical path for this project and the minimum completion time? Also complete the table showing EST and LST. Activity EST LST A B C D E F G H I J

Chapter 6: Activity Planning Part 2

Chapter 6: Activity Planning Part 2 Chapter 6: Activity Planning Part 2 NET481: Project Management Afnan Albahli " Representing Lagged Activities Lag activities: are two activities that will be undertaken in parallel but there is a lag between

More information

SEQUENCING AND SCHEDULING ACTIVITIES

SEQUENCING AND SCHEDULING ACTIVITIES SEQUENCING AND SCHEDULING ACTIVITIES SEQUENCING AND SCHEDULING ACTIVITIES Throughout a project, we will require a schedule that clearly indicates when each of the project s activities is planned to occur

More information

Modelling with linear programming

Modelling with linear programming Modelling with linear programming jla@imm.dtu.dk Informatics and Mathematical Modeling Technical University of Denmark 1 Decision models Real world abstraction Model interpretation A model is a carefully

More information

if i is a predecessor of j, and there i is an immediate predecessor (IP) of j is no other job for which i is a predecessor and j a successor. Then j i

if i is a predecessor of j, and there i is an immediate predecessor (IP) of j is no other job for which i is a predecessor and j a successor. Then j i 8.1 Project management applications Katta G. Murty, IOE 612 Lecture slides 8 Large projects consist of many individual jobs (or activities) with a predecessor ordering among them. Job i is a pre- if j

More information

Construction Planning & scheduling. Precedence Networks. Precedence networks

Construction Planning & scheduling. Precedence Networks. Precedence networks Construction Planning & scheduling Precedence Networks Dr. Maha alkasasbeh are the most common type of network schedule in use today Most scheduling software these days require the user to input the information

More information

Network Optimization Models. Chapter 10: Hillier and Lieberman Chapter 8: Decision Tools for Agribusiness Dr. Hurley s AGB 328 Course

Network Optimization Models. Chapter 10: Hillier and Lieberman Chapter 8: Decision Tools for Agribusiness Dr. Hurley s AGB 328 Course Network Optimization Models Chapter 10: Hillier and Lieberman Chapter 8: Decision Tools for Agribusiness Dr. Hurley s AGB 328 Course Terms to Know Nodes, Arcs, Directed Arc, Undirected Arc, Links, Directed

More information

Dependency Table Example. Task ID Name Predecessors 1 A 2 B 3 C 4 D 1 5 E 1;2 6 F 1;2 7 G 5;6 8 H 4;5

Dependency Table Example. Task ID Name Predecessors 1 A 2 B 3 C 4 D 1 5 E 1;2 6 F 1;2 7 G 5;6 8 H 4;5 Dependency Table Example Task ID Name Predecessors 1 A 2 B 3 C 4 D 1 5 E 1;2 6 F 1;2 7 G 5;6 8 H 4;5 Dependent tasks Dependency Matrix 1 2 3 4 5 6 7 8 9 10 1 x 2 x x 3 x x 4 x 5 x x 6 x 7 x 8 x 9 x x 10

More information

MATHEMATICS (MEI) 4771 Decision Mathematics 1

MATHEMATICS (MEI) 4771 Decision Mathematics 1 ADVANCED SUBSIDIARY GCE MATHEMATICS (MEI) 4771 Decision Mathematics 1 QUESTION PAPER * OCE / 1 3662* Candidates answer on the Printed Answer Book OCR Supplied Materials: Printed Answer Book 4771 MEI Examination

More information

Monday 23 January 2012 Morning

Monday 23 January 2012 Morning Monday 2 January 202 Morning AS GCE MATHEMATICS (MEI) 477 Decision Mathematics QUESTION PAPER *472202* Candidates answer on the Printed Answer Book. OCR supplied materials: Printed Answer Book 477 MEI

More information

Mathematics Success Grade 8

Mathematics Success Grade 8 T616 Mathematics Success Grade 8 [OBJECTIVE] The student will explore angle relationships within triangles. [PREREQUISITE SKILLS] angles, congruency, supplementary angles, adjacent angles [MATERIALS] Student

More information

2.3.5 Project planning

2.3.5 Project planning efinitions:..5 Project planning project consists of a set of m activities with their duration: activity i has duration d i, i = 1,..., m. estimate Some pairs of activities are subject to a precedence constraint:

More information

ADMS 3330 FALL 2008 EXAM All Multiple choice Exam (See Answer Key on last page)

ADMS 3330 FALL 2008 EXAM All Multiple choice Exam (See Answer Key on last page) MULTIPLE CHOICE. Choose the letter corresponding to the one alternative that best completes the statement or answers the question. 1. Which of the following are assumptions or requirements of the transportation

More information

Subtraction Understand Subtraction on a Number Line Using a number line let s demonstrate the subtraction process using the problem 7 5.

Subtraction Understand Subtraction on a Number Line Using a number line let s demonstrate the subtraction process using the problem 7 5. Objective 1 Subtraction Understand Subtraction on a Number Line Using a number line let s demonstrate the subtraction process using the problem 7 5. -7-6 -5-4 -3-2 -1 0 1 2 3 4 5 6 7 Using the number line

More information

CS6704 RESOURCE MANAGEMENT TECHNIQUES TOPIC WISE QUESTION BANK LINEAR PROGRAMMING PROBLEMS 1) What is OR techniques? Where it can be used? 2) What is OR? List out various applications of OR. 3) Explain

More information

5.4 Pure Minimal Cost Flow

5.4 Pure Minimal Cost Flow Pure Minimal Cost Flow Problem. Pure Minimal Cost Flow Networks are especially convenient for modeling because of their simple nonmathematical structure that can be easily portrayed with a graph. This

More information

Key Terms. Writing Algebraic Expressions. Example

Key Terms. Writing Algebraic Expressions. Example Chapter 6 Summary Key Terms variable (6.1) algebraic expression (6.1) evaluate an algebraic expression (6.1) Distributive Property of Multiplication over Addition (6.2) Distributive Property of Multiplication

More information

We can use square dot paper to draw each view (top, front, and sides) of the three dimensional objects:

We can use square dot paper to draw each view (top, front, and sides) of the three dimensional objects: Unit Eight Geometry Name: 8.1 Sketching Views of Objects When a photo of an object is not available, the object may be drawn on triangular dot paper. This is called isometric paper. Isometric means equal

More information

Math for Liberal Arts MAT 110: Chapter 13 Notes

Math for Liberal Arts MAT 110: Chapter 13 Notes Math for Liberal Arts MAT 110: Chapter 13 Notes Graph Theory David J. Gisch Networks and Euler Circuits Network Representation Network: A collection of points or objects that are interconnected in some

More information

Chapter 26 Set up Smart Connect for Search and Store DW 6.10

Chapter 26 Set up Smart Connect for Search and Store DW 6.10 Chapter 26 Set up Smart Connect for Search and Store DW 6.10 The Smart Connect module is designed to have a quick integration to other applications and allow the user to gather information for indexes

More information

Mini-Project 1: The Library of Functions and Piecewise-Defined Functions

Mini-Project 1: The Library of Functions and Piecewise-Defined Functions Name Course Days/Start Time Mini-Project 1: The Library of Functions and Piecewise-Defined Functions Part A: The Library of Functions In your previous math class, you learned to graph equations containing

More information

Lesson 5: Identical Triangles

Lesson 5: Identical Triangles NS COMMON CORE MATHEMATICS CURRICULUM Lesson 5 7 6 Classwork Opening When studying triangles, it is essential to be able to communicate about the parts of a triangle without any confusion. The following

More information

Chapter 11: PERT for Project Planning and Scheduling

Chapter 11: PERT for Project Planning and Scheduling Chapter 11: PERT for Project Planning and Scheduling PERT, the Project Evaluation and Review Technique, is a network-based aid for planning and scheduling the many interrelated tasks in a large and complex

More information

Connect the Dots NEW! Reveal a picture through your skill at working on a coordinate plane.

Connect the Dots NEW! Reveal a picture through your skill at working on a coordinate plane. NEW! Connect the Dots Reveal a picture through your skill at working on a coordinate plane. Typically in a connect-the-dots puzzle, the dots are already given, but not in the National Math Club s version!

More information

Mathematics Success Level E

Mathematics Success Level E T877 [OBJECTIVE] The student will classify two-dimensional figures based on properties. [PREREQUISITE SKILLS] Lesson 29, knowledge of basic geometry terminology including: parallel sides, congruent sides,

More information

Find terms of a sequence and say whether it is ascending or descending, finite or infinite Find the next term in a sequence of numbers or shapes

Find terms of a sequence and say whether it is ascending or descending, finite or infinite Find the next term in a sequence of numbers or shapes 1.1 Sequences Find terms of a sequence and say whether it is ascending or descending, finite or infinite Find the next term in a sequence of numbers or shapes Key words sequence term consecutive infinite

More information

The following notation will be used in the explanations:

The following notation will be used in the explanations: In the following slides some geometry basics will be presented: Finding the center of a circle/arc Construct a circle from three points Finding the min/max distance between a point and circle/arc page

More information

Boxplots. Lecture 17 Section Robb T. Koether. Hampden-Sydney College. Wed, Feb 10, 2010

Boxplots. Lecture 17 Section Robb T. Koether. Hampden-Sydney College. Wed, Feb 10, 2010 Boxplots Lecture 17 Section 5.3.3 Robb T. Koether Hampden-Sydney College Wed, Feb 10, 2010 Robb T. Koether (Hampden-Sydney College) Boxplots Wed, Feb 10, 2010 1 / 34 Outline 1 Boxplots TI-83 Boxplots 2

More information

Lesson #3. Variables, Operators, and Expressions. 3. Variables, Operators and Expressions - Copyright Denis Hamelin - Ryerson University

Lesson #3. Variables, Operators, and Expressions. 3. Variables, Operators and Expressions - Copyright Denis Hamelin - Ryerson University Lesson #3 Variables, Operators, and Expressions Variables We already know the three main types of variables in C: int, char, and double. There is also the float type which is similar to double with only

More information

LECTURES 3 and 4: Flows and Matchings

LECTURES 3 and 4: Flows and Matchings LECTURES 3 and 4: Flows and Matchings 1 Max Flow MAX FLOW (SP). Instance: Directed graph N = (V,A), two nodes s,t V, and capacities on the arcs c : A R +. A flow is a set of numbers on the arcs such that

More information

Simple graph Complete graph K 7. Non- connected graph

Simple graph Complete graph K 7. Non- connected graph A graph G consists of a pair (V; E), where V is the set of vertices and E the set of edges. We write V (G) for the vertices of G and E(G) for the edges of G. If no two edges have the same endpoints we

More information

InDesign Tutorial: Working with InDesign panels. InDesign Tutorial: Working with InDesign panels. The InDesign Tools panel

InDesign Tutorial: Working with InDesign panels. InDesign Tutorial: Working with InDesign panels. The InDesign Tools panel InDesign Tutorial: Working with InDesign panels What you?ll learn in this InDesign Tutorial: The InDesign CS6 Tools Panel Understanding the InDesign CS6 Workspace This tutorial provides you with a foundation

More information

n Given: n set of resources/machines M := {M 1 n satisfies constraints n minimizes objective function n Single-Stage:

n Given: n set of resources/machines M := {M 1 n satisfies constraints n minimizes objective function n Single-Stage: Scheduling Scheduling is the problem of allocating scarce resources to activities over time. [Baker 1974] Typically, planning is deciding what to do, and scheduling is deciding when to do it. Generally,

More information

Chapter 3. Planning and Scheduling. Chapter Objectives. Check off these skills when you feel that you have mastered them.

Chapter 3. Planning and Scheduling. Chapter Objectives. Check off these skills when you feel that you have mastered them. Chapter Objectives Check off these skills when you feel that you have mastered them. State the assumptions for the scheduling model. Compute the lower bound on the completion time for a list of independent

More information

Expressions. Eric McCreath

Expressions. Eric McCreath Expressions Eric McCreath 2 Expressions on integers There is the standard set of interger operators in c. We have: y = 4 + 7; // add y = 7-3; // subtract y = 3 * x; // multiply y = x / 3; // integer divide

More information

Chapter 5snow year.notebook March 15, 2018

Chapter 5snow year.notebook March 15, 2018 Chapter 5: Statistical Reasoning Section 5.1 Exploring Data Measures of central tendency (Mean, Median and Mode) attempt to describe a set of data by identifying the central position within a set of data

More information

Scheduling. Job Shop Scheduling. Example JSP. JSP (cont.)

Scheduling. Job Shop Scheduling. Example JSP. JSP (cont.) Scheduling Scheduling is the problem of allocating scarce resources to activities over time. [Baker 1974] Typically, planning is deciding what to do, and scheduling is deciding when to do it. Generally,

More information

12 Abstract Data Types

12 Abstract Data Types 12 Abstract Data Types 12.1 Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: Define the concept of an abstract data type (ADT). Define

More information

CRITICAL PATH ANALYSIS

CRITICAL PATH ANALYSIS UMMRY H IION MH RIIL PH NLYI he main ideas are covered in efore the exam you should know Q dexcel MI OR When you need to use dummy activities. he main ideas in this topic are rawing ctivity or Precedence

More information

How to Do Word Problems. Building the Foundation

How to Do Word Problems. Building the Foundation Building the Foundation The notion that Mathematics is a language, is held by many mathematicians and is being expressed on frequent occasions. Mathematics is the language of science. It is unique among

More information

M. Yamuna* et al. /International Journal of Pharmacy & Technology

M. Yamuna* et al. /International Journal of Pharmacy & Technology ISSN: 0975-766X CODEN: IJPTFI Available Online through Research Article www.ijptonline.com FINDING CRITICAL PATH OF A NETWORK USING MODIFIED DIJKSTRA S ALGORITHM Shantan Sawa, Shivangee Sabharwal, Purushottam

More information

SUGGESTED SOLUTION CA FINAL MAY 2017 EXAM

SUGGESTED SOLUTION CA FINAL MAY 2017 EXAM SUGGESTED SOLUTION CA FINAL MAY 2017 EXAM ADVANCED MANAGEMENT ACCOUNTING Test Code - F M J 4 0 1 6 BRANCH - (MULTIPLE) (Date : 11.02.2017) Head Office : Shraddha, 3 rd Floor, Near Chinai College, Andheri

More information

Midterm II CS164, Spring 2006

Midterm II CS164, Spring 2006 Midterm II CS164, Spring 2006 April 11, 2006 Please read all instructions (including these) carefully. Write your name, login, SID, and circle the section time. There are 10 pages in this exam and 4 questions,

More information

MATHEMATICS (MEI) 4771 Decision Mathematics 1

MATHEMATICS (MEI) 4771 Decision Mathematics 1 DVNCED SUSIDIRY GCE MTHEMTICS (MEI) 4771 Decision Mathematics 1 *OCE/T67883* Candidates answer on the nswer ooklet OCR Supplied Materials: Printed nswer ook MEI Examination Formulae and Tables (MF2) Other

More information

MICROSOFT PROJECT 2010 EXERCISE

MICROSOFT PROJECT 2010 EXERCISE MICROSOFT PROJECT 2010 EXERCISE Copyright 2011 University of Warwick MICROSOFT PROJECT 2010 EXERCISE Introduction In MS Project there are typically several possible ways to do each desired action. This

More information

Industrial Engineering and Ergonomics

Industrial Engineering and Ergonomics Industrial Engineering and Ergonomics Exercise Unit 2 Work organization Fall Winter 207/208 Dr.-Ing. Dr. rer. medic. Dipl.-Inform. Alexander Mertens Chair and Institute of Industrial Engineering and Ergonomics

More information

Learning Log Title: CHAPTER 3: ARITHMETIC PROPERTIES. Date: Lesson: Chapter 3: Arithmetic Properties

Learning Log Title: CHAPTER 3: ARITHMETIC PROPERTIES. Date: Lesson: Chapter 3: Arithmetic Properties Chapter 3: Arithmetic Properties CHAPTER 3: ARITHMETIC PROPERTIES Date: Lesson: Learning Log Title: Date: Lesson: Learning Log Title: Chapter 3: Arithmetic Properties Date: Lesson: Learning Log Title:

More information

Chapter 4 Answers. Lesson 4.1. Chapter 4 Answers 1

Chapter 4 Answers. Lesson 4.1. Chapter 4 Answers 1 Chapter 4 Answers Lesson 4.1 1. 2. 3. 4. Chapter 4 Answers 1 5. Answers vary. Sample answer: a. A: 2, none; B: 4, A; C: 3, B; D: 7, C; E: 5, A; F: 10, E; G: 8, A; H: 3, A; I: 4, D, F, G, and H b. c. In

More information

Introduction to AutoCAD 2010

Introduction to AutoCAD 2010 Page 1 Introduction to AutoCAD 2010 Alf Yarwood Chapter 2 Exercise 1 1. Open AutoCAD 2010 - either with a double-click on its start-up icon in the Windows desktop, or by using the method on the computer

More information

PENTAGON FUZZY NUMBER AND ITS APPLICATION TO FIND FUZZY CRITICAL PATH

PENTAGON FUZZY NUMBER AND ITS APPLICATION TO FIND FUZZY CRITICAL PATH Volume 114 No. 5 017, 183-185 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu PENTAGON FUZZY NUMBER AND ITS APPLICATION TO FIND FUZZY CRITICAL PATH SyedaNaziyaIkram

More information

1 Introduction. 1.1 Clicking on any orange box shows the login window. Seatrack Web last updated

1 Introduction. 1.1 Clicking on any orange box shows the login window. Seatrack Web last updated Seatrack Web last updated 2016-11-07 1 Introduction Below follow simple screenshots of what to expect when selecting the orange boxes. This is the start page for Seatrack Web located at https://stw-helcom.fcoo.dk/.

More information

MATH 353 Engineering mathematics III

MATH 353 Engineering mathematics III MATH 353 Engineering mathematics III Instructor: Francisco-Javier Pancho Sayas Spring 2014 University of Delaware Instructor: Francisco-Javier Pancho Sayas MATH 353 1 / 20 MEET YOUR COMPUTER Instructor:

More information

Class Notes, 3/21/07, Operating Systems

Class Notes, 3/21/07, Operating Systems Class Notes, 3/21/07, Operating Systems Hi, Jane. Thanks again for covering the class. One of the main techniques the students need to how to recognize when there is a cycle in a directed graph. (Not all

More information

Baseline Scheduling with ProTrack

Baseline Scheduling with ProTrack Baseline Scheduling with ProTrack 1.0 (last update: 11/11/08) 1 Baseline Scheduling with ProTrack by Mario Vanhoucke Professor at Ghent University and Vlerick Leuven Gent Management School (Belgium) Partner

More information

ENGR (Socolofsky) Week 02 Python scripts

ENGR (Socolofsky) Week 02 Python scripts ENGR 102-213 (Socolofsky) Week 02 Python scripts Listing for script.py 1 # data_types.py 2 # 3 # Lecture examples of using various Python data types and string formatting 4 # 5 # ENGR 102-213 6 # Scott

More information

TTS Scratch Controller. Teacher Guide. 1 TTS Scratch Controller - Teacher Guide. Product Code: EL00530

TTS Scratch Controller. Teacher Guide.  1 TTS Scratch Controller - Teacher Guide. Product Code: EL00530 1 TTS Scratch Controller - Teacher Guide Product Code: EL00530 TTS Scratch Controller Teacher Guide www.tts-shopping.com 2 TTS Scratch Controller - Teacher Guide TTS Scratch Controller Using the Scratch

More information

The Algorithm Design by using programming language Visual Basic for Application on the example of Crithical Path Method (CPM)

The Algorithm Design by using programming language Visual Basic for Application on the example of Crithical Path Method (CPM) The Algorithm Design by using programming language Visual Basic for Application on the example of Crithical Path Method (CPM) Slavomir Vukmirović Economics Faculty University of Rijeka, Croatia vukmirovics@gmail.com,

More information

Graph and Digraph Glossary

Graph and Digraph Glossary 1 of 15 31.1.2004 14:45 Graph and Digraph Glossary A B C D E F G H I-J K L M N O P-Q R S T U V W-Z Acyclic Graph A graph is acyclic if it contains no cycles. Adjacency Matrix A 0-1 square matrix whose

More information

Assessment of Programming Skills of First Year CS Students: Problem Set

Assessment of Programming Skills of First Year CS Students: Problem Set Assessment of Programming Skills of First Year CS Students: Problem Set Notes to the working group participants. Enclosed in this file are the three problems. They are in ascending order of difficulty.

More information

Name Course Days/Start Time

Name Course Days/Start Time Name Course Days/Start Time Mini-Project : The Library of Functions In your previous math class, you learned to graph equations containing two variables by finding and plotting points. In this class, we

More information

A Theory of Parallel Computation The π-calculus

A Theory of Parallel Computation The π-calculus A Theory of Parallel Computation The π-calculus Background DFAs, NFAs, pushdown automata, Turing machines... All are mathematical entities that model computation. These abstract systems have concrete,

More information

Lab 7 - Toaster Oven Commit ID Form:

Lab 7 - Toaster Oven Commit ID Form: UNIVERSITY OF CALIFORNIA, SANTA CRUZ BOARD OF STUDIES IN COMPUTER ENGINEERING CMPE-13/L: COMPUTER SYSTEMS AND C PROGRAMMING Lab 7 - Toaster Oven Commit ID Form: http://goo.gl/forms/d2lo0jqhcr Introduction

More information

Unit 7 Day 1. Task Graphs and Critical Paths

Unit 7 Day 1. Task Graphs and Critical Paths Unit 7 Day 1 Task Graphs and ritical Paths Remember that ollege Tour ctivity is due at the beginning of class tomorrow!! Notes Day 1 Task Graphs and ritical Paths GRPH PPLITIONS How does a building contractor

More information

Object Behaviours UML Statecharts

Object Behaviours UML Statecharts Object Behaviours UML Statecharts Software Requirements and Design CITS 4401 Lecture 5 Based on Ch 5 Lecture Notes by Bruegge & Dutoit Finite state machine flip switch on light off light on flip switch

More information

Image Formation and the Lens: Object Beyond The Focal Point

Image Formation and the Lens: Object Beyond The Focal Point Image Formation and the Lens: Object Beyond The Focal Point A convex lens is shown below with its focal points displayed (the dots). An object is located to the left of and at a distance of 2f to the lens.

More information

Introduction to Networks

Introduction to Networks LESSON 1 Introduction to Networks Exploratory Challenge 1 One classic math puzzle is the Seven Bridges of Königsberg problem which laid the foundation for networks and graph theory. In the 18th century

More information

Primal Simplex Algorithm for the Pure Minimal Cost Flow Problem

Primal Simplex Algorithm for the Pure Minimal Cost Flow Problem Primal Simplex Algorithm for the Pure Minimal Cost Flow Problem Algorithm This section describes the adaptation of the primal simplex algorithm for solving a pure network flow program; that is, the problem

More information

An Introduction to Graph Theory

An Introduction to Graph Theory An Introduction to Graph Theory CIS008-2 Logic and Foundations of Mathematics David Goodwin david.goodwin@perisic.com 12:00, Friday 17 th February 2012 Outline 1 Graphs 2 Paths and cycles 3 Graphs and

More information

AutoCAD 2D I. Module 15. Trimming and Extending. IAT Curriculum Unit PREPARED BY. January 2011

AutoCAD 2D I. Module 15. Trimming and Extending. IAT Curriculum Unit PREPARED BY. January 2011 AutoCAD 2D I Trimming and Extending PREPARED BY IAT Curriculum Unit January 2011 Institute of Applied Technology, 2011 Auto CAD Self-paced Learning Modules AutoCAD 2D Trimming and Extending Learning Outcomes:

More information

may be sent to:

may be sent to: B A S I C M A T H A Self-Tutorial by Luis Anthony Ast Professional Mathematics Tutor LESSON 1: NUMBERS Copyright 2005 All rights reserved. No part of this publication may be reproduced or transmitted in

More information

Use of Technology. Perform statistical computations on stored data or entered statistics.

Use of Technology. Perform statistical computations on stored data or entered statistics. Chapter 1 Introduction Use of Technology Statistics is a field that deals with sets of data. After the data is collected, it needs to be organized and interpreted. There is a limit to how much of the work

More information

2.8 An application of Dynamic Programming to machine renewal

2.8 An application of Dynamic Programming to machine renewal ex-.6-. Foundations of Operations Research Prof. E. Amaldi.6 Shortest paths with nonnegative costs Given the following directed graph, find a set of shortest paths from node to all the other nodes, using

More information

Intro to Contemporary Math

Intro to Contemporary Math Intro to Contemporary Math Conditional Probability Intro Department of Mathematics UK Announcement You have a homework assignment due next Monday. Sequences of Experiments Suppose two experiments are performed,

More information

Australian Journal of Basic and Applied Sciences. Meeting the Desired Fuzzy Shortest Possible Duration to Complete the Project at Fuzzy Least Cost

Australian Journal of Basic and Applied Sciences. Meeting the Desired Fuzzy Shortest Possible Duration to Complete the Project at Fuzzy Least Cost Australian Journal of Basic and Applied Sciences, 9(23) July 2, Pages: 36-43 ISSN:99-878 Australian Journal of Basic and Applied Sciences Journal home page: www.ajbasweb.com Meeting the Desired Shortest

More information

Computational Modelling 102 (Scientific Programming) Tutorials

Computational Modelling 102 (Scientific Programming) Tutorials COMO 102 : Scientific Programming, Tutorials 2003 1 Computational Modelling 102 (Scientific Programming) Tutorials Dr J. D. Enlow Last modified August 18, 2003. Contents Tutorial 1 : Introduction 3 Tutorial

More information

CSE 333 Midterm Exam 7/29/13

CSE 333 Midterm Exam 7/29/13 Name There are 5 questions worth a total of 100 points. Please budget your time so you get to all of the questions. Keep your answers brief and to the point. The exam is closed book, closed notes, closed

More information

Graphs Definitions. Gunnar Gotshalks. GraphDefinitions 1

Graphs Definitions. Gunnar Gotshalks. GraphDefinitions 1 Graphs Definitions GraphDefinitions 1 Examples of Graphs Street maps» Vertices are the intersections» Edges are the streets Power line network» Vertices are the houses & power stations» Edges are the power

More information

Fireplace Mantel in Google SketchUp

Fireplace Mantel in Google SketchUp Creating the fireplace itself is quite easy: it s just a box with a hole. But creating the mantel around the top requires the fun-to-use Follow Me tool. This project was created in SketchUp 8, but will

More information

Use the Associative Property of Multiplication to find the product.

Use the Associative Property of Multiplication to find the product. 3-1 1. The Associative Property of Multiplication states factors can be grouped differently and the product remains the same. Changing the grouping of the factors changes the factors that are multiplied

More information

8 Optimisation. 8.1 Introduction to Optimisation

8 Optimisation. 8.1 Introduction to Optimisation 8 8.1 Introduction to 8.1 Introduction refers to compiler strategies which result in generated object code which is more efficient, either in terms of speed or memory use. can be performed in two locations:

More information

Subprime Fibonacci sequences

Subprime Fibonacci sequences CS 7A - Spring 2015 - Richard Guy s Sub-Fibonacci Sequence. Due 5/21/15 Subprime Fibonacci sequences 0.1 Background Theory Start like the Fibonacci sequence 0, 1, 1, 2, 3, 5,..., but before you write down

More information

Fundamentals of Operations Research. Prof. G. Srinivasan. Department of Management Studies. Indian Institute of Technology Madras.

Fundamentals of Operations Research. Prof. G. Srinivasan. Department of Management Studies. Indian Institute of Technology Madras. Fundamentals of Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras Lecture No # 06 Simplex Algorithm Initialization and Iteration (Refer Slide

More information

Course Learning Outcomes for Unit I. Reading Assignment. Unit Lesson. UNIT I STUDY GUIDE Number Theory and the Real Number System

Course Learning Outcomes for Unit I. Reading Assignment. Unit Lesson. UNIT I STUDY GUIDE Number Theory and the Real Number System UNIT I STUDY GUIDE Number Theory and the Real Number System Course Learning Outcomes for Unit I Upon completion of this unit, students should be able to: 2. Relate number theory, integer computation, and

More information

STATISTICAL TECHNIQUES. Interpreting Basic Statistical Values

STATISTICAL TECHNIQUES. Interpreting Basic Statistical Values STATISTICAL TECHNIQUES Interpreting Basic Statistical Values INTERPRETING BASIC STATISTICAL VALUES Sample representative How would one represent the average or typical piece of information from a given

More information

Graphs of Increasing Exponential Functions

Graphs of Increasing Exponential Functions Section 5 2A: Graphs of Increasing Exponential Functions We want to determine what the graph of an exponential function y = a x looks like for all values of a > We will select a value of a > and examine

More information

Mini-Project 1: The Library of Functions and Piecewise-Defined Functions

Mini-Project 1: The Library of Functions and Piecewise-Defined Functions Name Course Days/Start Time Mini-Project 1: The Library of Functions and Piecewise-Defined Functions Part 2: Piecewise-Defined Functions A piecewise-defined function is two or more functions combined into

More information

Table of Contents. 1. Creating a Microsoft Excel Workbook...1 EVALUATION COPY

Table of Contents. 1. Creating a Microsoft Excel Workbook...1 EVALUATION COPY Table of Contents Table of Contents 1. Creating a Microsoft Excel Workbook...1 Starting Microsoft Excel...1 Creating a Workbook...2 Saving a Workbook...3 The Status Bar...5 Adding and Deleting Worksheets...6

More information

Graphs of Increasing Exponential Functions

Graphs of Increasing Exponential Functions Section 5 2A: Graphs of Increasing Exponential Functions We want to determine what the graph of an exponential function y = a x looks like for all values of a > We will select a value of a > and examine

More information

MatDeck tips. Basic. :=- assignment of variable values; assign value to variable a with code a := value

MatDeck tips. Basic. :=- assignment of variable values; assign value to variable a with code a := value MatDeck tips Basic :=- assignment of variable values; assign value to variable a with code a := value = - displaying variable value; display value stored in the variable a with code a = Alt continue with

More information

if you have anything on the screen you can clear it by pressing: CLEAR

if you have anything on the screen you can clear it by pressing: CLEAR Graphing Calculators are really very powerful hand held computing devices. The allow mathematics problems to be investigated by those whose learning styles range from the symbolic to the visual to the

More information

Mathematics for Business and Economics - I. Chapter7 Linear Inequality Systems and Linear Programming (Lecture11)

Mathematics for Business and Economics - I. Chapter7 Linear Inequality Systems and Linear Programming (Lecture11) Mathematics for Business and Economics - I Chapter7 Linear Inequality Systems and Linear Programming (Lecture11) A linear inequality in two variables is an inequality that can be written in the form Ax

More information

Mathematics Concepts 2 Exam 1 Version 4 21 September 2018

Mathematics Concepts 2 Exam 1 Version 4 21 September 2018 Mathematics Concepts 2 Exam 1 Version 4 21 September 2018 Name: Permissible Aides: The small ruler distributed by the proctor Prohibited: Class Notes Class Handouts Study Guides and Materials The Book

More information

Decision Mathematics D1 Advanced/Advanced Subsidiary. Friday 17 May 2013 Morning Time: 1 hour 30 minutes

Decision Mathematics D1 Advanced/Advanced Subsidiary. Friday 17 May 2013 Morning Time: 1 hour 30 minutes Paper Reference(s) 6689/01R Edexcel GCE ecision Mathematics 1 Advanced/Advanced Subsidiary Friday 17 May 2013 Morning Time: 1 hour 30 minutes Materials required for examination Nil Items included with

More information

Project Management. Week 5 Microsoft Project 2007 Tutorial

Project Management. Week 5 Microsoft Project 2007 Tutorial Project Management Week 5 Microsoft Project 2007 Tutorial Project Activities ID TASK NAME DURATION PREDECESSORS 1 A1 CLIENT WORKSHOP 10-2 A2 CASE MODEL 15 1 3 A3 USER REVIEW 10 2 4 B1 Db DEFINITION 10

More information

ECE 2030D Computer Engineering Spring problems, 5 pages Exam Two 8 March 2012

ECE 2030D Computer Engineering Spring problems, 5 pages Exam Two 8 March 2012 Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate

More information

Introduction p. 1 Java Features p. 2 Java Expansion p. 4 Getting, Setting Up, and Using Java p. 5 The Java Language p. 5 Java Swing Components p.

Introduction p. 1 Java Features p. 2 Java Expansion p. 4 Getting, Setting Up, and Using Java p. 5 The Java Language p. 5 Java Swing Components p. Introduction p. 1 Java Features p. 2 Java Expansion p. 4 Getting, Setting Up, and Using Java p. 5 The Java Language p. 5 Java Swing Components p. 6 Components, Containers, and Layour Management p. 6 Checkboxes,

More information

Practical 2: Ray Tracing

Practical 2: Ray Tracing 2017/2018, 4th quarter INFOGR: Graphics Practical 2: Ray Tracing Author: Jacco Bikker The assignment: The purpose of this assignment is to create a small Whitted-style ray tracer. The renderer should be

More information

Examples of Tasks from Course 1, Unit 4

Examples of Tasks from Course 1, Unit 4 Examples of Tasks from Course 1, Unit 4 What Solutions are Available? Lesson 1: page 258, Modeling Task 1; page 260, Modeling Task 4; page 261, Organizing Task 1; page 271, Modeling Task 2; page 272, Modeling

More information

4 Operations On Data 4.1. Foundations of Computer Science Cengage Learning

4 Operations On Data 4.1. Foundations of Computer Science Cengage Learning 4 Operations On Data 4.1 Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: List the three categories of operations performed on data.

More information

PLAY VIDEO. 2. Select Cell Library File menu > New item to display the Create Cell Library dialog.

PLAY VIDEO. 2. Select Cell Library File menu > New item to display the Create Cell Library dialog. Chapter 12 Cells PLAY VIDEO INTRODUCTION A cell is a group of elements combined into one complex element and stored in a cell library or in your design file as a shared cell. Any cell can be easily recalled

More information

Adjusting the Schedule

Adjusting the Schedule L E S S O N 3 Adjusting the Schedule Suggested lesson time 45-55 minutes Lesson objectives To be able to manage future tasks, you will: a b Adjust future tasks. You will adjust future tasks by changing

More information