###### Question 9876 – Database-Management-System

February 13, 2024###### Question 9849 – Minimum-Spanning-Tree

February 13, 2024# Question 9762 – Database-Management-System

Suppose the adjacency relation of vertices in a graph is represented in a table Adj(X,Y). Which of the following queries cannot be expressed by a relational algebra expression of constant length?

Correct Answer: D

Question 45 Explanation:

(a) Finding a adjacency vertex for the given vertex is too simple i.e., Adj(X,Y).

(b) Finding a self loop is also simple (Oop(X,X))

(c) If a → b, b → c then c!=a, finding this is also simple.

(d) List all the elements reachable from a given vertex is too difficult in Relational Algebra.

(b) Finding a self loop is also simple (Oop(X,X))

(c) If a → b, b → c then c!=a, finding this is also simple.

(d) List all the elements reachable from a given vertex is too difficult in Relational Algebra.

List of all vertices adjacent to a given vertex

List all vertices which have self loops

List all vertices which belong to cycles of less than three vertices

List all vertices reachable from a given vertex

Subscribe

Login

0 Comments