BUSINESS CASE
TODAY
Business Case
Something you have to write
Think about how this relates to your project
Weighted Decision Analysis
How to make a decision in a group
BUSINESS CASE
Core idea
Is t
PROJECT TIME
MANAGEMENT
TODAYS AGENDA
Running example
Activitiesdependenciesnetworktimes
Critical path
Adjustments
Activity on Arrow diagrams
Precedence Diagramming
Where do time estimates come fro
PROJECT SCOPE
MANAGEMENT AND WBS
DUE: COMING UP
Due this Friday
DRAFT: Scope Statement and Work Breakdown Structure
Due next Friday
FINAL: Scope Statement and Work Breakdown Structure
PROJECT SCOPE
M
TEAMS
INFORMATICS 151
THE GROUP OVER
TIME
P
Define the Group
s
Recruit Members Assess the State
of the Group Task
Finish the Group
Allocate Roles
Build a Group
History (Archive)
Gain Commitment Histor
PROJECT
MANAGEMENT INTRO
J A N U A RY 1 0 , 2 0 1 8
TODAYS AGENDA
Why Project Management
What is a Project
Projects, programs portfolios
Components of Project Management
Tools and techniques
Ten most
PROJECT MANAGEMENT
INFORMATICS 151
Professor
Alexander Cho,
Ph.D.
WHAT IS THIS ABOUT?
How to advance work in a professional, methodical,
transparent, and communicative way
This will make you shine
Goo
Topics:
The two Brooks articles
No Silver Bullet
The Mythical Man Month
Software Process Models through Lec 5-2
Waterfall Model + (strengths/weaknesses)
Rapid Prototyping and incremental models
R
Informatics 43 - Homework 2
Notes to help understand the following testing matrices.
Here you might want to define certain aspects of your input. For example, you say that all of your Use Case 1 test
Pooch Palace System Requirements
Inf 43 Homework 1
Oct 22, 2017
Ruowan Yang
ID# 74391124
Inf 43, Homework 1
#!1 of 9!
Ruowan Yang
Introduction
Pooch Palace system is a day-to-day operation for a dog c
commit f7d716704253551745cd499fd164ab7281a17f27
Author: Matt Lee <[email protected]>
Date: Wed Jan 20 11:20:39 2016 -0500
Add missing gold config to example.ini
The gold plugin is throwing an error
Your student ID #: _
Circle your discussion start time:
3:00pm
4:00pm
Informatics 43 Fall, 2017 Quiz #6
First (given) name: _ Last (family) name: _
Answer all questions in the Answer Box on the ot
Your student ID #: _
Circle your discussion start time:
3:00pm
4:00pm
Informatics 43 Fall, 2017 Quiz #5
First (given) name: _ Last (family) name: _
1. In white-box testing, edge coverage ensures t
Informatics 43 Spring, 2016 - Homework 2
Student Name:
Awarded Available
Points
Points
10
Definition of the set of all possible inputs.
20
Basis #1, subdomains, and test cases
20
Basis #2, subdomains,
Informatics 43 April 7, 2014
Announcements
1. Discussions did meet on Friday, April 3.
1. Oh no, I missed discussion!?
2. Discussion Again on Friday, April 10
3. Homework 1
2. Thursday: interview with
Informatics 43 June 4, 2015
Being a Software Engineer
Software Engineer
Programmer
Developer
Programming
Network Engineer
Application Engineer
Web Developer
Front End, Back End
Database Administrato
Solutions
Homework 6
1. The longest common substring is the same as the longest common prefix of all the suffixes of
the strings. A node in the suffix tree has children (i.e., is an internal node) whe
Solutions
Homework 8
1. We have that m n2 for all graphs. Thus, log m 2 log n, which implies log m is O(log n).
2. The order given in the problem will work: LA15, LA16, LA22, LA31, LA32, LA126, LA127,
Solutions
Homework 4
1. a. a = 2, b = 2, c = 0, d = 1
O(n)
b. a = 8, b = 2, c = 2, d = 0
O(n3 )
c. a = 16, b = 2, c = 4, d = 4
O(n4 log5 n)
d. a = 7, b = 3, c = 1, d = 0
O(nlog3 7 )
e. a = 9, b = 3, c
Solutions
Homework 1
1. If n0 = 59, then 10n log n < n2 whenever n n0 .
2. If n0 = 20,520, then 10n log n < n n whenever n n0 .
3. The functions below are listed in increasing order, with functions th
Solutions
Homework 9
1. Let P be a polygon where the points are given in clockwise order. Then we simply need to check
that we never make a left turn, and we only switch directions from right to left
Solutions
Homework 2
1. (a) Binary search
(b) There are six positions for f to be placed in. Since all the positions must be represented as
a leaf of the binary tree, there must be at least six leaves
Solutions
Homework 7
1. I think the problem intended the weights all be integers. However, if they are fractions, just
multiply all the weights and the capacity by the least common multiple of the den
Solutions
Homework 5
1. In the worst case every key will be mapped to the same place in the
P array. Thus on the kth
insert, we have to move over k 1 times. Thus the algorithm is O( nk=1 k) = O(n2 ).
Informatics 43
LECTURE 7-2
EMILY NAVARRO
Last Time
Many failures are caused by a lack of good
quality assurance (QA) practices
QA = All activities designed to measure and
improve quality in a produc