UNIT 4

PART A
1. Define critical path( April-May 23)
The critical path (or paths) is the longest path (in time) from Start to Finish; it indicates
the minimum time necessary to complete the entire project.
he critical path is the entire path through the diagram that will take the longest amount of
time to complete.
The essential technique for using CPM

1. A list of all activities required to complete the project (typically categorized

within a work breakdown structure)
2. The time (duration) that each activity will take to complete
3. The dependencies between the activities
4. Logical end points such as milestones or deliverable items

2. State the uses of topological sort( April-May 23)

Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices
such that for every directed edge u-v, vertex u comes before v in the ordering.
Applications of Topological Sorting:
 Topological Sorting is mainly used for scheduling jobs from the given dependencies among
jobs.
 In computer science, applications of this type arise in:
 Instruction scheduling
 Ordering of formula cell evaluation when recomputing formula values in
spreadsheets
 Logic synthesis
 Determining the order of compilation tasks to perform in make files
 Data serialization
 Resolving symbol dependencies in linkers

3. Exemplify a weighted acyclic graph. (Nov-Dec 22)

a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it
consists of vertices and edges (also called arcs), with each edge directed from one vertex
to another, such that following those directions will never form a closed loop. A directed
graph is a DAG if and only if it can be topologically ordered, by arranging the vertices as
a linear ordering that is consistent with all edge directions.
4. What is the property that makes an undirected graph as a biconnected.?(Nov-Dec 22)
A biconnected undirected graph is a connected graph that is not broken into
disconnected pieces by deleting any single vertex (and its incident edges).

Removal of any vertex will nit disconnect the graph.

5. Outline the difference between B-Tree and B+ Tree data structure with respect to storing
—keys and records.(Nov-Dec 22) (R-21)
 6. Outline the directed graph with example.(Nov-Dec 22) (R-21)
A directed graph is defined as a type of graph where the edges have a direction
associated with them.

 Directed edges: In a directed graph, edges have a direction associated with them,
indicating a one-way relationship between vertices.
 Indegree and Outdegree: Each vertex in a directed graph has two different degree
measures: indegree and outdegree. Indegree is the number of incoming edges to a vertex,
while outdegree is the number of outgoing edges from a vertex.
 Cycles: A directed graph can contain cycles, which are paths that start and end at the same
vertex and contain at least one edge. Cycles can be important for understanding feedback
loops or other patterns in the graph.
 Paths and reachability: Paths in a directed graph follow the direction of the edges, and
can be used to analyze reachability between vertices.

7. Define the length of the graph. (Apr/May 22)

Length of the graph is defined as the number of edges contained in the graph. The
distance between two vertices in a graph is the number of edges in a shortest or minimal
 path

Length of the graph: 8

AB, BC, CD, DE, EF, FA, AC, CE
8. What is topological sorting give an example. (Apr/May 22)
A topological sort is a linear ordering of vertices in a directed acyclic graph (DAG).
Given a DAG G = (V, E), a topological sort algorithm returns a sequence of vertices in

(u, v) ∈ E, v never appears before u in the sequence.

which the vertices never come before their predecessors on any paths. In other words, if

Output: 5 4 2 3 1 0
Explanation: The first vertex in topological sorting is always a vertex with an in-
degree of 0 (a vertex with no incoming edges). A topological sorting of the following
graph is “5 4 2 3 1 0”. There can be more than one topological sorting for a graph.
Another topological sorting of the following graph is “4 5 2 3 1 0”.

9. What are the variouse operations that can be performed on B-tree(may-16)

B-tree is also a self-balancing tree allowing each node multiple keys and offspring. It is
the binary search tree in a more generalized version. We have also talked about the
properties and applications of the B tree along with various operations on the B tree, such
as

 Insertion operation
 Search operation
 Deletion operation

10. What are different ways to represent graph(Dec 18)

 A Graph is a non-linear data structure consisting of vertices and edges. The vertices
are sometimes also referred to as nodes and the edges are lines or arcs that connect
any two nodes in the graph. More formally a Graph is composed of a set of
vertices( V ) and a set of edges( E ). The graph is denoted by G(V, E).
Here are the two most common ways to represent a graph :
1. Adjacency Matrix
 if there is an edge from vertex i to j, mark adjMat[i][j] as 1.
 If there is no edge from vertex i to j, mark adjMat[i][j] as 0.
2. Adjacency List

11. What is weakly connected graph(may 12)

A directed graph is weakly connected if there is a path between every two vertices in
the underlying undirected graph (i.e, the graph formed when the direction of the edges
are removed).

12. What are articulation point(may 09)

An articulation point in a connected graph is vertex such that removing the vertex and its
incident edges disconnects the graph into two or more connected components.
 13. Define Euler circuite(Dec 18)
An Euler circuit is a circuit that uses every edge of a graph exactly once. ▶ An Euler
path starts and ends at different vertices. ▶ An Euler circuit starts and ends at the same
vertex.
Euler paths and circuits :
An Euler path is a path that uses every edge of a graph exactly once.
An Euler circuit is a circuit that uses every edge of a graph exactly once.
An Euler path starts and ends at different vertices.
An Euler circuit starts and ends at the same vertex.
14. Define adjacency list(dec 19)
An adjacency list is a data structure used to represent a graph where each node in the
graph stores a list of its neighboring vertices.

15. What is activity node graph (dec 09,may 07)

A network diagram where nodes represent activities and arrows illustrate the logical
relationships between various activities.
a diagram of project activities that shows the sequential relationships of activities using arrows
and nodes
Activity diagrams show the flow of one activity to another within a system or process. Even
complex systems can be visualized using activity diagrams. They are used within organizations
to model customer journeys, to show the process of receiving an order through shipping to the
customer, and to model sales processes.
16. Difference between weakly connected graph and strongly connected graph(dec 21)
 Strongly Connected A directed graph is strongly connected if there is a path from a to b
and from b to a whenever a and b are vertices in the graph. Weakly Connected
A directed graph is weakly connected if there is a path between every two vertices in the
underlying undirected graph.

17. What are the application of graph(may 05)

Graphs and graph databases provide graph models to represent relationships. They allow
users to apply pattern recognition, classification, statistical analysis, and machine
learning to these models, which enables more efficient analysis at scale against massive
amounts of data.
Graph databases ensure transaction-safe, persistent storing and querying of graph
structured data. Graph theory is used to find shortest path in road or a network.
18. Prove that the number of odd degree vertices in a connected graph should be even(may
07)
Since the graph is undirected, every edge increases the sum of degrees by 2.
If we consider sum of degrees and subtract all even degrees, we get an even number.
So total number of odd degree vertices must be even.
Example:

19. What is breath first traversal? (Dec 10)

Here's a step-by-step explanation of how BFS works:
1. Start by selecting a starting vertex or node.
2. Add the starting vertex to a queue.
3. Mark the starting vertex as visited.
4. While the queue is not empty, do the following steps:
o Remove the front vertex from the queue.
o Visit the removed vertex and process it.
o Enqueue all the adjacent vertices of the removed vertex that have not been visited yet.
o Mark each visited adjacent vertex as visited and add it to the queue.
 5. Repeat step 4 until the queue is empty.

20. When is a graph is said to be bipartite? (may 11)

A Bipartite Graph is a graph whose vertices can be divided into two independent sets, U
and V such that every edge (u, v) either connects a vertex from U to V or a vertex from V
to U. In other words, for every edge (u, v), either u belongs to U and v to V, or u belongs
to V and v to U.
21. What is bi connectivity?
An undirected graph is called Biconnected if there are two vertex-disjoint paths
between any two vertices. In a Biconnected Graph, there is a simple cycle through any
two vertices.
A graph is said to be Biconnected if:
1. It is connected, i.e. it is possible to reach every vertex from every other vertex, by a simple
path.
2. Even after removing any vertex the graph remains connected.

22. Define regular graph?

In graph theory, a regular graph is a graph where each vertex has the same number of
neighbors; i.e. every vertex has the same degree or valency. A regular directed graph
must also satisfy the stronger condition that the indegree and outdegree of each internal
vertex are equal to each other.
Regular Graph:
A graph is called regular graph if degree of each vertex is equal. A graph is called K regular if
degree of each vertex in the graph is K.
Example:
Consider the graph below:
23. What are the properties of binomial graph
A binomial experiment is one that has the following properties:
(1) The experiment consists of n identical trials.
(2) Each trial results in one of the two outcomes, called a success S and failure F.
(3) The probability of success on a single trial is equal to p and remains the same from
trial to trial
24. What is the significance of articulation point in graph(dec 21)
Articulation points represent vulnerabilities in a connected network – single points
whose failure would split the network into 2 or more components. They are useful for
designing reliable networks.

25. What are the steps involved in topological sorting?

Here's the algorithm step by step:
 Find a vertex that has indegree = 0 (no incoming edges)
 Remove all the edges from that vertex that go outward (make its outdegree = 0, remove
outgoing edges)
 Add that vertex to the array representing the topological sorting of the graph.
 Repeat till there are no more vertices left.