Scribd
Upload
31 views

IT1401 - Part A

A graph G is defined as an ordered set G(V,E) where V represents vertices and E represents edges connecting vertices. A degree of a node is the number of edges connected to that node. A spanning tree is a subset of a graph G that connects all vertices using the minimum possible number of edges without cycles. An Euler circuit uses every edge in a graph exactly once. A biconnected graph has two vertex-disjoint paths between any two vertices. Topological sorting for a directed acyclic graph (DAG) produces a linear ordering of vertices such that for every directed edge u to v, u comes before v in the ordering.

Uploaded by

harish
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
31 views

IT1401 - Part A

A graph G is defined as an ordered set G(V,E) where V represents vertices and E represents edges connecting vertices. A degree of a node is the number of edges connected to that node. A spanning tree is a subset of a graph G that connects all vertices using the minimum possible number of edges without cycles. An Euler circuit uses every edge in a graph exactly once. A biconnected graph has two vertex-disjoint paths between any two vertices. Topological sorting for a directed acyclic graph (DAG) produces a linear ordering of vertices such that for every directed edge u to v, u comes before v in the ordering.

Uploaded by

harish
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

IT1401 – Data Structures

Unit IV
1. Define a graph.
A graph G can be defined as an ordered set G(V, E) where V(G) represents the set of
vertices and E(G) represents the set of edges which are used to connect these vertices.
2. What is a degree of a node?
A degree of a node is the number of edges that are connected with that node. A node
with degree 0 is called as isolated node.
3. What is spanning tree?
 A spanning tree is a subset of Graph G, which has all the vertices covered with
minimum possible number of edges.
 A spanning tree does not have cycles and it cannot be disconnected.
4. What is Euler Circuit?
 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.

5. Why do we say the graph is biconnected?


An undirected graph is said to be a biconnected graph, if there are two vertex-disjoint
paths between any two vertices are present.
6. What is a biconnected graph? Give example.
 An undirected graph is said to be connected if there are no vertices whose removal
disconnects the rest of the graph
 Examples
• Computers in a network
• Transit system
7. What is topological sort?
 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.
 Topological Sorting for a graph is not possible if the graph is not a DAG.

Unit V
1. Define hash table.
 The hash table is a collection of key-value pairs. It is used when the searching
or insertion of an element is required to be fast
2. Mention the difference between Hashing & Extendible Hashing with example.
Hashing Extensible Hashing
Static Hashing Dynamic Hashing
Bucket size is fixed Directory is extensible

3. Name two types of collision avoidance techniques.


a. Open hashing / Separating chaining
b. Closed hashing / Open addressing
4. Define Hash function.
 Hashing is the process of converting an input of any length into a fixed size
string or a number using an algorithm
5. Define Double Hashing.
Hashing technique consists a hash function that takes a key and produces hash table
index for that key. The double hashing technique uses two hash functions so it is
called double hashing.

You might also like