Daily Updates
   HTML
   HTML5
   CSS
   CSS3
   JavaScript
   jQuery
   AngularJS
   Articles
   Blog
logo
Data Structures Algorithms - Quiz(MCQ)
____ is not the component of data structure.
A)
Operations
B)
Algorithms
C)
Storage Structures
D)
None of the above

Correct Answer : Option (D) :   None of the above

Recently Updated in Data Structures Algorithms Questions
Q .
Consider the following code snippet:
void solve(vector<int> &a) {
   int queries;
   cin >> queries;
   while(queries--) {
       int type;
       cin >> type;
       if(type == 1) {
           int index, value;
           cin >> index >> value;
           update(a, index, value);
       }
       else {
           int l, r;
           cin >> l >> r;
           cout << getXOR(a, l, r) << endl;
       }
   }
}
The update() function updates the element at the given index in the array to some given value. The getXOR() function returns the XOR of the elements in the array a, in the range [l, r]. Which of the following data structures can perform the above tasks optimally?
A)
Tries.
B)
Stacks
C)
Prefix XOR Arrays.
D)
Segment Trees.

Correct Answer : Option (D) :   Segment Trees.

Q .
Consider we have a function, getLCA(), which returns us the Lowest Common Ancestor between 2 nodes of a tree. Using this getLCA() function, how can we calculate the distance between 2 nodes, given that distance from the root, to each node is calculated?
A)
dist(u) + dist(v)
B)
dist(u) + dist(v) - 2 * dist(getLCA(u, v))
C)
dist(u) + dist(v) - dist(getLCA(u, v))
D)
dist(u) + dist(v) + 2 * dist(getLCA(u, v))

Correct Answer : Option (B) :   dist(u) + dist(v) - 2 * dist(getLCA(u, v))

Explanation : The distance between 2 nodes, can be broken down into the sum of distances from the root, to each of the nodes. Observe, that in each of these paths, the path from the root to the LCA comes in each of them. So, this needs to be removed from the answer, and hence we get our formula in Option (B).