The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
520 views
IISc CD-CS written test and interview

 

General info: In IISc M.Tech Research interviews are conducted in a span of 5 days and two sessions every day(morning: 9 am and afternoon: 2 pm). The written test starts at the specified time in the call letter. There are no specific instructions regarding what to do on that day, you need to directly report to the department half an hour before your test time. In each session they first take a written test of about 30 minutes , its result is declared within next half an hour and then they call for an interview based on your preferences.

 

I had CSA interview on the 21st-morning session and CD-CS interview on 22nd May 2018.

 

CSA Written test : 10 Que in 30 minutes.

 

I’d chosen systems so the questions were from the programming, DSA, COA(cache), DBMS, Compiler, OS, probability, and permutation-combination etc. The questions were very basic thus one can easily clear written examination. I also heard that other two streams paper were easy.

 

-> cleared written

 

I was 4th in the queue for the interview.

In the room, there were 8-9 professors, each having their own field of interest.

In starting they read all my details from my application form and then asked questions related to programming [inplace reversal of singly LL] and to program it on the whiteboard. After that they asked some questions related to previous questions.  Then they switched to OS and asked some questions from scheduling and execution of the instruction from basic to advance level . A bit shorter but good experience.

 

----------------------------------------------------

 

CD-CS written test: 22nd May morning session

 

Only one paper for all different labs. They took our lab preference in another form before the test.

 

5 question in 30 minutes

Q1: given partial code for finding node at d distance from the root node and we have to complete the remaining. The question was easy but many of us struggled with the logic to their partial implementation.

Q2:Given two-persons A and B. A work x hours in a day. B starts at 11th day. However, B worked overtime and at the end of 30 days, both A and B get same payment. For this thing to happen what is the max value of X possible.

 

Q3: The question gave outline of the rainbow and of the 7 colors of the rainbow. Then asked that in how many ways we can fill it?

 

Q4: Given a deck of 10 cards numbered 1 to 10. Select 3 cards one by one. Find the probability that selected cards is in increasing order. Eg : {1, 5, 7} or {8, 9, 10} etc

 

Q5: with n vertices and self-loops allowed, how many undirected graphs possible?

 

After some time they declared shortlisted candidates and 7-8 students got selected for systems interview and 15-17 for Data science research from a total of 46 students.

 

->cleared written.

 

I was 3rd in the queue for the interview.

 

In the roundtable, there were three profs. for taking the interview. Like in CSA, first they go through my details from application and option form. Then they began with algorithms. First, they asked about graph coloring problem. Then they asked for diff approaches to the solution and asked me to code it on the whiteboard. They also asked me to explain the code and find it’s time complexity. Then they’d asked about overlapping range problem. So, I gave the algorithm and also implemented the code on board.

Then they switched to OS and asked about scheduling, round robin(what is going on in the background in round robin) and other things related to scheduling and virtual memory. The interview ended here.
posted Jun 24 in Interview Experience by (25 points) | 520 views
1
Like
0
Love
0
Haha
0
Wow
0
Angry
0
Sad

1 Comment

Hi rushit,

Q4: Given a deck of 10 cards numbered 1 to 10. Select 3 cards one by one. Find the probability that selected cards is in increasing order. Eg : {1, 5, 7} or {8, 9, 10} etc

Answer- 10C3 /( 10C3 * 3!)= 1/6  please verify the answer and procedure

Q5: with n vertices and self-loops allowed, how many undirected graphs possible?

Answer-  2^((n^2 + n)/2) please verify the answer
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

42,557 questions
48,547 answers
155,292 comments
63,502 users