Written Test
Technical round -1
Technical round - 2
- structures:
struct t{
int a;
int b;
};
t c[100] = {{1,2},{3,4},{5,6}. . . . };
t *tmp = (t*) &c[1].b;
tmp->a=100;
tmp->b=200;
Answer and explaining what values changes
- Binary search - input array is either ascending or descending, detect and do search! (give most optimized sol possible).
- 240 students marks list is given.Generate the report and marks count of students
0-10 - ,
11-20
.
.
.
.
91-100
Give a solution, use any DS if you want, give optimize solution!
-> After i gave answer with hashing,
hash function calculates upper bound and lower bound, so extended question on that for bin size 0-5.
- Given a list of names of unknown length, store them dynamically in contagious locations
- Talk about different databases in market (as I had mention of MongoDB in my Internship Experience)
- Talk about NoSQL Database and SQL databases (since I gave him few reasons why I found MongoDB more cool over SQL database over some areas).
- Questions on Internship Experience, schooling, College. Casual one on one talk about their company, asked me if I've any questions to ask.
HR Round - 1
HR Round - 2
