Csci570 - Study guides, Class notes & Summaries
Looking for the best study guides, study notes and summaries about Csci570? On this page you'll find 4 study documents about Csci570.
All 4 results
Sort by
-
CSCI570 UPDATED Exam Questions and CORRECT Answers
- Exam (elaborations) • 30 pages • 2024
-
- $8.99
- + learn more
What is the problem def of the stable matching problem? What are its inputs and 
outputs?How do we match n men with n women so that they stay together ever after? 
Input: preference lists for a set of n men and n women 
Output: a set of n marriages (ordered pairs)with no instabilities (perfect matching) 
What are the four steps we go through when studying a problem?1) Come up with a 
concise problem statement 
2) Present a solution 
3) Prove the correctness of your solution 
4) Analyze its per...
-
CSCI570 TOP Study Guide Exam Questions and CORRECT Answers
- Exam (elaborations) • 19 pages • 2024
-
- $8.99
- + learn more
What is the complexity of multiplication?n^2 
What does it mean for a function f(n) = O(g(n))?g(n) will grow asymptotically larger 
than f(n) 
f(n) is big O of g(n) 
What does an algorithm of runtime log n mean?the max runtime is proportional to the 
logarithm of n 
Is log n slower or faster than n?always slower
-
CSCI570 Certification Exam Questions and CORRECT Answers
- Exam (elaborations) • 6 pages • 2024
-
- $7.99
- + learn more
If we multiply the same positive number to the capacity of every directed edge, then the 
minimum cut (but not its value) remains unchanged. - True 
If we multiply all capacities by a constant c, then the max-flow of the graph will by 
multiplied by c. - True 
The edge with minimum capacity will always appear in the minimum cut. - True 
In a flow network, if maximum flow is unique then min cut must also be unique. - False 
A flow network with unique edge capacities may have several min cuts. -...
-
CSCI570
- Exam (elaborations) • 14 pages • 2024
-
- $13.49
- + learn more
Accounting method - computes the individual cost of each operation, assign different 
charges to each operation 
- AC is the amount we charge an operation 
Adjacency List - a representation of a graph in which each node has a list of nodes that 
are adjacent to it, i.e. connected to it by an arc. 
- used for sparse graphs, E=O(V) 
Adjacency Matrix - A matrix which records the number of direct links between vertices 
- can answer if vertices are adjacent in O(1) time, just look up index 
- used...
Fear of missing out? Then don’t!
Do you wonder why so many students wear nice clothes, have money to spare and enjoy tons of free time? Well, they sell on Stuvia! Imagine your study notes being downloaded a dozen times for $15 each. Every. Single. Day. Discover all about earning on Stuvia