TPEC4

What will be the result of the following code snippet?

#include <stdio.h>

void solve()

{

char ch[10] = "abcdefghij";

int ans = 0;

for(int i = 0; i < 10; i++)

{

ans += (ch[i] - 'a');

}

printf("%d", ans);

}

int main()

{

solve();

return 0;

}

• 45

• 35

• 20

• 100

#include "stdio.h"

int main()

{

int x, y = 5, z = 5;

x = y == z;

printf("%d", x);

getchar();

return 0;

}

• 0

• 1

• 5

• Compiler Error

How is an array initialized in C language?

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

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

• int a[] = new int[3];

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

How is the 3rd element in an array accessed based on pointer notation?

• *(a + 3)

• *a + 3

• &(a + 3)

• (a + 3)

How to find the length of an array in C?

• sizeof(a[0])

• sizeof(a) / sizeof(a[0])

• sizeof(a) * sizeof(a[0])

• sizeof(a)

What is the output of the following code snippet?

#include <stdio.h>

#include<stdlib.h>

void set(int to)

{

to = (int)malloc(5 sizeof(int));

}

void solve()

{

int ptr; set(ptr); ptr = 10;

printf("%d", ptr);

}

int main()

{

solve();

return 0;

}

• 10

• The program may crash.

• Cannot Say

• Garbage Value

From following which is not the operation of data structure?

• Operations that manipulate data in some way

• Operations that perform a computation

• Operations that check for syntax errors

• Operations that check for syntax errors

What is the time complexity of the following code snippet in C++?

void solve()

{

string s = "scaler";

int n = s.size();

for(int i = 0; i < n; i++)

{

s = s + s[i];

}

cout << s << endl;

}

• O(n)

• O(n^2)

• O(1)

• O(log n)

Which of the following data structures finds its use in recursion?

• Stack

• Arrays

• LinkedList

• Queues

Which of the following sorting algorithms provide the best time complexity in the worst-case scenario?

• Selection Sort

• Bubble Sort

• Quick Sort

• Merge Sort