C/C++

Author : John Carlo C. Nañoz Program Name : Heap Algorithm In C++ Date : November 11, 2016 Features: 1 - Show how Heap Algorithm Work 2 - Input Validation 3 - Changing Colors

Author : John Carlo C. Nañoz Program Name : Simple File Manipulation In C++ Date : November 11, 2016 Features: Save to a file View file content Obtain file size File Detail Clear the file Delete the file Color Changing after each selection

This console game has 2 player mode as well as one player mode. No 3rd party library has been used to develop this code. Try this yourself. This easy and fun to do source code. Hope you learned from this.

Code Features: 1. Find the Volume of a cone 2. Find the value of other properties of the cone 3. Teach user how to compute the volume of the cone manually Thanks to following for the code: John Carlo C. Nañoz, Dondon Bagasbas, Gabby Peñones

You are required to model a vehicle parking lot system. The parking lot has a facility to park cars and scooters. The parking lot contains four parking lanes-two for cars and two for scooters. Each lane can hold ten vehicles. There is an operator with a console at the East end of the parking lot. The system should be able to handle following scenarios. Arrival of a vehicle: 1. Type of vehicle (car

Hello, this C source code shows how to reverse any string using only one stack, this is written in dev-C++ platform, OS- Win 7.

This simple C source code is written in dev-C++ platform, (OS- Win 7). Here, in a given random simple symmetric graph, whether there a Hamiltonian circuit exists or not, is being checked. This is based on the formula: If 2e >= [ (n^2) - 3n + 6 ], then there hamiltonian circuit exits, else not. e & n are the number of edges & vertices respectively here.

Hello, this is a simple C source code, written in dev-C++ platform (OS- Windows 7). This code actually check whether two given graphs are Isomorphic or not. Basically here both graphs are represented by their Adjacency matrix. At first this check whether two graph has equal number of vertices or not, then if they have the same number of edges, then again it is checked that whether they have equal

This simple C source code is written in dev-C++ platform. Here a subgraph will be generated of a simple symmetric random graph. At first Create a Simple symmetric random graph, (for n vertices) & now enter number of vertices for subgraph. automatically subgraph will be generated. thnks.

This code generates a Simple symmetric random graph initially & then it also generates the complement graph of that graph. This is written in Dev-C++ platform. Let a simple symmetric random graph is denoted by G, then we say the complement graph will be denoted by G'. Consider G has three vertices (1, 2, 3) & egdes (a, b). a exists between 1 & 2, b exists between 2 & 3. No edge exists between 1 &