Qz1Fa11 - sorting? Explain in a sentence. Q1e. What is the...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Analysis of Algorithms CSE 5211 Fall 2011 Quiz 1 Points 30 Intro to Analysis of Algorithms CSE 4081 Fall 2011 Quiz 1 Points 30 Time: 45 min [Q1 answer on question paper., Q2 on your stationery.] Q1a. Solve using Master’s theorem: [10 pts] T(n) = T(n/2)+O(n) Q1b. Mention a scenario where Quicksort has O(N^2) asymptotic complexity for problem size N. Q1c. Mergesort’s worst case complexity is always same for a given problem size – true or false? Explain in a sentence. Q1d. Can Q1a be recurrence equation for asymptotic complexity of a comparison-based
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: sorting? Explain in a sentence. Q1e. What is the space-complexity (memory needed) of Quick sort? ( Think! ) Explain in a sentence. Q2. Evaluate a polynomial 4 + 3x + 2x 2 + x 3 at w 4 , w 4 2 , w 4 3 , and w 4 4 , four complex roots of the equation x 4 =1, using recursive FFT algorithm. Show the recurrence tree and your steps. How many steps (complexity) are there in your computation? [20 pts]...
View Full Document

This note was uploaded on 02/10/2012 for the course CSE 5211 taught by Professor Dmitra during the Spring '12 term at FIT.

Ask a homework question - tutors are online