Back to the 2022 paper
Similar questions
Design and Analysis of Algorithms A graph with five nodes is represented using the adjacency list as follows: | | | | | | |---|---|---|---|---| | A | -> | B (10) | C (3) | | | B | -> | C (1) | D (5) | | | C | -> | B (4) | D (8) | E (2) | | D | -> | E (7) | | | | E | -> | D (9) | | | Answer the following: (i) Draw the graph for the above adjacency list. (ii) Write the algorithm for the Breadth-First Traversal (BFS). (iii) Show the BFS traversal of the graph with the starting node as A.20247mArtificial intelligenceGraph used to represent semantic network is (i) undirected graph (ii) directed graph (iii) directed acyclic graph (DAG) (iv) directed complete graph20222mDesign and Analysis of Algorithms An adjacency matrix representation of a graph cannot contain information of (i) nodes (ii) edges (iii) direction of edges (iv) parallel edges20222mOPERATING SYSTEMIf the wait for graph contains a cycle, then (i) a deadlock does not exist (ii) a deadlock exists (iii) the system is in a safe state (iv) either deadlock exists or system is in a safe state20222m
PreviousLet G=(V, E) be a simple graph. Let R be the relation on V consisting of pairs of vertices (u,v) such that there is a path from u to v or such that u=v. Show that R is an equivalence relation.NextUse pseudocode to describe an algorithm for determining the value of a game tree when both players follow a minimax strategy.