Scribd
Upload
14 views1 page

Important

The document covers various concepts in graph theory, including definitions and types of graphs, terminology such as paths and cycles, and algorithms like Kruskal’s, Dijkstra’s, and Warshall's for finding minimum spanning trees and shortest paths. It also discusses searching algorithms, sorting techniques including bubble sort, quick sort, radix sort, and insertion sort, as well as data structures like B-Trees, hashing, and AVL trees. The document provides examples and comparisons to illustrate these concepts.

Uploaded by

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

Important

The document covers various concepts in graph theory, including definitions and types of graphs, terminology such as paths and cycles, and algorithms like Kruskal’s, Dijkstra’s, and Warshall's for finding minimum spanning trees and shortest paths. It also discusses searching algorithms, sorting techniques including bubble sort, quick sort, radix sort, and insertion sort, as well as data structures like B-Trees, hashing, and AVL trees. The document provides examples and comparisons to illustrate these concepts.

Uploaded by

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

1. Define Graph & its type with example. Also give the comparison between Graph & Tree.

2. Explain these Graph terminology with example :


a) Path b) Cycle c) In –degree & Out-degree d) Self loop & Multiple edges
3. Explain Kruskal’s algorithm . Find the minimum cost spanning tree of a graph using Kruskal’s
algorithm.
4. Explain the Difference between BFS & DFS with example.
5. Describe Dijkstra’s algorithm for finding shortest path with the help of suitable example.
6. Describe Warshall algorithm to find shortest path between any two vertices of a graph with the
help of suitable example.
Unit -5
1. Explain the concept of Searching, and give the difference between linear seach and B
binary search.
2. Explain Bubble sort. Write the algorithm for bubble sort with example.
3. Explain Quick sort algorithm. Sort the elements given in the following array using Quick
sort algorithm. 44, 33, 11, 55, 77, 90, 40, 60, 99, 22, 88, 66
4. Sort the numbers given below using radix sort.
48, 43, 61, 23, 38, 28, 21, 63, 66.
5. Explain Insertion sort algorithm. Sort the elements given in the following array using
Insertion sort algorithm.
77, 33, 44, 11, 88, 22, 66, 55
6. Write a short note on
(a) B-Tree (b) B + Tree (c) Hashing (d) Garbage collection (e) Collision and its solution
techniques
7. Define Hash function and its significance in data structure also discuss its types with
example.
8. Define AVL tree . show the result of inserting 2,1,4,5,9,3,6,7,into an empty AVL tree.

You might also like