What will be the worst case time complexity of finding the sum of elements in a given range of (l,r) in an array of size n when we use square root optimization?

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

Given below are three quantities named 1, 2 and 3. Based on the given information, you have to determine the relationship between the three quantities. You should use the given data and knowledge of Mathematics to choose between the possible answer. Quantity 1: Area of the innermost square. A square is made by joining the midpoints of a square of area 200 sq. m. The outermost square is called Square 1, The square inside it is called Square 2. The next square is made by joining midpoints of square 2 and is called Square 3. This process goes on. Square 5 is the innermost square. Quantity 2: A man starts with a speed of 10 km/hr. He increases his speed by 10 km/hr every hour at the start and drives at the same speed for that hour. If he traveled a total distance of 550 km. Find the time Quantity 3: Height of cylinder Its volume is equal to the volume of a cone whose radius is 14 cm and height is 39.3 cm. The radius of the cylinder is 14 cm

A

Quantity 2 > Quantity 3 > Quantity 1

B

Quantity 1 > Quantity 2 > Quantity 3

C

Quantity 3 > Quantity 1 > Quantity 2

D

Quantity 1 = Quantity 2 < Quantity 3

E

Quantity 1 > Quantity 2 = Quantity 3

When subtracting the square root of the square root of 625 from the square root of the square root of 1296, which of the following number is square root of the difference?

A

1

B

4

C

9

D

25

What will be the worst case time complexity of finding the sum of elements in a given range of (l,r) in an array of size n?

A

O(n)

B

O(l+r)

C

O(l-r)

D

O(r-l)

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

Total how many iterations are required to find the sum of elements in a given range of (l,r) in an array of size n when we use square root optimization?

A

√n

B

2*√n

C

3*√n

D

n*√n

What will be the time complexity of update query operation in an array of size n when we use square root optimization?

A

O(√n)

B

O(n)

C

O(1)

D

O(n2)

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)

The worst case time complexity of insertion sort is O(n2). What will be the worst case time complexity of insertion sort if the correct position for inserting element is calculated using binary search?

A

O(nlogn)

B

O(n2)

C

O(n)

D

O(logn)

What will be the worst case time complexity of code to find sum in given query range (l,r) in an array of size n with q number of such queries?

A

O(n)

B

O(q)

C

O(n*q)

D

O(n+q)

What will be the worst case time complexity of finding the sum of elements in a given range of (l,r) in an array of size n when we use square root optimization?

Related Questions