BRAIN BUSTERS (ROUND2)

What is the output of the following code snippet?

#include <stdio.h>

int main() {

int a[] = {1, 2, 3, 4};

int sum = 0;

for(int i = 0; i < 4; i++) {

sum += a[i];

}

printf("%d", sum);

return 0;

}

• 10

• 20

• 15

• 12

what is the average Time Complexity of binary search using recursion?

• O(nlogn)

• O(logn)

• O(n)

• O(n^2)

Which one of the following is not the application of the stack data structure

• String reversal

• Recursion

• Backtracking

• Asynchronous data transfer

What will be the output of the following code snippet?

#include <stdio.h>

void solve() {

int first = 10, second = 20;

int third = first + second;

{

int third = second - first;

printf("%d ", third);

}

printf("%d", third);

}

int main() {

solve();

return 0;

}

• 10 30

• 30 10

• 10 20

• 20 10

Which of the following is known as a set of entities of the same type that share same properties , or attributes?

• Relation set

• Tuples

• Entity set

• Entity Relation Model

Which of the following is not a valid C variable name?

• int number;

• float rate;

• int variable_count;

• int $main;

Which of the following is not a function of the database?

• Managing stored data

• Manuplating data

• Security for stored data

• Analysing code

Which of the following methods can be used to search an element in a linked list ?

• Iterative linear search

• Iterative Binary search

• Recursion Binary search

• Normal binary search

what is the best case and worst case complexity of ordered linear search?

• O(nlogn),O(logn)

• O(logn),O(nlogn)

• O(n),O(1)

• O(1),O(n)

which data structure is used for implementing recusion?

• Queue

• Stack

• Array

• List