# REVE Systems Interview Experience | Set 1 (On Campus)

The process consisted of three rounds:

Round-1 : Written Test (90 minues)
Round-2 : Technical Interview
Round-3 : HR Interview

Round-1 : Written Test (90 minutes)
There was a set of 15 Questions. The questions are given below:

Qn-1: Write a program to check if the given tree is Symmetric structure wise or not.

Example:

```       5
/   \
6     7
\   /
8 9

Symmetric

5
/   \
6     7
\     \
8     9

Not Symmetric

```

Qn-2: Write a function to delete a node from Linked List.

Qn-3: Find the output of the code and explain.

 `#include ` ` `  `int` `main() ` `{ ` `    ``char` `c = 125; ` ` `  `    ``c = c+ 10; ` ` `  `    ``printf``(``"%d"``, c); ` ` `  `return` `0; ` `} `

Qn-4: Write a C function to convert an IPv4 Address (string format) to an unsigned integer . Also write the problem Test Cases.

Qn-5: Write an efficient code snippet(function only) for achieving the following output array from a given input array. i.e. replace each array element with the greatest element on its right. Order of complexity should not exceed O(n) .

Example:

```Input: 34 13 45 7 9

Output: 45 45 9 9 -1
```

Qn-6: Explain little endian and big endian machine. What will be the output of the given code if this runs on two different machines (one in little endian and other in big endian)

 `#include ` ` `  `int` `main() ` `{ ` `    ``int` `arr[] = {1, 2, 3, 4, 5, 6}; ` `    ``char` `*ptr = (``char` `*)arr; ` `    ``printf``(``"fifth element of array = %d"``, ptr); ` ` `  `return` `0; ` `} `

Qn-7: Consider the following data base schema:

```mysql> create table Personinfo
(
personid bigint(20) primary key,
name varchar(100),
mobilenumber bigint(20)
);

mysql> create table Studentinfo
(
studentid bigint(20) primary key,
personid bigint(20),
);

mysql> alter table Studentinfo add foreign key(personid) references Personinfo(personid) ;
```

Now, following queries are run. What is the output ?

```1. insert into Personinfo(1, 'Sachin', 8894421234);

2. insert into Studentinfo(1, 2, 'Mumbai');
```

Qn-8: What will be the output of given program ? If there is any error, please mention and explain.

 `#include ` `#include ` `#include ` ` `  `struct` `person ` `{ ` `    ``char` `name; ` `    ``int` `age; ` `}; ` ` `  `int` `allocate_person(``struct` `person *me, ``int` `age) ` `{ ` `    ``me = ``malloc``(``sizeof``(``struct` `person)); ` `    ``if``(me == NULL) ` `        ``return` `0; ` ` `  `    ``me->age = age; ` `    ``strcpy``(me->name, ``"Dennis_Ritchi"``); ` ` `  `return` `1; ` `} ` ` `  `int` `main() ` `{ ` `    ``struct` `person *me = NULL; ` `    ``if``(allocate_person(me, 25)) ` `        ``printf``(``"Myage is = %d\n"``, me->age); ` `    ``else` `        ``printf``(``"Not able to find Age !!!\n"``); ` ` `  `return` `0; ` `} `

Qn-9: What will be the output of the following program ?

```#include

using namespace std;

void main()
{
char *s[] = {"Reve", "Systems", "India", "Pvt", "Ltd"};

char **p[] = {s+3, s+4, s+1, s+2};

char ***ptr;

ptr = p;

cout << *(*p);

}
```

Qn-10: What is the output of the following code snippet ?

```#include

using namespace std;
class Point
{
private:
int x, y;
public:
Point(int i = 0, int j = 0);
Point(const Point &t);
};
Point::Point(int i, int j)
{
x = i;
y = j;
cout << "Normal Constructor called\n";
}
Point::Point(const Point &t)
{
y = t.y;
cout << "Copy Constructor called\n";
}

int main()
{
Point *t1, *t2;
t1 = new Point(10, 15);
t2 = new Point(*t1);
Point t3 = *t1;
Point t4;
t4 = t3;

return 0;
}
```

Qn-11: You are given a list of n-1 integers and these integers are in the range of 1 to n. There are no duplicates in list. One of the integers is missing in the list. Write an efficient code to find the missing integer.

Qn-12: What is the output of the following code snippet ? Explain the logic behind the same.

```class Test1
{
int x = 10;
public static void main(String[] args)
{
System.out.println(x);
}
static
{
int y = 20;
System.out.print(x + " " + y);
}
}
```

Qn-13: What will be the output of the following code and explain why ?

```#include
#include

using namespace std;

class Base
{
public:
int num1, num2;
Base(int a, int b): num1(a), num2(b)()
virtual int sum()
{
return (num1 + num2);
}
};
class Derived:public Base
{
public:
int num3;
Derived(int a, int b, int c):Base(a, b), num3(c)()
virtual int sum(int num1, int num2)
{
return (num1 + num2 + num3);
}
};

{
return p.sum();
}

int main()
{
Baseb(2, 3);
Derived d(4, 5, 6);
cout << "2 + 3 = " << add_mem(b) << endl;
cout << "4 + 5 + 6 = " << add_mem(d) << endl;

return 0;
}
```

Qn-14: If a network has 85.13.210.64/28 subnet. Find number of IP addresses in this subnet and also find usable IP address range.

Qn-15: You are given a paragraph, which contains n number of words, you are given m threads. What you need to do it, each thread should print one word and give the control to next thread, this way each thread will keep one word, in case last thread come, it should invoke the first thread. Printing will repeat until all the words are printed in paragraph. Finally all threads should exit gracefully. Demonstrate with a simple pseudo code as to how you will approach the problem.

By the evening, the results were out and total 6 students were selected for further rounds. Fortunately, I was one of them 🙂

Round-2 : Technical Interview

Around 30 min interview
Qn-2: Internship description
Qn-3: What is a virtual function and Can a constructor be made virtual.
Qn-4: Constructor is used at run time or compile time ?
Qn-5: Can a constructor be made private. When do we make a constructor private.
Qn-6: Write code to implement singleton class.
Qn-7: How can you delete a node in a singly linked list, given the pointer to that node and no other pointer (or start pointer) to the list is available.
Qn-8: Given a sorted array and a variable (sum), how to find out which pair of elements in the array when summed up equals to the variable (sum). How can you solve the problem if instead of array, the list of elements are stored in a BST.
Qn-9: How many types of tree traversals do you use and what’s the advantage of inorder traversal.
Qn-10: How to check if a Binary tree is a BST.
Qn-11: Do you have any question for us.
After the technical interview was over, they declared the result after an hour and 4 students were selected for the final HR round. Fortunately, I was one of them 🙂

Round-3 : HR Interview
Around 45 mins Interview
Qn: Walk me through your life in brief, Place of birth, schooling etc.

Other general HR Questions related to relocation, adaptable to changes, work life balance etc. It was a very friendly talk.

The final result came after 5 days and out of 4, only 2 students got selected, I was one of them 🙂 .

This interview experience is of my friend POOJA DASHOTTAR (IIEST, Shibpur). It’s a suggestion from Pooja to all the students and juniors to follow GeeksForGeeks as it helped her a lot to clear the interview.

Write your Interview Experience or mail it to contribute@geeksforgeeks.org

My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Article Tags :

Be the First to upvote.

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.