Consider the Quick sort algorithm in which the partitioning procedure splits elements into two sub-arrays and each sub-array contains at least one-fourth of the elements. Let T(n) be the number of comparisons required to sort array of n elements. Then T(n)<=?

Consider the following two C code segment. Y and X are one- and two-dimensional arrays of size n and n × n respectively, where 2 ≤ n ≤ 10. Assume that in both code segments, elements of y are initialized to 0 and each element X[i] [j] of array X is initialized to i + j. Further assume that when stored in main memory all elements of x are in same main memory page frame. Code segment 1: //initialize elements of y to 0 //initialize elements X[i] [j] of X to i+j for (i = 0; i < n; i++) Y[i] += X[0] [i]; Code Segment 2: //initialize elements of Y to 0 //initialize elements X[i] [j] of X to i+j for (i = 0; i < n; i++) Y[i] += X[i] [0]; Which of the following statements is/are correct? S1: Final contents of array Y will be same in both code segments S2: Elements of array X accessed inside the for loop shown in code segment 1 are contiguous in main memory S3: Elements of array X accessed inside the for loop shown in code segment 2 are contiguous in main memory

A

Only S3 is correct

B

Only S2 is correct

C

Only S1 and S2 are correct

D

Only S1 and S3 are correct

Let Xij =I { zi is compared to zj in quick sort algorithm} is an indicator variable, and zi is the ith smallest number. Which of the following sequence of the numbers give the X2,5 = 1? Note: Assume that there is a divide and conquer quick sort algorithm and in partition algorithm the first element of the lists is taken as pivot-element.

A

40, 50, 10, 20, 30

B

10, 20, 50, 30, 40

C

40, 20, 10, 30, 50

D

30, 20, 10, 40, 50

A teacher asked the class to subtract 5 from 75.70% of the class said: 25. Their work was shown as: \(\begin{array}{*{20}{c}} {\begin{array}{*{20}{c}} 7&5 \end{array}}\\ {\underline {\begin{array}{*{20}{c}}\ { - 5} \ \ \ &{} \end{array}} }\\ {\underline {\begin{array}{*{20}{c}} 2&5 \end{array}} } \end{array}\) Which of the following describes the most appropriate remedial action that the teacher should take to clarify this misconception?

A

Revise the concept of place value and asking students to explain the process they have used to solve the problem

B

Revise the rule of subtraction of 1-digit numbers from 2-digit numbers that digits should be written from right to left.

C

Give more practice on simpler problems like subtracting 1-digit numbers.

D

Use a number line to explain how subtraction is done

Consider the Quick sort algorithm which sorts elements in ascending order using the first element as pivot. Then which of the following input sequence will require a maximum number of comparisons when this algorithm is applied on it?

A

22 25 56 67 89

B

52 25 76 67 89

C

22 25 76 67 50

D

52 25 89 67 76

Which of the following statements is not true about a splitting rule at internal nodes of the tree based on thresholding the value of a single feature? , where i ∈ is the index of the relevant feature b) It move to the right or left child of the node on the basis of 1, where ϑ ∈ R is the threshold c) Here a decision tree splits the instance space, X = Rd, into cells, where each leaf of the tree corresponds to one cell d) Splits based on thresholding the value of a single feature are also known as multivariate splits

A

It move to the right or left child of the node on the basis of 1, where i ∈ is the index of the relevant feature

B

xi < ϑ

C

xi < ϑ

D

xi < ϑ

Two splits A and B are ventilated from an intake airway. Resistances of the splits are 0.5 Ns²m^-8 and 0.8 Ns²m^-8 respectively. A regulator is placed in split B to maintain a flow of 15 m³/s and 10 m³/s in splits A and B respectively as shown in the figure. The size of the regulator in m² is
Mine Ventilation mcq question image

A

2.1

B

1.3

C

1.2

D

1.13

There are two rows, each containing 3 numbers. Below are some rules to be used to get the resultant number for each row separately. Use the rule from left to right for each row and find the answer to the question. Rule: 1. If an even number is followed by an even number, then the first number will be subtracted from the second. 2. If an odd number is followed by an odd number, then both will be added. 3. If an odd number is followed by an even number, then the even number will be subtracted from the square of the odd number. 4. If an even number is followed by an odd number, then the odd number will be subtracted from the even number. Row I: 9,11, 34 Row II: 16, 9, 8 What is the difference between the resultant numbers in the first row and the second row

A

19

B

37

C

27

D

55

The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many passes will be done to sort the array?

A

4

B

2

C

1

D

3

Which of the following statements are correct? (i) All elements of an array are ints (ii) All elements of an array are floats (iii) Some elements of an array can be ints and other floats (iv) All elements of an array are chars

A

(i) (ii) and (iii)

B

(i), (ii) and (iv)

C

(ii), (iii) and (iv)

D

(i), (iii) and (iv)

A class III mathematics teacher gave the following questions to her students: \(\begin{equation} \frac{ \begin{array}[b]{r} 256 \\ + 173 \end{array} }{ } \end{equation}\) \(\begin{equation} \frac{ \begin{array}[b]{r} 28 \\ + 32 \end{array} }{ } \end{equation}\) \(\begin{equation} \frac{ \begin{array}[b]{r} 129 \\ + 76 \end{array} }{ } \end{equation}\) Later she asks the students to solve a worksheet that has similar questions. Which of the following statements is appropriate for the given situation?

A

It is an example of contextual question

B

It is an example of open ended task

C

Teacher should have asked the students to solve ten more such questions as a home task to save the time

D

The tasks is based on drill and practice and should be discouraged at primary level

Consider the Quick sort algorithm in which the partitioning procedure splits elements into two sub-arrays and each sub-array contains at least one-fourth of the elements. Let T(n) be the number of comparisons required to sort array of n elements. Then T(n)<=?

Related Questions