Data Structure & Algorithms - Sample Questions

How is the 2nd element in an array accessed based on pointer notation?

What will be the output of the following code snippet? <pre><code class="language-plaintext hljs">void solve() { int a[] = {1, 2, 3, 4, 5}; int sum = 0; for(int i = 0; i &lt; 5; i++) { if(i % 2 == 0) { sum += a[i]; } } cout &lt;&lt; sum &lt;&lt; endl; }</code></pre>

Which of the following algorithms are useful for processing queries on trees?

Which of the following is not the type of queue?

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?

From following which is not the operation of data structure?

How is an array initialized in C language?

What will the output of the following code snippet? <pre><code class="language-plaintext hljs">void solve() { int a[] = {1, 2, 3, 4, 5}; int sum = 0; for(int i = 0; i &lt; 5; i++) { if(i % 2 == 0) { sum += *(a + i); } else { sum -= *(a + i); } } cout &lt;&lt; sum &lt;&lt; endl; }</code></pre>