IIT D:
Type : Online
Platform : Interview Street
Platform : Interview Street
Duration : 90 min
-0.25 negative marking
20 MCQ + 2 Coding
For MCQ’s go through last 5 years GATE papers
IIT G :
some of the MCQs are :
1) Huffman code for a,b,c,d,e
2) Initially 5 numbers stored in max heap. level order given. 2 new number inserted . find new
level order.
3) If P(a) =1,P(b)=1/2 and P(c) =1/3 and a,b,c are independent, find P(a/b)P(b/c)P(c/a). this
question was repeated.
4) 3 men playing a game with coin, whoever gets first head wins. find the probability of winning
of 3rd guy....
5) one code was there on tree. It was finding the height of tree.
6) 2 questions on recursion. cvf
7) 11 players team. age of captain=26 and wicketkeeper=29 given. avg age of team = avg age of team without captain and wicketkeeper +1, find the avg age of team
8) Arranging time complexities.
9) in insertion sort if we use binary search instead of internal loop, what would be the time complexity.
IIT K :
Coding questions
1) Check if given two strings are anagrams( ignore spaces and don’t consider case sensitive
cases)
2) given array of strings of dates in dd/mm/yyyy form , write a program to sort them rings of dates in dd/mm/yyyy form , write a program to sort them
IIT D :
1. one Probabity
2. one reasoning
3. one java
4. one network question subnet mask question.
5. TOC question (a+b*) and (a+b)* same language or subset.
Coding Questions :
1) find in a array different number of pairs with difference k. Array has unique elements.
2) Second questions was same as
http://www.geeksforgeeks.org/forums/topic/directi-coding-round-2/
IIT M:
coding:
1. List all the repeated characters lexicographically in a string(if ‘a’ & ‘A’ are there, that also counts as a repetition.
2. print the 90 degree rotation of a matrix.
IIT G :
1. Find the minimum distance between 2 numbers.
http://www.geeksforgeeks.org/find-the-minimum-distance-between-two-numbers/
2. Sum of 3 linked lists.
IIT B :
1 Coin change problem: Given a “sum” and denominations of coins, find minimum number of
coins required to make the “sum”.
2. Find anagram pairs in an array of strings. Check should be case insensitive.
IIT H:
1. First nonrepetitive character in string.
2. Next higher number with same digits .
http://stackoverflow.com/questions/2553522/interview-question-check-if-one-string-is-a-rotation-of-other-string
IIT Kgp :
1. Left view of binary tree
http://www.geeksforgeeks.org/print-left-view-binary-tree/
2. Given n points, find 3 nearest points from each
Input:n (no of points)
then n lines each containing id,x,y
Output:
n lines each containing id of 3 nearest points
Q: Given a square matrix of size n containing positive integers. Find the greatest submatrix(square or otherwise) which is sorted both rowwise and columnwise in increasing order. A matrix is sorted rowwise, if all the elements in any row are sorted in increasing order. And similarly, a matrix is sorted columnwise, if all the elements in any column are sorted in increasing order. Greatest submatrix is defined as the submatrix containing the maximum number of elements.
eg
2 5 3 8 3
1 4 6 8 4
3 6 7 9 5
1 3 6 4 2
2 6 4 3 1
has the greatest submatrix as
1 4 6 8
3 6 7 9
NIT W :
1 . http://www.geeksforgeeks.org/sum-of-two-linked-lists/
2 . http://www.geeksforgeeks.org/check-if-a-given-binary-tree-is-sumtree/
20 MCQ + 2 Coding
For MCQ’s go through last 5 years GATE papers
20 MCQs : aptitude, data structures, os, C
IIT G :
some of the MCQs are :
1) Huffman code for a,b,c,d,e
2) Initially 5 numbers stored in max heap. level order given. 2 new number inserted . find new
level order.
3) If P(a) =1,P(b)=1/2 and P(c) =1/3 and a,b,c are independent, find P(a/b)P(b/c)P(c/a). this
question was repeated.
4) 3 men playing a game with coin, whoever gets first head wins. find the probability of winning
of 3rd guy....
5) one code was there on tree. It was finding the height of tree.
6) 2 questions on recursion. cvf
7) 11 players team. age of captain=26 and wicketkeeper=29 given. avg age of team = avg age of team without captain and wicketkeeper +1, find the avg age of team
8) Arranging time complexities.
9) in insertion sort if we use binary search instead of internal loop, what would be the time complexity.
IIT K :
Coding questions
1) Check if given two strings are anagrams( ignore spaces and don’t consider case sensitive
cases)
2) given array of strings of dates in dd/mm/yyyy form , write a program to sort them rings of dates in dd/mm/yyyy form , write a program to sort them
IIT D :
1. one Probabity
2. one reasoning
3. one java
4. one network question subnet mask question.
5. TOC question (a+b*) and (a+b)* same language or subset.
Coding Questions :
1) find in a array different number of pairs with difference k. Array has unique elements.
2) Second questions was same as
http://www.geeksforgeeks.org/forums/topic/directi-coding-round-2/
IIT M:
coding:
1. List all the repeated characters lexicographically in a string(if ‘a’ & ‘A’ are there, that also counts as a repetition.
2. print the 90 degree rotation of a matrix.
IIT G :
1. Find the minimum distance between 2 numbers.
http://www.geeksforgeeks.org/find-the-minimum-distance-between-two-numbers/
2. Sum of 3 linked lists.
IIT B :
1 Coin change problem: Given a “sum” and denominations of coins, find minimum number of
coins required to make the “sum”.
2. Find anagram pairs in an array of strings. Check should be case insensitive.
IIT H:
1. First nonrepetitive character in string.
2. Next higher number with same digits .
http://stackoverflow.com/questions/2553522/interview-question-check-if-one-string-is-a-rotation-of-other-string
IIT Kgp :
1. Left view of binary tree
http://www.geeksforgeeks.org/print-left-view-binary-tree/
2. Given n points, find 3 nearest points from each
Input:n (no of points)
then n lines each containing id,x,y
Output:
n lines each containing id of 3 nearest points
Q: Given a square matrix of size n containing positive integers. Find the greatest submatrix(square or otherwise) which is sorted both rowwise and columnwise in increasing order. A matrix is sorted rowwise, if all the elements in any row are sorted in increasing order. And similarly, a matrix is sorted columnwise, if all the elements in any column are sorted in increasing order. Greatest submatrix is defined as the submatrix containing the maximum number of elements.
eg
2 5 3 8 3
1 4 6 8 4
3 6 7 9 5
1 3 6 4 2
2 6 4 3 1
has the greatest submatrix as
1 4 6 8
3 6 7 9
NIT W :
1 . http://www.geeksforgeeks.org/sum-of-two-linked-lists/
2 . http://www.geeksforgeeks.org/check-if-a-given-binary-tree-is-sumtree/
No comments:
Post a Comment