Bsc csit Notes DSA 2nd semester

Bsc csit Notes DSA 2nd semester

Note of data structure and algorithm for bsc csit second semester

Click here
DSA Note

Sorting Notes

Sorting
The concept of an ordered set of elements is one that has considerable impact in out daily
lives. So sorting is one of the most common ingredients of programming systems. The
process of rearranging the items in a list according to some linear order is termed as sorting.
– The process of finding a telephone number in a telephone directory is simplified
considerably by the fact that the names are listed in alphabetical order.
– In a library, books are shelved in a specific order, each book is assigned a specific

position relative to the others and can be retrieved in a reasonable amount of time.

Click here for chapter 10 Graphs notes

Graph

A graph is a data structure that describes a binary relation between elements and has a
webby looking graphical representation. Graph plays a significant role in solving a rich
class of problems.
Definition:
A graph G = (V, E) consists of a finite non-empty set of vertices V and set of edges E.
V = { v1, v2, ..., vn}
E = {e1, e2, ...en}
Each edge e is a pair (v, w) where v, w є V. The edge is also called arc.