What is performance measurement?

What is an algorithm?
Define Program.
Write the For LOOP general format.
What is recursive algorithm?
What is space complexity?
What is time complexity?
Give the two major phases of performance evaluation
Define input size.
Define best-case step count.
Define worst-case step count.
Define average step count.
Define the asymptotic notation “Big on” (0)
Define the asymptotic notation “Omega” ( Ω).
Define the asymptotic t\notation “theta” (θ)
Define Little “oh”.
Define Little Omega.
Write algorithm using iterative function to fine sum of n numbers.
Write an algorithm using Recursive function to fine sum of n numbers,
Define the divide an conquer method.
Define control abstraction.
Write the Control abstraction for Divide-and conquer.
What is the substitution method?
What is the binary search?
Give computing time for Bianry search?
Define external path length?
Define internal path length.
What is the maximum and minimum problem?
What is the Quick sort?
Write the Anlysis for the Quick sot.
Is insertion sort better than the merge sort?
Write a algorithm for straightforward maximum andminimum>algorithm straight
MaxMin(a,n,max,min)
Give the recurrence relation of divide-and-conquer?
Write the algorithm for Iterative binary search?
What are internal nodes?
Describe the recurrence relation ofr merge sort?
What is meant by feasible solution?
Write any two characteristics of Greedy Algorithm?
Define optimal solution?
What is Knapsack problem?
Define weighted tree.
What is the use of TVSP?
What is the Greedy choice property?
What is greedy method?
What are the steps required to develop a greedy algorithm?
What is activity selection problem?
Write the specification of TVSP
Define forest.
What does Job sequencing with deadlines mean?
Define post order traversal.
Write the formula to calculate delay and also write the condition inwhich the node gets splitted?
What is meant by tolerance level?
When is a task said to be late in a schedule?
Define feasible solution for TVSP.
Define optimal solution for TVSP.
Write the general algorithm for Greedy method control abstraction.
Define optimal solution for Job sequencing with deadlines.
Write the difference between the Greedy method and Dynamic programming.
Define dynamic programming.
What are the features of dynamic programming?
What are the drawbacks of dynamic programming?
Write the general procedure of dynamic programming.
Define principle of optimality.
Give an example of dynamic programming and explain.
Write about optimal merge pattern problem.
Explain any one method of finding the shortest path.
Define 0/1 knapsack problem.
What is the formula to calculate optimal solution in 0/1 knapsack problem?
Write about traveling salesperson problem.
Write some applications of traveling salesperson problem.
Give the time complexity and space complexity of traveling salesperson problem.
Define flow shop scheduling.
What are the conditions of flow shop scheduling?
Define nonpreemptive schedule.
Define preemptive schedule.
Define finish time
Define mean flow time
Define optimal finish time.
Define preemptive optimal finish time.
What are the requirements that are needed for performing Backtracking?
Define explicit constraint.
Define implicit constraint.
Define state space tree.
Define state space of the problem.
Define answer states.
What are static trees?
What are dynamic trees?
Define a live node.
Define a E–node.
Define a dead node.
,What are the factors that influence the efficiency of the backtracking algorithm?
Define Branch-and-Bound method.
What are the searching techniques that are commonly used in Branch-and-Boundmethod.
State 8–Queens problem.
State Sum of Subsets problem.
State m–colorability decision problem.
Define chromatic number of the graph.
Define a planar graph.
What are NP- hard and Np-complete problems?
What is a decision problem?
What is maxclique problem?
what is approximate solution?