C++ Programming Tutorial for Beginners

Tic Tac Toe c++ game project source code and documentation

2019-12-12T13:54:00.012-08:00

Here we will learn how to develop a tic tac toe multiplayer game project in С++ programming language with source code

Introduction
Let's assume you are a beginner in the c++ programming language and looking for a detailed guide with source code for the tic tac toe game.

This post will definitely help you to guide the complete process of development with a detailed explanation of code.

This C++ Game project is developed using C++ code blocks IDE. It has a defined board size of 5X5 with two modes.

1. Player vs Player. 2. Player vs Computer

C++ Concepts used in this c++ code project:

Variables
Two-dimensional Arrays (2D arrays)
Nested for loop
if else statement
functions

Code Explanation
In this c++ game, there are 5 global variables and 11 functions. Every function defines a separate different action in the game. The practice of defining functions for a separate action or related work always helps to keep the code clean, readable, and also trackable.

Variables
#define BoardSize 5
char Player1Move = 'X';
char Player2Move = 'O';
int p1 = 1;
int p2 = 2;

Functions

void menu();
void printBoard();
void input(int);
void player1();
void player2();
void p2p();
bool check();
bool defend(int, int, int);
bool attack();
void computerMoves(int);
void p2c();

2D Arrays

char board[BoardSize][BoardSize];

int b[BoardSize][BoardSize] = { 0 }; How code works?
"board" and "b" are two arrays, the board represents X for player 1 and O for player 2. 'b' is used only in player vs Computer game represents 1 for the first player and 2 for the second player which helps to build logic for computer moves.

Global variables description

BoardSize defines the tic tac toe game board size of 5
player1Move defines the symbol for player 1 which is 'X'
player2Move defines the symbol for player 2 which is 'O'
p1 represents value for the first player, it will be 1 or 2
p2 represents value for the second player, it will be 1 or 2
p1 and p2 are the variables that help to build the logic for the player to computer module
player will select as a 1st or 2nd turn

Functions description

menu
simple menu function shows and manage three options

player vs player
player vs computer
exit
according to the user choice call-related function.

printBoard
print the 5-by-5 board on the console.

input(int)
Takes input from user in both cases, player to player(form both players) and in the player to computer(only form player).
Asks the user to enter row number and column number for example 1 and 1 mean first cell of the board

player1
Calls in the case of player to player for player 1 move simply clear the screen first and then print the marker sign of player and then call above described input function.

player2
Calls in the case of a player to player for player 2 move simply clear the screen first and then print the marker sign of player and then call above described input function.

p2p
Calls player1 and player2 functions one by one and calls check function after every turn of the player e.g check function call when player1 place his/her marker on the board.

check
Checks the status of the game after every placement of the new marker this function will return true when all marks of the same type are in any row, column, or diagonally, otherwise, this function will return false.

defend
This function is for computer vs player move and called for computer move in this function computer will check the first all rows, columns and diagonals.

If the computer is having a possible winning move. Take the step and wins and also Checks if the player (opponent) has a possible winning move, takes a step to block the player.

attack aka Attacking move
Take a step such that it has winning possibilities in the next moves. place the marker in such a row or column which contains computer's marker more.

computerMove
Calls first defend function, check any possibility to win in this move, then check any possibility for the player wins.

If find any possibility to win or defend, place the marker at that place but if couldn't find then return false and if defend function return false then call the attack function.

if any cell is empty which may help the computer to win in the next moves then place a marker at that point but if not found then place any cell empty in the board.

p2c
first asks the user to play as a first or second player then according to the user's choice call the first turn for computer or player after every turn call the check function to determine the winning of any player, and when board filled, draw the game and return to the main menu.

C++ Source Code

#include<iostream>
#include<Windows.h>
#include<time.h>
#include<cstdlib>
#define BoardSize 5
char Player1Move = 'X';
char Player2Move = 'O';
int p1 = 1;
int p2 = 2;
void menu();
void printBoard();
void input(int);
void player1();
void player2();
void p2p();
bool check();
bool defend(int, int, int);
bool attack();
void computerMoves(int);
void p2c();
using namespace std;
char board[BoardSize][BoardSize];
int b[BoardSize][BoardSize] = { 0 }; // additional array for efficient computer Vs Human Game.
int main()
{
	menu();
	system("pause");
	return 0;
}
//Main Menu Function
void menu()
{
	for (int i = 0; i < BoardSize; i++)
	{
		for (int j = 0; j < BoardSize; j++)
		{
			board[i][j] = '\0';
		}
	}
	system("CLS");
	int choice;
	cout << "\n\t\t\t\t\tTic Tac Toe Game";
	cout << "\n\n\t\t\t\t1.Human Player VS Human Player";
	cout << "\n\t\t\t\t2.Human Player VS Computer";
	cout << "\n\t\t\t\t3.Exit\n";
	cin >> choice;
	switch (choice)
	{
	case 1:
		printBoard();
		p2p();
		break;
	case 2:
		p2c();
		break;
	case 3:
		exit(1);
	default:
		cout << "Please enter a valid choice(1, 2 or 3)\n";
		system("pause");
		menu();
	}
}
//Function for display board
void printBoard()
{
	system("CLS");
	cout << "\n\n\n\n";
	cout << "\t\t\t\t   1     2     3     4     5   \n";
	cout << "\t\t\t\t+-----+-----+-----+-----+-----+\n";
	cout << "\t\t\t\t|     |     |     |     |     |\n";
	cout << "\t\t\t      1 |  " << board[0][0] << "  |  " << board[0][1] << "  |  " << board[0][2] << "  |  " << board[0][3] << "  |  " << board[0][4] << "  |\n";
	cout << "\t\t\t\t|     |     |     |     |     |\n";

	cout << "\t\t\t\t+-----+-----+-----+-----+-----+\n";
	cout << "\t\t\t\t|     |     |     |     |     |\n";
	cout << "\t\t\t      2 |  " << board[1][0] << "  |  " << board[1][1] << "  |  " << board[1][2] << "  |  " << board[1][3] << "  |  " << board[1][4] << "  |\n";
	cout << "\t\t\t\t|     |     |     |     |     |\n";
	cout << "\t\t\t\t+-----+-----+-----+-----+-----+\n";
	cout << "\t\t\t\t|     |     |     |     |     |\n";
	cout << "\t\t\t      3 |  " << board[2][0] << "  |  " << board[2][1] << "  |  " << board[2][2] << "  |  " << board[2][3] << "  |  " << board[2][4] << "  |\n";
	cout << "\t\t\t\t|     |     |     |     |     |\n";
	cout << "\t\t\t\t+-----+-----+-----+-----+-----+\n";
	cout << "\t\t\t\t|     |     |     |     |     |\n";
	cout << "\t\t\t      4 |  " << board[3][0] << "  |  " << board[3][1] << "  |  " << board[3][2] << "  |  " << board[3][3] << "  |  " << board[3][4] << "  |\n";
	cout << "\t\t\t\t|     |     |     |     |     |\n";
	cout << "\t\t\t\t+-----+-----+-----+-----+-----+\n";
	cout << "\t\t\t\t|     |     |     |     |     |\n";
	cout << "\t\t\t      5 |  " << board[4][0] << "  |  " << board[4][1] << "  |  " << board[4][2] << "  |  " << board[4][3] << "  |  " << board[4][4] << "  |\n";
	cout << "\t\t\t\t|     |     |     |     |     |\n";
	cout << "\t\t\t\t+-----+-----+-----+-----+-----+\n";
}
//Input Function
void input(int turn)
{
	int row, col;
	cout << "Please enter Row Number:\t";
	cin >> row;
	cout << "Please enter Column Number:\t";
	cin >> col;
	row--;
	col--;
	if (row < 5 && col < 5)
	{
		if (board[row][col] == '\0')
		{
			if (turn == 1)
			{
				board[row][col] = Player1Move;
				b[row][col] = p1;
			}
			else
			{
				board[row][col] = Player2Move;
				b[row][col] = p2;
			}
		}
		else
		{
			cout << "This Cell is already fill\n";
			input(turn);
		}
	}
	else
	{
		cout << "Please enter an Valid cell Number\n";
		input(turn);
	}
}

//Player1 Turn Function
void inline player1()
{
	system("CLS");
	printBoard();
	cout << "Player1 [X] Your Turn\n";
	input(1);
}
//Player2 Function
void inline player2()
{
	system("CLS");
	printBoard();
	cout << "Player2 [O] Your Turn\n";
	input(2);
}
//Player VS Player Game Funcation
void inline p2p()
{
	for (int i = 0; i < 13; i++)
	{
		player1();
		if (i > 3)
		{
			if (check())
			{
				system("CLS");
				printBoard();
				cout << "\n\t\t\t\tCongrats!! Player1 Won the Game!!\n";
				cout << "\n\t\t\t\t";
				system("pause");
				menu();
			}
		}
		if (i == 12)
		{
			system("CLS");
			printBoard();
			cout << "\n\t\t\t\tOopss!! Game Drawn!!\n";
			system("pause");
			menu();
		}
		player2();
		if (i > 3)
		{
			if (check())
			{
				system("CLS");
				printBoard();
				cout << "\n\t\t\t\tCongrats!! Player2 Won the Game!!\n";
				cout << "\n\t\t\t\t";
				system("pause");
				menu();
			}
		}

	}
}
//Check the Status Of Game
bool check()
{
	for (int i = 0; i < 5; i++)
	{
		if ((board[i][0] != '\0') && (board[i][0] == board[i][1]) && (board[i][1] == board[i][2]) && (board[i][2] == board[i][3]) && (board[i][3] == board[i][4]) || (board[0][i] != '\0') && (board[0][i] == board[1][i]) && (board[1][i] == board[2][i]) && (board[2][i] == board[3][i]) && (board[3][i] == board[4][i]))
		{
			return true;
		}
	}
	if ((board[0][0] != '\0') && (board[0][0] == board[1][1]) && (board[1][1] == board[2][2]) && (board[2][2] == board[3][3]) && (board[3][3] == board[4][4]))
	{
		return true;
	}
	else if ((board[0][4] != '\0') && (board[0][4] == board[1][3]) && (board[1][3] == board[2][2]) && (board[2][2] == board[3][1]) && (board[3][1] == board[4][0]))
	{
		return true;
	}
	else
	{
		return false;
	}
}
//defend function for Computer
bool defend(int comp, int player, int brd)
{
	if (brd < 5)
	{
		return false;
	}
	else if (b[0][0] + b[1][1] + b[2][2] + b[3][3] + b[4][4] == 4 * comp && b[0][0] != player && b[1][1] != player && b[2][2] != player && b[3][3] != player && b[4][4] != player)
	{
		for (int i = 0; i < 5; i++)
		{
			if (b[i][i] == 0)
			{
				b[i][i] = p2;
				board[i][i] = Player2Move;
				return true;
			}
		}
	}
	else if (b[0][4] + b[1][3] + b[2][2] + b[3][1] + b[4][0] == 4 * comp && b[0][4] != player && b[1][3] != player && b[2][2] != player && b[3][1] != player && b[4][0] != player)
	{
		for (int i = 0; i < 5; i++)
		{
			if (b[i][4 - i] == 0)
			{
				b[i][4 - i] = p2;
				board[i][4 - i] = Player2Move;
				return true;
			}
		}
	}
	else
	{
		for (int i = 0; i < 5; i++)
		{
			if (b[i][0] + b[i][1] + b[i][2] + b[i][3] + b[i][4] == 4 * comp && b[i][0] != player && b[i][1] != player && b[i][2] != player && b[i][3] != player && b[i][4] != player)
			{
				for (int j = 0; j < 5; j++)
				{
					if (b[i][j] == 0)
					{
						b[i][j] = p2;
						board[i][j] = Player2Move;
						return true;
					}
				}
			}
			else if (b[0][i] + b[1][i] + b[2][i] + b[3][i] + b[4][i] == 4 * comp && b[0][i] != player && b[1][i] != player && b[2][i] != player && b[3][i] != player && b[4][i] != player)
			{
				for (int j = 0; j < 5; j++)
				{
					if (b[j][i] == 0)
					{
						b[j][i] = p2;
						board[j][i] = Player2Move;
						return true;
					}
				}
			}
		}
	}
	return false;
}
//attack -- take a move as to win in future
bool attack()
{
	if (b[0][0] + b[0][4] + b[4][0] + b[4][4] == p1 || b[0][0] + b[0][4] + b[4][0] + b[4][4] == 4 * p1)
	{
		for (int i = 0; i < 5; i++)
		{
			if (b[i][0] + b[i][1] + b[i][2] + b[i][3] + b[i][4] == p2 && b[i][0] == p2 || b[i][1] == p2 || b[i][2] == p2 || b[i][3] == p2 || b[i][4] == p2)
			{
				if (i == 3)
				{
					for (int j = 0; j < 5; j++)
					{
						if (b[i][j] == 0)
						{
							b[i][j] = p2;
							board[i][j] = Player2Move;
							return true;
						}
					}
				}
				else
				{
					for (int j = 4; j >= 0; j--)
					{
						if (b[i][j] == 0)
						{
							b[i][j] = p2;
							board[i][j] = Player2Move;
							return true;
						}
					}
				}
			}
			if (b[0][i] + b[1][i] + b[2][i] + b[3][i] + b[4][i] == p2 && b[0][i] == p2 || b[1][i] == p2 || b[2][i] == p2 || b[3][i] == p2 || b[4][i] == p2)
			{
				if (i == 3)
				{
					for (int j = 0; j < 5; j++)
					{
						if (b[j][i] == 0)
						{
							b[j][i] = p2;
							board[j][i] = Player2Move;
							return true;
						}
					}
				}
				else
				{
					for (int j = 4; j >= 0; j--)
					{
						if (b[j][i] == 0)
						{
							b[j][i] = p2;
							board[j][i] = Player2Move;
							return true;
						}
					}
				}
			}
		}
		if (b[0][0] + b[1][1] + b[2][2] + b[3][3] + b[4][4] == p2 && b[0][0] == p2 || b[1][1] == p2 || b[2][2] == p2 || b[3][3] == p2 || b[4][4] == p2)
		{
			for (int i = 4; i >= 0; i--)
			{
				if ((b[i][i] == 0) && ((b[i][0] + b[i][1] + b[i][2] + b[i][3] + b[i][4] == p2 && (b[i][0] == p2 || b[i][1] == p2 || b[i][2] == p2 || b[i][3] == p2 || b[i][4] == p2)) || ((b[0][i] + b[1][i] + b[2][i] + b[3][i] + b[4][i] == p2) && (b[0][i] == p2 || b[1][i] == p2 || b[2][i] == p2 || b[3][i] == p2 || b[4][i] == p2))))
				{
					b[i][i] = p2;
					board[i][i] = Player2Move;
					return true;
				}
			}
			for (int i = 4; i >= 0; i--)
			{
				if (b[i][i] == 0)
				{
					if (((b[i][0] + b[i][1] + b[i][2] + b[i][3] + b[i][4] == p1 && (b[i][0] == p1 || b[i][1] == p1 || b[i][2] == p1 || b[i][3] == p1 || b[i][4] == p1)) || ((b[0][i] + b[1][i] + b[2][i] + b[3][i] + b[4][i] == p1) && (b[0][i] == p1 || b[1][i] == p1 || b[2][i] == p1 || b[3][i] == p1 || b[4][i] == p1))))
					{
						b[i][i] = p2;
						board[i][i] = Player2Move;
						return true;
					}
				}
			}
			for (int i = 4; i >= 0; i--)
			{
				if (b[i][i] == 0)
				{
					b[i][i] = p2;
					board[i][i] = Player2Move;
					return true;
				}
			}
		}
		else if (b[0][4] + b[1][3] + b[2][2] + b[3][1] + b[4][0] == p2 && b[0][4] == p2 || b[1][3] == p2 || b[2][2] == p2 || b[3][1] == p2 || b[4][0] == p2)
		{
			for (int i = 4; i >= 0; i--)
			{
				if (b[i][4 - i] == 0 && ((b[i][0] + b[i][1] + b[i][2] + b[i][3] + b[i][4] == p2 && (b[i][0] == p2 || b[i][1] == p2 || b[i][2] == p2 || b[i][3] == p2 || b[i][4] == p2)) || ((b[0][4 - i] + b[1][4 - i] + b[2][4 - i] + b[3][4 - i] + b[4][4 - i] == p2) && (b[0][4 - i] == p2 || b[1][4 - i] == p2 || b[2][4 - i] == p2 || b[3][4 - i] == p2 || b[4][4 - i] == p2))))
				{
					b[i][4 - i] = p2;
					board[i][4 - i] = Player2Move;
					return true;
				}
			}
			for (int i = 4; i >= 0; i--)
			{
				if (b[i][4 - i] == 0)
				{
					if (((b[i][0] + b[i][1] + b[i][2] + b[i][3] + b[i][4] == p1 && (b[i][0] == p1 || b[i][1] == p1 || b[i][2] == p1 || b[i][3] == p1 || b[i][4] == p1)) || ((b[0][4 - i] + b[1][4 - i] + b[2][4 - i] + b[3][4 - i] + b[4][4 - i] == p1) && (b[0][4 - i] == p1 || b[1][4 - i] == p1 || b[2][4 - i] == p1 || b[3][4 - i] == p1 || b[4][4 - i] == p1))))
					{
						b[i][4 - i] = p2;
						board[i][4 - i] = Player2Move;
						return true;
					}
				}
			}
			for (int i = 4; i >= 0; i--)
			{
				if (b[i][4 - i] == 0)
				{
					b[i][4 - i] = p2;
					board[i][4 - i] = Player2Move;
					return true;
				}
			}
		}
	}
	else
	{
		if(b[0][0]+b[1][1]+b[2][2]+b[3][3]+b[4][4]==p2 && (b[0][0] == p2 || b[1][1] == p2 || b[2][2] == p2 || b[3][3] == p2 || b[4][4] == p2))
		{
			for (int i = 4; i >= 0; i--)
			{
				if ((b[i][i] == 0) && ((b[i][0] + b[i][1] + b[i][2] + b[i][3] + b[i][4] == p2 && (b[i][0] == p2 || b[i][1] == p2 || b[i][2] == p2 || b[i][3] == p2 || b[i][4] == p2)) || ((b[0][i] + b[1][i] + b[2][i] + b[3][i] + b[4][i] == p2) && (b[0][i] == p2 || b[1][i] == p2 || b[2][i] == p2 || b[3][i] == p2 || b[4][i] == p2))))
				{
					b[i][i] = p2;
					board[i][i] = Player2Move;
					return true;
				}
			}
			for (int i = 4; i >= 0; i--)
			{
				if (b[i][i] == 0)
				{
					if (((b[i][0] + b[i][1] + b[i][2] + b[i][3] + b[i][4] == p1 && (b[i][0] == p1 || b[i][1] == p1 || b[i][2] == p1 || b[i][3] == p1 || b[i][4] == p1)) || ((b[0][i] + b[1][i] + b[2][i] + b[3][i] + b[4][i] == p1) && (b[0][i] == p1 || b[1][i] == p1 || b[2][i] == p1 || b[3][i] == p1 || b[4][i] == p1))))
					{
						b[i][i] = p2;
						board[i][i] = Player2Move;
						return true;
					}
				}
			}
			for (int i = 4; i >= 0; i--)
			{
				if (b[i][i] == 0)
				{
					b[i][i] = p2;
					board[i][i] = Player2Move;
					return true;
				}
			}
		}
		else if (b[0][4] + b[1][3] + b[2][2] + b[3][1] + b[4][0] == p2 && b[0][4] == p2 || b[1][3] == p2 || b[2][2] == p2 || b[3][1] == p2 || b[4][0] == p2)
		{
			for (int i = 4; i >= 0; i--)
			{
				if (b[i][4 - i] == 0 && ((b[i][0] + b[i][1] + b[i][2] + b[i][3] + b[i][4] == p2 && (b[i][0] == p2 || b[i][1] == p2 || b[i][2] == p2 || b[i][3] == p2 || b[i][4] == p2)) || ((b[0][4 - i] + b[1][4 - i] + b[2][4 - i] + b[3][4 - i] + b[4][4 - i] == p2) && (b[0][4 - i] == p2 || b[1][4 - i] == p2 || b[2][4 - i] == p2 || b[3][4 - i] == p2 || b[4][4 - i] == p2))))
				{
					b[i][4 - i] = p2;
					board[i][4 - i] = Player2Move;
					return true;
				}
			}
			for (int i = 4; i >= 0; i--)
			{
				if (b[i][4 - i] == 0)
				{
					if (((b[i][0] + b[i][1] + b[i][2] + b[i][3] + b[i][4] == p1 && (b[i][0] == p1 || b[i][1] == p1 || b[i][2] == p1 || b[i][3] == p1 || b[i][4] == p1)) || ((b[0][4 - i] + b[1][4 - i] + b[2][4 - i] + b[3][4 - i] + b[4][4 - i] == p1) && (b[0][4 - i] == p1 || b[1][4 - i] == p1 || b[2][4 - i] == p1 || b[3][4 - i] == p1 || b[4][4 - i] == p1))))
					{
						b[i][4 - i] = p2;
						board[i][4 - i] = Player2Move;
						return true;
					}
				}
			}
			for (int i = 4; i >= 0; i--)
			{
				if (b[i][4 - i] == 0)
				{
					b[i][4 - i] = p2;
					board[i][4 - i] = Player2Move;
					return true;
				}
			}
		}
		else
		{
			for (int i = 0; i < 5; i++)
			{
				if (b[i][0] + b[i][1] + b[i][2] + b[i][3] + b[i][4] == p2 && b[i][0] == p2 || b[i][1] == p2 || b[i][2] == p2 || b[i][3] == p2 || b[i][4] == p2)
				{
					if (i == 3)
					{
						for (int j = 0; j < 5; j++)
						{
							if (b[i][j] == 0)
							{
								b[i][j] = p2;
								board[i][j] = Player2Move;
								return true;
							}
						}
					}
					else
					{
						for (int j = 4; j >= 0; j--)
						{
							if (b[i][j] == 0)
							{
								b[i][j] = p2;
								board[i][j] = Player2Move;
								return true;
							}
						}
					}
				}
				else if (b[0][i] + b[1][i] + b[2][i] + b[3][i] + b[4][i] == p2 && b[0][i] == p2 || b[1][i] == p2 || b[2][i] == p2 || b[3][i] == p2 || b[4][i] == p2)
				{
					if (i == 3)
					{
						for (int j = 0; j < 5; j++)
						{
							if (b[j][i] == 0)
							{
								b[j][i] = p2;
								board[j][i] = Player2Move;
								return true;
							}
						}
					}
					else
					{
						for (int j = 4; j >= 0; j--)
						{
							if (b[j][i] == 0)
							{
								b[j][i] = p2;
								board[j][i] = Player2Move;
								return true;
							}
						}
					}
				}
			}
		}
	}
	return false;
}
//Computer Moves
void computerMoves(int x)
{
	if (!defend(p2, p1, x))
	{
		if (!defend(p1, p2, x))
		{
			if ((b[0][0] + b[0][4] + b[4][0] + b[4][4] == p1 + p2 || b[0][0] + b[0][4] + b[4][0] + b[4][4] == p1 + 2 * p2) && b[2][2] == 0)
			{
				for (int i = 0; i < 5; i += 2)
				{
					for (int j = 0; j < 5; j += 2)
					{
						if (b[i][j] == 0)
						{
							b[i][j] = p2;
							board[i][j] = Player2Move;
							goto end;
						}
					}
				}
			}
			else if (x == 2 && b[2][2] == 0)
			{
				b[2][2] = p2;
				board[2][2] = Player2Move;
				goto end;
			}
			if (!attack())
			{
				if (x == 0)
				{
					time_t seconds;
					time(&seconds);
					srand((unsigned int)seconds);
					int i, j;
					i = (rand() % 2) * 4;
					j = (rand() % 2) * 4;
					b[i][j] = p2;
					board[i][j] = Player2Move;
				}
				else if (b[2][2] == 0)
				{
					b[2][2] = p2;
					board[2][2] = Player2Move;
				}
				else
				{
					for (int i = 0; i < 5; i++)
					{
						for (int j = 0; j < 5; j++)
						{
							if (b[i][j] == 0)
							{
								b[i][j] = p2;
								board[i][j] = Player2Move;
								goto end;
							}
						}
					}
				}
			}
		}
	}
end:
	cout << endl;
}
//Player VS Computer Funcation
void p2c()
{
	system("CLS");
	cout << "\n\n\n\t\t\t\tYou wanna go 1st or 2nd(1 or 2)\n";
	int choice;
	cin >> choice;
	switch (choice)
	{
	case 1:
		cout << "\t\t\t\tYour symbol is X and Computer's symbol is O\n";
		cout << "\t\t\t\t";
		system("pause");
		for (int i = 0; i < 25;)
		{
			system("CLS");
			printBoard();
			input(p1);
			system("CLS");
			printBoard();
			i++;
			if (i > 8)
			{
				if (check())
				{
					system("CLS");
					printBoard();
					cout << "\n\t\t\t\tCongrats!! You Won the Game!!\n";
					cout << "\n\t\t\t\t";
					system("pause");
					menu();
				}
			}
			if (i >= 24)
			{
				system("CLS");
				printBoard();
				cout << "\n\t\t\t\tOopss!! Game Drawn!!\n";
				system("pause");
				menu();
			}
			computerMoves(i);
			system("CLS");
			printBoard();
			i++;
			if (i > 9)
			{
				if (check())
				{
					system("CLS");
					printBoard();
					cout << "\n\t\t\t\Oopss!! Computer Won the Game!!\n";
					cout << "\n\t\t\t\t";
					system("pause");
					menu();
				}
			}
		}
		break;
	case 2:
	{
		p2 = 1;
		p1 = choice;
		Player1Move = 'O';
		Player2Move = 'X';

		cout << "\t\t\t\tYour symbol is O and Computer's symbol is X\n";
		cout << "\t\t\t\t";
		system("pause");
		for (int i = 0; i < 25;)
		{
			system("CLS");
			printBoard();
			computerMoves(i);
			system("CLS");
			printBoard();
			i++;
			if (i > 8)
			{
				if (check())
				{
					system("CLS");
					printBoard();
					cout << "\n\t\t\t\Oopss!! Computer Won the Game!!\n";
					cout << "\n\t\t\t\t";
					system("pause");
					menu();
				}
			}
			if (i >= 24)
			{
				system("CLS");
				printBoard();
				cout << "\n\t\t\t\tOopss!! Game Drawn!!\n";
				system("pause");
				menu();
			}
			input(p2);
			system("CLS");
			printBoard();
			i++;
			if (i > 9)
			{
				if (check())
				{
					system("CLS");
					printBoard();
					cout << "\n\t\t\t\tCongrats!! You Won the Game!!\n";
					cout << "\n\t\t\t\t";
					system("pause");
					menu();
				}
			}
		}
		break;

	}
	default:
		cout << "Invalid Input..!!\n ";
		system("pause");
		p2c();
		break;
	}
}

Check more c++ examples here C++ Simple Examples

Looking for a website for IT solutions?

2018-08-11T17:35:00.001-07:00

Many of the times we think there should be a website which have different types of solutions. Why?
For example we like a blog/website due to

Its content
Author writing tone
Design
To the point content no long stories

And we get addicted to this web or blog. Let a website contains solutions about frontend development only. Its author is a gem and explains very well for you and you get your solutions quickly.
At the same time there is another website which has backend programming solutions but you get its explanation after digging out more and more. So you will like first author have backend solutions too?
Yes here is the website SolutionSpirit.com which does this it has vast covering solutions categories.

If you are an android developer mush check their android solutions category. Like scrolling recycler view making items shuffle incorrectly is to the point explained.

After reading their about us page it feels they are fully dedicated to provide the best solutions in super easy way and their content proves that too.

Design
Its simple clean and focus on the content no extra design to disturb your attention towards content. And currently they don't have ads on their site but a donate button. They should have fewer ads to keep there sources up and running hope they will.

How about quality of solutions?
Well the solutions I found on their site is worth for the beginners and for the experience person as well. There is an example I my self working on android faced a problem about recycle view after too many hours of searching here and there I found a solution but not efficient in the above link the described the best way of the problem by overriding methods of adapter.

As a whole they did an excellent job by making live a site like solutionSpirit.com I wish them best of luck and keep solving the problems of others.

Do My Assignment for Me Requests Picked up & Dealt with Ease!

2018-06-14T20:58:00.000-07:00

A perfectly matching programming assignment writer with a great track record in a particular area is assigned to check, research and write your project, regardless the complexity level and the deadline.

When working with a professional programming assignments guru at AssignCode.com, you’ve got an opportunity to hand in a top quality report or a term paper in a timely manner! Online procedure requires very little payment and effort from your side.

When you make a choice to collaborate with the programming assignment helper online, you do the right thing towards academic progress and your career in general. Working hard on every other custom writing assignment in the field, the experts of the company save numerous hours of researching, writing and editing to high school, college and university students.

Entrust your project on JAVA, app development, Python, or any other subject in the computer science to the experienced and qualified academic solutions providers at AssignCode.com and enjoy the range of options offered for both new and regular clients. Stunning performance with every ‘Do my assignment for me, please’ is a must for a moderate price.

Pay Someone to Do My Assignment Requests of Any Level Are Welcome!

The process of ordering a programming homework assignment from the websites like AssignCode.com is quite simple and quick. To do this, you have to fill in an online form with the ‘Please, do my assignment for me’ request.

To get the best online assistance possible, you have to explain, describe and give all additional comments on the key points of the college programming project. Thus, the representative of the website will have a complete understanding of your task, as well as its specifications.

At the point, the customer of the companies like AssignCode.com should be exceptionally careful. The thing is that the more precise and accurate the project instructions are – the better-researched custom written assignment you’re going to find in your inbox.

Here are the central features of the programming writing service available at AssignCode.com:

US Specialists

When you provide the company with your ‘I’d like to pay someone to do my assignment, do you have an expert available at the moment?’ request, you’re provided with an opportunity to co-work with someone, who has the relevant experience to solve the problems of your academic level.

The websites like AssignCode.com, where professional programming assistance is offered for relatively cheap prices, recruit native English speakers, who have proven experience needed to accomplish a good looking paper free from any sort of errors. Every candidate is properly evaluated before becoming a part of the company staff.

Complete Confidentiality

Privacy of every client approaching the company for help is the number one priority for AssignCode.com. When you place your ‘I need a competent programming assignment problem solver, who can get my MBA paper done for money’ order, you’re provided with the services based on the solid principles of non-disclosure and privacy.

100% Unique Work

Every single project that you buy from the writers of Assign Code company is free from plagiarism and includes all the answers to your particular question.

Every programming paper on JAVA, app development or any other issue is custom written from scratch, so you won’t find the project you purchase from AssignCode.com anywhere else on the web.

Unique Approach

AssignCode.com is a custom writing company, where a team of trusted people know exactly how to write the paper that you need. The experts of the sites like the one mentioned above have fully dedicated themselves to provide unparalleled experience to every client, who stands behind the ‘I’m assigned with the programming writing task. Will you be there to help me somehow?’ order.

power function c++ code using pointers

2017-11-11T16:01:00.001-08:00

Write a program in c++ programming that calculates the power of a number using pointers.

User will input two numbers and program will calculate power. First number will be base and second number will be the power.

This code explains the following C++ Concepts

Functions with the same arguments but different return data types
How to use pointers
Using pointers value to perform an arithmetic operation

program prototypes

functions prototypes

Program has been tested on code blocks c++ complier.
see also: pointers multiplication example, pointers addition example code

program source code:

#include <iostream>
using namespace std;


int Power(int *, int *);
float Power1(int *, int *);
double Power2(int *, int *);

int main()

{
    int a,b;

 cout<<"Enter 1st Value:";
 cin>>a;

 cout<<"Enter 2nd Value:";
 cin>>b;

 cout<<endl <<endl;

 cout<<"...............Power.........." <<endl <<endl;

 cout<<"The Power of these numbers is:"<<Power(&a,&b)<<endl;
 cout<<"The Power of these numbers is:"<<Power1(&a,&b)<<endl;
 cout<<"The Power of these numbers is:"<<Power2(&a,&b)<<endl;

 cout<<endl <<endl;

 return 0;

}


int Power(int *x, int *y)

{
 int P=1;
 for(int i=0;i<*y;i++)
 {
  P=(P * *x);
 }
 return P;
}

float Power1(int *x, int *y)

{
 float P=1;
 for(int i=0;i<*y;i++)
 {
  P=(P * *x);
 }
 return P;
}

double Power2(int *x, int *y)

{
 double P=1;
 for(int i=0;i<*y;i++)
 {
   P=(P * *x);
 }
 return P;
}

program input-output

This program will help to clear the concept of functions with different return types.

It shows the output of 3 functions having the same arguments but different return types.

Besides this, it shows how to use the value with pointers.
find more examples here: c++ examples code

pointer multiplication c++ example source code

2017-11-08T15:38:00.003-08:00

Write a program in c++ programming to multiply two numbers using pointers.

Make a function for multiplication that takes input from the user.

There should be three functions and each should return a different data type int, float and double.

Prototypes for functions are

This program has been tested on c++ code blocks IDE
C++ source code:
see also: pointer addition example source code

#include <iostream>
using namespace std;

int Mult(int *, int *);
float Mult1(int *, int *);
double Mult2(int *, int *);

int main(){

    int a,b;

 cout<<"Enter 1st Value:";
 cin>>a;
 cout<<"Enter 2nd Value:";
 cin>>b;
 cout<<"...............Multiplication.........." <<endl <<endl;

 cout<<"The integer Multiplication of these numbers is:"<<Mult(&a,&b)<<endl;
 cout<<"The float Multiplication of these numbers is:"<<Mult1(&a,&b)<<endl;
 cout<<"The double Multiplication of these numbers is:"<<Mult2(&a,&b)<<endl;

 cout<<endl <<endl;
 return 0;
}

int Mult(int *x, int *y){
 int Prod;
 Prod=(*x * *y);
 return Prod;
}

float Mult1(int *x, int *y){
 float Prod;
 Prod=(*x * *y);
 return Prod;
}

double Mult2(int *x, int *y){
 double Prod;
 Prod=(*x * *y);
 return Prod;
}

Program input-output

If you don't want to write prototypes then just add three methods above the main method.

Suggestion number 1

I suggest first remove the prototypes then examine the errors the c++ compiler (IDE) will show. This will help to understand errors also.

Suggestion number 2

We have 3 methods with all methods take two integers as arguments. Try by changing argument data types and return types and examine the different cases in which your code is working and not working.

Always keep doing experiments with the code for fast learning.

Each and every time you face an error you learn.

Read also: c++ programming simple examples

c++ pointer addition example

2017-10-03T14:50:00.001-07:00

Write a c++ program that calculates the addition of two numbers using pointers.

Program has three functions receiving two-pointers reference.

Three functions return int, float and double sum of numbers.

This c++ tutorial uses the following concepts.

pointers in c++
functions
passing reference to a function

This code has been tested on code blocks c++ compiler

C++ source code

#include <iostream>
using namespace std;

int Sum(int *, int *);
float Sum1(int *,int *);
double Sum2(int *, int *);


int main()

{
    int a,b;


 cout<<"Enter 1st Value:";
 cin>>a;

 cout<<"Enter 2nd Value:";
 cin>>b;

    cout<<"...............ADDITION.............." <<endl <<endl;

 cout<<"The integer sum of these numbers is:"<<Sum(&a,&b)<<endl;
 cout<<"The float sum of these numbers is:"<<Sum1(&a,&b)<<endl;
 cout<<"The double sum of these numbers is:"<<Sum2(&a,&b)<<endl;

 cout<<endl <<endl;

 cout<<endl <<endl;


 return 0;

}


int Sum(int *x, int *y )

{
 int sum;
 sum=(*x + *y);
 return sum;
}

float Sum1(int *x,int *y )

{
 float sum;
 sum=(*x + *y);
 return sum;
}

double Sum2(int *x, int *y )
{
 double sum;
 sum=(*x + *y);
 return sum;

}

Input-output of code

addition functions

Find more here: c++ examples with output
github source

c++ program to count spaces in a string using pointers

2017-09-26T09:32:00.003-07:00

Write a c++ program that calculates a number of spaces in a string using pointers.

Make a separate function that takes a pointer then using for loop it calculates all spaces.

This example covers the concept of

pointers in c++
functions
loops in c++

C++ source code

#include <iostream>
using namespace std;
void Calculate_Spaces_alpha(char *);
int main()
{
 char string [] = "This string contains four spaces";
 cout <<"String is "<<"\n%----------------------%\n" << string << endl;
 char *str = string;
 Calculate_Spaces_alpha(str);
 return 0;
}

void Calculate_Spaces_alpha(char *ptr)
{
 int spaces = 0;
 int characters = 0;
 for ( ; ; ptr++)
 {
  if (*ptr == ' ')
   spaces++;

  if (*ptr != '\0')
   characters++;
  else
   break;
 }
 cout << "\nIn the String: "<< endl << "Characters:  "<< characters << endl <<"Spaces:  " << spaces << endl;
}

This code has been tested on the c++ Code blocks compiler

code view

also check more examples here: C++ Example Source Codes

Experts to rely on when you stuck with programming

2017-09-07T12:57:00.000-07:00

Since nowadays there are plenty of high-paid career opportunities in the IT and Software Engineering spheres worldwide, many young people are committed to gaining a degree in Computer Science. However, entering a college or university, they can hardly imagine how complicated and time-consuming their homework may appear over time. And when it comes to combining that homework with assignments in other subjects, students quickly get tired, frustrated, and unwilling to do any kind of work. As a result, they either skip some tasks and burn the midnight oil doing the most important ones or turn to help to put a part of their burden on somebody else’s shoulders. Fortunately or not, sometimes the latter helps the most.

Service to use when programming becomes a headache

One of the number of services throughout the internet to provide the students with homework assistance is Assignment Expert which has been strengthening its position in the market for 8 years so far, claiming to have delivered more than 51k tasks. It specializes in Computer Science, Programming, Mathematics, Engineering, Economics and some others and, what’s more, boasts to have 900 qualified and individually tested experts in all disciplines presented on their website, so every task has high chance to be accomplished.

When the experts accept the task, they promise the customer to accomplish the assignment successfully with a 97% guarantee. Only rare cases show that sometimes misunderstandings may happen during the task processing, but most of them can be easily solved with deposits or compensations. Such high percent of excellently prepared projects is gained due to another special thing about the service that is its quality control team. This is a group of in-office experts and members of the support team who control the actual process of doing any kind of homework 24/7 and keep in touch with the customers online all the time.
The success of the company also lies in a fair system of task evaluation where the price of every task is budget-friendly and depends on the thorough examination of the factors like the level of difficulty, volume, and deadline set in the requirements by the customer.

Computer Science as a major branch of Assignment Expert

Programming is one of the most popular АЕ’s specializations; the team of developers work with a large number of languages, technologies and Integrated Development Environments that are used in studying of Programming and creation of business offers. C/C++, Java, and Python branches embrace all kinds of assignments from the easiest basic tasks to big projects like, for example, implementation of PageRank algorithm, grid and parallel computing, FTP clients/servers, etc. A wide range of tasks deal with databases, web design and web development.

Programmers engaged in C and C++ often perform the tasks that presuppose implementation of various algorithms while working with data structures and numerical methods. It is the use of abstract data types (like stack or queue), trees, graph algorithms, genetic algorithms and many more. A bunch of tasks go to developing and coding the hierarchy of classes for console games, modeling of the work of the stocks, airports and office applications. For the works to receive the good grades, it's important to follow the main quality standards, namely modularity, standards of code structuring and variables naming, avoidance of memory leaks and often passing tests. The experts of Assignment Expert test the code with the help of Visual Studio и Valgrind to make sure all results are correct. Besides, clear comments and explanations that follow the code help the customers to better and quicker grasp the topic and feel confident during classes.

The service constantly checks the clients’ feedback in order to always be able to support, fix, and improve the quality of its work. First year students, for instance, always pay attention to the accompanying documentation (the process of project building, screenshots, purpose of classes and functions, description of complex algorithms from the point of view of the algorithms’ developer) and they are often grateful for the provided material on different websites like Sitejabber.com, “They provided screenshots of it working, even how to compile it. I am simply amazed”. From the reviews, it’s clear that the experts communicate with the customer until the grade is given, “My experience with them has been absolutely top notch. Starting from customer service to getting the assignment done and the follow up support”. The student, therefore, can always be sure in the best result, "I send back my assignment a lot of times. In every time, I find very good cooperation from expert and customer services."

It can’t be argued that the number of successful homework tasks is the result of hard work of the professionals of Assignment Expert, independent quality control and experience they got over the years.

c++ program for complex numbers using class

2017-07-22T14:54:00.001-07:00

C++ class for addition, subtraction, multiplication and division for complex numbers.

Class has four functions to perform arithmetic operations. It takes two complex numbers input from user real and imaginary parts separately.

The double data type is used to perform all operations. Code tested using c++ CodeBlocks IDE.

#include <iostream>
using namespace std;

//**********COMPLEX CLASS************************
class Complex{

private:
 double real,imag;

public:
 Complex(){
  real=imag=0;
 }
 ///////////////////////////////////////////////////
 Complex(double r){
  real=r;
  imag=0;
 }
    ///////////////////////////////////////////////////
 Complex(double r, double i){
  real=r;
  imag=i;
 }
    ///////////////////////////////////////////////////
 Complex(Complex &obj){
  real=obj.real;
  imag=obj.imag;
 }
    ///////////////////////////////////////////////////
 Complex add(Complex c){
        Complex Add;
  Add.real = real + c.real;
  Add.imag = imag + c.imag;
        return Add;
 }
    ///////////////////////////////////////////////////
 Complex sub(Complex c){
  Complex Sub;
  Sub.real = real - c.real;
  Sub.imag = imag - c.imag;
  return Sub;
 }
    ///////////////////////////////////////////////////
 Complex mult(Complex c){
        Complex Mult;
  Mult.real = real*c.real - imag*c.imag;
  Mult.imag = real*c.imag - c.real*imag;
  return Mult;
 }
    ///////////////////////////////////////////////////
 Complex div(Complex c){
  Complex Div;
  Div.real = (real*c.real + imag*c.imag)/(c.real*c.real + c.imag*c.imag);
  Div.imag = (imag*c.real + real*c.imag)/(c.real*c.real + c.imag*c.imag);
  return Div;
 }
    ///////////////////////////////////////////////////
 void print(){
        cout<<real<<"+"<<imag<<"i"<<endl<<endl;
 }
    ///////////////////////////////////////////////////
 double getReal() const{
  return real;
 }
    ///////////////////////////////////////////////////
 double getImag() const{
  return imag;
 }
    ///////////////////////////////////////////////////
 void setReal(double re){
  real = re;

 }
    ///////////////////////////////////////////////////
 void setImag(double im){
        imag = im;
 }
 ///////////////////////////////////////////////////

};

//***************MAIN***************************
int main()
{
 double real1,imag1,real2,imag2;

 cout<<"Enter the Real  part of First Number: ";
    cin>>real1;
 cout<<"Enter the imaginary  part of First Number: ";
 cin>>imag1;
    Complex obj1(real1,imag1);
 obj1.print();

 cout<<"Enter the Real part of Second Number: ";
 cin>>real2;
 cout<<"Enter the Imaginary part of second number: ";
    cin>>imag2;
    Complex obj2(real2,imag2);
 obj2.print();

 Complex c;
 c = obj1.add(obj2);
 cout<<"Addition is : ("<<c.getReal()<<")+("<<c.getImag()<<")i"<<endl;
 c= obj1.sub(obj2);
 cout<<endl<<"Subtraction is : ("<<c.getReal()<<")+("<<c.getImag()<<")i"<<endl;

 c= obj1.mult(obj2);
 cout<<endl<<"Multiplication is : ("<<c.getReal()<<")+("<<c.getImag()<<")i"<<endl;

 c= obj1.div(obj2);
 cout<<endl<<"Division result  is : ("<<c.getReal()<<")+("<<c.getImag()<<")i"<<endl;
 return 0;
}

program input-output

program output

Program images

also, find more examples here C++ Examples

Queue c++ project source code using array, linked list and doubly/circular linked list

2017-03-25T18:11:00.001-07:00

Download C++ project source code for queue implementation using an array, linked list and circular linked list.

Each data structure has its own functions. Users can select from the menu for data type selection to build a queue.

All data structures have basic queue functions. En-queue, De-queue, show front, show queue, etc.

Project source code. It has been tested on Code Blocks C++ IDE.

#include<iostream>
#include<windows.h>

using namespace std;
// Queue for array
void enqueue(int);
void dequeue();
int isempty();
int isfull();
void array_call();
void show();
const int total = 2;
int marks[total];
int rear = -1; //rear mean last element of queue
int front = 0;//front mean first element of queue
int counter = 0;

// Queue for Linklist
struct list
{
 int data;
 list * next;
};
list *f, *c, *p, *temp;
int linklist_counter = 0;
void linklist_insert();
void linklist_call();
void linklist_dequeu();
void linklist_show();
void linklist_front();
int linklist_isempty();

//Queue for Double Linklist
struct dlist {
 dlist * prev;
 int data;
 dlist * next;
};
dlist *first, *current, *previos, *tamp;
int dlinklist_counter = 0;
void dlinklist_insert();
void dlinklist_call();
void dlinklist_dequeu();
void dlinklist_show();
void dlinklist_front();

int main()
{
zee:
 system("cls");
 int i;
 cout << "\t\t\t\t Welcome in Queue  \n 1- Array \n 2- Link List \n 3- Double Link List \n 4- EXIT \n";
 cin >> i;

 switch (i)
 {
 case 1:
  array_call();
  goto zee;
 case 2:
  linklist_call();
  goto zee;
 case 3:

  dlinklist_call();
  goto zee;
 case 4:
  break;
 default:
  cout << " You enter invalid number PLZ Select again \n";
  system("pause");
  goto zee;
 }
 return 0;
}

// function of Array
void array_call()
{
start:
 system("cls");
 cout << "\t\t\t\t Welcome in Queue with Array";
 int input;
 cout << "\n 1- Enqueu \n 2- Dequeu \n 3- Front\n 4- Show all data \n 5- Exit from Queue in Array \n";
 cin >> input;
 switch (input)
 {
 case 1:
 {int z; z = isfull();
 if (z)
 {
  int y;//y is input whiich you insert in queue
  cout << "Enter you number";
  cin >> y;
  enqueue(y);
  cout << " Number entered \n";
  system("pause");
 }
 else
 {
  cout << "Your Queue is full \n";
  system("pause");
 }
 goto start;
 break;
 }

 case 2:
 { int a; a = isempty();
 if (a)
 {
  dequeue();
  cout << "Number deleted \n ";
  system("pause");
 }
 else
 {
  cout << "Your Queue is Empty \n";
  system("pause");
 }
 goto start;
 break;
 }

 case 3:
 {
  int a; a = isempty();
  if (a)
   cout << "\n Your front value is " << marks[front]<<endl;
  else
   cout << "Your Queue is Empty"<<endl;
  system("pause");
  goto start;
  break;
 }

 case 4:
 {
  int a; a = isempty();
  if (a)
   show();
  else
   cout << "Your Queue is Empty"<<endl;
  system(" pause");
  goto start;
 }

 case 5:
 {
  break;
 }
 default:
  cout << "\n You enter invalid Number \n";
  system("pause");
  goto start;
  break;
 }

}
void enqueue(int x)
{
 rear = (rear + 1) % total;
 marks[rear] = x;
 counter = counter + 1;
}
void dequeue()
{
 front = (front + 1) % total;
 counter = counter - 1;
}
int isempty()
{
 return(counter != 0);
}
int isfull()
{
 return(counter != total);
}
void show()
{
 int j = front;
 for (int i = 0; i < counter; i++)
 {

  cout << " " << marks[j];
  j++;
  j = j%total;
 }
}

//function of LINK LIST
void linklist_call()
{
linklist_start:
 system("cls");
 cout << "\t\t\t\t Welcome in linklist Queue";
 int input;
 cout << "\n 1- Enqueu \n 2- Dequeu \n 3- show list \n 4- Front\n 5- Exit\n";
 cin >> input;
 switch (input)
 {
 case 1:
  linklist_insert();
  cout << " Number entered \n";
  system("pause");
  goto linklist_start;
 case 2:
  linklist_dequeu();
  goto linklist_start;
 case 3:
  linklist_show();
  goto linklist_start;
 case 4:
  linklist_front();
  goto linklist_start;
 case 5:
  break;
 default:
  cout << " You enter invalid number ";
  system("pause");
  goto linklist_start;
 }
}
void linklist_insert()
{
 c = new list;
 if (linklist_counter == 0)
 {
  f = c;
  p = c;
  cout << " Enter data ";
  cin >> c->data;
 }
 else
 {
  p->next = c;
  p = c;
  cout << " Enter data";
  cin >> c->data;
 }
 c->next = NULL;
 linklist_counter++;
}
void linklist_dequeu()
{
 if (linklist_counter == 0)
 {
  cout << " Queue is empty";
  system("pause");
 }
 else
 {
  f = f->next;
  linklist_counter--;
  cout << "Number deleted \n ";
  system("pause");
 }
}
void linklist_show()
{
 int emp = linklist_isempty();
 if (emp)
 {
  temp = f;
  while (temp->next != NULL)
  {
   cout << " " << temp->data;
   temp = temp->next;
  }
  cout << " " << temp->data;
 }
 else
 {
  cout << " Queue is empty";
 }
 system("pause");
}
void linklist_front()
{
 int emp = linklist_isempty();
 if (emp)
 {
  cout << " " << f->data;
 }
 else
 {
  cout << " Queue is empty";
 }
 system("pause");
}
int linklist_isempty()
{
 return(linklist_counter != 0);
}

//function of DOUBLE LINK LIST
void dlinklist_call()
{
dlinklist_start:
 system("cls");
 cout << "\t\t\t\t Welcome in Double linklist Queue";
 int dinput;
 cout << "\n 1- Enqueu \n 2- Dequeu \n 3- show list \n 4- Front\n 5- Exit\n";
 cin >> dinput;
 switch (dinput)
 {
 case 1:
  dlinklist_insert();
  cout << " Number entered \n";
  system("pause");
  goto dlinklist_start;
 case 2:
  dlinklist_dequeu();
  cout << "Number deleted \n ";
  system("pause");
  goto dlinklist_start;
 case 3:
  dlinklist_show();
  goto dlinklist_start;
 case 4:
  dlinklist_front();
  goto dlinklist_start;
 case 5:
  break;
 default:
  cout << " You enter invalid number ";
  system("pause");
  goto dlinklist_start;
 }
}
void dlinklist_insert()
{
 current = new dlist;
 if (dlinklist_counter == 0)
 {
  previos = current;
  first = current;
  current->prev = NULL;
  cout << " Enter Data ";
  cin >> current->data;
 }
 else
 {
  previos->next = current;
  current->prev = previos;
  previos = current;
  cout << " Enter Data ";
  cin >> current->data;
 }
 current->next = NULL;
 dlinklist_counter++;
}
void dlinklist_dequeu()
{
 if (dlinklist_counter == 0)
 {
  cout << " Queue is empty";
  system("pause");
 }
 else
 {
  first = first->next;
  dlinklist_counter--;
 }
}
void dlinklist_show()
{
 if (dlinklist_counter == 0)
 {
  cout << " Queue is empty";
 }
 else
 {
  tamp = first;
  while (tamp->next != NULL)
  {
   cout << " " << tamp->data;
   tamp = tamp->next;
  }
  cout << " " << tamp->data;
 }
 system("pause");
}
void dlinklist_front()
{
 if (dlinklist_counter == 0)
 {
  cout << " Queue is empty";
 }
 else
 {
  cout << " " << first->data;
 }
 system("pause");
}

Project output images.

Also, find more c++ simple projects

doubly linked list queue in c++ source code

2017-03-16T14:58:00.001-07:00

Doubly or circular linked list in c++ programming example using the queue data structure.

This c++ source code of the queue has four main functions.

enqueue
dequeue
show front
show list

It uses the concept of functions, pointer, struct and switch, etc..

#include<iostream>
#include<windows.h>

using namespace std;

//Queue for Double Linklist
struct dlist {
	dlist * prev;
	int data;
	dlist * next;
};
dlist *first, *current, *previos, *tamp;
int dlinklist_counter = 0;
void dlinklist_insert();
void dlinklist_call();
void dlinklist_dequeu();
void dlinklist_show();
void dlinklist_front();

int main()
{
	system("cls");

    dlinklist_call();
   return 0;
}


//function of DOUBLE LINK LIST
void dlinklist_call()
{
dlinklist_start:
	system("cls");
	cout << "\t\t\t\t Welcome in Double linklist Queue";
	int dinput;
	cout << "\n 1- Enqueu \n 2- Dequeu \n 3- show list \n 4- Front\n 5- Exit\n";
	cin >> dinput;
	switch (dinput)
	{
	case 1:
		dlinklist_insert();
		cout << " Number entered \n";
		system("pause");
		goto dlinklist_start;
	case 2:
		dlinklist_dequeu();
		cout << "Number deleted \n ";
		system("pause");
		goto dlinklist_start;
	case 3:
		dlinklist_show();
		goto dlinklist_start;
	case 4:
		dlinklist_front();
		goto dlinklist_start;
	case 5:
		break;
	default:
		cout << " You enter invalid number ";
		system("pause");
		goto dlinklist_start;
	}
}
void dlinklist_insert()
{
	current = new dlist;
	if (dlinklist_counter == 0)
	{
		previos = current;
		first = current;
		current->prev = NULL;
		cout << " Enter Data ";
		cin >> current->data;
	}
	else
	{
		previos->next = current;
		current->prev = previos;
		previos = current;
		cout << " Enter Data ";
		cin >> current->data;
	}
	current->next = NULL;
	dlinklist_counter++;
}
void dlinklist_dequeu()
{
	if (dlinklist_counter == 0)
	{
		cout << " Queue is empty";
		system("pause");
	}
	else
	{
		first = first->next;
		dlinklist_counter--;
	}
}
void dlinklist_show()
{
	if (dlinklist_counter == 0)
	{
		cout << " Queue is empty";
	}
	else
	{
		tamp = first;
		while (tamp->next != NULL)
		{
			cout << " " << tamp->data;
			tamp = tamp->next;
		}
		cout << " " << tamp->data;
	}
	system("pause");
}
void dlinklist_front()
{
	if (dlinklist_counter == 0)
	{
		cout << " Queue is empty";
	}
	else
	{
		cout << " " << first->data;
	}
	system("pause");
}

Program output:

queue data structure implementation c++ code using linked list

2017-03-14T14:09:00.003-07:00

C++ program to implement queue data structure using linked list

It uses struct, pointers, switch and functions concept. Every queue operation has its own function. User selects its desired operation from the menu.
It has the following functions

Enqueue
Dequeue
Show front
Show All

    #include<windows.h>
    #include<iostream>
    using namespace std;

    // Queue for Linklist
    struct list
    {
     int data;
     list * next;
    };
    list *f, *c, *p, *temp;
    int linklist_counter = 0;
    void linklist_insert();
    void linklist_call();
    void linklist_dequeu();
    void linklist_show();
    void linklist_front();
    int linklist_isempty();

    int main()
    {
     linklist_call();
     return 0;
    }
    //function of LINK LIST
    void linklist_call()
    {
    linklist_start:
     system("cls");
     cout << "\t\t\t\t Welcome in linklist Queue";
     int input;
     cout << "\n 1- Enqueue \n 2- Dequeue \n 3- show list \n 4- Front\n 5- Exit\n";
     cin >> input;
     switch (input)
     {
     case 1:
      linklist_insert();
      cout << " Number entered \n";
      system("pause");
      goto linklist_start;
     case 2:
      linklist_dequeu();
      goto linklist_start;
     case 3:
      linklist_show();
      goto linklist_start;
     case 4:
      linklist_front();
      goto linklist_start;
     case 5:
      break;
     default:
      cout << " You enter invalid number ";
      system("pause");
      goto linklist_start;
     }
    }
    void linklist_insert()
    {
     c = new list;
     if (linklist_counter == 0)
     {
      f = c;
      p = c;
      cout << " Enter data ";
      cin >> c->data;
     }
     else
     {
      p->next = c;
      p = c;
      cout << " Enter data";
      cin >> c->data;
     }
     c->next = NULL;
     linklist_counter++;
    }
    void linklist_dequeu()
    {
     if (linklist_counter == 0)
     {
      cout << " Queue is empty";
      system("pause");
     }
     else
     {
      f = f->next;
      linklist_counter--;
      cout << "Number deleted \n ";
      system("pause");
     }
    }
    void linklist_show()
    {
     int emp = linklist_isempty();
     if (emp)
     {
      temp = f;
      while (temp->next != NULL)
      {
       cout << " " << temp->data;
       temp = temp->next;
      }
      cout << " " << temp->data;
     }
     else
     {
      cout << " Queue is empty";
     }
     system("pause");
    }
    void linklist_front()
    {
     int emp = linklist_isempty();
     if (emp)
     {
      cout << " " << f->data;
     }
     else
     {
      cout << " Queue is empty";
     }
     system("pause");
    }
    int linklist_isempty()
    {
     return(linklist_counter != 0);
    }

Read Also: Array based queue c++ code example
program output:

linked list queue c++

As a beginner, this code helps the student to clear the concept of the queue using a linked list. It can be used as started code for beginners. find a full c++ array based queue project.

also read other projects here: c++ simple projects

queue implementation in c++ programming using array

2017-03-08T14:48:00.002-08:00

Simple c++ queue using array implementation example

which uses function loops and conditional statement concepts.

Queue size is fixed in a variable name 'total which is equal to 5 it can be changed as a requirement.

User select function from menu and enter input.
We have the following functions in queue

Enqueue
Dequeue
Is Empty (check if the queue is empty)
Is Full
Show All

Prototypes are

void enqueue(int);

void dequeue();

int isempty();

int isfull();

void show();

C++ Queue Source Code

#include<iostream>
#include<windows.h>

using namespace std;
// Queue for array
void enqueue(int);
void dequeue();
int isempty();
int isfull();
void array_call();
void show();
const int total = 5;
int marks[total];
int rear = -1; //rear mean last element of queue
int front = 0;//front mean first element of queue
int counter = 0;

int main()
{
    array_call();
    return 0;
}

// function of Array
void array_call()
{
start:
 system("cls");
 cout << "\t\t\t\t Welcome in Queue with Array";
 int input;
 cout << "\n 1- Enqueu \n 2- Dequeu \n 3- Front\n 4- Show all data \n 5- Exit from Queue in Array \n";
 cin >> input;
 switch (input)
 {
 case 1:
 {int z; z = isfull();
 if (z)
 {
  int y;//y is input whiich you insert in queue
  cout << "Enter you number: ";
  cin >> y;
  enqueue(y);
  cout << " Number entered \n";
  system("pause");
 }
 else
 {
  cout << "Your Queue is full \n";
  system("pause");
 }
 goto start;
 break;
 }

 case 2:
 { int a; a = isempty();
 if (a)
 {
  dequeue();
  cout << "Number deleted \n ";
  system("pause");
 }
 else
 {
  cout << "Your Queue is Empty \n";
  system("pause");
 }
 goto start;
 break;
 }

 case 3:
 {
  int a; a = isempty();
  if (a)
   cout << "\n Your front value is " << marks[front]<<endl;
  else
   cout << "Your Queue is Empty"<<endl;
  system("pause");
  goto start;
  break;
 }

 case 4:
 {
  int a; a = isempty();
  if (a)
   show();
  else
   cout << "Your Queue is Empty"<<endl;
  system(" pause");
  goto start;
 }

 case 5:
 {
  break;
 }
 default:
  cout << "\n You enter invalid Number \n";
  system("pause");
  goto start;
  break;
 }

}
void enqueue(int x)
{
 rear = (rear + 1) % total;
 marks[rear] = x;
 counter = counter + 1;
}
void dequeue()
{
 front = (front + 1) % total;
 counter = counter - 1;
}
int isempty()
{
 return(counter != 0);
}
int isfull()
{
 return(counter != total);
}
void show()
{
 int j = front;
 for (int i = 0; i < counter; i++)
 {
  cout << " " << marks[j];
  j++;
  j = j%total;
 }
}

Run the program

Example input output

Input-output

This example may help beginner students to understand the concept of an array using a queue. It is recommended to change the code add validations etc.

Payroll management system project C++ source code

2017-02-24T13:43:00.001-08:00

Payroll management system project in C++ is a console application with the use of Object Oriented Programming with graphics.

This project has multiple classes and sub-classes. User can perform basic actions like

create, edit, and delete an employee's record

Besides these, this c++ payroll management project also allows users to print the salary slip for a particular employee.

Employee’s grades are categorized as A, B, C, D and E.

This project is large, complete and we tried our best to make it error-free. The source code is very long – over 1500 lines and developed in Code Blocks compiler.

It uses the concept of following c/c++ topics:

Pointers
Loops
Functions
If Else
Switch
Classes
File handling
C++ Graphics
Function overriding and overloading
composition

The Project has 3 main classes and with many functions in the menu

LINES

LINE_HOR
LINE_VER
BOX
CLEARUP
CLEARDOWN

MENUS

MAIN_MENU
EDIT_MENU
INTRODUCTION

EMPLOYEE

NEW_EMPLOYEE
MODIFICATION
DELETION
DISPLAY
LIST
SALARY_SLIP
ADD_RECORD
MODIFY_RECORD
DELETE_RECORD
LASTCODE
CODEFOUND
RECORDNO
FOUND_CODE
DISPLAY_RECORD
VALID_DATE

How Project Works:

Addition of a New Employee:

This feature is under the public functions of class employees.

The information handled in this feature is employee code number, name, address, phone number, joining date (day, month and year), designation, grade and loan.

Modify or Editing an Employee Record:

Users can edit the employee's code number, joining date (day, month and year), name, address, phone number, designation, grade, house allowance and loan given to the employee.

Deleting an Employee Record:

An employee's record can be deleted using the employee's code. A deletion confirmation message displays whether the user really wants to delete the record from the file.

Printing an Employee Salary Slip:

This feature also asks for the employee code.

Please note: Being unique, the employee code has been used to unlock or perform operations in many features of this payroll management system project in C++.

This function lists all the months of the year and asks for a date, employee name, designation, and grade from the user.

To print the salary slip, the user further needs to provide information such as a number of days worked in the month by the employee and the number of hours worked overtime.

The slip enlists the basic salary, allowance, deductions and net salary of the employee.

Displaying Employee Record:

By entering the employee's code number, users can access all the provided information related to a particular employee via this function.

The employee record information displayed is the one provided while adding a new employee record.

Displaying List of Employees:

This feature displays the record of all employees added to a file.

The records are displayed in a tabular pattern inclding information such as the code name of the employee, phone number, date of joining, designation, grade and salary.


#include<Windows.h>
#include <iostream>
#include <fstream>
#include <process.h>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <ctype.h>
#include <conio.h>
#include <time.h>
#include <unistd.h>

#include <dos.h>

using namespace std;

void gotoxy(int x, int y)
{
 COORD c = { x, y };
 SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), c);
}


class LINES
{
public:
 void LINE_HOR(int, int, int, char);
 void LINE_VER(int, int, int, char);
 void BOX(int, int, int, int, char);
 void CLEARUP(void);
 void CLEARDOWN(void);
};



class MENU
{
public:
 void MAIN_MENU(void);
private:
 void EDIT_MENU(void);
 void INTRODUCTION(void);
};



class EMPLOYEE
{
public:
 void NEW_EMPLOYEE(void);
 void MODIFICATION(void);
 void DELETION(void);
 void DISPLAY(void);
 void LIST(void);
 void SALARY_SLIP(void);
private:
 void ADD_RECORD(int, char[], char[], char[], int, int, int, char[], char, char, char, float, float);
 void MODIFY_RECORD(int, char[], char[], char[], char[], char, char, char, float, float);
 void DELETE_RECORD(int);
 int  LASTCODE(void);
 int  CODEFOUND(int);
 int  RECORDNO(int);
 int  FOUND_CODE(int);
 void DISPLAY_RECORD(int);
 int  VALID_DATE(int, int, int);

 int   code, dd, mm, yy;
 char  name[26], address[31], phone[10], desig[16];
 char  grade, house, convense;
 float loan, basic;
};



void MENU::MAIN_MENU(void)
{
 char ch;
 LINES L;
 L.CLEARUP();
 while (1)
 {
  system("cls");
  gotoxy(14, 3);
  cout << "     C++ Project for Payroll Management System";
  L.BOX(25, 7, 57, 9, 218);
  L.BOX(10, 5, 71, 21, 218);
  L.BOX(11, 6, 70, 20, 219);
  gotoxy(29, 8);
  cout << "PAYROLL MANAGEMENT SYSTEM";
  gotoxy(30, 11);
  cout << "1: NEW EMPLOYEE";
  gotoxy(30, 12);
  cout << "2: DISPLAY EMPLOYEE";
  gotoxy(30, 13);
  cout << "3: LIST OF EMPLOYEES";
  gotoxy(30, 14);
  cout << "4: SALARY SLIP";
  gotoxy(30, 15);
  cout << "5: EDIT";
  gotoxy(30, 16);
  cout << "0: QUIT";
  gotoxy(30, 18);
  cout << "ENTER YOUR CHOICE :";
  gotoxy(5, 23);

  ch = _getch();
  if (ch == 27 || ch == '0')
   break;
  else if (ch == '1')
  {
   EMPLOYEE E;
   E.NEW_EMPLOYEE();
  }
  else if (ch == '2')
  {
   EMPLOYEE E;
   E.DISPLAY();
  }
  else if (ch == '3')
  {
   EMPLOYEE E;
   E.LIST();
  }
  else if (ch == '4')
  {
   EMPLOYEE E;
   E.SALARY_SLIP();
  }
  else if (ch == '5')
   EDIT_MENU();
 }
 L.CLEARUP();
}



void MENU::EDIT_MENU(void)
{
 char ch;
 LINES L;
 L.CLEARDOWN();
 while (1)
 {
  system("cls");
  L.BOX(28, 8, 49, 10, 218);
  L.BOX(10, 5, 71, 21, 218);
  L.BOX(11, 6, 70, 20, 219);
  gotoxy(31, 9);
  cout << "E D I T  M E N U";
  gotoxy(30, 13);
  cout << "1: DELETE RECORD";
  gotoxy(30, 14);
  cout << "2: MODIFY RECORD";
  gotoxy(30, 15);
  cout << "0: EXIT";
  gotoxy(30, 17);
  cout << "ENTER YOUR CHOICE :";
  ch = _getch();
  if (ch == 27 || ch == '0')
   break;
  else if (ch == '1')
  {
   EMPLOYEE E;
   E.DELETION();
  }
  else if (ch == '2')
  {
   EMPLOYEE E;
   E.MODIFICATION();
  }
 }
 L.CLEARDOWN();
}


void LINES::LINE_HOR(int column1, int column2, int row, char c)
{
 for (column1; column1 <= column2; column1++)
 {
  gotoxy(column1, row);
  cout << c;
 }
}



void LINES::LINE_VER(int row1, int row2, int column, char c)
{
 for (row1; row1 <= row2; row1++)
 {
  gotoxy(column, row1);
  cout << c;
 }
}



void LINES::BOX(int column1, int row1, int column2, int row2, char c)
{
 char ch = 218;
 char c1, c2, c3, c4;
 char l1 = 196, l2 = 179;
 if (c == ch)
 {
  c1 = 218;
  c2 = 191;
  c3 = 192;
  c4 = 217;
  l1 = 196;
  l2 = 179;
 }
 else
 {
  c1 = c;
  c2 = c;
  c3 = c;
  c4 = c;
  l1 = c;
  l2 = c;
 }
 gotoxy(column1, row1);
 cout << c1;
 gotoxy(column2, row1);
 cout << c2;
 gotoxy(column1, row2);
 cout << c3;
 gotoxy(column2, row2);
 cout << c4;
 column1++;
 column2--;
 LINE_HOR(column1, column2, row1, l1);
 LINE_HOR(column1, column2, row2, l1);
 column1--;
 column2++;
 row1++;
 row2--;
 LINE_VER(row1, row2, column1, l2);
 LINE_VER(row1, row2, column2, l2);
}


//**********************************************************
// THIS FUNCTION CLEAR THE SCREEN LINE BY LINE UPWARD
//**********************************************************

void LINES::CLEARUP(void)
{
 for (int i = 25; i >= 1; i--)
 {
  sleep(20);
  gotoxy(1, i);
  clreol();
 }
}



void LINES::CLEARDOWN(void)
{
 for (int i = 1; i <= 25; i++)
 {
  delay(20);
  gotoxy(1, i);
  clreol();
 }
}


//**********************************************************
// THIS FUNCTION ADDS THE GIVEN DATA IN THE EMPLOYEE'S FILE
//**********************************************************

void EMPLOYEE::ADD_RECORD(int ecode, char ename[26], char eaddress[31], char ephone[10], int d, int m, int y, char edesig[16], char egrade, char ehouse, char econv, float eloan, float ebasic)
{
 fstream file;
 file.open("EMPLOYEE.DAT");
 code = ecode;
 strcpy(name, ename);
 strcpy(address, eaddress);
 strcpy(phone, ephone);
 dd = d;
 mm = m;
 yy = y;
 strcpy(desig, edesig);
 grade = egrade;
 house = ehouse;
 convense = econv;
 loan = eloan;
 basic = ebasic;
 file.write((char *) this, sizeof(EMPLOYEE));
 file.close();
}


//**********************************************************
// THIS FUNCTION MODIFY THE GIVEN DATA IN THE
// EMPLOYEE'S FILE
//**********************************************************

void EMPLOYEE::MODIFY_RECORD(int ecode, char ename[26], char eaddress[31], char ephone[10], char edesig[16], char egrade, char ehouse, char econv, float eloan, float ebasic)
{
 int recno;
 recno = RECORDNO(ecode);
 fstream file;
 file.open("EMPLOYEE.DAT", ios::out | ios::ate);
 strcpy(name, ename);
 strcpy(address, eaddress);
 strcpy(phone, ephone);
 strcpy(desig, edesig);
 grade = egrade;
 house = ehouse;
 convense = econv;
 loan = eloan;
 basic = ebasic;
 int location;
 location = (recno - 1) * sizeof(EMPLOYEE);
 file.seekp(location);
 file.write((char *) this, sizeof(EMPLOYEE));
 file.close();
}


//**********************************************************
// THIS FUNCTION DELETE THE RECORD IN THE EMPLOYEE FILE
// FOR THE GIVEN EMPLOYEE CODE
//**********************************************************

void EMPLOYEE::DELETE_RECORD(int ecode)
{
 fstream file;
 file.open("EMPLOYEE.DAT", ios::in);
 fstream temp;
 temp.open("temp.dat", ios::out);
 file.seekg(0, ios::beg);
 while (!file.eof())
 {
  file.read((char *) this, sizeof(EMPLOYEE));
  if (file.eof())
   break;
  if (code != ecode)
   temp.write((char *) this, sizeof(EMPLOYEE));
 }
 file.close();
 temp.close();
 file.open("EMPLOYEE.DAT", ios::out);
 temp.open("temp.dat", ios::in);
 temp.seekg(0, ios::beg);
 while (!temp.eof())
 {
  temp.read((char *) this, sizeof(EMPLOYEE));
  if (temp.eof())
   break;
  file.write((char *) this, sizeof(EMPLOYEE));
 }
 file.close();
 temp.close();
}


//**********************************************************
// THIS FUNCTION RETURNS THE LAST EMPLOYEE'S CODE
//**********************************************************

int EMPLOYEE::LASTCODE(void)
{
 fstream file;
 file.open("EMPLOYEE.DAT", ios::in);
 file.seekg(0, ios::beg);
 int count = 0;
 while (file.read((char *) this, sizeof(EMPLOYEE)))
  count = code;
 file.close();
 return count;
}


//**********************************************************
// THIS FUNCTION RETURNS 0 IF THE GIVEN CODE NOT FOUND
//**********************************************************

int EMPLOYEE::FOUND_CODE(int ecode)
{
 fstream file;
 file.open("EMPLOYEE.DAT", ios::in);
 file.seekg(0, ios::beg);
 int found = 0;
 while (file.read((char *) this, sizeof(EMPLOYEE)))
 {
  if (code == ecode)
  {
   found = 1;
   break;
  }
 }
 file.close();
 return found;
}


//**********************************************************
// THIS FUNCTION RETURNS RECORD NO. OF THE GIVEN CODE
//**********************************************************

int EMPLOYEE::RECORDNO(int ecode)
{
 fstream file;
 file.open("EMPLOYEE.DAT", ios::in);
 file.seekg(0, ios::beg);
 int recno = 0;
 while (file.read((char *) this, sizeof(EMPLOYEE)))
 {
  recno++;
  if (code == ecode)
   break;
 }
 file.close();
 return recno;
}


//**********************************************************
// THIS FUNCTION DISPLAYS THE LIST OF THE EMPLOYEES
//**********************************************************

void EMPLOYEE::LIST(void)
{
 system("cls");
 int row = 6, found = 0, flag = 0;
 char ch;
 gotoxy(31, 2);
 cout << "LIST OF EMPLOYEES";
 gotoxy(30, 3);
 cout << "~~~~~~~~~~~~~~~~~~~";
 gotoxy(1, 4);
 cout << "CODE NAME                     PHONE    DOJ         DESIGNATION    GRADE  SALARY";
 gotoxy(1, 5);
 cout << "~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~";
 fstream file;
 file.open("EMPLOYEE.DAT", ios::in);
 file.seekg(0, ios::beg);
 while (file.read((char *) this, sizeof(EMPLOYEE)))
 {
  flag = 0;
  delay(20);
  found = 1;
  gotoxy(2, row);
  cout << code;
  gotoxy(6, row);
  cout << name;
  gotoxy(31, row);
  cout << phone;
  gotoxy(40, row);
  cout << dd << "/" << mm << "/" << yy;
  gotoxy(52, row);
  cout << desig;
  gotoxy(69, row);
  cout << grade;
  if (grade != 'E')
  {
   gotoxy(74, row);
   cout << basic;
  }
  else
  {
   gotoxy(76, row);
   cout << "-";
  }
  if (row == 23)
  {
   flag = 1;
   row = 6;
   gotoxy(1, 25);
   cout << "Press any key to continue or Press <ESC> to exit";
   ch = getch();
   if (ch == 27)
    break;
   system("cls");
   gotoxy(31, 2);
   cout << "LIST OF EMPLOYEES";
   gotoxy(30, 3);
   cout << "~~~~~~~~~~~~~~~~~~~";
   gotoxy(1, 4);
   cout << "CODE NAME                     PHONE    DOJ         DESIGNATION    GRADE  SALARY";
   gotoxy(1, 5);
   cout << "~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~";
  }
  else
   row++;
 }
 if (!found)
 {
  gotoxy(5, 10);
  cout << "\7Records not found";
 }
 if (!flag)
 {
  gotoxy(1, 25);
  cout << "Press any key to continue...";
  getche();
 }
 file.close();
}


//**********************************************************
// THIS FUNCTION DISPLAYS THE RECORD OF THE EMPLOYEES
//**********************************************************

void EMPLOYEE::DISPLAY_RECORD(int ecode)
{
 fstream file;
 file.open("EMPLOYEE.DAT", ios::in);
 file.seekg(0, ios::beg);
 while (file.read((char *) this, sizeof(EMPLOYEE)))
 {
  if (code == ecode)
  {
   gotoxy(5, 5);
   cout << "Employee Code # " << code;
   gotoxy(5, 6);
   cout << "~~~~~~~~~~~~~";
   gotoxy(5, 7);
   cout << "Name         : " << name;
   gotoxy(5, 8);
   cout << "Address      : " << address;
   gotoxy(5, 9);
   cout << "Phone no.    : " << phone;
   gotoxy(5, 11);
   cout << "JOINING DATE";
   gotoxy(5, 12);
   cout << "~~~~~~~~~~~~";
   gotoxy(5, 13);
   cout << "Day   : " << dd;
   gotoxy(5, 14);
   cout << "Month : " << mm;
   gotoxy(5, 15);
   cout << "Year  : " << yy;
   gotoxy(5, 17);
   cout << "Designation  : " << desig;
   gotoxy(5, 18);
   cout << "Grade        : " << grade;
   if (grade != 'E')
   {
    gotoxy(5, 19);
    cout << "House (y/n)    : " << house;
    gotoxy(5, 20);
    cout << "Convense (y/n) : " << convense;
    gotoxy(5, 22);
    cout << "Basic Salary   : " << basic;
   }
   gotoxy(5, 21);
   cout << "Loan           : " << loan;
  }
 }
 file.close();
}


//**********************************************************
// THIS FUNCTION GIVE DATA TO ADD IN THE FILE
//**********************************************************

void EMPLOYEE::NEW_EMPLOYEE(void)
{
 system("cls");
 char  ch, egrade, ehouse = 'N', econv = 'N';
 char  ename[26], eaddress[31], ephone[10], edesig[16], t1[10];
 float t2 = 0.0, eloan = 0.0, ebasic = 0.0;
 int   d, m, y, ecode, valid;
 gotoxy(72, 2);
 cout << "<0>=EXIT";
 gotoxy(28, 3);
 cout << "ADDITION OF NEW EMPLOYEE";
 gotoxy(5, 5);
 cout << "Employee Code # ";
 gotoxy(5, 6);
 cout << "~~~~~~~~~~~~~";
 gotoxy(5, 7);
 cout << "Name         : ";
 gotoxy(5, 8);
 cout << "Address      : ";
 gotoxy(5, 9);
 cout << "Phone no.    : ";
 gotoxy(5, 11);
 cout << "JOINING DATE";
 gotoxy(5, 12);
 cout << "~~~~~~~~~~~~";
 gotoxy(5, 13);
 cout << "Day   : ";
 gotoxy(5, 14);
 cout << "Month : ";
 gotoxy(5, 15);
 cout << "Year  : ";
 gotoxy(5, 17);
 cout << "Designation  : ";
 gotoxy(5, 18);
 cout << "Grade        : ";
 gotoxy(5, 21);
 cout << "Loan           : ";

 ecode = LASTCODE() + 1;
 if (ecode == 1)
 {
  ADD_RECORD(ecode, "null", "null", "null", 0, 0, 0, "null", 'n', 'n', 'n', 0.0, 0.0);
  DELETE_RECORD(ecode);
 }
 gotoxy(21, 5);
 cout << ecode;
 do
 {
  valid = 1;
  gotoxy(5, 25);
  clreol();
  cout << "Enter the name of the Employee";
  gotoxy(20, 7);
  clreol();
  gets(ename);
  strupr(ename);
  if (ename[0] == '0')
   return;
  if (strlen(ename) < 1 || strlen(ename) > 25)
  {
   valid = 0;
   gotoxy(5, 25);
   clreol();
   cout << "\7Enter correctly (Range: 1..25)";
   getch();
  }
 } while (!valid);
 do
 {
  valid = 1;
  gotoxy(5, 25);
  clreol();
  cout << "Enter Address of the Employee";
  gotoxy(20, 8);
  clreol();
  gets(eaddress);
  strupr(eaddress);
  if (eaddress[0] == '0')
   return;
  if (strlen(eaddress) < 1 || strlen(eaddress) > 30)
  {
   valid = 0;
   gotoxy(5, 25);
   clreol();
   cout << "\7Enter correctly (Range: 1..30)";
   getch();
  }
 } while (!valid);
 do
 {
  valid = 1;
  gotoxy(5, 25);
  clreol();
  cout << "Enter Phone no. of the Employee or Press <ENTER> for none";
  gotoxy(20, 9);
  clreol();
  gets(ephone);
  if (ephone[0] == '0')
   return;
  if ((strlen(ephone) < 7 && strlen(ephone) > 0) || (strlen(ephone) > 9))
  {
   valid = 0;
   gotoxy(5, 25);
   clreol();
   cout << "\7Enter correctly";
   getch();
  }
 } while (!valid);
 if (strlen(ephone) == 0)
  strcpy(ephone, "-");
 char tday[3], tmonth[3], tyear[5];
 int td;
 do
 {
  valid = 1;
  do
  {
   gotoxy(5, 25);
   clreol();
   cout << "ENTER DAY OF JOINING";
   gotoxy(13, 13);
   clreol();
   gets(tday);
   td = atoi(tday);
   d = td;
   if (tday[0] == '0')
    return;
  } while (d == 0);
  do
  {
   gotoxy(5, 25);
   clreol();
   cout << "ENTER MONTH OF JOINING";
   gotoxy(13, 14);
   clreol();
   gets(tmonth);
   td = atoi(tmonth);
   m = td;
   if (tmonth[0] == '0')
    return;
  } while (m == 0);
  do
  {
   gotoxy(5, 25);
   clreol();
   cout << "ENTER YEAR OF JOINING";
   gotoxy(13, 15);
   clreol();
   gets(tyear);
   td = atoi(tyear);
   y = td;
   if (tyear[0] == '0')
    return;
  } while (y == 0);
  if (d>31 || d<1)
   valid = 0;
  else if (((y % 4) != 0 && m == 2 && d>28) || ((y % 4) == 0 && m == 2 && d>29))
   valid = 0;
  else if ((m == 4 || m == 6 || m == 9 || m == 11) && d>30)
   valid = 0;
  else if (y<1990 || y>2020)
   valid = 0;
  if (!valid)
  {
   valid = 0;
   gotoxy(5, 25);
   clreol();
   cout << "\7Enter correctly";
   getch();
   gotoxy(13, 14);
   clreol();
   gotoxy(13, 15);
   clreol();
  }
 } while (!valid);
 do
 {
  valid = 1;
  gotoxy(5, 25);
  clreol();
  cout << "Enter Designation of the Employee";
  gotoxy(20, 17);
  clreol();
  gets(edesig);
  strupr(edesig);
  if (edesig[0] == '0')
   return;
  if (strlen(edesig) < 1 || strlen(edesig) > 15)
  {
   valid = 0;
   gotoxy(5, 25);
   clreol();
   cout << "\7Enter correctly (Range: 1..15)";
   getch();
  }
 } while (!valid);
 do
 {
  gotoxy(5, 25);
  clreol();
  cout << "Enter Grade of the Employee (A,B,C,D,E)";
  gotoxy(20, 18);
  clreol();
  egrade = getche();
  egrade = toupper(egrade);
  if (egrade == '0')
   return;
 } while (egrade < 'A' || egrade > 'E');
 if (egrade != 'E')
 {
  gotoxy(5, 19);
  cout << "House (y/n)    : ";
  gotoxy(5, 20);
  cout << "Convense (y/n) : ";
  gotoxy(5, 22);
  cout << "Basic Salary   : ";
  do
  {
   gotoxy(5, 25);
   clreol();
   cout << "ENTER IF HOUSE ALLOWANCE IS ALLOTED TO EMPLOYEE OR NOT";
   gotoxy(22, 19);
   clreol();
   ehouse = getche();
   ehouse = toupper(ehouse);
   if (ehouse == '0')
    return;
  } while (ehouse != 'Y' && ehouse != 'N');
  do
  {
   gotoxy(5, 25);
   clreol();
   cout << "ENTER IF CONVENCE ALLOWANCE IS ALLOTED TO EMPLOYEE OR NOT";
   gotoxy(22, 20);
   clreol();
   econv = getche();
   econv = toupper(econv);
   if (econv == '0')
    return;
  } while (econv != 'Y' && econv != 'N');
 }
 do
 {
  valid = 1;
  gotoxy(5, 25);
  clreol();
  cout << "ENTER LOAN AMOUNT IF ISSUED";
  gotoxy(22, 21);
  clreol();
  gets(t1);
  t2 = atof(t1);
  eloan = t2;
  if (eloan > 50000)
  {
   valid = 0;
   gotoxy(5, 25);
   clreol();
   cout << "\7SHOULD NOT GREATER THAN 50000";
   getch();
  }
 } while (!valid);
 if (egrade != 'E')
 {
  do
  {
   valid = 1;
   gotoxy(5, 25);
   clreol();
   cout << "ENTER BASIC SALARY OF THE EMPLOYEE";
   gotoxy(22, 22);
   clreol();
   gets(t1);
   t2 = atof(t1);
   ebasic = t2;
   if (t1[0] == '0')
    return;
   if (ebasic > 50000)
   {
    valid = 0;
    gotoxy(5, 25);
    clreol();
    cout << "\7SHOULD NOT GREATER THAN 50000";
    getch();
   }
  } while (!valid);
 }
 gotoxy(5, 25);
 clreol();
 do
 {
  gotoxy(5, 24);
  clreol();
  cout << "Do you want to save (y/n) ";
  ch = getche();
  ch = toupper(ch);
  if (ch == '0')
   return;
 } while (ch != 'Y' && ch != 'N');
 if (ch == 'N')
  return;
 ADD_RECORD(ecode, ename, eaddress, ephone, d, m, y, edesig, egrade, ehouse, econv, eloan, ebasic);
}


//**********************************************************
// THIS FUNCTION GIVE CODE FOR THE DISPLAY OF THE RECORD
//**********************************************************

void EMPLOYEE::DISPLAY(void)
{
 system("cls");
 char t1[10];
 int t2, ecode;
 gotoxy(72, 2);
 cout << "<0>=EXIT";
 gotoxy(5, 5);
 cout << "Enter code of the Employee  ";
 gets(t1);
 t2 = atoi(t1);
 ecode = t2;
 if (ecode == 0)
  return;
 system("cls");
 if (!FOUND_CODE(ecode))
 {
  gotoxy(5, 5);
  cout << "\7Record not found";
  getch();
  return;
 }
 DISPLAY_RECORD(ecode);
 gotoxy(5, 25);
 cout << "Press any key to continue...";
 getch();
}


//**********************************************************
// THIS FUNCTION GIVE DATA FOR THE MODIFICATION OF THE
// EMPLOYEE RECORD
//**********************************************************

void EMPLOYEE::MODIFICATION(void)
{
 system("cls");
 char  ch, egrade, ehouse = 'N', econv = 'N';
 char  ename[26], eaddress[31], ephone[10], edesig[16], t1[10];
 float t2 = 0.0, eloan = 0.0, ebasic = 0.0;
 int   ecode, valid;
 gotoxy(72, 2);
 cout << "<0>=EXIT";
 gotoxy(5, 5);
 cout << "Enter code of the Employee  ";
 gets(t1);
 t2 = atoi(t1);
 ecode = t2;
 if (ecode == 0)
  return;
 system("cls");
 if (!FOUND_CODE(ecode))
 {
  gotoxy(5, 5);
  cout << "\7Record not found";
  getch();
  return;
 }
 gotoxy(72, 2);
 cout << "<0>=EXIT";
 gotoxy(22, 3);
 cout << "MODIFICATION OF THE EMPLOYEE RECORD";
 DISPLAY_RECORD(ecode);
 do
 {
  gotoxy(5, 24);
  clreol();
  cout << "Do you want to modify this record (y/n) ";
  ch = getche();
  ch = toupper(ch);
  if (ch == '0')
   return;
 } while (ch != 'Y' && ch != 'N');
 if (ch == 'N')
  return;
 system("cls");
 fstream file;
 file.open("EMPLOYEE.DAT", ios::in);
 file.seekg(0, ios::beg);
 while (file.read((char *) this, sizeof(EMPLOYEE)))
 {
  if (code == ecode)
   break;
 }
 file.close();
 gotoxy(5, 5);
 cout << "Employee Code # " << ecode;
 gotoxy(5, 6);
 cout << "~~~~~~~~~~~~~";
 gotoxy(40, 5);
 cout << "JOINING DATE : ";
 gotoxy(40, 6);
 cout << "~~~~~~~~~~~~~~";
 gotoxy(55, 5);
 cout << dd << "/" << mm << "/" << yy;
 gotoxy(5, 7);
 cout << "Name         : ";
 gotoxy(5, 8);
 cout << "Address      : ";
 gotoxy(5, 9);
 cout << "Phone no.    : ";
 gotoxy(5, 10);
 cout << "Designation  : ";
 gotoxy(5, 11);
 cout << "Grade        : ";
 gotoxy(5, 14);
 cout << "Loan           : ";
 do
 {
  valid = 1;
  gotoxy(5, 25);
  clreol();
  cout << "Enter the name of the Employee or <ENTER> FOR NO CHANGE";
  gotoxy(20, 7);
  clreol();
  gets(ename);
  strupr(ename);
  if (ename[0] == '0')
   return;
  if (strlen(ename) > 25)
  {
   valid = 0;
   gotoxy(5, 25);
   clreol();
   cout << "\7Enter correctly (Range: 1..25)";
   getch();
  }
 } while (!valid);
 if (strlen(ename) == 0)
 {
  strcpy(ename, name);
  gotoxy(20, 7);
  cout << ename;
 }
 do
 {
  valid = 1;
  gotoxy(5, 25);
  clreol();
  cout << "Enter Address of the Employee or <ENTER> FOR NO CHANGE";
  gotoxy(20, 8);
  clreol();
  gets(eaddress);
  strupr(eaddress);
  if (eaddress[0] == '0')
   return;
  if (strlen(eaddress) > 30)
  {
   valid = 0;
   gotoxy(5, 25);
   clreol();
   cout << "\7Enter correctly (Range: 1..30)";
   getch();
  }
 } while (!valid);
 if (strlen(eaddress) == 0)
 {
  strcpy(eaddress, address);
  gotoxy(20, 8);
  cout << eaddress;
 }
 do
 {
  valid = 1;
  gotoxy(5, 25);
  clreol();
  cout << "Enter Phone no. of the Employee or or <ENTER> FOR NO CHANGE";
  gotoxy(20, 9);
  clreol();
  gets(ephone);
  if (ephone[0] == '0')
   return;
  if ((strlen(ephone) < 7 && strlen(ephone) > 0) || (strlen(ephone) > 9))
  {
   valid = 0;
   gotoxy(5, 25);
   clreol();
   cout << "\7Enter correctly";
   getch();
  }
 } while (!valid);
 if (strlen(ephone) == 0)
 {
  strcpy(ephone, phone);
  gotoxy(20, 9);
  cout << ephone;
 }
 do
 {
  valid = 1;
  gotoxy(5, 25);
  clreol();
  cout << "Enter Designation of the Employee or <ENTER> FOR NO CHANGE";
  gotoxy(20, 10);
  clreol();
  gets(edesig);
  strupr(edesig);
  if (edesig[0] == '0')
   return;
  if (strlen(edesig) > 15)
  {
   valid = 0;
   gotoxy(5, 25);
   clreol();
   cout << "\7Enter correctly (Range: 1..15)";
   getch();
  }
 } while (!valid);
 if (strlen(edesig) == 0)
 {
  strcpy(edesig, desig);
  gotoxy(20, 10);
  cout << edesig;
 }
 do
 {
  gotoxy(5, 25);
  clreol();
  cout << "Enter Grade of the Employee (A,B,C,D,E) or <ENTER> FOR NO CHANGE";
  gotoxy(20, 11);
  clreol();
  egrade = getche();
  egrade = toupper(egrade);
  if (egrade == '0')
   return;
  if (egrade == 13)
  {
   egrade = grade;
   gotoxy(20, 11);
   cout << grade;
  }
 } while (egrade < 'A' || egrade > 'E');
 if (egrade != 'E')
 {
  gotoxy(5, 12);
  cout << "House (y/n)    : ";
  gotoxy(5, 13);
  cout << "Convense (y/n) : ";
  gotoxy(5, 15);
  cout << "Basic Salary   : ";
  do
  {
   gotoxy(5, 25);
   clreol();
   cout << "ALLOTED HOUSE ALLOWANCE ? or <ENTER> FOR NO CHANGE";
   gotoxy(22, 12);
   clreol();
   ehouse = getche();
   ehouse = toupper(ehouse);
   if (ehouse == '0')
    return;
   if (ehouse == 13)
   {
    ehouse = house;
    gotoxy(22, 12);
    cout << ehouse;
   }
  } while (ehouse != 'Y' && ehouse != 'N');
  do
  {
   gotoxy(5, 25);
   clreol();
   cout << "ALLOTED CONVENCE ALLOWANCE or <ENTER> FOR NO CHANGE";
   gotoxy(22, 13);
   clreol();
   econv = getche();
   econv = toupper(econv);
   if (econv == '0')
    return;
   if (econv == 13)
   {
    econv = convense;
    gotoxy(22, 13);
    cout << econv;
   }
  } while (econv != 'Y' && econv != 'N');
 }
 do
 {
  valid = 1;
  gotoxy(5, 25);
  clreol();
  cout << "ENTER LOAN AMOUNT or <ENTER> FOR NO CHANGE";
  gotoxy(22, 14);
  clreol();
  gets(t1);
  t2 = atof(t1);
  eloan = t2;
  if (eloan > 50000)
  {
   valid = 0;
   gotoxy(5, 25);
   clreol();
   cout << "\7SHOULD NOT GREATER THAN 50000";
   getch();
  }
 } while (!valid);
 if (strlen(t1) == 0)
 {
  eloan = loan;
  gotoxy(22, 14);
  cout << eloan;
 }
 if (egrade != 'E')
 {
  do
  {
   valid = 1;
   gotoxy(5, 25);
   clreol();
   cout << "ENTER BASIC SALARY or <ENTER> FOR NO CHANGE";
   gotoxy(22, 15);
   clreol();
   gets(t1);
   t2 = atof(t1);
   ebasic = t2;
   if (t1[0] == '0')
    return;
   if (ebasic > 50000)
   {
    valid = 0;
    gotoxy(5, 25);
    clreol();
    cout << "\7SHOULD NOT GREATER THAN 50000";
    getch();
   }
  } while (!valid);
  if (strlen(t1) == 0)
  {
   ebasic = basic;
   gotoxy(22, 15);
   cout << ebasic;
  }
 }
 gotoxy(5, 25);
 clreol();
 do
 {
  gotoxy(5, 18);
  clreol();
  cout << "Do you want to save (y/n) ";
  ch = getche();
  ch = toupper(ch);
  if (ch == '0')
   return;
 } while (ch != 'Y' && ch != 'N');
 if (ch == 'N')
  return;
 MODIFY_RECORD(ecode, ename, eaddress, ephone, edesig, egrade, ehouse, econv, eloan, ebasic);
 gotoxy(5, 23);
 cout << "\7Record Modified";
 gotoxy(5, 25);
 cout << "Press any key to continue...";
 getch();
}


//**********************************************************
// THIS FUNCTION GIVE CODE NO. FOR THE DELETION OF THE
// EMPLOYEE RECORD
//**********************************************************

void EMPLOYEE::DELETION(void)
{
 system("cls");
 char t1[10], ch;
 int t2, ecode;
 gotoxy(72, 2);
 cout << "<0>=EXIT";
 gotoxy(5, 5);
 cout << "Enter code of the Employee  ";
 gets(t1);
 t2 = atoi(t1);
 ecode = t2;
 if (ecode == 0)
  return;
 system("cls");
 if (!FOUND_CODE(ecode))
 {
  gotoxy(5, 5);
  cout << "\7Record not found";
  getch();
  return;
 }
 gotoxy(72, 2);
 cout << "<0>=EXIT";
 gotoxy(24, 3);
 cout << "DELETION OF THE EMPLOYEE RECORD";
 DISPLAY_RECORD(ecode);
 do
 {
  gotoxy(5, 24);
  clreol();
  cout << "Do you want to delete this record (y/n) ";
  ch = getche();
  ch = toupper(ch);
  if (ch == '0')
   return;
 } while (ch != 'Y' && ch != 'N');
 if (ch == 'N')
  return;
 DELETE_RECORD(ecode);
 LINES L;
 L.CLEARDOWN();
 gotoxy(5, 23);
 cout << "\7Record Deleted";
 gotoxy(5, 25);
 cout << "Press any key to continue...";
 getch();
}


//**********************************************************
// THIS FUNCTION RETURN 0 IF THE GIVEN DATE IS INVALID
//**********************************************************

int EMPLOYEE::VALID_DATE(int d1, int m1, int y1)
{
 int valid = 1;
 if (d1>31 || d1<1)
  valid = 0;
 else if (((y1 % 4) != 0 && m1 == 2 && d1>28) || ((y1 % 4) == 0 && m1 == 2 && d1>29))
  valid = 0;
 else if ((m1 == 4 || m1 == 6 || m1 == 9 || m1 == 11) && d1>30)
  valid = 0;
 return valid;
}


//**********************************************************
// THIS FUNCTION PRINTS THE SALARY SLIP FOR THE EMPLOYEE
//**********************************************************

void EMPLOYEE::SALARY_SLIP(void)
{
 system("cls");
 char t1[10];
 int t2, ecode, valid;
 gotoxy(72, 2);
 cout << "<0>=EXIT";
 gotoxy(5, 5);
 cout << "Enter code of the Employee  ";
 gets(t1);
 t2 = atoi(t1);
 ecode = t2;
 if (ecode == 0)
  return;
 system("cls");
 if (!FOUND_CODE(ecode))
 {
  gotoxy(5, 5);
  cout << "\7Record not found";
  getch();
  return;
 }
 fstream file;
 file.open("EMPLOYEE.DAT", ios::in);
 file.seekg(0, ios::beg);
 while (file.read((char *) this, sizeof(EMPLOYEE)))
 {
  if (code == ecode)
   break;
 }
 file.close();
 int d1, m1, y1;
 struct date d;
 getdate(&d);
 d1 = d.da_day;
 m1 = d.da_mon;
 y1 = d.da_year;
 char *mon[12] = { "January", "February", "March", "April", "May", "June", "July", "August", "September", "November", "December" };
 LINES L;
 L.BOX(2, 1, 79, 25, 219);
 gotoxy(31, 2);
 cout << "NADEEM AKHTAR, PGDBA - 200754667";
 L.LINE_HOR(3, 78, 3, 196);
 gotoxy(34, 4);
 cout << "SALARY SLIP";
 gotoxy(60, 4);
 cout << "Date: " << d1 << "/" << m1 << "/" << y1;
 gotoxy(34, 5);
 cout << mon[m1 - 1] << ", " << y1;
 L.LINE_HOR(3, 78, 6, 196);
 gotoxy(6, 7);
 cout << "Employee Name : " << name;
 gotoxy(6, 8);
 cout << "Designation   : " << desig;
 gotoxy(67, 8);
 cout << "Grade : " << grade;
 L.BOX(6, 9, 75, 22, 218);
 L.LINE_HOR(10, 71, 20, 196);
 int days, hours;
 if (grade == 'E')
 {
  do
  {
   valid = 1;
   gotoxy(10, 21);
   cout << "ENTER NO. OF DAYS WORKED IN THE MONTH ";
   gotoxy(10, 11);
   cout << "No. of Days   : ";
   gets(t1);
   t2 = atof(t1);
   days = t2;
   if (!VALID_DATE(days, m1, y1))
   {
    valid = 0;
    gotoxy(10, 21);
    cout << "\7ENTER CORRECTLY                       ";
    getch();
    gotoxy(10, 11);
    cout << "                    ";
   }
  } while (!valid);
  do
  {
   valid = 1;
   gotoxy(10, 21);
   cout << "ENTER NO. OF HOURS WORKED OVER TIME   ";
   gotoxy(10, 13);
   cout << "No. of hours  : ";
   gets(t1);
   t2 = atof(t1);
   hours = t2;
   if (hours > 8 || hours < 0)
   {
    valid = 0;
    gotoxy(10, 21);
    cout << "\7ENTER CORRECTLY                     ";
    getch();
    gotoxy(10, 13);
    cout << "                    ";
   }
  } while (!valid);
  gotoxy(10, 21);
  cout << "                                               ";
  gotoxy(10, 11);
  cout << "                        ";
  gotoxy(10, 13);
  cout << "                        ";
 }
 gotoxy(10, 10);
 cout << "Basic Salary         : Rs.";
 gotoxy(10, 12);
 cout << "ALLOWANCE";
 if (grade != 'E')
 {
  gotoxy(12, 13);
  cout << "HRA  : Rs.";
  gotoxy(12, 14);
  cout << "CA   : Rs.";
  gotoxy(12, 15);
  cout << "DA   : Rs.";
 }
 else
 {
  gotoxy(12, 13);
  cout << "OT   : Rs.";
 }
 gotoxy(10, 17);
 cout << "DEDUCTIONS";
 gotoxy(12, 18);
 cout << "LD   : Rs.";
 if (grade != 'E')
 {
  gotoxy(12, 19);
  cout << "PF   : Rs.";
 }
 gotoxy(10, 21);
 cout << "NET SALARY           : Rs.";
 gotoxy(6, 24);
 cout << "CASHIER";
 gotoxy(68, 24);
 cout << "EMPLOYEE";
 float HRA = 0.0, CA = 0.0, DA = 0.0, PF = 0.0, LD = 0.0, OT = 0.0, allowance, deduction, netsalary;
 if (grade != 'E')
 {
  if (house == 'Y')
   HRA = (5 * basic) / 100;
  if (convense == 'Y')
   CA = (2 * basic) / 100;
  DA = (5 * basic) / 100;
  PF = (2 * basic) / 100;
  LD = (15 * loan) / 100;
  allowance = HRA + CA + DA;
  deduction = PF + LD;
 }
 else
 {
  basic = days * 30;
  LD = (15 * loan) / 100;
  OT = hours * 10;
  allowance = OT;
  deduction = LD;
 }
 netsalary = (basic + allowance) - deduction;
 gotoxy(36, 10);
 cout << basic;
 if (grade != 'E')
 {
  gotoxy(22, 13);
  cout << HRA;
  gotoxy(22, 14);
  cout << CA;
  gotoxy(22, 15);
  cout << DA;
  gotoxy(22, 19);
  cout << PF;
 }
 else
 {
  gotoxy(22, 13);
  cout << OT;
 }
 gotoxy(22, 18);
 cout << LD;
 gotoxy(33, 15);
 cout << "Rs." << allowance;
 gotoxy(33, 19);
 cout << "Rs." << deduction;
 gotoxy(36, 21);
 cout << netsalary;
 gotoxy(2, 1);
 getch();
}


//**********************************************************
// MAIN FUNCTION CALLING MAIN MENU
//**********************************************************

void main(void)
{
 MENU menu;
 menu.MAIN_MENU();
}

program output

Payroll management c++ project main menu

Employee Details c++ project output

Find more c++ simple project source code

c++ stack push pop example project

2017-02-02T14:57:00.000-08:00

C++ stack push pop implementation source code. It uses two stacks, user can push pop to both using menu selection. Menu have options 0 to 9 for example push value to stack one , pop value to stack two, display both etc. Switch statement has used for menu options. Both are the size of 10 user can increase their size according to need. There is an option to build stack. It uses for loop to assign 5 values to each.

Concept used

Stack push pop
Dynamic memory allocation
array
for loop
switch statement

#include <iostream>
#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
//////////////////////////
int ts = 10;
int len = 10;
int top1 = -1;
int top2 = -1;
int ch = 0;
int* exp = new int[ts];
int* stk1 = new int[len];
int* stk2 = new int[len];

void inputexp();
void push1(int);
void push2(int);
void pop1();
void pop2();
int topitem1();
int topitem2();
void displaysk1();
void displaysk2();
void menu();
void buildstack();

/////////////////////////////////
void menu()
{
    int op;
    system("pause");
    system("cls");
    cout << "press 0 to enter array:\n";
    cout << "press 1 to push element to stack 1:\n";
    cout << "press 2 to push element to stack 2:\n";
    cout << "press 3 to get top stack 1:\n";
    cout << "press 4 to get top stack 2:\n";
    cout << "press 5 to pop from stack 1 and push in 2:\n";
    cout << "press 6 to pop from stack 2 and push in 1:\n";
    cout << "press 7 to display sk 1:\n";
    cout << "press 8 to display sk 2:\n";
    cout << "press 9 to build stack:\n";
    cout << "option:";
    cin >> op;
    switch (op) {

    case 0: {
        inputexp();
        menu();
    } break;
    case 1: {
        int it;
        cout << "enter value:";
        cin >> it;
        push1(it);
        menu();
    } break;
    case 2: {
        int it;
        cout << "enter value:";
        cin >> it;
        push2(it);
        menu();
    } break;
    case 3: {
        int t = 0;
        t = topitem1();
        cout << "top is:" << t << endl;
        menu();
    } break;
    case 4: {
        int t = 0;
        t = topitem2();
        cout << "top is:" << t << endl;
        menu();
    } break;
    case 5: {
        pop1();
        menu();
    } break;
    case 6: {
        pop2();
        menu();
    } break;
    case 7: {
        displaysk1();
        menu();
    } break;
    case 8:

    {
        displaysk2();
        menu();
    } break;
    case 9: {
        buildstack();

        cout << "stacks successfully built\n";
        menu();
    } break;
    default:
        cout << "invalid\n";
        break;
    } //switch

} //funciton

/////////////////////////////////
void push1(int ch)
{
    ++top1;
    stk1[top1] = ch;

} //function
//////////////////////////
void push2(int ch)
{
    ++top2;
    stk2[top2] = ch;

} //function
///////////////////////////
void pop1()
{

    ch = stk1[top1];
    push2(ch);
    top1--;
} //function
//////////////////////////
void pop2()
{

    ch = stk2[top2];
    push1(ch);
    top2--;
} //function
//////////////////////////
int topitem1()
{
    return stk1[top1];
} //function
//////////////////////////
int topitem2()
{
    return stk2[top2];
} //function
//////////////////////////

void inputexp()
{
    int i;
    cout << "enter array:\n";
    for (i = 0; i < ts; i++) {
        cin >> exp[i];
    }
    exp[i] = '\0';
    cout << "successfully entered\n";
    cout << "array u entered is \n";
    for (int j = 0; j < ts; j++)
        cout << exp[j] << endl;
} //funciton
///////////////////////////
void buildstack()
{

    for (int k = 0; k < 10; k++) {
        if (exp[k] % 2 == 0) {
            push1(exp[k]);
        }
        else {
            push2(exp[k]);
        }
    } //for

} //function
///////////////////////////////

void displaysk1()
{
    cout << "stack 1 is:\n";
    for (int j = 0; j <= top1; j++) {
        cout << stk1[j] << endl;
    }
    cout << endl;
}
///////////////////////////
void displaysk2()
{
    cout << "stack 2 is:\n";
    for (int k = 0; k <= top2; k++) {
        cout << stk2[k] << endl;
    }
}

////////////////////////////////

////////////////////////////////
int main()
{

    menu();

    getch();
}

Sample Output:

This is a simple small c++ project code it can be edit or improve more its basic purpose is just to give the idea to how stack push pop works. How it can be implement in code using array, dynamic memory and others.
find more c++ simple projects and solution

find minimum maximum and average c++ program

2017-02-02T03:00:00.000-08:00

Simple c++ program which takes input numbers from user and find minimum, maximum and average of numbers.
Program uses do while loop to find min, max and avg.
User can input many numbers, condition is set for -1 to get results. You can set any number according to your wish.
To calculate user has to break do while loop condition which breaks when user inputs -1.

#include<iostream>
#include<conio.h>
using namespace std;
int main()
{
    float max=0.0,min=0.0,sum=0.0;
    float num=0.0;
    float avg=0.0;
    cout<<"enter a whole number or -1 to get result:";             //program working through example
    cin>>num;                                  
    max=num;                                   
    min=num;                                  
    do
    {
    if(num!=-1){
        sum=sum+num;        
        if(num>max)                 
        max=num;                        
        else
        if(num<min)                    
        min=num;                           
        cout<<"enter a whole number or -1 to get result:";             
        cin>>num;                          
      }
    }
    while(num!=-1);                      
        avg=sum/10.0;
        cout<<"sum="<<sum<<endl;
        cout<<"average of numbers you entered is:"<<avg<<endl;
        cout<<"maximum number you enter is:"<<max<<endl;
        cout<<"minimum number you enter is:"<<min<<endl;
        getch();
        }

program output:

find more examples here: c++ programming examples and solutions
find sample c++ projects here: c++ projects source codes

This example will help the beginner to refresh logic building muscle.
It is recommended to practice these kinds of codes. Sometimes while programming our mind hesitate for some complex code and before going enough deep to understand and implement a good logic our mind return us back.

Doing these code practices will make your logic building ability fresh and when a complex problem needs to solve your mind will give you positive energy. Yes go, deep dive into it you can do it.!!

Print alphabets from a to z c++ program do while

2017-02-01T09:56:00.000-08:00

C++ simple program which displays alphabets from A to Z using do while loop. This program simply start the ASCII code from capital which is 65 and keep increment the ASCII code to Z. To do this a char variable is being used and initialized it form 'A' then in while loop condition it checks till character 'Z'.

//this program will print alphabets from A-Z.
#include<iostream>
#include<conio.h>
using namespace std;
int main()
{                                //working of program
    int character=0;            //initializing variable of type int from zero to remove garbage value
    char ch='A';                //initializing character type variable from first letter 'A'
    do                         //loop begins and steps 1-5 repeat till ch=Z
    {
         character=int(ch);   //1)character=int(A) =changes value of A to ascii code of type int so
                              // character=65
         cout<<ch<<" ";     //2)print ch=A
         character++;        //3)character=66
         ch=char(character); //4)ch=char(66)=changes value of 66 to alphabet
                            // ch=B
    }
    while(ch<='Z');         //5)check if B<=Z
    getch();
}

program output

Try this code to print lower case alphabets from a to z. Hint ASCII code of 'a' is 97.

Find more example here: c++ programming examples and solutions

find sum of series c++ code

2017-01-29T12:22:00.001-08:00

Find sum of given series in which user enter a number and program calculate series using while loop.
Series example:
if input number = 100
1/1 +1/2 +1/4 +.......+ 1/100

//this program will calculate sum of following series
// 1/1 +1/2 +1/4 +.......+ 1/100.
#include<iostream>
#include<conio.h>
using namespace std;
int main()
{
    float n=1.0;
    float d=2.0;
    float sum=1.0;
    float temp=0.0;
    cout<<"Enter a number:";
    int number;
    cin>>number;
    while(d<=number)                    //loop will start from denominator=2 & steps 1,2 &3 continues till d=100.
    {
      temp=n/d;                     // 1) temp=1/2=0.5
      sum=sum+temp;                 // 2) sum=1+0.5=1.5
      d=d+2;                        // 3) d=2+2=4
      }
      cout<<"sum of series is:"<<sum<<endl;
      getch();
      return 0;

}

Output:

It is recommended to dry run the code on paper and changes the series to understand more.
Find more example here: c++ simple examples source codes

c++ multiplication table using while loop example

2017-01-25T12:53:00.001-08:00

C++ simple program which uses while loop to print a multiplication table in a proper format. User inputs a number for table then limit.
program has tested on code blocks c++ compiler.

source code:

#include<iostream>
#include<conio.h>
#include<iomanip>
using namespace std;
int main()
{
    int n,c=1,limit;
    cout<<"Enter number to print its table=";
    cin>>n;
    cout<<"Enter limit=";
    cin>>limit;
    while(c<=limit)
    {
       cout<<n<<" * "<<setw(2)<<c<<" = "<<setw(2)<<n*c<<endl;
       c++;
    }

getch();
}

program output:

find more examples here: C++ simple examples with source codes

Linked list in C++ project example student record

2017-01-20T14:47:00.000-08:00

Project introduction and scope

It is a simple c++ project for Student Information System. It gives a simple example of a complete system with the functionality of add record, search record, Update record and delete record using linked list. If students understand basic CRUD (Create, Read, Update and Delete) functionality it would be easy for them to create any Management System using this functionality.

It uses the concept of following topics:

Pointers
Loops
Functions
Linked List
If Else

The Project has 5 major function in menu

Add New record
Search a record
Modify a record
Delete a record
Exit

How it Works

The menu is handled by if else statement. While adding a new record, if any node already exist then new node is connected with it otherwise a new node is created. While searching a node, a pointer searches all the pointers of linked lists to match the required data from start to end. While Modification the data part of the linked list is overwritten with new data and in case of Deletion, the pointers before and after of the node which we need to delete are connected with each other.

#include<conio.h>
#include<iostream>
#include<fstream>
#include<Windows.h>
#include<dos.h>
#include<cctype>
#include<sstream>
#include<string>
using namespace std;
bool check = true;
struct node    //structure of node //
{
 char name[20];
 char discipline[20];
 int rollNo;
 char section;
 node *next;
}*head,*lastptr;

void add()    //Adds record of student//
{
 node *p;
 p=new node;
 cout<<"Enter name of student:"<<endl;
 gets(p->name);
 fflush(stdin);
 cout<<"Enter discipline of student:"<<endl;
 gets(p->discipline);
 fflush(stdin);
 cout<<"Enter Roll Number of student:"<<endl;
 cin>>p->rollNo;
 fflush(stdin);
 cout<<"Enter section of student:"<<endl;
 cin>>p->section;
 fflush(stdin);
 p->next=NULL;

 if(check)
 {
  head = p;
  lastptr = p;
  check = false;
 }
 else
 {
  lastptr->next=p;
  lastptr=p;
 }
 cout<<endl<<"Recored Entered";
 getch();
}
void modify()   //modifies record of student//
{
 node *ptr;
 node *prev=NULL;
 node *current=NULL;
 int roll_no;
 cout<<"Enter Roll Number to search:"<<endl;
 cin>>roll_no;
 prev=head;
 current=head;
 while(current->rollNo!=roll_no)
 {
  prev=current;
  current=current->next;
 }
 ptr=new node;
 fflush(stdin);
 cout<<"Enter name of student:"<<endl;
 gets(ptr->name);
 fflush(stdin);
 cout<<"Enter discipline of student:"<<endl;
 gets(ptr->discipline);
 fflush(stdin);
 cout<<"Enter Roll Number of student:"<<endl;
 cin>>ptr->rollNo;
 fflush(stdin);
 cout<<"Enter section of student:"<<endl;
 cin>>ptr->section;
 fflush(stdin);
 prev->next=ptr;
 ptr->next=current->next;
 current->next=NULL;
 delete current;
 cout<<endl<<"Recored Modified";
 getch();
}
void search()   //searches record of student//
{
 node *prev=NULL;
 node *current=NULL;
 int roll_no;
 cout<<"Enter Roll Number to search:"<<endl;
 cin>>roll_no;
 prev=head;
 current=head;
 while(current->rollNo!=roll_no)
 {
  prev=current;
  current=current->next;
 }
 cout<<"\nname: ";
 puts(current->name);
 cout<<"\nRoll No:";
 cout<<current->rollNo;
 cout<<"\nDiscipline:";
 puts(current->discipline);
 cout<<"\nSection:";
 cout<<current->section;
 getch();
}
void del()    //deletes record of a student//
{
 node *ptr=NULL;
 node *prev=NULL;
 node *current=NULL;
 int roll_no;
 cout<<"Enter Roll Number to Delete:"<<endl;
 cin>>roll_no;
 prev=head;
 current=head;
 while(current->rollNo!=roll_no)
 {
  prev=current;
  current=current->next;
 }
 prev->next = current->next;
 current->next=NULL;
 delete current;
 cout<<endl<<"Recored Deleted";
 getch();
}

int main()
{
 char x;
 cout<<"\t\t ********************************* \t\t\t"<<endl;
 cout<<"\t\t ****STUDENT MANAGEMENT SYSTEM**** \t\t\t"<<endl;
 cout<<"\t\t ********************************* \t\t\t"<<endl;
 cout<<"…………………………………….."<<endl;
 cout<<"…………………"<<endl;
 cout<<"……………………………………………………."<<endl;
 cout<<"\n\nPress Any Key To Continue . . . ."<<endl;
 getch();
 do
 {
  system("cls");
  cout<<"1--->Press '1' to add New record:"<<endl;
  cout<<"2--->Press '2' to search a record:"<<endl;
  cout<<"3--->Press '3' to modify a record:"<<endl;
  cout<<"4--->Press '4' to delete a record:"<<endl;
  cout<<"5--->Press '5' to exit:"<<endl;
  x=getch();
  if(x=='1')
  {
   system("cls");
   add();
  }
  else if(x=='2')
  {
   system("cls");
   search();
  }
  else if(x=='3')
  {
   system("cls");
   modify();
  }
  else if(x=='4')
  {
   system("cls");
   del();
  }
  else if(x=='5')
  {
   exit(0);
  }
  else
  {
  }
 }while(x != 27);
 getch();
}

Sample output

show project menu

Code has been tested on code Blocks C++ compiler.
find more c++ simple projects

calculator program in c++ using functions

2016-12-28T12:42:00.000-08:00

Write a program for a simple c++ calculator which have different functions for different operations. Make a menu base selection screen using switch statement. Ever operation should have its own function. This code may also be use as a mini project to start.
Calculator should have following operations.

Addition
Subtraction
Multiplication
Division
Square root
Factorial
Exponential

This code has been tested on Code blocks c++ compiler

C++ Source Code:

#include<iostream>
#include<conio.h>
#include<math.h>
#include<stdlib.h>
#include<iomanip>
  char op;
using namespace std;
void sum()
   {
     
    int sum = 0;
    int n;
    int numberitems;
    cout << "Enter number of items: \n";
    cin >> numberitems;

    for(int i=0;i<numberitems;i++)
    {
        cout<< "Enter number "<<i<<":\n\n" ;
        cin>>n; 
        sum+=n;
    }
    cout<<"sum is: "<< sum<<endl<<endl;
    
    }
void diff()
    {
     int diff;
     int n1,n2;
     cout<<"enter two numbers to find their difference:\n\n";
     cout<<"enter first number:";
     cin>>n1;
     cout<<"\nenter second number:";
     cin>>n2;
     diff=n1-n2;
     cout<<"\ndifference is:"<<diff<<endl<<endl;
     }
     
void pro()
    
    {
     int pro=1;
     int n;
     int numberitems;
     cout<<"enter number of items:\n";
     cin>>numberitems;
     for(int i=0;i<=numberitems;i++)
     {
             cout<<"\nenter item "<<i<<":";
             cin>>n;
             pro*=n;
     }
             
     cout<<"product is:"<<pro<<endl<<endl;    
     }
       
 void div()
     {
      int div;
      int n1;
      int n2;
      cout<<"enter 2 numbers to find their quotient\n\n";
      cout<<"enter numerator:";
      cin>>n1;
      cout<<"\nenter denominator:";
      cin>>n2;
      div=n1/n2;
      cout<<"\nquotient is:"<<div<<endl<<endl;
      }      

void power()
     {     
     long int p;
     int res=1,n; 
     cout<<"enter number:";
     cin>>n;
     cout<<"\nenter power:";
     cin>>p;
     for(int i=1;i<=p;i++)
     {
      res=n*res;
     }
      cout<<n<<"\n power "<<p<<" is :"<<res<<endl;
     } 
       
void sq()
     {
     float s;
     int n;
     cout<<"enter number to find its square root:";
     cin>>n;
     s=sqrt(n);
     cout<<"\nsquare root of "<<n<<" is :"<<s<<endl;
     }
 void fact()
     {
      long int f=1;
      int c=1,n;
      cout<<"enter number to find its factorial:";
      cin>>n;
      while(c<=n)
      {
                 f=f*c;
                 c+=1;
      }     
                 cout<<"\nfactorial of "<<n<<" is :"<<f<<endl;     
      }
void expo()
     {
          long double res=1,p; 
     double e=2.718281828;     
     cout<<"enter power of exponential function:";
     cin>>p;
     for(int i=1;i<=p;i++)
     {
      res=e*res;
     }
      cout<<" e^ "<<p<<" is :"<<res<<endl;
           
           }
int main()
{   
    
    
    system("cls");
    do
    {
                
    system("pause");              
    system("cls");    
    cout<<"***which operation you want to perform***\n";
    cout<<"press 0 for exit\n";
    cout<<"press 1 for addition \n";
    cout<<"press 2 for subtraction\n";
    cout<<"press 3 for multiplication\n";
    cout<<"press 4 for division\n";
    cout<<"press 5 for power calculation\n";
    cout<<"press 6 for square root \n";
    cout<<"press 7 for factorial calculation\n";
    cout<<"press 8 for exponential calculation\n";
    cout<<"press option:";
    cin>>op;
    switch(op)
    {
              case '1':
              sum();
              
              break;
              case '2':
              diff();
              break;
              case '3':
              pro();
              break;
              case '4':
              div();
              break;
              case '5':
              power();
              break;
              case '6':
              sq();
              break;
              case '7':
              fact();
              break;
              case '8':
              expo();
              break;     
              case '0':
              exit(0);    
              default:
              cout<<"invalid input"  ;
              system("cls");
    } 
    }
                                                                         
    while(op!='0');
                    
                    getch();
                    }

Program output video

Image output

output on code blocks console

Find more examples here: C++ simple example source code and explanation with dry run

fibonacci series number c++ using while loop example

2016-12-24T13:09:00.000-08:00

A program can be coded in different ways and this example shows how to find a number which is in Fibonacci series or not using do while loop.
To read more visit Wikipedia
For example 5 is in Fibonacci series where 6 is not
To make it more easy to understand this example shows a dry run in comments at line by line. Hope it will help to understand.
This program covers the concept of while loop and if statement.
Program has tested on code blocks compiler.

C++ source code:

#include <iostream>

using namespace std;

int main()
{
     int n,a,b,next;
     cout<<"Enter a number to check if it is a fibonacci number: ";
     cin>>n;         // 1)let n=9
     if(n==0||n==1)  // 2)check if 9=0 or 9=1 (NOT)
     cout<<n<<" is a fibonacci number\n\n";     //skip
     else
     a=0;b=1;        // 3) a=0 , b=1
     next=a+b;       // 4) next=0+1=1
     while(next<n)   // 5)loop starts from 1 and continues till next is less then 9
     {
        a=b;         // 6) a=1      ,9) a=1   ,12)a=2  ,15) a=3   ,18)a=5
        b=next;      // 7) b=1      ,10)b=2   ,13)b=3  ,16) b=5   ,19)b=8
        next=a+b;    // 8)next=1+1=2   ,11)next=1+2=3   ,14)next=2+3=5   ,17)next=3+5=8
                     // 18)next=5+8=13 (loop ends)
     }
     if(next==n)     // 19)check if 13==9 (NOT)
    cout<<n<<" is a fibonacci number";      //skip
    else
    cout<<n<<" is not a fibonacci number"; // 20)prints that 9 is not a fibonacci number.
    return 0;
}

program image:

c++ Fibonacci number source code

Program input output:

input = 5

stack implementation in c++ using array source code

2016-10-21T16:44:00.000-07:00

Stack in C++ program
This c++ program has 10 functions. Each function calls on menu based selection using switch statement (functions names may very in source code). Each function and whole code has proper commented to explain the code. This program has been tested on Visual Studio IDE.

What is a stack?
Stack is know as LIFO(Last in First Out) functionality which means a thing or an object which has been added last time will out first. Like Placing books on one an other the last book we placed will be picked first to collect all books. To now more about stack in c++ read wiki .

List of Stack Functions

void createStack();
void menu();
void display();
void deleteStack();
void clearStack(); // declaration of functions
int pop();
void push(int);
void findelement();
int isfull();
int isempty();
void find_by_position();

Program brief introduction

Every function will be called on menu based selection
An integer pointer has declared for dynamic memory allocation
Global variable size and top has declared to track the stack status in whole program

C++ Source Code

#include<iostream>
#include<conio.h>
#include<stdlib.h>
#include<stdio.h>
using namespace std;
int top=-1;                         // -1 shows that stack is not created
int size=0;                         // initial size is zero
int *stk;             // initialization of dynamic array of typ int [works as stack]
/////////////////////////////////////////////////////////////////////////////////////
void createstk();
void menu();
void display();
void deletestk();
void clearstk();                     // declaration of functions 
int pop();
void push(int);
void findelement();
int isfull();
int isempty();
int checkIndex=0;
void find_by_position();
 /////////////////////////////////////////////////////////////////////////////////////
void menu()                      
{
     int option;
     system("pause");
     system("cls"); 
     while(option<1||option>10)                             // continue till we select option from 1-10
     {       
     system("cls"); 
     cout<<"press 0 to find element by position\n";
     cout<<"press 1 to create stack\n";
     cout<<"press 2 to display stack\n";
     cout<<"press 3 to clear stack\n";
     cout<<"press 4 to delete stack\n";                    
     cout<<"press 5 to find element in stack\n";        
     cout<<"press 6 to remove element from stack\n" ;
     cout<<"press 7 to add element in stack\n";
     cout<<"press 8 to check whether stack is full\n";
     cout<<"press 9 to check whether stack is empty\n";
     cout<<"press 10 to exit\n";
     cin>>option;
     
     
     switch(option)
     {
      case 0:
      find_by_position();
      break;


     case 1:
     createstk();
     break;
          
     case 2:
     display();
     break;
     
     case 3:
     clearstk();
     break;
          
     case 4:
     deletestk();
     break;    
     
     case 5:
     findelement();
     break;    
     
     case 6:
     {
     if(top<0)
     cout<<"stack not created\n";                  // check to see if stack is created or not
     if(isempty()==1)
     cout<<"stack is empty\n";                     // check to see if stack is empty 
     else 
     pop();                                        // pop element
     }
     menu();
     break;
     
     case 7:
     {
     int a;                 
     if(top<0)
     cout<<"stack not created\n";                   // check to see if stack is created or not
     else 
     if(isfull()==1 )
     cout<<"stack is full\n";                       //check to see if stack is full 
     else 
     cout<<"enter element to push on stack:";       // take element to push on stack if it is not full
     cin>>a;           
     push(a);                         
     }
     menu();
     break;
     
     
     case 8:
     {
     int a;      
     if(top<0)                                        //check to see if stack is created or not
     cout<<"stack not created\n";
     else
     isfull();                                         //calling isfull funtion
     if(a==1)
     cout<<"stack is full\n";                         //if isfull function returns 1 (true) then stack is full
     else
     cout<<"stack is not full\n";                     //else stack is not full
     }
     menu();
     break;
     
     
     case 9:
     {
     int a;
     if(top<0)                                     
     cout<<"stack not created\n";                    //check to see if stack is created or not
     else
     isempty();                                      //calling isempty function
     if(a==1)                                        //if isempty function returns 1(true) then stack is empty
     cout<<"stack is empty\n";
     else
     cout<<"stack is not empty\n";                  //else stack is not empty
     } 
     menu();
     break;
 
          
                       
     case 10:
     exit(0);                                       //calling default built in function to exit program
     break;
     
     
     default:
     cout<<"invalid option";
     break;
     }    
     }
     }
 ///////////////////////////////////////////////////////////////////////////////////////////    
 void createstk()        
 {
      cout<<"enter total size of stack:";
      cin>>size;     
   stk=new int[size];                                        // take total size of stack
     do
     {
           
                         
     cout<<"how many elements do you want to enter?\n";     //take current size of stack that we are going to use yet
     cin>>top;
                         
     }
     while(top<1||top>size);                               //prompt to enter current size till size entered is less then 1
                                                           // or greater then total size
                                                           
     cout<<"enter elements\n";                             
     for(int i=0;i<top;i++)                                //for loop from index 0 to current size (top)
     {
     cin>>stk[i];                                          //input value in stack
     
     }    
     menu();                                               //function call to enter main menu again
     } 
///////////////////////////////////////////////////////////////////////////////////////////
void display()
{
     if(top<0)
     cout<<"stack not created\n";                         //check to see if stack is created
     else
     cout<<"total number of elements in stack are :"<<top;       //displays total number of elements in stack
                                                                //by diplaying current value of top
     
     cout<<"\nand are as follows\n";                           
                                                                                      
                                                                                      
     for(int i=0;i<top;i++)                                 //loop from 0 index to top
     cout<<stk[i]<<endl;                                    //displays value in stack 
     getch();
     menu();                                              //function call to enter main menu again
}

////////////////////////////////////////////////////////////////////////////////////////////
void clearstk()
{
     if(top<0)
     cout<<"stack not created\n";                          //check to see if stack is created or not
     else
     top=0;                                               //if stack is created then make top=0 and clear it
     cout<<"stack is cleared\n";
     menu();
}


////////////////////////////////////////////////////////////////////////////////////////////////
void  deletestk()
{
      if(top<0)
      cout<<"stack not created\n";                       //check to see if stack is created or not
      else
      top=-1;
      cout<<"stack is deleted\n";                        //if stack is created then make top=-1 and delete it
      menu();
}
 ///////////////////////////////////////////////////////////////////////////////////////////////
void findelement()
{
     int item,temp=0;                                 //initialize temp variable from 0 + intializing variable to enter item
                                                        //to be found + intitailaizing counter variable 'i'
     if(top<0)
     cout<<"stack not created\n";                      //check to see if stack is created or not
     else
     {
     
     cout<<"enter item you want to find\n";
     cin>>item;                                        //input item to be found in stack
     for(int m=0;m<top;m++)                                //loop starts from zero index and continue upto top
     {
             if(stk[m]==item)                          //compare each content of stack with value entere
    {
    cout<<"item found at "<<m<<endl;
     temp=1;
             }
                                                //if item found then change value of temp to false the condition
             
             
     
     }
                                                     //control comes out of loop
    if(temp==0)
    {
    
     cout<<"item not found\n";                       //if temp!=1 displays that item not found
}
}
  menu();
     
  }
 /////////////////////////////////////////////////////////////////////////////////////////
 void push(int i)                                   //take arguement
 {
  
    
     stk[top]=i;                                   //places arguement at top
     top++;                                        //increment top to show next available position
  }
 //////////////////////////////////////////////////////////////////////////////////////// 
  int pop()
  {
    
     int i=stk[top];                               //remove element from top
     top--;                                        //decrements top 
  return i;
  }  
 /////////////////////////////////////////////////////////////////////////////////// 
  int isfull()
  {
    
     if( top==size)                              //check if top is equal to total size
     return 1 ;                                  //return true i-e stack is full
     else                                       
     return 0;                                   //else return false tnat stack is not full
     }
 /////////////////////////////////////////////////////////////////////////////////    
     int isempty()
     {
         if(top==0)                             //check if top is zero
         return 1;                              //return true that stack is empty
         else
         return 0;                              //else return false that stack is not empty
     } 
/////////////////////////////////////////////////////////////////////////////////////////   
void find_by_position()
{
     int pos;
     
     if(top<0)
     cout<<"stack not created\n";
     else
     if(top==0)
     cout<<"stack is empty\n";
     else
     {
     do
     {    
     cout<<"enter position to find its content\n";
     cin>>pos;
     }while(pos<0||pos>size); 
     for(int i=0;i<size;i++)
     {
             if(i==pos)
             {
                       cout<<"item at position "<<i<<" is "<<stk[i]<<endl;
                       
              }   //if closed
     }   //for closed
            
     }  //else closed
     menu();
     } //function closed
int main()
     {
         cout<<"welcome to stack application\n";
         menu();                                //funtion call to main menu
         getch();
         }

Program Sample output
create, enter size, select number of elements to enter then enter elements

Program output

Push element to stack

Output video

Download Source code from Google Drive

Note: It is recommended to dry run all the code for better understanding. There is always more way to code a program. Try to improve it by adding more functions and validations. Hope this mini c++ project help the beginners.
See also: Queue Implementation Using Array C++ Source Code
More C++ projects can be found here
Simple C++ mini projects for beginners

Array based Queue c++ simple project

2016-10-11T17:19:00.000-07:00

In this c++ tutorial we will discuss about Array Based Queue C++ project which have 10 functions including main function. User will select an option from main menu function and the respective function will be called. The code is for array based queue implementation. It comprises of various operations that can be performed on array based queue. This code can be used as a project or self-assignment by beginners of data structure. It is recommended to understand the code thoroughly mainly the “logic” then try to create logic for each individual function by yourself. It will surely enhance your coding capability

What is a Queue?

List of items arranged on basis of first in and first out principal is called queue.
It has 2 ends.
Data can be considered as to pass through hollow cylinder.
Data enters from one end and leaves from another end.
Data only moves in one direction.

Characteristics Of Queue:

It works on the FIFO (first in first out) principal.
It is ordered list and has elements/data of same type.
It doesn’t allow duplication of data.
Enqueue function is used to insert new item in queue.
Dequeue function is used to remove any item from queue.
If you want to dequeue any random item from queue, you will have to first dequeuer all items above it. Then remove the item you want. Then enqueue dequeued items accordingly.

queue image example

Real World Examples:

People standing in a queue for submission of their bills in bank. The person who came first will submit bill first. The person who came later will submit bill later.
Cars on one way road. The car that entered first will exists first while the car that entered later will exit later.

Array Based Queue in C++ Data Structures

It is a linear data structure in which insertion of data/element takes places from end (rear) and deletion of data/element takes place from front (head).It allows you to store a data in form of array.

Project Overview:

Below I am going to share with you a c++ source code that is compiled using dev c++ compiler. The code is for array based queue implementation. It comprises of various operations that can be performed on array based queue. This code can be used as a project or self-assignment by beginners of data structure. It is recommended to understand the code thoroughly mainly the “logic” then try to create logic for each individual function by yourself. It will surely enhance your coding capability.

Code:

#include<iostream>     //header files
#include<conio.h> //header files
#include<stdlib.h>      //header files
#include<stdio.h>     //header files
using namespace std;

//////////////////////////////////////////////////////////////////////////////////////
/*declaration of global variables*/
/* front will show first index of array, initiated with -1 that shows that nothing is present at first position in queue*/
int front=-1;   
/* rear will show first last index of array, initiated with -1 that shows that nothing is present at last position in queue*/
int rear=-1;
int index=0;          // index will represent that how long is queue
int *queue=new int[index];      // for dynamical creation of queue
//////////////////////////////////////////////////////////////////////////////////////
/*declaration of functions*/
The functions below are named in such a way that they will clearly reveal what they are meant for 
//////////////////////////////////////////////////////////////////////////////////////
void createqueue();
void enqueue(int a);
int dequeue();
void deletequeue();
void clearqueue();
int isfull();
int isempty();
void find();
void display();
void menu();

/////////////////////////////////////////////////////////////////////////////////////
The function below is the first function that would be called when code is executed. It will display a menu having different functionalities. Just select the number corresponding to operation you want to perform and then you will be on your way to go 
////////////////////////////////////////////////////////////////////////////////////
void menu()
{ 
     system("pause");     /*built in function supported by dev c++ to pause a screen until “enter” or any key is entered to proceed further.*/
     system("cls");   /*It will remove any garbage value that may appear on screen*/
     int option;
     cout<<"****welcome to queue application****\n";
     cout<<"press 1 to create queue\n";
     cout<<"press 2 to display queue\n";
     cout<<"press 3 to delete queue\n";
     cout<<"press 4 to clear queue\n";
     cout<<"press 5 to find number in queue\n";
     cout<<"press 6 to enqueue\n";
     cout<<"press 7 to dequeue\n";
     cout<<"press 8 to check if queue is full\n";
     cout<<"press 9 to check if queue is empty\n";
     cout<<"press 0 to exit\n";
     cout<<"enter option\n";
     cin>>option;
//////////////////////////////////////////////////////////////////////////////////////
Below I have used a switch to call various functions. If you are a beginner and don’t have any idea about “switch” you can go ahead with if-else statements but their drawback is they mess up everything, make confusions as code gets lengthy. 
/////////////////////////////////////////////////////////////////////////////////////     
     switch(option)
     {
     case 1:   // this case will simply call create queue function and will create it.
          createqueue();
          menu();
          break;
          
     case 2:   // this case will call display function and will display queue items
          display();
          menu();
          break;
     
     case 3:  // this function will delete whole queue by calling delete queue function
          deletequeue();
          menu();
          break;
     
     case 4:     // it will only clear items in queue but empty queue will still exist
          clearqueue();
          menu();
          break;
     
     case 5:   // it will search for required item in queue
          find();
          menu();
          break;
     
     case 6:    //
          {
          int a;
/*the check below will be used throughout the code to check if queue is created or not. Note the point that whenever front and rear will have negative value it means that array does not exist because array’s index can never be negative*/
          if(front==-1&&rear==-1)
          cout<<"queue not created\n";
          else  
          if(isfull()==1)
          
          cout<<"queue is already full\n";
                     
          else
          {
          cout<<"enter element to enqueue\n";
          cin>>a;
          enqueue(a);
          }
          menu();
          }
          break;
     
     case 7:
          {
          if(front==-1&&rear==-1)
          cout<<"queue not created\n";
          else 
          if(isempty()==1)
          {
          cout<<"queue is already empty\n";
          }
          else
          {
          cout<<"element dequeued is :"<<dequeue();
          cout<<endl;                
          }
          menu();
          } 
          break;
     
     case 8:
          {     
          int a;     
          if(front==-1&&rear==-1)
          cout<<"queue not created\n";
          else   
          isfull();
          if(a==1)
          cout<<"queue is full\n";
          else
          cout<<"queue is not full\n";
          }
          menu();
          break;
     
     case 9:
          {
          int a;     
          if(front==-1&&rear==-1)
          cout<<"queue not created\n";
          else   
          isempty();
          if(a==1)
          cout<<"queue is empty\n";
          else
          {
          cout<<"queue is not empty\n";   
          }
          menu();
          }
          break;
          
     case 0:
          exit(0);
          break;
   
    default:
          cout<<"invalid input\n";
          break;
          }
          }
//////////////////////////////////////////////////////////////
          
void createqueue()
{
/*The loop below will continue till you enter correct size of queue that must be greater than zero*/
     do
     {
     cout<<"enter size of queue:";
     cin>>index;
     }
     while(index<=0);
//////////////////////////////////////////////////////////////////////////////////////
Suppose you entered 10 then, queue will be like that
Front/rear


enter queue value = 10

Dequeue/ Enqueue         
//////////////////////////////////////////////////////////////////////////////////////  

/*The loop below will continue till you enter accurate current size that must be positive and less then index value. The “rear” here is pointing last index. */
     do
     {
     cout<<"enter current size of queue:";
     cin>>rear;
     }
     while(rear>index||rear<0);
/////////////////////////////////////////////////////////////////////////////////
Suppose you entered rear=5 so,

queue input = 5


         

//////////////////////////////////////////////////////////////////////////////////
     front=0;   // front always start from zero it could be 1 also. 
     cout<<"enter elements\n";    
     for(int i=front;i<rear;i++)// loop will start from ‘0’ and continue till “rear” value
     {
        cin>>queue[i];
     }
 cout<<"queue is successfully created\n";
}

queue created c++



//////////////////////////////////////////////////////////////////////////////////////
The function below will be used for display. 
//////////////////////////////////////////////////////////////////////////////////////

void display()
{
     if(front==-1&&rear==-1)
     cout<<"queue not created\n";
     else
     if(front<rear)
     {
     cout<<"total number of elements in queue are:";
     cout<<rear-front<<endl;                             // rear=5 , front=0 so 5-0=5 elements
     cout<<"elements are\n";
     for(int i=front;i<rear;i++)                        
     cout<<queue[i]<<endl;
     }
     else
     {
     int length;
     length=(index-front)+rear;
     cout<<"total number of elements in queue are:";
     cout<<length<<endl;
     cout<<"elements are\n";
     for(int i=front;i<index;i++)
     for(int j=0;j<rear;j++)
     cout<<queue[1]<<endl; 
     }    
}

//////////////////////////////////////////////////////////////////

void deletequeue()
{
     if(front==-1&&rear==-1)
     cout<<"queue not created\n";
     else
     front=-1;
     rear=-1;
     cout<<"queue is successfully deleted\n";
} 

/////////////////////////////////////////////////////////////////

void clearqueue()
{
     if(front==-1&&rear==-1)
     cout<<"queue not created\n";
     else
     front=0;
     rear=0;
     cout<<"queue is successfully cleared\n";
}

////////////////////////////////////////////////////////////////

void find()
{
     int temp=0;
     int number;
     int i;
     if(front==-1&&rear==-1)
     cout<<"queue not created\n";  
     else
     cout<<"enter number to find in queue\n";
     cin>>number;
     for(i=front;i<rear;i++)
     {
     if(queue[i]==number)
     {
     cout<<"number found at position"<<i<<endl;
     temp=1;
     
     }
     }
     
     if(temp==0)
     cout<<"number not found\n";
     
     }

//////////////////////////////////////////////////////////////

void enqueue(int a)
{
     queue[rear]=a;
     rear=(rear+1)%index;
     cout<<"element is successfully enqueued\n";
}

//////////////////////////////////////////////////////////////

int dequeue()
{
    int a=queue[front];
    front=(front+1)%index;
    return a;
}

////////////////////////////////////////////////////////////

int isfull()
{
    if(rear-front==rear)
    return 1;
    else 
    return 0;
}
///////////////////////////////////////////////////////////

int isempty()
{
    if(front==rear)
    return 1;
    else
    return 0;
}         



///////////////////////////////////////////////////////////////

int main()
{
    menu();
    return 0;
}

C++ source code output:

Sample input output



menu output selection

if we select option 1 and enter 1, 2, 3 then option 2 we have

display queue c++ project

find more projects here: C++ projects source code

Array based list c++ simple project

2016-09-28T13:57:00.000-07:00

Array based list Implementation
What is Array based list?

It is a data structure that is used to store data in a single array.
Also known as backing array.

Advantages:

They allow you to randomly access any item in list by providing constant time access to any value in array.

Disadvantages:

They cannot expand or shrink.
They are not very dynamic. It means if you want to add or remove data in somewhere middle of the list you will need to shift all elements in the array either to fill the gap caused by removal of item or to make a space for inserting an item.
If number of elements exceed the size of backing array then an expensive operations needs to be performed. The operation is to make a new array of size larger than previous array and shift all the elements of previous array in new array accordingly before making new insertions.

C++ project introduction
this project contains following list of functions. Every function is called by a menu option.

Create list
Delete list
Clear list
Display list
add item in list
add item at particular place
remove item from list
remove item from particular position
swap items by position
find item in list
find item by position
copy list
update item
update item by position
check size of list
get element
check if list is full
check if list is empty

C++ Project Overview:

This code below can be used by beginners as a small project or assignment during semester. It contains menu based working using 19 functions. You can add more functions in it and can extend it to any level using your own customization.

/*inclusion of header files*/
#include<iostream>
#include<conio.h>
#include<stdlib.h>
#include<stdio.h>
using namespace std;
////////////////////////////////////////////
/*initialization of global variables and dynamic array */
/*By global variable we mean the variables that can be used anywhere in whole code*/
int total_size=0;                                    // shows total size of list is zero
int *list=new int[total_size];              // dynamically creating array with size ‘0’
int cs=0;                                                 //shows that current size of list is zero
int cl=-1;                                                //shows that list is not created yet,  “cl=clear”

///////////////////////////////////////////
/*declaration of functions */
/*Below Is the list of functions that we will be using in our code*/
/*00*/void menu();
/*01*/void create_list();
/*02*/void delete_list();
/*03*/void clear_list();
/*04*/void display_list();
/*05*/void add_item(int);
/*06*/void add_item_by_position(int,int);
/*07*/void remove_item();
/*08*/void remove_item_by_position();       
/*09*/void swapp_items(int,int);
/*10*/void swapp_items_by_position(int,int);
/*11*/int find_item(int);
/*12*/int find_item_by_pos(int);
/*13*/void copy_list();
/*14*/void update_item(int,int);
/*15*/void update_item_by_position(int,int);
/*16*/void check_size_of_list();
/*17*/int get_element_by_position(int);
/*18*/int isfull();
/*19*/int isempty();
//////////////////////////////////////////////////////////////////////////////////////
The function that is written below will work throughout the code to display a menu of various functions. You will be prompted to enter the corresponding number of function you want to use and move ahead.
//////////////////////////////////////////////////////////////////////////////////////
void menu()
{
   system("pause");
   system("cls"); 
   int option;
   cout<<"****welcome to list application****\n";
   cout<<"press 0  to exit\n";           //
   cout<<"press 1  to create list\n";    //
   cout<<"press 2  to delete list\n";   //
   cout<<"press 3  to clear list\n";   //
   cout<<"press 4  to display list\n";  //
   cout<<"press 5  to add item in list\n"; //
   cout<<"press 6  to add item at particular position\n"; //
   cout<<"press 7  to remove item from list\n";
   cout<<"press 8  to remove item from particular position\n";
   cout<<"press 9  to swap items\n";//
   cout<<"press 10 to swap items by position\n";//
   cout<<"press 11 to find item in list\n";   //
   cout<<"press 12 to find item by position\n";   //
   cout<<"press 13 to copy list\n";//
   cout<<"press 14 to update item\n"; //
   cout<<"press 15 to update item by position\n"; //
   cout<<"press 16 to check size of list\n"; //
   cout<<"press 17 to get element\n"; //
   cout<<"enter 18 to check if list is full\n"; //
   cout<<"enter 19 to check if list is empty\n"; //
   cout<<"enter option:";
   cin>>option;
///////////////////////////////////////////////////  
   switch(option)
   {
    case 0:
    {
    exit(0);                               //built in function to exit from program    
    }
    break;
//////////////////////////////////////////////////   
               
    case 1:      
         {          
         create_list();
         menu();
         }
    break;
/////////////////////////////////////////////////
    case 2:
         {
         delete_list();
         menu();                                       
         }
    break;
////////////////////////////////////////////////
    case 3:
         {
         clear_list();
         menu();                                      
         }
    break;
////////////////////////////////////////////////                                                             
    case 4:
         {
         display_list();
         menu();
         }
    break;
///////////////////////////////////////////////
    case 5:
         {
         int it;                                     
         if(cl==-1)
         cout<<"list is not created\n";
         else
         if(isfull()==1)
         cout<<"list is already full\n";
         else
         do
          {
           cout<<"enter item:";
           cin>>it;
           if(find_item(it)==1)
           cout<<"item is already in list\n";
           }
                     while(find_item(it)==1);
           
           add_item(it);  
           cout<<"item added successfully in list\n";    
           cs++;                        
         }
         menu();
    break;
//////////////////////////////////////////////
    case 6:
         {
         int it,pos;
         if(cl==-1)
         cout<<"list is not created\n";
         else
          do
          {
          cout<<"enter item:";
          cin>>it;
          if(find_item(it)==1)
          cout<<"item is already in list\n";
          }
          while(find_item(it)==1);
         cout<<"enter position:";
         cin>>pos;
         if(cl==1&&pos<cs)
         {
         for(int i=cs-1;i>pos-1;i--)
         {
                 list[i+1]=list[i];
         }
         add_item_by_position(it,pos);
         
         cout<<"item added successfully at pos :"<<pos<<endl;
         cs++;
         }
         else
        
         if(cl==1&&pos>=cs&&pos< total_size)
        
         {
         list[cs]=it;
         cs++;
         }
         else
         cout<<"position out of range\n";
         }
           menu();
           break;      
/////////////////////////////////////////////
    case 7:
         {
         if(cs==0)
         cout<<"list is empty\n";
         else
         if(cl==-1)
         cout<<"list is not created\n";
         else
         remove_item();
         cout<<"item is successfully removed\n";                                   
         }
         menu();
         break;
////////////////////////////////////////////
    case 8:
         {
         if(cs==0)
         cout<<"list is empty\n";
         else
         if(cl==-1)
         cout<<"list is not created\n";
         else                                 
         remove_item_by_position();
         cout<<"item successfully deleted\n";                                 
         }
         menu();
         break;
////////////////////////////////////////////
    case 9:
         {
         int it1,it2;                                  
         if(cs==0)
         cout<<"list is empty\n";
         else
         if(cl==-1)
         cout<<"list is not created\n";
         else
         do
         {
         cout<<"enter item 1: ";
         cin>>it1;
         if(find_item(it1)!=1)
         cout<<"item is not in list\n";
         }
         while(find_item(it1)!=1);
         do
         {
         cout<<"enter item 2: ";
         cin>>it2;
         if(find_item(it1)!=1)
         cout<<"item is not in list\n";
         }
         while(find_item(it2)!=1);
         swapp_items(it1,it2);
         cout<<"items successfully swapped\n";
                                           
         }
         menu();
         break;
///////////////////////////////////////////                                                
    case 10:
         {
          int pos1,pos2;                                  
         if(cs==0)
         cout<<"list is empty\n";
         else
         if(cl==-1)
         cout<<"list is not created\n";
         else
         do
         {
         cout<<"enter position 1:";
         cin>>pos1;
         }
         while(pos1<0||pos1>=cs);
         do
         {
         cout<<"enter position 2:";
         cin>>pos2;
         }
         while(pos2<0||pos2>=cs);
        
         swapp_items_by_position(pos1,pos2);
         cout<<"items successfully swapped\n";
         }
         menu();
         break;
////////////////////////////////////////////
     case 11:
         {    
         int it;
         if(cs==0)
         cout<<"list is empty\n";
         else
         if(cl==-1)
         cout<<"list is not created\n";
         else
         {
         cout<<"enter item to check its presence in list\n";
         cin>>it;
         find_item(it);
         if(find_item(it)==1)
         {
         cout<<"item is present in list";
         int i=0;
         while(list[i]!=it)
         {
         i++;
         }
         cout<<"at position "<<i<<endl;                 
         }
         else
         cout<<"item not found\n";
         }
         menu();
         }
         break;
//////////////////////////////////////////////
         case 12:
         {
         int pos;
         if(cs==0)
         cout<<"list is empty\n";
         else
         if(cl==-1)
         cout<<"list is not created\n";
         else
         {
         do
         {
         cout<<"enter position to find its item\n";
         cin>>pos;  
         }
         while(pos<0||pos>ts);
         find_item_by_pos(pos);
         }
         menu();    
         }
         break;
//////////////////////////////////////////////
         case 13:
         {
         if(cs==0)
         cout<<"list is empty\n";
         else
         if(cl==-1)
         cout<<"list is not created\n";
         else  
         copy_list();
         cout<<"list copied successfully\n";
         }
         menu();
         break;
/////////////////////////////////////////////
         case 14:
         {
          int it1,it2;   
          if(cs==0)
          cout<<"list is empty\n";
          else
          if(cl==-1)
          cout<<"list is not created\n";
          else
          {
          do
          {       
          cout<<"enter item to be updated\n";
          cin>>it1;
          if(find_item(it1)!=1)
          cout<<"item is not in list\n";
          }
          while(find_item(it1)!=1);
          do
          {
          cout<<"enter new item to be replaced\n";
          cin>>it2;
          if(find_item(it2)==1)
          cout<<"item is already in list\n";
          }
          while(find_item(it2)==1);
          update_item(it1,it2);
         }
         }
         menu();
         break;
////////////////////////////////////////////
         case 15:
         {
          int it,pos;   
          if(cs==0)
          cout<<"list is empty\n";
          else
          if(cl==-1)
          cout<<"list is not created\n";
          else
          {
           do
           {   
           cout<<"enter item:";
           cin>>it;
           if(find_item(it)==1)
           cout<<"item already present\n";
           }
           while(find_item(it)==1);
           cout<<"enter position:";
           cin>>pos;
           if(pos<cs)
           update_item_by_position(it,pos);
           else
           cout<<"item at "<<pos<<" is not available to be updated\n";
          }
             
              
         }
         menu();
         break;
///////////////////////////////////////////
         case 16:
         {
         if(cs==0)
         cout<<"list is empty\n";
         else
         if(cl==-1)
         cout<<"list is not created\n";
         else    
         check_size_of_list();
        
         }
         menu();
         break;
//////////////////////////////////////////
         case 17:
         {   
              int a,pos;
              if(cs==0)
              cout<<"list is empty\n";
              else
              if(cl==-1)
              cout<<"list is not created\n";
              else
              do
              {
              cout<<"enter position to get from list:";
              cin>>pos;
              }
              while(pos<0||pos>cs);
              a=get_element_by_position(pos);
              cout<<"here is your item from list :"<<a<<endl;
         }
         menu();
         break;
//////////////////////////////////////////
         case 18:
         {
         if(cs==0)
         cout<<"list is empty\n";
         else
         if(cl==-1)
         cout<<"list is not created\n";
         else
         if(isfull()==1)
         cout<<"list is full\n";
         else
         cout<<"list is not full\n";
         }
         menu();
         break;
/////////////////////////////////////////
         case 19:
         {
         if(cl==-1)
         cout<<"list is not created\n";
         else
         if(isempty()==1)
         cout<<"list is empty\n";
         else
         cout<<"list is not empty\n";
         }
         menu();
         break;                 
/////////////////////////////////////////                                                                  
    default:
    cout<<"invalid option\n";
    menu();
    break;
//////////////////////////////////////////   
    }   //switch closed
    }   //funtion closed

/////////////////////////////////////////////////////////////////////////////////////////////////
/*definitions of functions*/
/*////////////////////////////////////////////////////////////////////////////////////

The function below will be used to create a list. In this function you will have to dynamically create a list first. As initially the total size of list was set to zero so that user can create a list of the size of its own choice and requirement. Total size could be any but make sure that it should be greater than current size of list. After entering total size enter current size of list that should be exactly the number of items you want to insert in list.

Suppose we set total_size to 10.

And current size (cs) to 5.

To avoid any errors we have put a check while getting value from user. You’ll be prompted to enter current size again and again if it is less than 1 or exceeds total size of list. After checking your list will be dynamically created.

After creation of list you will be prompted to insert items in a list. To avoid duplication, we have put a check on each entry. Whenever you will insert item in list, [find_item()] function will run and compare all previously inserted items of list with newly inserted item. If it is different, it will be entered otherwise it will prompt again and again to enter new value/item.

1 2 3 4 5 6 7 8 9 10

Cs Ts

////////////////////////////////////////////////////////////////////////////////////*/
    void create_list()
     {
     int it;
     cout<<"enter total size of list:";
     cin>>total_size ;
     do
     {
     cout<<"enter current size of list:";
     cin>>cs;
     }
     while(cs<1||cs>=ts);
    
     int i=0;
     while(i<cs)
     {
       
     cout<<"enter item:";
     cin>>it;
       
     if(find_item(it)!=1)
     {
    
     list[i]=it;
     i++;
     }
     else
     cout<<"item already present\n";
     }       //while closed
     cl=1;
     }       //function closed

The function below can be considered as a heart of the code as it will work for insertion of any new entry in list to check for duplication. It will return 1 that means true if new entry of item matches already existing item in list. Otherwise it will return 0 that means false.

Working:

We will pass any item that we want to check for duplication to this function. It will start checking from them item present at first number of list till end of list. Each time it will compare the item passed to it with item at particular position. It will continue till it reaches end of list or find a duplicate item. If there is no duplicate item and function has reached end of list, it will return 0.

int find_item(int it)
     {
     int i;  
     for(i=0;i< total_size;i++)
         
     if(list[i]==it)
     return 1;
     }       
The function below will randomly access any item whose position you will pass to it, and then it will return you that item.
     int find_item_by_pos(int pos)
    
     {
     cout<<"item at position "<<pos<<" is "<< list[pos]<<endl; 
     return 1;
     }

/*Suppose you pass pos = 3

This function will return you 30. According to list.*/

The function below will be used to display status of list whenever needed. But before displaying it will check if list is empty? Or if list is not created yet. If any of the two options come true, it will display the message accordingly. Otherwise it will simply display a list.


     void display_list()
     {
     if(cs==0)
     cout<<"list is empty\n";
     else
     if(cl==-1)
     cout<<"list is not created\n";
     else    
     for(int i=0;i<cs;i++)
     cout<<list[i]<<endl;
     }
/*Output: After the listed you have created first by inserting 5 items, if you will run this function the output you will have will be like:
10
20
30
40
50
*/
/*////////////////////////////////////////////////////////////////////////////////////
The function below will simply delete the list by giving negative value to “cl”. Must note that array can never have negative value, but if you assign it this value it means that it doesn’t exist.
///////////////////////////////////////////////////////////////////////////////////*/

     void delete_list()
     {
     if(cl==-1)
     cout<<"list is not created\n";
     else
     cl=-1;
     cout<<"list is successfully deleted\n";
     }
////////////////////////////////////////////////////////////////////////////////////
/*////////////////////////////////////////////////////////////////////////////////////
The function below will clear the list i-e only remove items from the list. By doing this, list will come to its initial form. It will exist but will be empty. We have put check before clearing the list to check if list exists or not and if it exists is it already clear or not. The function will work if list exists and contains some values otherwise it will show a default message that you already set.
///////////////////////////////////////////////////////////////////////////////////*/

     void clear_list()
     {
     if(cl==-1)
     cout<<"list is not created\n";    
     else
     if(cs==0)
     cout<<"list is already empty\n";
     else
     cs=0;
     cout<<"list is successfully cleared\n";    
     }

The function below will add item at unallocated location right after last item in list.

     void add_item(int item)
     {
      list[cs]=item;
     }

It will add item to specific location in list. For eg you want to insert item at 7^th location then,

1 2 3 4 5 6 7 8 9 10

Cs Ts

void add_item_by_position(int item,int pos)

{

list[pos]=item;

}

This function will return 1 if current size is equal to total size indicating list if full and there is no more space to add more item

100

1 2 3 4 5 6 7 8 9 10

Cs/Ts

int isfull()

{

if(cs== total_size)

return 1;

else

return -1;

}

This function will return 0 if current size is zero that indicates list is empty

1 2 3 4 5 6 7 8 9 10

Cs=0 Ts

int isempty()

{

if(cs==0)

return 1;

else

return 0;

}

The function below will be used to update and item in a list . Suppose you want to update item 40 to 80 then use this function.

Before update:

1 2 3 4 5 6 7 8 9 10

Cs Ts

After update:

1 2 3 4 5 6 7 8 9 10

Cs Ts

    void update_item(int it1,int it2)
    {
   
    if(find_item(it1)==1)
    {
    int i;                    
    for(i=0;list[i]!=it1;i++)
    int a=list[i];
    list[i]=it2;
    cout<<"at"<<i<<"="<<list[i]<<endl;
    cout<<"item successfully updated\n";
    }
    else
    cout<<it1<<"is not in list\n";    
    }

The function below will be used to update and item in a list by defining position at which place you want to update an item. Suppose you want to update item 40 to 80 and 40 is at position ‘4’ then use this function, pass the position at new item to the function. The function will replace the existing value with new value at position passed as argument.

Before update:

1 2 3 4 5 6 7 8 9 10

Cs Ts

After update:

1 2 3 4 5 6 7 8 9 10

Cs Ts

////////////////////////////////////////////////////////////////////////////////////*/

void update_item_by_position(int it,int pos)

{

int a=list[pos];

list[pos]=it;

cout<<"item at position "<<pos<<" is successfully updated\n";

cout<<"old item was:"<<a<<endl;

cout<<"new item is :"<<it<<endl;

}

Current size basically shows that how many items are in a list, so in order to get size of list the function below will be used that will print value of ‘Current size (cs)’.

void check_size_of_list()

{

cout<<"current size of list is:"<<cs<<endl;

}

The function below can be used to directly get the item present at particular position. Suppose in list below you want to get item present t position 4, so just pass number ‘4’ as argument and function will return ’40’.

1 2 3 4 5 6 7 8 9 10

Cs Ts

/////////////////////////////////////////////////////////////////////////////*/

int get_element_by_position(int pos)

{

return list[pos];

}

/*///////////////////////////////////////////////////////////////////////////////////

The function below can be used to swap any two items in a list. You have to pass the items that you want to swap. The function will first find both values in a list and then swap them. Suppose you want to swap 20 and 40 in list so.

Before swapping:

1 2 3 4 5 6 7 8 9 10

Cs Ts

After swapping:

1 2 3 4 5 6 7 8 9 10

Cs Ts

   void swapp_items(int it1,int it2)
   {
    int j=0,k=0;
   
    do
    {
    j++;
    }
    while(list[j]!=it1);
  
    do
    {
    k++;
    }
    while(list[k]!=it2);
   int temp=0;
   temp=list[j];
   list[j]=list[k];
   list[k]=temp;
   }

The function below can be used to swap any two items in a list. You have to pass the positions of items that you want to swap. This thing will give you instant result and function will not have to find the values first. It will directly go to the positions and then swap items. Suppose you want to swap items at position 2 and 4 in list so.

Before swapping:

1 2 3 4 5 6 7 8 9 10

Cs Ts

After swapping:

1 2 3 4 5 6 7 8 9 10

Cs Ts

////////////////////////////////////////////////////////////////////////////////////*/

void swapp_items_by_position(int pos1,int pos2)

{

int temp=0;

temp=list[pos1];

list[pos1]=list[pos2];

list[pos2]=temp;

}

/*/////////////////////////////////////////////////////////////////////////////////

The function below can be used to copy list items from one list to another.

////////////////////////////////////////////////////////////////////////////////*/

void copy_list()

{

int i,j;

int *c_list=new int[cs];

for(i=0;i<cs;i++)

c_list[i]=list[i];

cout<<"your copied list is\n";

for(j=0;j<cs;j++)

cout<<c_list[j]<<endl;

}

/*////////////////////////////////////////////////////////////////////////////////

The function below can be used to remove an item from list. You have to pass the item you want to delete. The function will first find item in list then delete it.

void remove_item()
 {
  int it;   
  do
  {
  cout<<"enter item to delete from list:";
  cin>>it;   
  if(find_item(it)!=1)
  cout<<"item is not in list\n";
  }
  while(find_item(it)!=1);
   int i=0;  
  do
  {
  i++;    
  }
  while(list[i]!=it);
  int a;
  a=list[i];
  for(int j=i;j<cs-1;j++)
  {
  list[j]=list[j+1];
  }
  cs--;
  }
/*/////////////////////////////////////////////////////////////////////////////
The function below can be used to remove an item from list. You have to pass the position from which you want to delete item. The function will go to that position in list then delete it.
//////////////////////////////////////////////////////////////////////////////*/
   void remove_item_by_position()
   {
    int pos;
    do
    {
    cout<<"enter position:";
    cin>>pos;
    if(pos<0||pos>cs)
    cout<<"there is no item at position "<<pos<<endl;   
    }
    while(pos<0||pos>cs);   
    int a;
    a=list[pos];
    for(int i=pos;i<cs;i++)
    {
     list[i]=list[i+1];
    }
    cs--;
   } 
////////////////////////////////////////////////////////////////////////////////    
/* start of main*/
////////////////////////////////////////////////////////////////////////////////////         
    int main()
    {
        menu();
        getch();
    }
/*end of main */

Download c++ source code

Sample input outputs

Select option create list

Display all items in list option 4

This C++ project has developed by a student and can be improve student like you. You may found bugs in it but they are meant to be solve by you. It is very good for learning to change the logic or flow of code according to your need