Question 1 : In a bipartite graph G=(V,U,E), the matching of a free vertex in V to a free vertex in U is called?
1. Bipartite matching
2. Cardinality matching
3. Augmenting
4. Weight matching
View Answer   Discuss with Members

Question 2 : In case of stability, how many symmetric possibilities of trouble can occur?
1. 1
2. 2
3. 4
4. 3
View Answer   Discuss with Members

Question 3 : If there are n couples who would prefer each other to their actual marriage partners, then the assignment is said to be unstable.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 4 : When a free man proposes to an available woman, which of the following happens?
1. She will think and decide
2. She will reject
3. She will replace her current mate
4. She will accept
View Answer   Discuss with Members

Question 5 : Given input string = “ABCDABCATRYCARCABCSRT” and pattern string = “CAT”. Find the first index of the pattern match using quick search algorithm.
1. 2
2. 6
3. 11
4. 14
View Answer   Discuss with Members

Question 6 : The searching phase in quick search algorithm has good practical behaviour.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 7 : Quick search algorithm starts searching from the right most character to the left.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 8 : What is the space complexity of quick search algorithm?
1. O(n)
2. O(log n)
3. O(m+n)
4. O(mn)
View Answer   Discuss with Members

Question 9 : Who created the Rabin Karp Algorithm?
1. Joseph Rabin and Michael Karp
2. Michael Rabin and Joseph Karp
3. Richard Karp and Michael Rabin
4. Michael Karp and Richard Rabin
View Answer   Discuss with Members

Question 10 : What is the basic principle in Rabin Karp algorithm?
1. Hashing
2. Sorting
3. Augmenting
4. Dynamic Programming
View Answer   Discuss with Members