3. Let G (V, E) be an undirccted, connectcd graph with n vertices and m cdgcs. All verticcs are initially un-marked. Consider the following algorithm: Algorithm traverse(G, u) Input: Undirected, connected graph G, and vertex u of G. Mark u For each edge (u, v) incident on u do { trim(u, v) if v is not marked then traverse(G, v) } Algorithm trim(u, v) performs kmn operations, where k is a constant valuc. Assume that G is stored in an adjacency list. What is the time complexity of algorithm traverse(G, u) in the worst case? (A) O(m +n) (В) O(тn) (С) 0(mn') V(D) O(m²n) (E) O(n²)

3. Let G (V, E) be an undirccted, connectcd graph with n vertices and m cdgcs. All verticcs are initially un-marked. Consider the following algorithm: Algorithm traverse(G, u) Input: Undirected, connected graph G, and vertex u of G. Mark u For each edge (u, v) incident on u do { trim(u, v) if v is not marked then traverse(G, v) } Algorithm trim(u, v) performs kmn operations, where k is a constant valuc. Assume that G is stored in an adjacency list. What is the time complexity of algorithm traverse(G, u) in the worst case? (A) O(m +n) (В) O(тn) (С) 0(mn') V(D) O(m²n) (E) O(n²)

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Input: A directed graph G with n vertices. Task: If one can add at most one directed edge to G such that every vertex can reach all other vertices, then print 'Yes'. Otherwise, print 'Unsatisfiable'. Give an efficient algorithm (to the best of your knowledge) and a formal proof of correctness for your algorithm. An answer without any formal proof will be considered incomplete. Analyze the running time of the algorithm. You must write down your algorithm as pseudocode
The weights of edges in a graph are shown in the table below. We will apply the nearest neighbor algorithm to the graph starting at vertex D. DE 1 27 2 B 9 11 36 17 9 1. 27 -37 37 36 43 D E F 16 15 15 11 43 16 14 717 3 14 al The first edge to be chosen will be BA (Write the edge tby giving the two endpoints eg AB. DC, etc) bi The second edge to be chosen will be AE d Give the firal answer as a list of vertices starting and ending at vertex D. Example: DEFABCD BEFDCA di The total vsisht of the ciuit is
Let G be a graph whose vertices are the integers 1 through 8, and let the adjacent vertices of each vertex be given by the table. Assume that, in a traversal of G, the adjacent vertices of a given vertex are returned in the same order as they are listed in the table below. Vertex Adjacent vertices 1 2 3 4 5 6 7 8 (2,3,4) (1,3,4) (1,2,4) (1,2,3,6) (6,7,8) (4,5,7) (5,6,8) (5,7) a) Draw Gb) Order the vertices as they are visited in a DFS traversal starting at vertex 1. c) Order the vertices as they are visited in a BFS traversal starting at vertex 1.
Assume a graph G is simple (ie. no self loop or parallel edges). Let v be any vertex in the graph. Let boolean[] marked be initalized to all false. Consider: boolean dfs(Graph G, int v) { marked[v] = true; for (int w: G.adj(v)) { if (w } u) continue; if (marked[w]) return true; if (dfs (G, v, w)) return true; } return false; == If the call dfs(v) returns true, then: a. The graph has cycles b. The graph is bipartite c. The graph is connected Not enough information a
6. In Java create an algorithm for an undirected graph with n vertices and m edges that...- Takes as a parameter some integer k- Returns the maximum induced subgraph where each vertex of that subgraph has a degree greater than or equal to k (or returns null if no such subgraph exists)- Operates in O(n + m) time
A B C D E F A -- 32 44 33 31 34 B 32 -- 6 23 25 10 C 44 6 -- 2 58 13 D 33 23 2 -- 15 50 E 31 25 58 15 -- 5 F 34 10 13 50 5 -- The weights of edges in a graph are shown in the table above. Apply the nearest neighbor algorithm to the graph starting at vertex A. Give your answer as a list of vertices, starting and ending at vertex A. Example: ABCDEFA
Undirected graph is given with the list of edges. Build an adjacency matrix. Print the number of ones in adjacency matrix. Graph can contain multiple edges and loops. Input First line contains number of vertices n. Each of the next line contains one edge. Read the edges till the end of file. Output Build an adjacency matrix. Print the number of ones in adjacency matrix. Sample input 3 1 2 23 22 32 Sample output 5
In the figure below there is a weighted graph, dots represent vertices, links represent edges, and numbers represent edge weights. S 2 1 2 1 2 3 T 1 1 2 4 (a) Find the shortest path from vertex S to vertex T, i.e., the path of minimum weight between S and T. (b) Find the minimum subgraph (set of edges) that connects all vertices in the graph and has the smallest total weight (sum of edge weights). 2. 3.
Consider the graph below. Use Dijkstra's algorithm to find the shortest path from vertex A to vertex H. Write your answer a. a sequence of nodes separated by commas (no blank spaces) starting with the source node: What's the weight of the shortest path? 15 10 10 15 2 10 12 14
function is y=3x2 Calculate a witness for "Big-O" O(x<). draw a graph Calculate a witness for "Big-Omega" N(x-). draw a graph Is this algorithm "Big Theta" 0(x2)
5. Fleury's algorithm is an optimisation solution for finding a Euler Circuit of Euler Path in a graph, if they exist. Describe how this algorithm will always find a path or circuit if it exists. Describe how you calculate if the graph is connected at each edge removal. Fleury's Algorithm: The algorithm starts at a vertex of v odd degree, or, if the graph has none, it starts with an arbitrarily chosen vertex. At each step it chooses the next edge in the path to be one whose deletion would not disconnect the graph, unless there is no such edge, in which case it picks the remaining edge (a bridge) left at the current vertex. It then moves to the other endpoint of that edge and adds the edge to the path or circuit. At the end of the algorithm there are no edges left ( or all your bridges are burnt). (NOTE: Please elaborate on the answer and explain. Please do not copy-paste the answer from the internet or from Chegg.)
Dijkstra's shortest path algorithm is run on the graph, starting at vertex D. When a vertex is dequeued, 0 or more adjacent vertices' distances are updated. For each iteration of the while loop in Dijkstra's algorithm, find the vertex dequeued and the adjacent vertices updated. Enter updated vertices as A, B, C or "none" if no adjacent vertices are updated. 10 B 4 C 8 6 9 A LO 5 D E Iteration Vertex dequeued Adjacent vertices updated Ex: A, B, C or none 1 2 3 4 5 SHIRA Ex: C