Question: a. Let us invent a new game, called Six degrees of Tim Berners-Lee. The goal is, given a Twitter handle -say @cab203 - find
a. Let us invent a new game, called Six degrees of Tim Berners-Lee. The goal is, given a Twitter handle -say @cab203 - find a chain of at most six Twitter handles, starting at @cab203 and ending at @timberners_lee, where every pair of adjacent Twitter handles in the chain appear on some web page together. The questions below are concerned with building a program that plays the game. (To be clear, you will not have to play this game or build any programs!) i. Discuss a reasonable use of regular expressions in building such a program. ii. Discuss a reasonable use of graphs in building such a program. iii. Discuss a graph theoretic problem that relates to building such a program. (1 mark) (1 mark) (1 mark) iv. Would you use breadth-first or depth-first traversal in solving the above problem? What are the reasons for your choice? (1 mark)
Step by Step Solution
There are 3 Steps involved in it
i Regular expressions are used for identifying some values based on some patternsIn this problem som... View full answer
Get step-by-step solutions from verified subject matter experts
