1
GATE CSE 2021 Set 1
MCQ (More than One Correct Answer)
+2
-0.67

Define Rn to be the maximum amount earned by cutting a rod of length n meters into one or more pieces of integer length and selling them. For i > 0, let p[i] denotes the selling price of a rod whose length is i meters. Consider the array of prices:

p = 1, p = 5, p = 8, p = 9, p = 10, p = 17, p = 18

Which of the following statements is/are correct about R7?

A
R7 cannot be achieved by a solution consisting of three pieces.
B
R7 = 19
C
R7 = 18
D
R7 is achieved by three different solutions.
2
GATE CSE 2014 Set 1
+2
-0.6
Consider the following C functions in which size is the number of elements in the array E:
int MyX(int *E, unsigned int size){
int Y = 0;
int Z;
int i,j,k;
for(i = 0; i < size; i++)
Y = Y + E[i];
for(i = 0; i < size; i++)
for(j = i; j < size; j++){
Z = 0;
for(k = i; k <= j; k++)
Z = Z + E[k];
if(Z > Y)
Y = X;
}
return Y;
}

The value returned by the function MyX is the
A
Maximum possible sum of elements in any sub-array of array E.
B
Maximum element in any sub-array of array E.
C
Sum of the maximum elements in all possible sub-arrays of array E.
D
The sum of all elements in the array E.
3
GATE CSE 2004
+2
-0.6
Two matrices M1 and M2 are to be stored in arrays A and B respectively. Each array can be stored either in row-major or column-major order in contiguous memory locations. The time complexity of an algorithm to compute M1$$\times$$ M2 will be
A
Best if A is in row-major and B is in column-major order
B
Best if both are in row-major order
C
Best if both are in column-major order
D
Independent of the storage scheme
4
GATE CSE 1998
+2
-0.6
Let A be a two dimensional array declared as follows:
A : array [ 1... 10] [1... 15] of integer;
Assuming that each integer takes one memory locations the array is stored in row-major order and the first element of the array is stored at location 100, what is the address of the element A[i] [j]?
A
15i + j + 84
B
15j + i + 84
C
10i + j + 89
D
10j + i + 89
GATE CSE Subjects
Discrete Mathematics
Programming Languages
Theory of Computation
Operating Systems
Digital Logic
Computer Organization
Database Management System
Data Structures
Computer Networks
Algorithms
Compiler Design
Software Engineering
Web Technologies
General Aptitude
EXAM MAP
Joint Entrance Examination