What is the performance behavior of a linked adjacency list for determining whether an edge exists between two vertices?
A. constant time
B. O(N2) where N is the number of vertices
C. linear with the length of the list
D. logarithmic with the total number of vertices
Answer: C
Computer Science & Information Technology
You might also like to view...
In a process called "____," code is reviewed and rewritten in a way that improves its structure or readability.
A. refactoring B. validation C. parsing D. compilation
Computer Science & Information Technology
PDF was created by _____.
A. Microsoft B. Google C. Apple D. Adobe Systems
Computer Science & Information Technology
Text effects can be applied to a section of text to make it stand out
Indicate whether the statement is true or false
Computer Science & Information Technology
Cache memory can be accessed quickly because it sits on the
a. microprocessor. b. hard drive. c. power supply. d. bus.
Computer Science & Information Technology