In directed graph G(V, E) where V = {P, Q, R, S, T} and E = {PQ, RS, TP, PS, QR, PT, ST, QP, RQ, TS}, the vertex with maximum in- degree is .......... and vertex with maximum out-degree is ......... .
V = {P, Q, R, S, T} तथा E = {PQ, RS, TP, PS, QR, PT, ST, QP, RQ, TS} वाले एक ग्राफ G(V, E) में अधिकतम इन-डिग्री का वर्टेक्स ......... है तथा अधिकतम आउट-डिग्री का वर्टेक्स ....... है।
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. S, P
Explanation
In-degrees: P 2 (TP, QP), Q 2, R 1, S 3 (RS, PS, TS), T 2 → maximum S. Out-degrees: P 3 (PQ, PS, PT), Q 2, R 2, S 1, T 2 → maximum P.
इन-डिग्री: P 2, Q 2, R 1, S 3 (RS, PS, TS), T 2 → अधिकतम S। आउट-डिग्री: P 3 (PQ, PS, PT), Q 2, R 2, S 1, T 2 → अधिकतम P।
More Data Structures questions
- Which of the following recurrence relation is related to worst case time complexity of quick sort ?
- A queue follows ……….. .
- Process of inserting an element in stack is called :
- If the elements 'A', 'B', 'C' and 'D' are placed in a queue and are deleted one at a time, in what order will these elements be removed ?
- In a stack, if a user tries to remove an element from an empty stack, it is called :
- A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear), is…