1 at most how many comparisons are required to search asorted vector of 255 elements 4948941

1.  
At most, how many comparisons are required to search asorted vector of 255 elements using the binary searchalgorithm?
(a)10             (b) 8                     (c) 7           (d) 9
2.  
A list implementation of a graph might use an array oflinked lists, each list containing all the ________ avertex.
(a)
pathscontaining            (b) vertices adjacent to
edges adjacent to      (c) trees containing
3.  
The adjacency list of the undirected graph                                                
is on theform: ………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………..
(T/F) The linear search has asymptotic running time oforder n
How many ways do you have to
parenthesize
the matrices multiplicationA1A2A3A4?………………
Question 2 ( 5 Marks):
Apply the BFS algorithm on the following undirectedgraph with source B. Attached

"Get 15% discount on your first 3 orders with us"
Use the following coupon
FIRST15

Order Now