Happy Codings - Programming Code Examples
Html Css Web Design Sample Codes CPlusPlus Programming Sample Codes JavaScript Programming Sample Codes C Programming Sample Codes CSharp Programming Sample Codes Java Programming Sample Codes Php Programming Sample Codes Visual Basic Programming Sample Codes


JavaScript Programming

JavaScript > Code Examples

A Countdown Timer





Print some General File info in C program - Filename, device, inode, protection, number of hard links, user ID of owner, group ID of owner, device type, total size, blocksize for filesystem I/O, number of blocks allocated,

Find The Perfect Number In C++ language - For example 6 is Perfect Number since divisor of 6 are 1, 2 and 3. Sum of its divisor is 1 + 2+ 3 =6 and 28 is also a 'Perfect Number' since 1+ 2 + 4 + 7 + 14= 28. Other 'Perfect Numbers': 496

Program Implement the Vizing's Theorem - The chromatic index of the simple graph can be either 'maxDegree' or maxDegree+1. The chromatic index is the maximum number of color needed for the 'edge coloring' of graph.

Calculate Sum and Difference of Matrices - C Program calculates the sum & difference of the matrices. Code first reads 2 matrices and then performs both addition and subtraction of matrices. Sum of elements of matrix A and

Display decimal equivalent of input binary - C Programming language example to display decimal equivalent of a input binary number. What will be the length of input no.? Don't exceed input from your input limit or 5 digits

Program Finds the Longest Path in a DAG - Program to find longest path in DAG. Given a weighted directed acyclic graph and a source vertex s in it, find the longest distances from s to all other vertices in the given graph. Create

Illustrate Stack Operations using MACROS - C Language Use #define function to define the macros. Define separate functions for the operations like push, pop, display etc. Use switch statement to access these functions.

Dictionary implimentation by Binary Trees - In C++, where first, the 'dictionary' is created by taking an input by the user for the words and their meanings. Next, these are stored in a "Binary Search Tree", after which the file is