Is the following graph traversal a result of a BFS or DFS search?   E, C, F, A, D, G, H, B

Given is a list L of 10 elements, which of the following list operations have an O(1) time complexity? 

l = range(m)for i in l:  for j in range(100):     for k in l:         print(“hi”) What is the time complexity of the above code?

After 5 iterations, which of the following two algorithms would likely have a deeper(more edges between the start and current node) traversal into a graph?  

Target algorithm is the black work line and g(N) is the red upper bound line. Assume g(N) = N. In the following image, what C value was chosen for the complexity analysis proof that the algorithm is O(N)?

Given three different versions of a website, A, B and C. Your colleague believes that B has the highest click through rate, you think otherwise. What is the best strategy to produce statistically significant results on which version has the highest click through rate?

from shapely.geometry import Polygona = Polygon()b = Polygon() What does a.intersects(b) output?

Which of the following allow a computer to host multiple flask sites on the same network at the same time?

Which of the following ferrous alloy types is most easily melted?

What is the typical carbon concentration range for medium-carbon steels?