Time Left - 15:00 mins
ISRO 2018 : CS MiniMock - 1
Attempt now to get your rank among 1112 students!
Question 1
Which of the following algorithm solves the all-pair shortest path problem?
Question 2
The output of a lexical analyzer is
Question 3
Which is/are true –
i) Router is a modem in WiFi connection
ii) Android mobile can be acting as server
iii) Network access layer attaches MAC address of sender's & receiver's computer to actual message
i) Router is a modem in WiFi connection
ii) Android mobile can be acting as server
iii) Network access layer attaches MAC address of sender's & receiver's computer to actual message
Question 4
The most appropriate matching for the following pairs:
List - I
X: Indirect Addressing
Y: Immediate Addressing
Z: Auto Decrement Addressing
List – II
1. Loop
2. Pointers
3. Constants
List - I
X: Indirect Addressing
Y: Immediate Addressing
Z: Auto Decrement Addressing
List – II
1. Loop
2. Pointers
3. Constants
Question 5
#include <iostream>
using namespace std;
class A
{
float a;
public:
A(){}
A(float k)
{
a=k;
}
void fun()
{
if(a%2.5==0)
cout<<"GATE2018";
else
cout<<"NONE";
}
};
int main(){
A a1;
a1=2.5;
a1.fun();
return 0;
}
What is true about this code ?
using namespace std;
class A
{
float a;
public:
A(){}
A(float k)
{
a=k;
}
void fun()
{
if(a%2.5==0)
cout<<"GATE2018";
else
cout<<"NONE";
}
};
int main(){
A a1;
a1=2.5;
a1.fun();
return 0;
}
What is true about this code ?
Question 6
Which of the following concurrency control protocol ensures both conflict serializability and free from deadlock?
Question 7
What is the minimum number of two-input NAND gates used to perform the function of two input OR gate?
Question 8
Which one of the following Boolean expressions is a tautology?
Question 9
Using Newton-Raphson method, a root correct to 3 decimal places of the equation 
Question 10
Process is
Question 11
Assume the Module 1 was 120 LOC and Module 2 was 80 LOC. Also take one programmer day as 400 minutes
|
Day |
Start |
Stop |
Interruptions |
Task |
|
Day 1 |
8.30 |
16.30 |
60 min for lunch |
Module 1 coding |
|
Day 2 |
9.00 |
17.00 |
30 min for lunch |
Module 1 coding |
|
Day 3 |
9.00 |
17.30 |
30 min for lunch 60 min for meeting |
Module 2 coding |
|
Day 4 |
7.30 |
12.00 |
Module 2 coding |
Question 12
Which one of the following is FALSE?
- 1112 attempts
- 5 upvotes
- 7 comments
Tags :
GATE & PSU CSGeneralMar 30GATE & PSU CS
