Programming and Data Structures Test 2

Question 1
2 / -0.33

How do you instantiate an array in Java?

A
int arr[] = new int(3);

B
int arr[];

C
int arr[] = new int[3];

D
int arr() = new int(3);

Question 2
2 / -0.33

What is the output of the following Java code?
public class array
{
public static void main(String args[])
{
int []arr = {1,2,3,4,5};
System.out.println(arr[2]);
System.out.println(arr[4]);
}
}

A
3 and 5

B
5 and 3

C
2 and 4

D
4 and 2

Question 3
2 / -0.33

When does the ArrayIndexOutOfBoundsException occur?

A
Compile-time

B
Run-time

C
Not an error

D
Not an exception at all

Question 4
2 / -0.33

What is the number of binary search trees possible with 9 distinct keys?

A
4862-4862

B
48624-48621

C
48627-48626

D
48629-48622

Question 5
2 / -0.33

What are the advantages of arrays?

A
Objects of mixed data types can be stored

B
Elements in an array cannot be sorted

C
Index of first element of an array is 1

D
Easier to store elements of same data type

Question 6
2 / -0.33

Assuming int is of 4bytes, what is the size of int arr[15];?

A
15

B
19

C
11

D
60

Question 7
2 / -0.33

A program X reads in 300 integers in the range [0..100] representing the %attendance of 300 students. It then prints the frequency of each %attendance above 25. What would be the best way for X to store the frequencies?

A
An array of 300 integers

B
An array of 100 integers

C
An array of 75 integers

D
An array of 25 integers

Question 8
2 / -0.33

Elements in an array are accessed _____________

A
Randomly

B
Sequentially

C
Exponentially

D
Logarithmically

Question 9
2 / -0.33

How do you initialize an array in C?

A
int arr[3] = (1,2,3);

B
int arr(3) = {1,2,3};

C
int arr[3] = {1,2,3};

D
int arr(3) = (1,2,3);

Question 10
2 / -0.33

If a queue is implemented using two stacks. In enqueue operation, all the elements are pushed from the first stack to the second stack. In dequeue operation pop an element from 1st stack.
Which of the following is/are true?

A
Time complexity of enqueue is O(n)

B
Time complexity of enqueue is O(1)

C
Time complexity of dequeue is O(1)

D
Time complexity of dequeue is O(n)

Question 11
2 / -0.33

A function f defined on stack of integer satisfies the following properties f(empty) = 0 and f (push (S, i)) = max (f(s), 0) + i for all stacks S and integer i.
After pushing integers 2, -3, 2, -1, 2 in order from bottom to top. f(s) returns the top of the stack. What is f(s)?

A
6

B
4

C
3

D
2

Question 12
2 / -0.33

What is the return output of the following C program segment?
char c= '2';
switch(c)
{
case '1': printf("C program, ");
case '2':
case '3': printf("Java program, ");
case '4' :
case '5': break;
default: printf("No program");
}
return 0;
}

A
Error

B
Java program, No program

C
Java program,

D
C program, Java program, No program

Question 13
2 / -0.33

Which of the following is the correct way to declare a multidimensional array in Java?

A
int[] arr;

B
int arr[[]];

C
int[][]arr;

D
int[[]] arr;

Question 14
2 / -0.33

Which of the following is/are true with respect to stacks and queues where where front points to the index where deletion is done and the rear points to the index where insertion is done in queue?

A
Breadth first search algorithm employs queue data structure while depth first search uses stack data structure.

B
The necessary condition to detect if a circular queue of capacity (n-1) is full is (rear+1) mod n = front

C
Depth first search algorithm employs queue data structure while breadth first search uses stack data structure.

D
Time complexity of converting a fully parenthesized infix expression to postfix expression is O(n).

Question 15
2 / -0.33

What is the output of the following Java code?

public class array
{
public static void main(String args[])
{
int []arr = {1,2,3,4,5};
System.out.println(arr[5]);
}
}

A
4

B
5

C
ArrayIndexOutOfBoundsException

D
InavlidInputException

Question 16
2 / -0.33

Which of the following is not a logical operator?

A
&&

B
!

C
||

D
|

Question 17
2 / -0.33

Which of the following is true about return type of functions in C?

A
Functions can return any type

B
Functions can return any type except array and functions

C
Functions can return any type except array, functions and union

D
Functions can return any type except array, functions, function pointer and union

Question 18
2 / -0.33

Consider the following C declaration

struct {
short s[5];
union {
float y;
long z;
}u;
} t;

Assume that objects of the type short, float and long occupy 2 bytes, 4 bytes and 8 bytes, respectively. The memory requirement for variable t, ignoring alignment considerations, is

A
22 bytes

B
14 bytes

C
18 bytes

D
10 bytes

Question 19
2 / -0.33

#include <stdio.h>
int main()
{
int i = 3;
printf("%d", (++i)++);
return 0;
}

What is the output of the above program?

A
3

B
4

C
5

D
Compile-time error

Question 20
2 / -0.33

Consider the following C program
main ( )
{
int N, x;
scanf (“% d”, &N);
x = 0;
while (N > 0)
{
x = x + 1 – N % 2;
N / = 2;
}
printf(“% d”, x)
}
What is the sum of the smallest three values of N for which the value printed is 5?

A
163-163

B
1634-1631

C
1637-1636

D
1639-1632

Question 21
2 / -0.33

Find the Output ?

#include<stdio.h>

int main()

{

int x, y = 5, z = 5;

x = y == z;

printf("%d", x);

getchar();

return 0;

}

A
0

B
1

C
5

D
Compiler Error

Question 22
2 / -0.33

Which file is generated after pre-processing of a C program?

A
.p

B
.i

C
.o

D
.m

Question 23
2 / -0.33

Which of the following is not a storage class specifier in C?

A
auto

B
register

C
static

D
volatile

Question 24
2 / -0.33

The following postfix expression with single digit operands in evaluated using a stack
4 2 5 ^ * 14 7 / - 7 5 * +
Note that ^ is exponentiation operator, * is multiplication operator, / is division operator, + is addition operator and – is subtraction operator

A
161-161

B
1614-1611

C
1617-1616

D
1619-1612

Question 25
2 / -0.33

In C, parameters are always

A
Passed by value

B
Passed by reference

C
Non-pointer variables are passed by value and pointers are passed by reference

D
Passed by value result

Submit Test

Programming and...

Question 1

int arr[] = new int(3);

int arr[];

int arr[] = new int[3];

int arr() = new int(3);

Question 2

3 and 5

5 and 3

2 and 4

4 and 2

Question 3

Compile-time

Run-time

Not an error

Not an exception at all

Question 4

4862-4862

48624-48621

48627-48626

48629-48622

Question 5

Objects of mixed data types can be stored

Elements in an array cannot be sorted

Index of first element of an array is 1

Easier to store elements of same data type

Question 6

15

19

11

60

Question 7

An array of 300 integers

An array of 100 integers

An array of 75 integers

An array of 25 integers

Question 8

Randomly

Sequentially

Exponentially

Logarithmically

Question 9

int arr[3] = (1,2,3);

int arr(3) = {1,2,3};

int arr[3] = {1,2,3};

int arr(3) = (1,2,3);

Question 10

Time complexity of enqueue is O(n)

Time complexity of enqueue is O(1)

Time complexity of dequeue is O(1)

​Time complexity of dequeue is O(n)

Question 11

6

4

3

2

Question 12

Error

Java program, No program

Java program,

C program, Java program, No program

Question 13

int[] arr;

int arr[[]];

int[][]arr;

int[[]] arr;

Question 14

Breadth first search algorithm employs queue data structure while depth first search uses stack data structure.

The necessary condition to detect if a circular queue of capacity (n-1) is full is (rear+1) mod n = front

Depth first search algorithm employs queue data structure while breadth first search uses stack data structure.

Time complexity of converting a fully parenthesized infix expression to postfix expression is O(n).

Question 15

4

5

ArrayIndexOutOfBoundsException

InavlidInputException

Question 16

&&

!

||

Time complexity of dequeue is O(n)