Data Structures

How is an array initialized in C language?

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

• int a = {1, 2, 3};

• int a[] = new int[3]

• int a(3) = [1, 2, 3];

Which of the following is not the type of queue?

• Priority queue

• Single-ended queue

• Circular queue

• Ordinary queue

What will the output of the following code snippet?

void solve() {

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

int sum = 0;

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

if(i % 2 == 0) {

sum += *(a + i);

}

else {

sum -= *(a + i);

}

}

cout << sum << endl;

}

• 15

• syntax error

• 3

• 2

Which of the following is not the type of queue?

• Single-ended queue

• Circular queue

• Priority queue

• Ordinary queue

How are String represented in memory in C?

• LinkedList of characters.

• The object of some class.

• An array of characters.

• Same as other primitive data types.

The depth of a complete binary tree is given by

• Dn = log2n+1

• Dn = n log2n+1

• Dn = n log2n

• Dn = log2n

In Binary trees nodes with no successor are called......

• Final nodes

• Last nodes

• Terminal nodes

• End nodes

The operation of processing each element in the list is known as

• Inserting

• Traversal

• Merging

• Sorting

The complexity of Bubble sort algorithm is

• O(n2)

• O(n)

• O(log n)

• O(n log n)

The complexity of Binary search algorithm is

• O(n)

• O(n log n)

• O(n2)

• O(log n)