Upcoming SlideShare
×

# Sure interview datastructure-1103

2,254 views

Published on

1 Like
Statistics
Notes
• Full Name
Comment goes here.

Are you sure you want to Yes No
• Be the first to comment

Views
Total views
2,254
On SlideShare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
93
0
Likes
1
Embeds 0
No embeds

No notes for slide

### Sure interview datastructure-1103

5. 5. Searchphone book 1. given name, find the phone number. 2. given first name, find the last name and phone number. 3. both direction 4. wild card support.submit my answer Searchcompare data structuresCompare different data structures, such as link, vector, list, queue, stack, set, and map.What are their pros and cons?submit my answer
6. 6. Graph SearchDesign data structure to store and operate on very sparse matrix.Design data structure to store and operate on very sparse matrix, which supports following operation: 1. multiply. 2. subtract. 3. check if links exists in the matrix.origsubmit my answer Searchteams of best friendshttp://www.mitbbs.com/article_t/JobHunting/31617589.htmlsubmit my answer Searchbipartite matching problemA binary matrix is like below:A B Ca 1 0 1b 0 1 1c 1 1 1lets say person a is available for job A can you write a program to list all possible assignment combinations in a format likebelow:A B Ca b ca c bc b a( each person can only be assigned to one job)submit my answer Searchshortest path algorithmexplain shortest path algorithmsubmit my answer SearchDesign a game which transform a word to the target word. one letter is replaced at each step.Design a game: which transform a word to a target word. for example: from he ad to tail, each step, you just can replace onecharacter, and the word must be valid.oirgsubmit my answer SearchGraph traversalhttp://www.mitbbs.com/article_t/JobHunting/31650275.html
7. 7. submit my answer Searchminimal set of words to understand half of the sentencesTheres a book and each sentence consists of several words. How to find the minimal set of words which can used by thereader to understand half of total number of the sentences. Each sentence is readable if the reader know all the words.submit my answer
8. 8. Hash Table SearchWhat is the difference between HashTable and binary search tree?What is there time complexity of following operation? 1. insertion. 2. lookupsubmit my answer SearchHashTable knowledge How to resolve conflicts Loading factorsubmit my answer
9. 9. Heap Searchimplement siftup (siftdown) for heaporigsubmit my answer