Question 5
A directed acyclic graph has 6 vertices. If it is guaranteed to have a unique topological sort, what is the maximum number of edges this graph can have?
Question 5: A directed acyclic graph has 6 vertices. If it is guarant…
Show answer
A written answer, not marked automatically.
Question 5 of 17 in the IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) Quiz 1 paper sat on 15 Mar 2026, in the January 2026 term (Programming, Data Structures And Algorithms Using Python 15 Mar 26). It carries 3 marks.
More questions from this paper
- What is , given the definition of above?
- Consider the following implementation for selection sort: Suppose a list is used as an input parameter to the above sel…
- Suppose each node of the linked list is an object of class Node. Variable head points to the first node of the linked l…
- Linear probing is an open addressing scheme for resolving hash collisions in tables. Linear probing takes the original …
- Consider the following functions: • • • Which of the following is/are false?
- Consider the following implementation of Merge Sort: Which of the following is/are true about Merge Sort?
- Which of the following statements is/are true about the Quicksort algorithm? Assume that the first element of the list …
- Consider a singly linked list implemented using the above class. Assume that: • variable points to the first node of th…
- Which of the following is/are possible degree sequence(s) of the vertices of a connected undirected graph with five ver…
- Which of the following statement(s) is/are true about Breadth First Search (BFS) in an unweighted graph ?
- You are given a non-empty list of integers sorted in ascending order. Every element in the list appears exactly twice, …
- You are implementing binary search on a sorted list L that may contain duplicate values. You need to find the index of …
- Let be a stack and be a queue supporting the following operations: Assume that supports the standard stack operations a…
- For a connected undirected graph with 7 vertices, which of the following gives the correct minimum and maximum possible…
- Let G be a connected undirected graph with n vertices represented using an adjacency matrix. In the DFS implementation …
- Select the most appropriate data structure for the following operations: