Download Theoretical Algorithms - Efficient Algorithms and Intractable Problems - Exams and more Exams Algorithms and Programming in PDF only on Docsity!
UC Berkeley—CS 170 Midterm 1 Lecturer: Satish Rao March 10
Midterm 1 for CS 170
Print your name:
(last) (first)
Sign your name:
Write your section number (e.g., 101):
Write your SID:
One page of notes is permitted. No electronic devices, e.g. cell phones and calculators, are permitted. Do all your work on the pages of this examination. If you need more space, you may use the reverse side of the page, but try to use the reverse of the same page where the problem is stated.
You have 80 minutes. The questions are of varying difficulty, so avoid spending too long on any one question.
In all algorithm design problems, you may use high-level pseudocode.
DO NOT TURN THE PAGE UNTIL YOU ARE TOLD TO DO SO.
Problem Score/Points Name/Section/etc. / 1 / 2 / 3 / 4 / 5 / Total /
1. True/False. No need to justify your answer. [2 points per problem]
Answer true or false for each. Scoring is 2 points for correct answer and -2 points for incorrect.
- 2n^ = Ω(n!).
- 3log^
√n = Θ(
n).
If f (n) = O(g(n)), then g(n) = Ω(f (n)).
∑n j=1 j^ =^ O(n^ log^ n).
- If T (n) = 4T (n/2) + O(n) then T (n) = O(n^3 ).
- If T (n) = 4T (n/2) + O(n) then T (n) = O(n^2 log n).
- If an−^1 ≡ 1 mod n for all positive integers a < n, then n is prime.
- The probability that an n-bit integer is prime is roughly 2−n.
- Any DAG with a unique source and sink has a unique topological ordering.
- Breadth first search and depth first search produces the same tree on connected undi- rected graphs if and only if the graph is a tree.
3. Algorithm Design and FFT.
- Given k sorted arrays of length l, sketch an algorithm for finding the median element of all the kl elements. Justify the correctness and give and justify running time bounds. (We are looking for a solution that takes o(kl) time.)
- What is the FFT matrix for a four point FFT? What is the FFT of (0,0,0,1)? of (1,0,0,0)?
4. Depth first Search. 20 points.
Given only the ability to run DFS on a graph from any starting point u and obtaining the resulting pre and post order numbers. (You never get to see an edge.) (Remark: these are pretty easy so don’t worry if it seems so.)
- Show how to find a pair of vertices that is in a cycle in a directed graph if there is one. (You can call DFS as many times as you like on different starting point.)
- If for some DFS [pre(u), post(u)] is disjoint from [pre[v], post(v)], what is the relative order of the intervals if u is reachable from v?
- For a connected undirected graph where the starting point is on a cycle, what is the pre and post numbers of the starting point in terms of the number of nodes in the graph. What if the graph is not connected?
