Virtual Labs

1. How do you describe an array?

a: Data structure having linear access time Explanation

Explanation

b: Data structure containing elements of similar types in contiguous storage Explanation

Explanation

c: A container of unique elements of similar types Explanation

Explanation

d: Data structure containing elements located in various locations memory which may or may not be contiguous Explanation

Explanation

2. What is the time complexity of traversing through all the elements in an array?

a: O(N^2) Explanation

Explanation

b: O(1) Explanation

Explanation

c: O(N) Explanation

Explanation

d: O(log N) Explanation

Explanation

3. Let us consider the following code:

int a = 0, b[N];
for (i = 0; i < M; i++) {
    a+=i;
}
for (i = 0; i < N; i++) {
    scanf(\“%d\”, &b[i]);
    a+=b[i];
}

What is the space and time complexity of the above code?

a: Space: O(M+N), Time: O(M+N) Explanation

Explanation

b: Space: O(N), Time: O(M*N) Explanation

Explanation

c: Space: O(M), Time: O(M) Explanation

Explanation

d: Space: O(N), Time: O(M+N) Explanation

Explanation

4. Let us consider following four arrays:
A = [9, 5, 11, 25, 7, 35]
B = [1, 2, 9, 15, 27]
C = [29, 27, 27, 18, 4, 2]
D = [1, 8, 2, 5, 6, 7, 8, 9]
Which of the arrays are sorted?

a: A and C Explanation

Explanation

b: B and D Explanation

Explanation

c: B and C Explanation

Explanation

d: A and D Explanation

Explanation

5. If for large inputs, X is a better choice than Y, then:

a: Y is asymptotically more efficient than X Explanation

Explanation

b: X is asymptotically more efficient than Y Explanation

Explanation

c: X and Y are equivalently efficient Explanation

Explanation

d: None of the above Explanation

Explanation

Unsorted Arrays vs Binary Search