Design and Analysis of Algorithms Mock Test

1. Recursion is similar to which of the following?

2. Suppose the first fibonnaci number is 0 and the second is 1. What is the sixth fibonnaci number?

3. Which is the smallest number of 3 digits that is divisible by 2, 4, 8?

4. Which of the following is not a fibonnaci number?

5. Which of the following is also known as LCM?

6. Which of the following is also known as GCD?

7. What is the LCM of two coprime numbers?

8. Which of the following is coprime number?

9. What is the LCM of 8 and 13?

10. In terms of Venn Diagram, which of the following expression gives LCM (Given A ? B ? Ø)?

11. In terms of Venn Diagram, which of the following expression gives GCD (Given A ? B ? Ø)?

12. Which of the following option is wrong?

13. What is the LCM according to the given Venn Diagram?

14. Which of the following sorting algorithm is NOT stable?

15. Under what case of Masters theorem will the recurrence relation of stooge sort fall?

16. What is the bidirectional variant of selection sort?

17. Which of the following methods is the most effective for picking the pivot element?

18. Which of the following methods can be used to find the largest and smallest element in an array?

19. Under what case of Masters theorem will the recurrence relation of merge sort fall?

20. Which of the following methods can be used to find the largest and smallest number in a linked list?

21. Which is the safest method to choose a pivot element?

22. What is the number of swaps required to sort the array arr={5,3,2,4,1} using recursive selection sort?

23. Which case of masters theorem can be extended further?

24. Which of the following techniques can be used to search an element in an unsorted array?

25. The shortest distance between a line and a point is achieved when?

26. is a method of constructing a smallest polygon out of n given points.

27. What is the basic operation of closest pair algorithm using brute force technique?

28. Which of the points are closer to each other?

29. Which of the following algorithms is the simplest?

30. What is the other name for quick hull problem?

31. Which of the following is called the ultimate planar convex hull algorithm?

32. Which of the following strategies does the following diagram depict.

33. How many approaches can be applied to solve quick hull problem?

34. Cross product is a mathematical operation performed between

35. What is the running time of Hershberger algorithm?

36. Cross product is also known as?

37. Which of the following is similar to Euclidean distance?

38. What is the shortest distance between the line given by -2x + 3y + 4 = 0 and the point (5,6)?

39. Which of the following strategies does the following diagram depict?

40. Which of the following is false in the case of a spanning tree of a graph G?

41. What is the distance between the lines 3x- 4y+7=0 and 3x-4y+5=0?

42. Which of the following is not the algorithm to find the minimum spanning tree of the given graph?

43. Which of the following is false about the Kruskals algorithm?

44. Bellmann ford algorithm provides solution for problems.

45. Prims algorithm can be efficiently implemented using for graphs with greater density.

46. How many solution/solutions are available for a graph having negative weight cycle?

47. How many times the insert and extract min operations are invoked per vertex?

48. What is the basic principle behind Bellmann Ford Algorithm?

49. A graph is said to have a negative weight cycle when?

50. What approach is being followed in Floyd Warshall Algorithm?

Computer Science Engineering Mock Tests with Answers
Distributed Computing System Mock Test
Software Project Management Mock Test
Artificial Intelligence and Robotics Mock Test
Basics of Database Management Mock Test
C# Programming Mock Test
C#.NET Programming Mock Test
Cloud Computing Mock Test
Communication Network Mock Test
Computer Architecture Mock Test
Computer Architecture Mock Test
Computer Fundamentals Mock Test
Computer Networking Mock Test
Computer Networks Mock Test
CPP Programming Mock Test
Data Analysis Mock Test
Data Communication and Computer Network Mock Test
Data Compression and Data Retrieval Mock Test
Data Mining and Business Intelligence Mock Test
Data Mining and Data Warehouse Mock Test
Data Structure and Algorithms Mock Test
Data Structures Mock Test
DataBase Management System Mock Test
Design and Analysis of Algorithms Mock Test
Digital Electronics and Logic Design Mock Test
Digital Logic Circuits Mock Test
Digital Principles and System Design Mock Test
Discrete Mathematics Mock Test
Discrete Structure Mock Test
DotNet Technology Mock Test
Embedded Real Time Operating System Mock Test
Green Computing Mock Test
High Performance Computing Mock Test
Information Cyber Security Mock Test
Information and Network Security Mock Test
Information Retrival Techniques Mock Test
Information Systems and Engineering Economics Mock Test
Machine Learning Mock Test
Microprocessor and Interfacing Technique Mock Test
Microprocessors Mock Test
Muli core Architectures and Pro Mock Test
Multi core processors Mock Test
Network Security Mock Test
Neural Networks and Fuzzy Control
Object Oriented Programming Mock Test
Operating System Architecture Mock Test
Operating System Mock Test
Problem Solving and Python Programming Mock Test
Programming for Problem Solving Mock Test
Python Programming Mock Test
Soft Computing Mock Test
Software Design Modeling Mock Test
Software Engineering Mock Test
Software Testing Mock Test
Software Testing and Quality Assurance Mock Test
Theory of Computation and Compiler Design Mock Test
Theory of Computation Mock Test
Ubiquitous Computing System Mock Test