Blog

Which of the following URLs correctly pass the name fido to a web server listening for requests on port 8000 of a virtual machine with the IP address: 35.35.35.35?

What is the cost of a minimum spanning tree of the following graph? You may use either Kruskal’s algorithm or Prim’s algorithm (starting from an arbitrary node).

Cardinal Richelieu was appointed to serve as French king following the death of Henry IV.

For this question, a string matches a regex only if the entire string is described by the pattern, rather than a substring matching. We’re interested in finding equivalent regular expressions to this one, called R:  ca+[​rt​]s? Using these six test strings car cas cars cats crs carss For each candidate regular expression below, select one of the test strings where the candidate disagrees with our base expression R. This would mean that either R matches and the candidate doesn’t or R doesn’t match while the candidate does. If the two regular expressions agree on all the test strings, select “equivalent”. caa*[​rt​]s? [partA] ca+[​rt​]s* [partB] ca+(r|t)s? [partC] ca+[​rt​]?s? [partD] ca+rs? [partE] ca*[​rt​]s? [partF]

Michelangelo’s painting and sculpture both became ________ as the artist aged.

What order are nodes (successors of edges) first added to the Priority Queue while tracing through Prim’s algorithm on the following graph? If a starting point is necessary, start from node U.

What is the AVl balance factor of the root node of this tree?

What is the minimal number of nodes of a trie that contains the following words: to tan ton

Suppose the file list.txt is in the current directory and has the following contents: user@vm$ cat list.txtCherryAppleDurianBanana What will be displayed to the terminal when the following command is run: cat list.txt | head -n 3 | sort If a line is blank, select “(nothing)” [blank1] [blank2] [blank3] [blank4]

Which of the following strings does not match the regex “pie?a?(zza)+(s|z)*”