IIT D :
Type : Online
Platform : Interview Street
Duration : 90 min
Hint : You can use IDE's to code.
20 MCQ + 2 Coding Questions
Coding Questions :
Q1. There are m stations and n houses, (x,y) coordinates of each station and house are given, output nearest station for each house
Q2. n coins are given,you play a game against an opponent, you need to pick one coin at a time from either end, person having minimum coin values will win, also there is a golden coin with value 0,if a player picks a golden coin then he wins immediately. Find out the minimum possible values of coin needed to be picked by first player for winning.
IIT M:
Some MCQs are:
1. how many bits are required to represent mac address
2. last nonzero digit in (551)!
3. minimum number of nodes in a complete binary search tree
4. how many ways a garland of atleast 2 roses,3 lilies, 1 lotus..flst 5 flowers can be formed?
5. which data structure is used for efficient sequential insertion and searching?
6. we have to store the likes in facebook so that the people who liked this are showed in sorted order(alphabetically). Which data structure can be used?
7. digital signature in cryptography is ( a. symmetric b. asymmetric c.both(a & b) d. advanced), Some RDBMS qs Unix commands ,Network qs
Coding:
1. Find the botttom view of a binary tree.
2. Don't remember
No comments:
Post a Comment