Graduate Engineer Trainee

Who needs a BIOS to function properly?

• A mobile device
• An operating system
• Hardware devices
• All of the above

Which of the following is not considered a real-time operating system?

• PSOS
• LinuxRT
• VRTX
• Windows

Which of the following refers to the number of attributes in a relation?

• Degree
• Row
• Column
• All of the above

What will be the output of the following C++ code?    

#include <iostream> 

#include <algorithm> 

using namespace std; 

int main() { 

string s = "spaces in text"; 

s.erase(remove(s.begin(), 

s.end(), ' '), 

s.end()); 

cout << s << endl; 

}

What will be the output of the following C++ code?

#include <iostream>

using namespace std;

int main(int argc, char const *argv[]) {    

char s1[6] = "Hello";    

char s2[6] = "World";    

char s3[12] = s1 + " " + s2;    

cout << s3;    return 0;

}

Which of the following is not a type of queue? 

A) Priority Queue
B) Single-ended Queue
C) Circular Queue

A graph with an edge from each vertex to every other vertex is called a ___________.

The options remain the same:

a) Tightly Connected
b) Strongly Connected
c) Weakly Connected
d) Loosely Connected

A deck of 5 cards, each carrying a distinct number from 1 to 5, is shuffled thoroughly. Two cards are then removed one at a time from the deck. What is the probability that the two cards are selected, with the number on the first card being one higher than the number on the second card?

A) 1/5
B) 4/25
C) 1/4
D) 2/5

The probability that a given positive integer between 1 and 100 (both inclusive) is NOT divisible by 2, 3, or 5 is ______. 

A) 0.259 

B) 0.459 

C) 0.325 

D) 0.225

You are given an integer array ‘ARR’. You have to find the length of the shortest contiguous subarray such that, if you sort this subarray in ascending order, then the whole array will be sorted in ascending order.

An array 'C' is a subarray of array 'D' if it can be obtained by deletion of several elements(possibly zero) from the beginning and the end from array 'D'.

Example:

Let’s say we have an array 'ARR' {10, 12, 20, 30, 25, 40, 32, 31, 35, 50, 60}. Then we have to find the subarray {30 , 25 , 40 , 32 , 31 , 35} and print its length = 5 as our output. Because, when we sort this subarray the whole array will be sorted.

You have been given a circular array/list ‘ARR’ containing ‘N’ integers. You have to find out the maximum possible sum of a non-empty subarray of ‘ARR’.

A circular array is an array/list in which the end of the array connects to the beginning of the array.

A subarray may only include each element of the fixed buffer of ‘ARR’ at most once. (Formally, for a subarray ‘ARR[i]’, ‘ARR[i+1]’, ..., ‘ARR[j]’, there does not exist ‘i’ <= ‘k1’, ‘k2’ <= ‘j’ with ‘k1’ % ‘N’ = k2 % ‘N’.)

For Example:

The ‘ARR’ = [1, 2, -3, -4, 5], the subarray [5, 1, 2] has the maximum possible sum which is 8. This is possible as 5 is connected to 1 because ‘ARR’ is a circular array.