Conception of Heroic
Classical, Medieval, Romantic, and Modern
By: Hieu Nguyen
Classical Hero
Performed extraordinary feats (conquering lands)
Noble Character
Half God, Half Mortal
Death must occur in an unusual way
Well born were thought to be heroic
Vir
Trip to Mount Fuji
By: Hieu Nguyen
May 4th, a group of friends (Brett, Bella, Tom, and Jasmine) decided that they
wanted to go on an adventurous vacation. Brett lays out all points that each vacation
suggestion should includes: wilderness and isolated fro
Heroic Information
Classical Hero
Must perform extraordinary feats (conquering lands)
Noble Character
Half Mortal, half God
Death must occur in an unusual way
Fights for his honor
Only the well born can be thought to be heroic
Virtues: courage, pride, hon
/
\ ' Test 2A AP Statistics , Name:
1 R D Directions: Work on these sheets. A standardnormal table is attached.
1 ' .
Part 1: Multiple Choice. Circle the letter corresponding to the best answer.
1. The heights of American men aged 18 to 24 ac approximat
Sec. 2.5 Transformations of Functions
Vertical Shifting shifting up and down
h(x) = f(x) + c, shift the graph f(x) up c units.
h(x) = f(x) c, shift the graph f(x) down c units.
NOTE: The c is added/subtracted to the outside of the function.
Horizontal Shi
Fair Elections Notes
Section 1.1: An Electron Activity
1) Preference Ballot
a) allows voters to rank their choices from first to last
2) Preference Schedule
a) Represents the preferences of one or more individuals
b) Lists preferences from first to last
c
4.2: Critical Paths
1. The Critical Path is the path with the longest time.
a. The least amount of time that it takes to complete all of the tasks in the project
corresponds to the time it takes to complete the longest path (critical path)
2. An Earliest-
4.6: Graph Coloring
1. Coloring the Graph is the process of labeling the vertices of a graph, giving the same
label to events that can happen at the same time.
2. A label is anything that can be used to identify the event/object a vertex represents.
Label
Flow Networks
1
2
Weighted graph where the numbers represent the capacity of flow an edge can handle
Weights determine the maximum flow that can leave a vertex. If more goes to a vertex
3
than can leave the vertex, some of the flow is wasted
The maximum f
Fair Division Notes
2.2 Estate Division
Discrete Division when the objects cannot be meaningfully separated into pieces
Continuous Division when the objects can be meaningfully separated into pieces.
o The pieces can also be separated, hence the term cont
Absolg Value Func'Hons
Tim 6mrk JP y=QlX;k\+k Ckamdqn'SHCS.
(x; Gm? Ros (A WEEK (Ink) Ml E3 Xynmdc in He "at x=k.
.' Thaw F3 V'Skapd. 12+ opens up «>0 M down FF KO.
311%um Miermuedmfk a? y=lxl FF Inkl. ;
I'TLe anpk Is hmwew Whedmfwh 09 y=x FF la|>|.
A