Graduate Engineer Trainee

You are given an array of size ‘N’. The elements of the array are in the range from 1 to ‘N’.

Ideally, the array should contain elements from 1 to ‘N’. But due to some miscalculations, there is a number R in the range [1, N] which appears in the array twice and another number M in the range [1, N] which is missing from the array.

Your task is to find the missing number (M) and the repeating number (R).

For example:

Consider an array of size six. The elements of the array are { 6, 4, 3, 5, 5, 1 }. 
The array should contain elements from one to six. Here, 2 is not present and 5 is occurring twice. Thus, 2 is the missing number (M) and 5 is the repeating number (R). 

Follow Up

Can you do this in linear time and constant additional space? 

nteger value, n
Set value = 1, n = 45
while(value less than equal to n)
 value = value << 1
end loop
Print value

A 16
B 32
C 64
D 36

Integer a, b, c 
Set b = 4, c = 5 
for(each a from 2 to 4) 
 print c 
 b = b - 1 
 c = c + b 
end for
A
5 8 10
B
1 3 6
C
8 9 10
D
3 6 9

#include 
int main()
{
if (remove("myfile.txt") != 0)
 perror("Error");
else
 puts("Success");
return 0;
}

Options:
a) Error
b) Success
c) Runtime Error
d) Can’t say

Which type of data can be stored in the database?
a) Image-oriented data
b) Text, files containing data
c) Data in the form of audio or video
d) All of the above

CPU scheduling is the basis of 
a) multiprogramming operating systems
b) larger memory sized systems
c) multiprocessor systems
d) none of the mentioned

A boat can travel at a speed of 13 km/hr in still water. If the speed of the stream is 4 km/hr, find the time taken by the boat to go 68 km downstream.

A. 2 hours
B. 3 hours
C. 4 hours
D. 5 hours

You are given an integer ‘NUM’ . Your task is to find out whether this number is an Armstrong number or not.

A k-digit number ‘NUM’ is an Armstrong number if and only if the k-th power of each digit sums to ‘NUM’.

Example

153 = 1^3 + 5^3 + 3^3.

Therefore 153 is an Armstrong number.

You are given a string 'str' of length 'N'.

Your task is to reverse the original string word by word.

There can be multiple spaces between two words and there can be leading or trailing spaces but in the output reversed string you need to put a single space between two words, and your reversed string should not contain leading or trailing spaces.

Example :

If the given input string is "Welcome to Coding Ninjas", then you should return "Ninjas Coding to Welcome" as the reversed string has only a single space between two words and there is no leading or trailing space.

You are given a Singly Linked List of integers. Return true if it has a cycle, else return false.

A cycle occurs when a node's next points back to a previous node in the list.

Example:

In the given linked list, there is a cycle, hence we return true.

You have been given a number of stairs. Initially, you are at the 0th stair, and you need to reach the Nth stair.

Each time, you can climb either one step or two steps.

You are supposed to return the number of distinct ways you can climb from the 0th step to the Nth step.

Example :

N=3

We can climb one step at a time i.e. {(0, 1) ,(1, 2),(2,3)} or we can climb the first two-step and then one step i.e. {(0,2),(1, 3)} or we can climb first one step and then two step i.e. {(0,1), (1,3)}.

You are given a positive integer 'N'. Your task is to return all the prime numbers less than or equal to the 'N'.

Note:

1) A prime number is a number that has only two factors: 1 and the number itself.

2) 1 is not a prime number.

Which will be used with physical devices to interact with C++ programs?
a) Programs
b) Library
c) Streams
d) Iterators

There are 3 women and 3 men They all have to cross a river in a boat. The boat can only carry two people at a time. As long as there are an equal number of devils and priests, then devils will not eat Priest. If the number of devils is greater than the number of priests on the same side of the river then devils will eat the priests. So how can we make all the 8 people arrive on the other side safely?

What is the time complexity used for inserting a node in a priority queue based on key is:

Which of the following is a linear data structure?
a> array
b> AVL tree
c> binary search
d> graph

You are given an integer ‘N’, your task is to find and return the N’th Fibonacci number using matrix exponentiation.

Since the answer can be very large, return the answer modulo 10^9 +7.

Fibonacci number is calculated using the following formula:

F(n) = F(n-1) + F(n-2), 
Where, F(1) = F(2) = 1.

For Example:

For ‘N’ = 5, the output will be 5.

Difference between overriding and overloading
What is polymorphism?

what is the static class?

what is a constructor?

Types of constructors?

In C++ he asked to share screen and write syntaxes of string compare and syntaxes of polymorphism types.

Q1> What is super key?
Q2> What is primary key?
Q3> What is normalisation?

You are given an integer ‘N’. We can reorder the digits in any order (including the original order) such that the leading digit is not zero.

Return true if and only if we can do this so that the resulting number is a power of two. Else, return false.

For Example :

Given :-
‘N’ = 218
Then the answer will be true because it can be rearranged to 128, which is 2 raised to the power of 7.