c

C Source Code to Reverse the Operation of Shift & Caps Lock

Submitted by Arup Kr Goswami on
Hello. This is a simple C source code written in Turbo C platform (OS- Windows 7) which actually reverses the operation of Shift & Caps Lock. That is, if Caps Lock is ON, then all pressed key will be in Lower Case, or keeping Shift pressed, all pressed keys are in Lower case, else all are in Upper case. So, it is the reverse of normal condition.

Ohm's Law Calculator using Simple Graphics in C

Submitted by Arup Kr Goswami on
Hello. This is a simple C source code written in Turbo C (OS- Windows 7). It can calculate the values using Ohm's Law. I also used basic of Computer Graphics in this project. Basically, it is a calculator where you have to put values with proper unit (e.g resistance in ohm, voltage in volts etc), hence it finds the result. Thanks.

A simple Timer using C

Submitted by Arup Kr Goswami on
Hello, This C source code is written in gcc platform (Ubuntu, Linux). It is a simple timer, actually it counts the difference between the Set time (Set by user) & current time. Let the current time is hh-mm-ss of today, so it will run for maximum hh-mm-ss of tomorrow, i.e for 24 hours maximum. Thanks

Testing Directed or Undirected Graph From Adjacency Matrix

Submitted by Arup Kr Goswami on
This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests whether the adjacency matrix represents Directed or undirected graph. Actually This reads a text file & then checks the above condition. Change the path of the text file in code. Thanks.

Testing Weighted or Unweighted Graph From Given Adjacency Matrix

Submitted by Arup Kr Goswami on
This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests whether the adjacency matrix represents Weighted or unweighted graph. Actually This reads a text file & then checks the above condition. Change the path of the text file in code. Thanks.

Check Number of Isolated Vertices & Pendent Vertices from Adjacency Matrix

Submitted by Arup Kr Goswami on
This is a simple C source code written in gcc paltform (Ubuntu, Linux). It checks that how many Isolated vertices & pendent vertices are contained in the graph represented by the adjacency matrix. Isolated vertex has degree zero & pendent vertex has degree one. Hope it will help others. Thanks.

Check Number of Self-loop & Parallel Edges From Adjacency Matrix

Submitted by Arup Kr Goswami on
Hello, This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests that how many self-loop & parallel edges are contained in the graph represented by the adjacency matrix. Also it checks that which vertices contain only self-loop. Self-loop is an edge which has the same initial & termination point.

Testing Regular Graph From Adjacency Matrix

Submitted by Arup Kr Goswami on
Hello, This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests whether the adjacency matrix represents a Regular Graph or not. Basically a Regular graph is a graph, in which all vertices have equal degree. Let each & every vertex has degree x, then the graph is called as x-regular graph.