AAMU CIS CMP507 Data Structure and Algorithm in C Final EXam DR. Peter Wang
Name: SSN: Tel:
1. Given T(0)=c, T(n)=an+T(n-1), find the O-notation of T(n).
2. What are the phases of software development life cycle ?
3. Describe the Prim's algorithm to find the minimum cost spanning tree.
4. Describe and compare the bubble sort, insertion sort, selection
sort, heap sort, quick sort,binary tree sort, merge sort, shell
sort, proxmap sort, and radix sort.
5. Given the input sequence: 77, 61, 59, 48, 19, 11, 26, 15, 1, 5.
Construct the heap tree and the heap tree at each stage of heap sort.
6. Find the all source shortest path.
7. Why are stacks useful for processing nested structures ?
8. What is object-oriented programming (OOP) ?
9. Write a recursive C function to find the sum of squares.
10. Give the O-notation corresponding to the following adjective
names for various complexity classes: constant , logarithm ,
linear , n log n , quadratic , cubic , and exponential.