1

GATE CSE 2021 Set 1

MCQ (Single Correct Answer)

+2

-0.67

Let P be an array containing n integers. Let t be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an arbitrary of n elements. Which one of the following choices is correct?

2

GATE CSE 2021 Set 1

MCQ (More than One Correct Answer)

+2

-0.67

Define R_{n} 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] = 1, p[2] = 5, p[3] = 8, p[4] = 9, p[5] = 10, p[6] = 17, p[7] = 18

Which of the following statements is/are correct about R_{7}?

3

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

+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 the4

GATE CSE 2004

MCQ (Single Correct Answer)

+2

-0.6

Two matrices M

_{1}and M_{2}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 M_{1}$$\times$$ M_{2}will beQuestions Asked from Arrays (Marks 2)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE Subjects

Theory of Computation

Operating Systems

Algorithms

Database Management System

Data Structures

Computer Networks

Software Engineering

Compiler Design

Web Technologies

General Aptitude

Discrete Mathematics

Programming Languages