# Category: Software Development

## Efficiency of Recursion

In general cases, a non-recursive program runs more efficiently than a recursive program since a recursive program requires more execution time to enter and exit...

## Recursion in C

Recursion Recursion and Iteration are two different concepts of achieving a result by a number of repeated operations. Iteration involves use of for, while and...

Doubly Linked lists eliminates below drawbacks of circular lists – not able to traverse backward not able to delete and node given only points to...

## Simulation of Josephus Problem using Circular lists

Josephus Problem Josephus problem is that some soldiers are being surrounded by their enemies and there is only one horse to escape i.e. only one...

## Dynamic Circular Linked Lists in C

Circular lists eliminates same drawbacks of linear lists. In as circular list it is assumed that items are inserted at the front and the list...

## Advantages of Dynamic representation of Lists over its Array implementation

Below are the advantages of Dynamic representation of Lists over its Array implementation –  No advanced knowledge of number of nodes is required  No memory...

## Dynamic Linked Lists as Queues in C

When Dynamic Linked Lists are represented as Queues, the first node represents front of queue given by q.front and last node represents the rear of...

## Implementing Dynamic Linked Lists in C

List is a type of dynamic data structure which rectifies certain drawbacks of Stacks and Queues. Lists generally uses the concept of pointers which points...

## Queues and its implementation in C

A Queue is a First In First Out (FIFO) which is an ordered collection of items which are deleted at the front end and inserted...

## Game Trees

Game Tree is one of the applications of Binary Trees. For example the one implemented for the Tic-Tac-Toe Game. X | X | X O...

## Representing Lists As Binary Trees in C

Case 1: A list could be represented as a Binary Tree with all the list elements along with their information at the leaf nodes. For...

## HUFFMAN Algorithm and its implementation in C

Huffman trees are used as message encoding and message decoding trees which is the basic construct of compression and de. The specialty of Huffman tree...

## Threaded Binary Tree and its implementation in C

Threaded Binary Trees are those in which the NULL right pointers of all nodes are THREADED to its immediate inorder successor in the Binary Tree. Such...

## Traversing a Binary Tree in C

There are generally 3 traversal strategies for Binary Trees – INORDER, PREORDER and POSTORDER. For eg:, the inorder, preorder and postorder traversal of an expression tree...

## C program implementing Binary Tree Search to find duplicates of a file

A Binary Search is such a Binary Tree in which the info field of any of the nodes to the left of a particular node nd...

## Binary Tree representation and Primitive Operations on a Binary Tree in C

Binary Trees are one of the core data structures used in any programming language to implement complex systems. C programming language offers various binary tree...

## C program to print sum up-to each individual preceding number until the entered number

Here is a C program which accepts an integer and prints out sum from 1 to 1, 1 to 2, 1 to 3 …… 1...

## C program for Hailstones series

Hailstones is a sequence of numbers that could be generated from any positive number by performing a specific operation on it until it reaches 1....

## C program to generate random numbers in any range

Here is a C program to generate random numbers between any range of two digit numbers – #include #include main(){ int s, a, b, n,...

## for loops in C

The ‘for’  loop is another important looping structure which could replace ‘while’  and ‘do .. while’ loops. It has a special feature that the initialization,...

## C program to test for a prime number

Below is a C program to test for a prime number – main(){ float n, count = 0; i = 3; a; printf("\nEnter any number...

## C program to implement Russian Peasant

Here is a C program that I wrote years back to implement Russian Peasant method of an interesting multiplication technique – main(){ int a, b,...

## C program to find numbers whose sum of cubes of individual numbers is that number

Here is an implementation of while loop in C to find numbers whose sum of cubes of individual numbers is that number. You can go...

## C program to find circumference and area of a circle from given radius

Here is a simple C program to find circumference and area of a circle from given radius – main(){ float r, pi = 3.1416, c, area;...

## While Loop in C

Like do-while loop, While loop is the most commonly used looping construct to repeat a process or calculation for a set or collection of inputs...

## C program to find the sum of squares of first n natural numbers

Here is a simple C program to find the sum of squares of first n natural numbers using do-while looping construct – main(){ int n,...

## Do – While Loops in C

Looping constructs is an important programming language technique to repeat a process or calculation for a set or collection of inputs or storage based on...

## Sample C program showing if – else constructs

Below are simple C programs for beginners to learn if-else decision construct. Example 1: Program to check if a number is odd or even main...

## C Program to check for leap year

Here is a C program to check for leap year – main () { int year; printf("Please enter any year as 4 digits>> "); scanf("%d",...

## Making decision in C program

Decision making is an important aspect of programming language that enables the programmer to arrive at a conclusion based on certain data processing, comparisons and conditional...

## Declaring variables in C language

C programming language allows to define and classify data so we can use it appropriately in various parts of the program in the correct form...

## C Programming Language

C language developed at Bell lab by Dennis Ritchie on UNIX environment. UNIX was later rewritten in C. An earlier version of C is BCPL...

## Recursive C program for Binary search

Below is an example Recursive C program to perform Binary – int binsearch(int low, int high, in a, X){ int mid; if(low > high){ return(-1);...

## Recursive C program to print Fibonacci series

Below is an example recursive C program to return Fibonacci series for a given number – int fibonacci (int x){ if(n < 0){ printf("Invalid input");...

## C program for finding factorial by recursion

Here is a C program to find a factorial by recursive method – int factorial (int x ) { return ( n==0? 1: n*(fact(n-1))); }...

## Bubble sort in C

Simple bubble sort in C – for (i=0; i<n-1; i++){ for(j=i+1; j<n; j++){ if(x[j] < x[i]){ temp = x[j]; x[j] = x[i]; x[i] = temp;...

## Tree representation in C

Below is an example to represent a Tree structure in C using struct...

## File Operation in C

Below is a simple C program to perform file operation – include <stdlib.h> main() { FILE * file_source char * file_name = (char*) malloc (sizeof...

## C program to evaluate the 1st derivative of a function at any given point

Writing C programs for numerical differentiation is interesting and fun. Here is one that I wrote years back. Enjoy!  ...

## C Program to evaluate forward difference

Below is a C program to evaluate forward difference and thus print a forward difference table for n function values –...

## C program to convert a postfix string to prefix form

Below is sample C program to convert a postfix string to prefix form. Also included is detailed flow chart of the program and dry run...

## C program to convert a prefix string to infix form

Below is sample C program to convert a prefix string to infix form. Also included is detailed flow chart of the program and dry run...

...

## Example for Preorder and Postorder traversal of a Binary tree

Below is an example that I prepared for preorder and postorder traversal of a Binary Tree – enjoy!...

## Traversing a Binary Tree in Postorder

Below is the algorithm and C routine for traversing a Binary Tree in postorder.  ...

## Traversing a Binary Tree in Preorder

A binary tree can be traversed in two basic ways – preorder and postorder. Explained below is the process or preorder traverse of a binary...

## Binary Tree

Binary Tree is a basic data structure that is used behind the scenes of all major technologies whether it’s a Database system or operating system,...

## Simple HTTP log analyzer

Here is a simple light weight HTTP analyzer written in PHP. I wrote this to brush up my skills writing schedulers for a typical LAMP...

## Stack Vs Heap

Stack and Heap refers to 2 distinct memory areas utilized by an executing program based on the data type of data that it deals at...

## What is the purpose of static modifier?

Static modifier is commonly used in all programming languages. There are two distinct reasons for using the static modifier whether its C, Java, C#, PHP or...

## Arrays Vs Lists – Which one to use?

Both Arrays and Lists helps us to store list of elements. But which one to choose is an important design decision that is directly related...

## C# File, Directory Manipulation

C# provide two versions of File, Directory manipulation options – 1) Static methods based and 2) Instance methods based. Static method based operations are provided...

## MVC Architecture

MVC architecture has been in place since past 4 decades or so when GUI (Graphical Use Interfaces) started to be used widely. The idea is simple...

## C# Program to find Age

Below is a C# program to find Age from a Date of Birth. Enjoy! public class Person    {        public string Name { get; set; }        public Person(DateTime birthdate)        {            BirthDate = birthdate;        }        public DateTime BirthDate { get; private set; }        public int Age{                        get { ...

## Usage of params modifier in C#

Lets see how to use params modifier in C#. The perfect example is Calculator implementation. ‘params’ access modifier when used on a method argument, allows...

Constructors need to be overloaded depending on what extend of data/properties need to be initialized in order to set the object to a particular state....

## Using LINQ in C#

LINQ or Language Integrated Query gives the capability to query objects and C# allows two distinctive ways to achieve this – You can either use LINQ...

## Using DateTime in C#

Below is very simple usage of DateTime – class DateTimePr     {         static void Main(string args)         {             var datetime = new DateTime();             var now = DateTime.Now;             var today = DateTime.Today;             Console.WriteLine(now);             Console.WriteLine(today);             Console.WriteLine(now.Hour);             Console.WriteLine(now.ToLongDateString());             Console.WriteLine(now.ToString());         }     }...

## Reading a file in C#

Below is a simple program in C# that reads a file and outputs the longest word in it. Enjoy! using System; using System.IO; using System.Collections.Generic; namespace <yourNS> {     class FilesNDirs...

## Finding Lowest number from a List in C#

Below is a simple program to find the lowest number from a list of numbers – using System; using System.Collections.Generic; namespace GroundCSApp {     class GetSmallest     {         public static void Main(string argvs)         {             var numlist = new List<int> { 1, 2, 3, 4, 5, 6 };...