Design and Analysis of Algorithms MCQs with answers Page - 6

Here, you will find a collection of MCQ questions on Design and Analysis of Algorithms. Go through these questions to enhance your preparation for upcoming examinations and interviews.

To check the correct answer, simply click the View Answer button provided for each question.

Have your own questions to contribute? Click the button below to share your MCQs with others!

+ Add Question

A

Admin • 831.35K Points
Coach

Q. What will be the cross product of the vectors 2i + 3j + k and 3i + 2j + k?

  • (A) i + 2j + k
  • (B) 2i + 3j + k
  • (C) i + j – 5k
  • (D) 2i – j – 5k

A

Admin • 831.35K Points
Coach

Q. What will be the cross product of the vectors 2i + 3j + k and 6i + 9j + 3k?

  • (A) i + 2j + k
  • (B) i – j – 5k
  • (C) 0
  • (D) 2i – j – 5k

A

Admin • 831.35K Points
Coach

Q. Which of the following operation will give a vector that is perpendicular to both vectors a and b?

  • (A) a x b
  • (B) a.b
  • (C) b x a
  • (D) both a x b and b x a

A

Admin • 831.35K Points
Coach

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

  • (A) closest pair problem
  • (B) quick hull problem
  • (C) path compression
  • (D) union-by-rank

A

Admin • 831.35K Points
Coach

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

  • (A) convex hull
  • (B) concave hull
  • (C) closest pair
  • (D) path compression

A

Admin • 831.35K Points
Coach

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

  • (A) 1
  • (B) 2
  • (C) 3
  • (D) 4

A

Admin • 831.35K Points
Coach

Q. What is the average case complexity of a quick hull algorithm?

  • (A) o(n)
  • (B) o(n log n)
  • (C) o(n2)
  • (D) o(log n)

A

Admin • 831.35K Points
Coach

Q. What is the worst case complexity of quick hull?

  • (A) o(n)
  • (B) o(n log n)
  • (C) o(n2)
  • (D) o(log n)

A

Admin • 831.35K Points
Coach

Q. What does the following diagram depict?

  • (A) closest pair
  • (B) convex hull
  • (C) concave hull
  • (D) path compression

A

Admin • 831.35K Points
Coach

Q. Which of the following statement is not related to quickhull algorithm?

  • (A) finding points with minimum and maximum coordinates
  • (B) dividing the subset of points by a line
  • (C) eliminating points within a formed triangle
  • (D) finding the shortest distance between two points

Add MCQ in this Category

If you want to share an MCQ question in this category, it's a great idea! It will be helpful for many other students using this website.

Share Your MCQ

Browse Categories

Click on category to learn MCQs of that category.