In computer science or discrete structure, there are two important function are use i.e. Floor and ceiling function . In this tutorial we discuss definition, example using concept computer science and program of these function. Notation: ⌈x⌉ is ceiling function, ⌊x⌋ is floor function where x is variable. Let x be a real number then …
Floor and ceiling function with example, program Read More »
There are many algorithm for determining the minimal spanning tree of the given weighted graph. Here we discuss Kruskal’s algorithm in data structure. To understand these algorithm first we to know minimal spanning tree. Thus a minimal spanning tree of G is a spanning tree of G with minimum possible weight among all possible spanning …
Kruskal’s algorithm in data structure with example Read More »
There are different algorithm to find shortest path between two vertices in a weight graph. we discuss here Dijkstra’s algorithm for shortest path. Consider a weighted graph G . The length of a path in a weighted graph is the sum of the weights of the edges of this path And the shortest path between …
Sorting algorithm in discrete structure : Is the process of arranging the element of a list of file in any specific order which may be ascending or descending. For example all list of words could be sorted alphabetically or by length. All list of cities could be sorted by population by area or by zip code. In …
Sorting algorithm in discrete structure with program Read More »
Searching Algorithms in data structure: is the process of determining the ability of desired element in the given list of elements stored in any order or randomly. Searching operation returns the position of the required element in the list if it is a present otherwise it returns search failures notification. For example in the database …
What are Searching Algorithms in data structure – program, example Read More »
