Subject Title (Theory): Introduction to Algorithms
Unit I:
Introduction to computer problem solving and Fundamentals of
Algorithms
Two marks questions
1) What is algorithm?
2) Define pseudocode?
3) Define top down design.
4) What are the characteristics of algorithm.
5) What is program verification?
6) What is Fibonacci sequence?
7) List the steps involved in problem solving aspects.
8) What is Fibonacci number?
9) Define summation of set.
10) What is counting?
11) What is base conversion? Give example for binary to decimal conversion.
12) Write pseudocode to swap two numbers.
13) Write pseudocode to find factorial of a number.
14) Expand ASCII.
Five / Ten marks questions
1) Explain the characteristics of algorithm.
2) Explain top-down design approach in problem solving.
3) What are the applications of algorithm?
4) Write a note on algorithm implementation.
5) Write a note on program verification.
6) Explain problem solving aspects in algorithm.
7) Explain the concept of Base conversion.
8) Write a C Program to reverse a digit of an integer.
9) Create an algorithm to find summation of set of numbers.
10) How do you convert character to number, explain with algorithm & C
implementation?
11) Write an algorithm & C program to convert character to ASCII.
12) Explain and write C program to compute sin(x) without using Taylor’s Series.
13) Write a C program to generate Fibonacci sequence, give sample output
14) Explain exchanging the values of two variables, give example.
15) Convert the following (Any example):
i. 1010101(2) = ( )(10)
ii. 12312(8) = ( )(10)
iii. 256(10) = ( )(2)
iv. 3251(10) = ( )(2)
UnitII:
Factoring Methods:
Two marks questions
1) What is prime factor of a number?
2) What is prime number?
3) Write pseudocode to find GCD of two integers.
4) Define pseudo random number.
5) Define smallest divisor. Give example.
Five / Ten marks questions
1) Explain and write an algorithm to find smallest divisor of an integer.
2) Write a C program to find square root of a given number.
3) Explain to compute the square root of a given number.
4) Develop an algorithm to compute the prime factors of an integer.
5) Write algorithm to find GCD of two integers.
6) Write an algorithm & program for generating prime numbers.
7) C program to compute Nth Fibonacci number.
UnitIII:
Array Techniques:
Two marks questions
1) What is an array order reversal? Give example.
2) What is array partitioning.
3) How to find kth smallest element.
4) What is array counting or Histogram?
5) Write pseudocode to Find maximum element in a given set.
Five / Ten marks questions
1) Write algorithm development & program for reversing array elements.
2) Explain array counting or Histogramming?
3) Write an algorithm and C program to partition an array.
4) Write c program to find maximum number in a set.
5) Write c program to find kth smallest element.
6) Write c program to remove duplicate elements from an array.
Unit IV:
Merging, Sorting, Searching:
Two marks questions
1. What is Insertion Sort?
2. What is Sorting? List any two sorting algorithms
3. What is Searching? List searching algorithms
4. Define Sort by partition (Quick sort).
5. What is Linear Search?
6. What is Binary Search?
7. What is Sort by exchange (Bubble Sort)?
8. What is two-way merge sort?
9. What is selection sort?
Five / Ten marks questions
1) Explain two way merge sort with example.
2) Write an algorithm for sort by exchange (Bubble Sort). for {13, 26, 12, 33, 5, 8, 9}
3) Explain Selection and Insertion Sort in detail.
4) Explain Linear Search technique with example.
5) Write a C program to implement Linear search .
6) Write a C program to implement Binary search
7) Write a C program to perform Quick Sort.
8) Explain binary search with example. Ex: {3, 4, 5, 6, 8, 9} Search =8.
9) Explain linear search with example (trace the following): {50, 55, 70, 15, 40} Search key = 15