Virtual Labs

HOME
PARTNERS
CONTACT

Computer Science and Engineering Data Structures – 1 Experiments

Aim

Overview

Recap

Pretest

Linear Search

Aim Concept Algorithm Demo Quiz

Binary Search

Aim Concept Algorithm Demo Practice Exercise Quiz

Analysis

Aim Overview Time and Space Complexity Quiz

Posttest

Unsorted Arrays vs Binary Search

Choose difficulty:

Beginner

Intermediate

Advanced

1. How is a linear search performed?

a: An element is copied linearly in another array until the required element comes up. Explanation

Explanation

b: Array is broken into smaller subarrays and elements are searched recursively. Explanation

Explanation

c: Array is traversed from left to right using a loop, until the required element comes up. Explanation

Explanation

d: None of the above Explanation

Explanation

2. In the worst case, what is the time complexity of linear search?

a: O(log N) Explanation

Explanation

b: O(1) Explanation

Explanation

c: O(N) Explanation

Explanation

d: O(N log N) Explanation

Explanation

3. In the best case, what is the time complexity of linear search?

a: O(1) Explanation

Explanation

b: O(N log N) Explanation

Explanation

c: O(log N) Explanation

Explanation

d: O(N) Explanation

Explanation

4. How is linear search disadvantageous?

a: Time taken to find an element is more as compared to other searching algorithms Explanation

Explanation

b: Space complexity to perform a linear search increases the memory overhead Explanation

Explanation

c: It is difficult to implement linear search. Explanation

Explanation

d: None of the above Explanation

Explanation

5. For an ordered linear search, O(log n) is the worst case time complexity.
(An ordered linear search is the linear search on an array which is already sorted)

a: True Explanation

Explanation

b: False Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)