St. Britto Hr. Sec. School - Madurai
12th Computer Science Monthly Test - 1 ( Algorithmic Strategies )-Aug 2020
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
What is best algorithm?
-
What is searching? Write its types.
-
What is an Algorithm?
-
What in algorithmic strategy? Give an example.
-
Define Pseudo code
-
What is algorithm analysis?
-
What is algorithmetic strategy?
-
Write a note on Big omega asymptotic notation.
-
How the efficiency of an algorithm is defined?
-
Name the two factors, which decide the efficiency of an algorithm.
-
Discuss about Algorithmic complexity and its types
-
What are the factors that influence time and space complexity
-
List the characteristics of an algorithm
-
Write a note on Asymptotic notation
-
Write a note on time/space trade off.
-
Write a pseudo code for Insertion sort.
-
-
Write a pseudo code for selection sort.
-
Design an algorithm to find square of the given number and display the result.
-
-
What do you understand by Dynamic programming?
-
Write the steps to do dynamic programming.
-
Write a pseudo code that defines Fibonacci Iterative algorithm with Dynamic programming approach.
-
Write a note on Efficiency of an algorithm.
-
-
Differentiate Algorithm and program.
-
What is Binary search? Discuss with example
-
-
Explain the concept of Dynamic programming with suitable example.
-
Explain the Bubble sort algorithm with example
-
Discuss about Linear search algorithm