# Month: July 2020

## Connecting Traditional Water Fall Software Life Cycle Model with Agile Models

This article is written by wearing the traditional hat to appreciate where we came from. Water Fall or Phased approach to Software Development is the...

## Managerial Issues of Software Engineering

Software Engineering is the discipline that has historically studied, developed and is continuously improving methods, processes, techniques and frameworks to facilitate the analysis, design, development,...

## Factors Affecting Software Quality and Developer Productivity

If you take any Software Development environment, where a piece of code is written to automate a process, we can generalize the factors affecting Software...

## Software Engineering

Computer Software or Software is an integral part of this Information Age which enables information collection, storage, processing and management of Information within machines or virtual...

## Minimal Spanning Trees and Kruskal’s Algorithm

Given a weighted graph G, it is often desired to generate a spanning tree such that the sum of the weights of the tree edges...

## Depth First and Breadth First Traversal

Depth first traversal of a Graph could be used to traverse a directed or un-directed graph and thus creating a spanning tree. Depth first traversal...

## Graph Traversals and Spanning Forests

Connected Graph A graph is said to be connected if there is a path between any two of its nodes. Cycle A Path from a...

## Linked representation of Graphs in C

There are many in-inadequacies in using the Adjacency Matrix representation of Graphs. Once such inadequacy is the difficulty in adding or deleting nodes while data...

## Implementing Ford Fulkerson’s Algorithm in C To Maximize Network Flow

Flow Problem The main objective of a flow problem is to maximize the amount of an item being delivered from one point of a system...

## Implementation of Warshal’s Algorithm in C to find Path Matrices of a Graph

Warshal’s Algorithm can be applied to find the Path Matrices and this the TRANSITIVE CLOSURE of a graph given its adj matrix. Warshal’s algorithm is...

## Representing Graphs and Networks in C

A Graph is a data structure that consists of a set of nodes interconnected by directed or un-directed arcs. For a DIRECTED Graph, the ordered pair of nodes...

## Merge and Radix Sorts

Merge Sort Merge Sort is a process of combining more than one sorted files into a single sorted file. The procedure is to divide a...