Showing posts with label divide and conquer. Show all posts
Showing posts with label divide and conquer. Show all posts

Sunday, May 24, 2015

Analysis and Design of Algorithm Question Bank



Objective Type Questions:
1. The complexity of linear search algorithm is
a. O(n)                                                   b. O(log n)                                            c. O(n2)                                                  d. O(n log n)

2. The complexity of Binary search algorithm is
a. O(n)                                                   b. O(log n )                                           c. O(n2)                                                  d. O(n log n)

Tuesday, May 19, 2015

Analysis and Design of Algorithm Question bank with objective type


Objective Type Questions:
1. The time complexity of an algorithm quantifies the amount of time taken by an algorithm to run according to ____.
a. number of space                                                                                              b. number of inputs
c. number of outputs                                                                                          d. number of characters

2. Which is not a criterion of algorithm design?
a. Finiteness                                                                                                         b. Durability        
c. Definiteness                                                                                                     d. Efficient

Search Aptipedia