Which of the following data structures is preferred in the implementation of a database system?

What will be the output of the following code snippet?
int search(int l, int r, int target, vector<int> &a) {
   int mid = (l + r) / 2;
   if(a[mid] == target) {
       return mid;
   }
   else if(a[mid] < target) {
       return search(mid + 1, r, target, a);
   }
   else {
       return search(0, mid - 1, target, a);
   }
}
void solve() {
   vector<int> a = {1, 2, 3, 4, 5};
   cout << search(0, 4, 4, a) << endl;
}

Which one of these is not a Built-in Data Structure of python?

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?
 

What is the most important criteria that must be met before being inserted into a linked queue?
 

What does the following code snippet do?
void dfs(int node, vector<vector<int>> &edges, vector<bool> &vis, vector<int> &dp) {
   vis[node] = true;
   for(auto x: edges[node]) {
       if(!vis[x]) {
           dp[x] = dp[node] + 1;
           dfs(x, edges, vis, dp);
       }
   }
}

Which data structure is mainly used for implementing the recursive algorithm?

Which of the following are applications of Topological Sort of a graph?

What is the time complexity of the binary search algorithm?

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

How is an array initialized in C language?

Kruskal’s Algorithm for finding the Minimum Spanning Tree of a graph is a kind of a?

Which of the following code snippet is used to convert decimal to binary numbers?
 

which feature does not match with python

What will be the best sorting algorithm, given that the array elements are small (<= 1e6)?

Python is successor of which language?

Worst case time complexity to access an element in a BST can be?

What will be the output of the following code snippet?
void solve() {
   int n = 24;
   int l = 0, r = 100, ans = n;
   while(l <= r) {
       int mid = (l + r) / 2;
       if(mid * mid <= n) {
           ans = mid;
           l = mid + 1;
       }
       else {
           r = mid - 1;
       }
   }
   cout << ans << endl;
}

What is the extentions for the python file?

Which of the following is a non-linear data structure?

What does the following code snippet calculate (edges represent the adjacency list representation of a graph)?
void solve(vector<vector<int>> edges) {
   int count = 0;
   for(auto x: edges) {
       for(auto y: x) {
           count += 1;
       }
   }
   cout << count / 2 << endl;
}

Dijkstra’s Algorithm cannot be applied on which of the following?

Which of the following algorithms are used to find the shortest path from a source node to all other nodes in a weighted graph?
BFS.

In circular queue, the value of REAR would be?

What is the maximum number of children a node can have in an n-ary tree?
 

What will the output of the following code snippet be?

void solve() {
   vector<int> a = {1, 2, 3, 4, 5};
   sort(a.begin(), a.end(), [&](const int &x, const int &y) {
       return x % 2 < y % 2;
   });
   for(int x: a) {
       cout << x << " ";
   }
   cout << endl;
}

What will be the final elements on the stack if the following sequence of operations are executed?
Push(a,s);
Push(b,s);
Pop(s);
Push(c,s);
where a, b, c are the data elements and s is the stack.

In what traversal we process all of a vertex’s descendants before we move to an adjacent vertex?

Which of the following algorithms are used for string and pattern matching problems?
 

What will be the output of the following code snippet?
void solve() {
   string s = "00000001111111";
   int l = 0, r = s.size() - 1, ans = -1;
   while(l <= r) {
       int mid = (l + r) / 2;
       if(s[mid] == '1') {
           ans = mid;
           r = mid - 1;
       }
       else {
           l = mid + 1;
       }
   }
   cout << ans << endl;
}