Unit 1[DSPS]

1.

1 point

The data structure required to evaluate a postfix expression is

queue

stack

array

linked-list

2.

2 points

Evaluate for P = True, Q=True , R=False, S=Falsei) A= (P AND Q) OR R ii) A= Q OR S AND P

i) is True ii) is true

i)is true ii) is false

. i) is false ii) is true

i) False ii) False

3.

1 point

Following is true for understanding a problem

Knowing the knowledge base

Understanding the subject on which the

Communication with the client

All of the above

4.

1 point

Which of the following is an 8-byte Integer?

Char

long

short

byte

5.

1 point

O-notation provides an asymptotic

upper bound

lower bound

light bound

Both Lower & upper bound

6.

2 points

The expression 4 + 6 / 3 * 2 - 2 + 7 % 3 evaluates to

3

4

6

7

7.

2 points

Which of the following operators takes only integer operands ?

+

*

/

%

8.

1 point

There are ________ steps to solve the problem

Five

Four

Six

Two

9.

1 point

Which of the following case does not exist in complexity theory

Best case

Worst case

Average case

Null case

10.

2 points

If i j,k are integer variable with values 1,2,3 respectively, then what is the value of the expression!((j + k) > (i + 5))

6

5

1

0

11.

1 point

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

Sorting

Merging

Inserting

Traversal

12.

2 points

What is the postfix form of the following prefix expression -A/B*C$DE

ABCDE$*/-

A-BCDE$*/-

ABC$ED*/-

A-BCDE$*/

13.

1 point

Conditional operator can operate on__________operands

1

2

3

4

14.

2 points

Evaluate 5*(X+Y) – 4 * Y/(Z+6), where X=2, Y=3, Z=6

1

24

22

0

15.

1 point

Variable names beginning with underscore is not encouraged. Why?

It is not standardized

To avoid conflicts since assemblers and loaders use such names

To avoid conflicts since library routines use such names

To avoid conflicts with environment variables of an operating system

16.

1 point

The space factor when determining the efficiency of algorithm is measured by

Counting the maximum memory needed by the algorithm

Counting the minimum memory needed by the algorithm

Counting the average memory needed by the algorithm

Counting the maximum disk space needed by the algorithm

17.

2 points

The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort

6

5

7

8

18.

1 point

The case keyword is followed by ?

Float values

Character values

integer values

Both b and c

19.

2 points

Evaluate for A=5, B=4, C=3, D=12 for the equation E= A * B + D / C

40

24

10

34

20.

2 points

"Consider the function

find ( int x, int y)

{

return (( x < y ) ? 0 : ( x - y ));

}

Let a, b be two non-negative integers.
The call find{ a, find(a, b)} can be used to find the
"

maximum of a, b

positive difference of a, b

sum of a, b

minimum of a, b

21.

1 point

Two main measures for the efficiency of an algorithm are

Processor and memory

Complexity and capacity

Time and space

Data and space0

22.

2 points

The postfix form of A*B+C/D is

*AB/CD+

AB*CD/+

A*BC+/D

ABCD+/*

23.

2 points

The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is

600

350

650

588

24.

2 points

The prefix form of A-B/ (C * D ^ E) is,

-/*^ACBDE

-ABCD*^DE

-A/B*C^DE

-A/BC*^DE

25.

1 point

int i = 5; is a statement in a C program.

during execution, value of i may change but not its address

during execution both the address and value may change

repeated execution may result in different addresses for i

i may not have an associated address

26.

1 point

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

int number

float rate

int variable_count

int $main

27.

1 point

Which of the following is NOT an Integer?

Char

Byte

Integer

Short

28.

2 points

Evaluate the following A= False, B=True, C=False D=Truei) R= A AND B OR C AND D ii) R=NOT(A AND B) OR NOT(D AND C)

i) is True ii) is true

i)is true ii) is false

i) is false ii) is true

i) False ii) False

29.

1 point

The Average case occur in linear search algorithm

When Item is somewhere in the middle of the array

When Item is not in the array at all

When Item is the last element in the array

When Item is the last element in the array or is not there at all

30.

1 point

A floating point number contains......?

Both integral and fractional part

Fractional part only

Integral part only

None of these

31.

1 point

To access the members of a structure, which symbol is used ?

*

/

,

.

32.

2 points

What is the postfix form of the following prefix *+ab–cd

ab+cd–*

abc+*–

ab+*cd–

33.

1 point

The quick sort algorithm exploit _________ design technique

Greedy

Dynamic programming

Divide and Conquer

Backtracking

34.

1 point

In C programming language, which of the following operators has the highest precedence?

Unary +

*

>=

35.

2 points

A sort which relatively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called

insertion sort.

selection sort.

heap sort.

quick sort.

36.

1 point

The variables which can be accessed by all modules in a program, are called

local variables

internal variables

external variable

global variables

37.

2 points

Evaluate the following for the values A=5, B=2, C=true, D=Falsei)R= A + 3 > B – 1 AND C OR D ii)R=NOT C OR D OR A-3 <=B

i) is True ii) is true

i)is true ii) is false

i) is false ii) is true

i) False ii) False

38.

1 point

The Worst case occur in linear search algorithm when

Item is somewhere in the middle of the array

Item is not in the array at all

Item is the last element in the array

Item is the last element in the array or is not there at all

39.

2 points

The complexity of merge sort algorithm is

O(n)

O(log n)

O(n2)

O(n log n)

40.

2 points

The complexity of Bubble sort algorithm is

O(n)

O(log n)

O(n2)

O(n log n)

41.

1 point

Input/output function prototypes and macros are defined in which header file?

conio.h

stdlib.h

stdio.h

dos.h

42.

2 points

Evaluate for A=5, B=4, C=3, D=12 for the equation E= 5 * A \ D * ( B + 1 )

10

24

0

1

43.

1 point

The Random() is a _______

String function

Conversion Function

Utility Function

Statistical function

44.

1 point

________ is an identifier whose content is read only and cannot be changed during the program's execution of the program.

Constant

integer

literal

variable

45.

1 point

In C programming language, which of the following operators has the highest precedence?

Unary +

*

>=

equal to

46.

2 points

The postfix form of the expression (A + B)∗(C∗D − E)∗F / G is

AB + CD∗E − FG /∗∗

/ AB + CD ∗ E − F ∗∗G

/ AB + CD ∗ E − ∗F ∗ G

/ AB + CDE ∗ − ∗ F ∗ G

47.

1 point

Which symbol is used to declare a pointer ?

&

@

*

$

48.

2 points

The postfix equivalent of the prefix * + ab - cd is ?

ab + cd

abcd +

ab + cd *

ab +

49.

1 point

Which of the following is a legal identifier?

12age

age+2

_my_age

my@age

50.

2 points

The hierarchy of operations is denoted as____

<,>,<=,>=

+,-

OR

NOT