Happy Codings - Programming Code Examples

C Programming Code Examples

C > File Operations Code Examples

Copy a file in four debug level

Copy a file in four debug level

#include <stdio.h>
#include <stdlib.h>

/* DEBUG levels:
          0: no debug
          1: display byte read from source file
          2. display byte written to destination file
          3: display bytes read and bytes written
*/
#define DEBUG 2

int main(int argc, char *argv[])
{
  FILE *in, *out;
  unsigned char ch;

  /* see if correct number of command line arguments */
  if(argc!=4) {
    printf("Usage: code <in> <out> <key>");
    exit(1);
  }

  /* open input file */
  if((in = fopen(argv[1], "rb"))==NULL) {
    printf("Cannot open input file.\n");
    exit(1);
  }

  /* open output file */
  if((out = fopen(argv[2], "wb"))==NULL) {
    printf("Cannot open output file.\n");
    exit(1);
  }

  while(!feof(in)) {
    ch = fgetc(in);
#if DEBUG == 1 || DEBUG == 3
    putchar(ch);
#endif
    ch = *argv[3] ^ ch;
#if DEBUG >= 2
    putchar(ch);
#endif
    if(!feof(in)) fputc(ch, out);
  }

  fclose(in);
  fclose(out);

  return 0;
}

Partition of a Number in all Possible Ways - C++ Program to get all the unique partitions of an integer such that addition of a partition results an integer. An integer n, generate all "possible unique" ways to represent n as sum

Check Vowel or Consonant use switch case - English Alphabets a, e, i, o, u both lowercase & uppercase are known as vowels. Alphabets other than Vowels are known as Consonants. Input an alphabet from user. Store it in some

C Language Finding the Sum of H.P Series - This C program is used to find the sum of the 'Harmonic Progression Series'. H.P stands for harmonic progression. Harmonic progression is a progression formed by taking reciprocals

Find Fibonacci Series Understanding Logic - The Fibonacci series is infinite but we can not make a C++ program that display an "infinite" output. In program, we take input the "range" in integer upto which Fibonacci series will be

Find Second Largest & Smallest Elements - C Program finds second largest & smallest elements in an array. The program sorts the array in an descending order. Then it finds the second largest and smallest element in

Checks the Connectivity of Directed Graph - Add Edge to connect "v" and "w". A recursive function to print BFS starting from s. Returns reverse ('or transpose') of this graph. Check if graph is connected. Print graph is connected.

Switch Case Statement in C Programming - The Switch Case statement is used when we have multiple options & we need to perform a different task for each option. Case doesnt always need to have order 1, 2, 3 and so on...

Generate a Random UnDirected Graph for - Basically it implements on a big network. The time complexity of this algorithm is O(log(n)). This algorithm takes the input of the number of edges 'e'. It connects vertexes randomly &