Draw a line using DDA algorithm. with end points  a) (11, 21) to (16, 27) b) (10, 6) to (17, 11)

- Question Completion Status: Quèstion 7 (Big-O Analysis) Total number of comparisons in algorithm A is 2n² +n+1 and total number of comparisons in algorithm B is 2nlog(n) + 8n, where 'n' is input size. (The base of log is 2). Order of algorithm A is O( (a) ). Order of algorithm B is O( (b)). What is (a) and (b) ? O (a): n², (b): n2 o (a): n2, (b): nlog(n) (a): n, (b): nlog(n) (a): n2 +n, (b): log(n) ows b A Moving to another question will save this response.

1. Using the two representation methods you wrote in the last week to input the following graph. B E F H (a) Output the DFS sequence (b) Output the BFS sequence

(V, E) be a connected, undirected graph. Let A = V, B = V, and f(u) = neighbours of u. Select all that are true. Let G = a) f: AB is not a function Ob) f: A B is a function but we cannot always apply the Pigeonhole Principle with this A, B Odf: A B is a function but we cannot always apply the extended Pigeonhole Principle with this A, B d) none of the above

Apply Dijkstra's algorithm on the following graph. Show all the steps. F Start 10 B 15 12 15 D 2 10 E

Use python

handwritten please

i = 1 while (i  < n) do    s = s + i    i = i * 2 enddo   Is the step count dependent on which term?

Show the steps of the Dijkstra algorithm on the graph below, as done in class, starting with node C. Graph of 4 nodes А 1 3 D F

3. Given f(x) In(r) a) Use a for loop to find f(n+1) (x) (the (n +1)th derivative) when n = 2, 3,..8 b) Using your answers to part a), write a print statement giving the formula for general n.