ADVANCED ALGORITHMS-2ND INTERNALS Question Bank

CITY ENGINEERING COLLEGE

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

M.TECH 2^ND SEM

ADVANCED ALGORITHMS

2^ND INTERNALS Question Bank

1. Explain flow networks and flows with an example.
2. Explain the ford-Fulkerson method. Explain in detail residual networks, augmenting paths and and cuts in the flow networks. Also state the Max-flow Min-cut theorem.
3. Explain maximum bipartite matching problem.
4. Explain polynomial with coefficient representation and point value representation. How is fast multiplication of polynomials in coefficient form accomplished?
5. Explain what are complex roots of unity along with the cancellation lemma, halving lemma and summation lemma. How do you evaluate a polynomial using DFT?
6. Explain the recursive FFT implementation.
7. Explain the iterative FFT implementation.
8. Explain primality testing using miller-rabin randomized primality test. Explain in detail the WITNESS and MODULAR_EXPONENTIATION functions.
9. Explain integer factorization using the pollard's rho heuristic.
   
   
   ~~~~All The Best~~~~