If you find yourself in maze the better traversal approach will be?
a) BFS
b) BFS and DFS both are valid
c) Level order
d) DFS
What algorithm technique is used in the implementation of Kruskal’s solution for the MST?
a) Greedy Technique
b) Divide and Conquer Technique
c) Dynamic Programming Technique
d) The algorithm combines more than one of the above techniques
Cross Edge is.......
a) (u, v) where u is ancestor of v and v is not descendent of u
b) (u, v) where v is a proper descendant of u in the tree
c) (u, v) where u and v are not ancestor or descendent of one another
d) (u, v)where u and v are either ancestor or descendent of each other
Forward Edge is.....
a) (u, v) where u is a proper descendent of v in the tree
b) (u, v) where v is a proper descendant of u in the tree
c) (u, v) where v is a proper ancestor of u in the tree
d) None of the given
Back edge is………..
a) (u, v) where v is an ancestor of u in the tree
b) (u, v) where u is an ancestor of v in the tree
c) (u, v) where v is predecessor of u in the tree
d) None of the given
Using ASCII standard the strings | abababababab | will be encoded with?
a) 64
b) 96
c) 128
d) 256
