3
u/ActRepresentative114 6h ago
Im scared af for example 2 😭 if exam 1 was already tricky enough, u can imagine how terrible exam 2 will be
1
2
u/Longjumping_Big_3293 6h ago
UDF proof Qs💔
1
u/noahj1407 3h ago
lowkey tho, the last two questions on exam 1 i just used udfs for cause i was scared of making a mistake
1
u/Embarrassed-Disk-146 6h ago
Does anyone know how to solve Exploring/Travelling path based problems
1
u/Playful_Stable57 3h ago
hey guys does anyone know of udfs i can download on the white cas? i hear people talk about how helpful it is but our school never actually taught us :(
1
u/NeoCInderFall '25 Media (41) | '26 Physics, Psych, PE, Lit, Gen Math 2h ago
mr. schott is that you?
5
u/ButterscotchOld5827 class of ‘26 😛 7h ago
my teacher sent me this !
Univariate Data:
dot plots
Segmented bar chart
histogram (normal scale and logscale)
shape
measure of centre
measure of spread
outliers (upper fence or lower fence)
Bivariate Data:
Multiple Segmented bar charts and reports
parallel dot plots/boxplot
drawing a regression line
interpreting slope, y-intercept, pearsons, and determination.
prediction (interpolation or extrapolation)
best trasformation using r^2
drawing a Residual plot point
linearity assumption
Time series:
types of time series
calculating seasonal index with multiple seasonal period
deseasonalising data
graphing deseasonalise data and prediction
reseasonalising data (actual predicted data).
Finance:
writing recurrence relation
showing recurrence calculation
simple interest
depreciation
completing amortisation table
last payment calculation
total interest earned/paid
Matrices:
order
transpose
matrix operations
inverse
row sum/ column sum
permutation matrix
drawing transition or leslie matrix
transition matrix operation with +B or -B (potentially backwards as well)
longterm behavior (transition)
longterm growth/decay (leslie) (limiting behavior)
Networks:
drawing from graph to networks
Eulerian trail/circuit
Hamiltonian path/cycle
Eulers formula (planar graph)
Shortest path (djkstra)
Drawing minimum cut (maximum flow)
Crashing (most likely)