Menu

Arrays Questions

MCQ
131.
What is the time complexity of inserting at the end in dynamic arrays?
forum Discussion
MCQ
132.
One way is to have the linear relationship between the elements by means of sequential memory locations and such linear structures are called ______.
forum Discussion
MCQ
133.
Advantages of linked list representation of binary trees over arrays?
forum Discussion
NAT
134.

You are given an integer array A of length 10, initially containing all zeros. You must perform the following sequence of operations: 1. For i from 1 to 10 (inclusive), update A[i] = A[i] + i. 2. For every index i such that i is divisible by 2, update A[i] = A[i] + A[i/2]. 3. For every index i such that i is divisible by 3, update A[i] = A[i] + A[i/3]. 4. Compute the value S = sum(A[i] * i) for i from 1 to 10. What is the final value of S?

forum Discussion
chevron_left BackPage 14 of 14