NIELIT STQC 2021 Quiz-35

Consider the following CFG.

A → C* A|E

C → C – E | E

E → a

Choose the correct statement for the above CFG.

If array A of 'n' elements contains atmost 'n' inversions, then which of the following statement is TRUE?

I. Insertion sort takes O(n) for sorting the array of 'n' elements of 'A'.

II. Selection sort takes O(n²) for sorting the array of 'n' elements of 'A'.

In 32 bit IEEE floating-point representation represents(-1.75)₁₀, its hexadecimal value is _________.

What is the output of the following c-code [ Consider size of int as 4 Bytes]?

Consider the following relational schema R(ABCDEFG) with FD set

{AB → C, BC → A, AC → B, B → D, D → E}. What is the minimum relations required to decompose R into BCNF which satisfy lossless join and dependency preserving decomposition?

The output Y in the circuit below is always “1” when

For a rectangular distribution with the variable X lying between 1 and 2, the mean of the variable is:

You throw a fair die. If an odd number turns up you get that number of rupees. If an even number occurs you pay that number of rupees.

What is the value of your expectation in rupees for each throw?

Let and are partial orders on a set .

Consider the following statements.

: is a partial order

is a partial order

Which of the following is true?

A quiz contest has the following rules:

There are 10 stages to pass through.

For passing through the first stage, 50 points are given.

For passing through the n^th stage, additional (5n+20) points are given, where n = 2, 3, ……, 9, 10

If someone passes through all 10 stages, what is the final score?