Student’s Name………………………………… Roll No.
VIVEKANANDA COLLEGE OF TECHNOLOGY AND MANAGEMENT, ALIGARH
QUIZ NO. V
Course with Branch: B.Tech (CSE/IT) Session: 2024-25 Year/Semester: 3rd/5
Subject with Code: BCS 503 (DAA) Time: 20 min. Max. Marks: 10
1. What does Algebraic Computation primarily deal with?
a) Numbers and calculations b) Sorting data c) Finding paths in graphs d) String manipulation
2. What is the main use of the Fast Fourier Transform (FFT)?
a) To sort numbers quickly b) To analyze signals and images c) To search for patterns in strings d) To solve equations
3. Which algorithm is known for efficiently finding a substring in a string?
a) Bubble Sort b) Knuth-Morris-Pratt (KMP) c) Dijkstra's Algorithm d) Merge Sort
4. What does NP-Complete mean?
a) Problems that can be solved quickly b) The hardest problems in NP that can be verified quickly
c) Problems with no solutions d) Problems that are easy to understand
5. What is the goal of Approximation Algorithms?
a) To find exact answers only b) To give answers that are close to the best possible answer
c) To make problems easier to understand d) To solve problems without any errors
6. Which of these is an example of a randomized algorithm?
a) Linear Search b) QuickSort with random choice of pivot c) Selection Sort d) Insertion Sort
7. How does the Fast Fourier Transform (FFT) improve speed?
a) By reducing the number of calculations needed b) By using more memory
c) By simplifying the input data d) By increasing the size of the output
8. What data structure is often used in string matching algorithms?
a) Array b) Suffix Tree c) Stack d) Queue
9. Which problem is often used as an example of NP-Completeness?
a) Sorting numbers b) Traveling Salesman Problem (TSP) c) Finding the maximum number in a list d) Adding two numbers
10. What approach does a simple Approximation Algorithm for Vertex Cover use?
a) Random guessing b) Greedy approach c) Dynamic programming d) Backtracking
1 2 3 4 5 6 7 8 9 10
Marks Obtained…………………….. Signature of Teacher………………………………..
