adplus-dvertising

Welcome to the Algorithm Complexity MCQs Page

Dive deep into the fascinating world of Algorithm Complexity with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Algorithm Complexity, a crucial aspect of Data Structures and Algorithms. In this section, you will encounter a diverse range of MCQs that cover various aspects of Algorithm Complexity, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Data Structures and Algorithms.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Algorithm Complexity. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Data Structures and Algorithms.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Algorithm Complexity. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Algorithm Complexity MCQs | Page 7 of 10

Explore more Topics under Data Structures and Algorithms

Q61.
Six files Fl, F2, F3, F4, F5 and F6 have 100,200,50,80, 120, 150 number of records respectively. In what order should they be stored so as to optimize access time? Assume each file is accessed with the same frequency.

a.

Fl, F2, F3, F4, F5, F6

b.

F2, F6, F5, Fl, F4, F3

c.

F3, F4, FI, F5, F6, F2

d.

Ordering is immaterial as all files are accessed with the same frequency

Discuss
Answer: (c).F3, F4, FI, F5, F6, F2
Q62.
An algorithm is made up of 2 modules Ml and M2. If order of M1 is f(n) and M2 is g(n) then the order of the algorithm is

a.

f (n) + g (n)

b.

f (n) x g (n )

c.

min (f (n) ,g (n) )

d.

max (f (n) ,g (n))

Discuss
Answer: (d).max (f (n) ,g (n))
Q63.
The order of an algorithm that finds whether a given Boolean function of 'n' variables, produces a 1 is

a.

linear

b.

constant

c.

exponential

d.

logarithmic

Discuss
Answer: (b).constant
Q64.
The running time of an algorithm is given by T(n) = T(n - 1) + T(n - 2) - T(n - 3), if n > 3 n, otherwise.

a.

n

b.

log n

c.

n+1

d.

None of these

Discuss
Answer: (a).n
Q65.
A text is made up of the characters a, b, c, d, e each occurring with the probability .12, .4, .15, .08 and .25 respectively. The optimal coding technique will have the average length of

a.

1.78

b.

2.03

c.

2.15

d.

3.01

Discuss
Answer: (c).2.15
Q66.
The time complexity of an algorithm T(n), where n is the input size, is given by T( n) = T( n - 1) + 1/n if n > 1 The order of this algorithm is

a.

n

b.

log n

c.

n+1

d.

n-1

Discuss
Answer: (b).log n
Q67.
The concept of order (Big O) is important because

a.

it can be used to decide the best algorithm that solves a given problem

b.

it determines the maximum size of a problem that can be solved in a given system, in a given amount of time

c.

all of the above

d.

none of these

Discuss
Answer: (c).all of the above
Q68.
Which of the following sorting algorithms does not have a worst case running time of O(n2)?

a.

Quick sort

b.

Bubble sort

c.

Merge sort

d.

Insertion sort

Discuss
Answer: (c).Merge sort
Q69.
Using the standard algorithm, what is the time required to determine that a number n is prime ?

a.

Linear time

b.

Constant time

c.

Quadratic time

d.

Logarithmic time

Discuss
Answer: (a).Linear time
Q70.
Let m, n be positive integers. Define Q (m, n) as Q (m, n) = 0, if m>n Then Q (m, 3) is (a div b, gives the quotient when a is divided by b)

a.

3 x p

b.

a constant

c.

p x (m div 3)

d.

p x (m mod 3)

Discuss
Answer: (c).p x (m div 3)
Page 7 of 10

Suggested Topics

Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Java Spring Framework

Enhance your Java development skills with our Spring Framework MCQs. Learn about...

C# programming

Hone your skills in the C# language with our MCQs. Understand data types, operators,...

Hadoop

Dive into the world of big data with our Hadoop MCQs. Cover key concepts including...

Cyber Security

Understand the fundamentals of safeguarding digital assets with our Cyber Security...

Object Oriented Programming

Enhance your coding skills with our Object Oriented Programming MCQs. Understand...

Artificial Intelligence

Get started on the path to the future with our Artificial Intelligence MCQs. Covering...

C Programming

Master one of the most widely used programming languages with our C Programming MCQs....

Formal Languages and Automata Theory

Discover the mathematical models of computation with our Formal Languages and...

HTML

Start your journey in web development with our HTML MCQs. Learn the building blocks...