I would like to thank GEEKSFORGEEKS team that they made my confidence level high when it comes to coding. I finished my interview today, hope this could be of help to others.
Date Of Interview: 25th Aug, 3rd Sept, and 4th Sept 2012
No. of Rounds: 2 online exams + 6 rounds of PI
Type of Interview: Campus Interview for fresher’s
25-08-2012:
Online test conducted by some PARIKSHA LITE company (outsourced)
TEST 1: There were 15 questions to be done in 30 min. 6-7 of them were basic calculations and program output easy ones.
TEST 2:
A) There were 3 questions to be coded for IDC test:
- Check whether a linked list is a palindrome or not
- Whether a given sting is a new arrangement of main string (eg COXX is XXOC but not XOC)
- Convert a given sorted dynamic linked list to balanced binary search tree.
B) There were 4 question in MSIT test:
- Write merging two arrays code or pseudo code.
- Reverse a string of characters.
- Print binary representation of a given number.
- Given a control tower for aeroplane how will you make sure it does not fail. (Basically designing question )
03-09-2012:
Round1:
- A thread waiting at while(1) and thread waiting at wait(wrt), what is the difference?
- Output of following C program.
#include
#include
int main()
{
unsigned int a, b, c;
a = rand();
b = rand();
c = a + b;
if( c < a || c < b)
{
printf("correct");
}
else
{
printf("error");
}
}
- Write code to find Nth node from the last of a linked lists, and write test cases for the same.
Round2:
- Write code to implement a command called ‘tail -5 filename’ in unix file using file pointers and also write test cases (HINT using fread and fseek command)
- Write pseudo code to implement LRU in real time OS.
Round3:
- Write code to convert given number into words (eg 1234 as input should output one thousand two hundred and thirty four)
Write test cases for the same question mentioned above.
Round4:
- Write anagrams code when you are given an isWord() function in the fastest possible ways and also write test cases for that. After this the HR asked me to come on next day
04-09-2012
Round5:
- Design a database schema for college elections and how will you make sure at database end that one user can vote for one person standing for one post only.
- Write code to detect deadlocks and prevent deadlocks and implement as two separate functions.
- Write Singleton pattern code and state places with usage of keyword static and virtual.
- given two processes one that updates a database in 2 min and ot
her in 5 min. Together they take 7 min. Design a method that can reduce this to minimum possible.
- Write code to count number of nodes of a tree, find depth of a tree, find width of the tree.
Round6:
- Design a class diagram for students registering for a sport and competition being held based on which you can decide which guy wins or loses.
Rest were sort of HR questions like why microsoft, your strengths etc but in the end she said we will send your feedback to the campus placement cell, Thank you. 🙁
This article is compiled by Ankush Choudhary. If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape,
GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out -
check it out now!
Last Updated :
10 Jan, 2019
Like Article
Save Article