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

Visual Basic Programming Code Examples

Visual Basic > Applications VBA Code Examples

Test if an application is responding and terminate application

C Convert Lowercase String to Uppercase - C user would be asked to enter a lower case String and the program would convert it into a Upper case String. Logic followed in the program: All lower case characters (a to z)

C++ Compare Binary & Sequential Search - A 'function implementing' Binary search on a 'Sorted array'. Every time this function called, counted as a iteration of 'binary search'. So if value is "Less than Value" at start index more

C Converting Roman Numbers to Decimal - Take a roman number as input and store it in the array roman_Number. In the C function digit(), define the value of each digit of the roman number inside the switch statement

C++ Code Find ASCII Value of a Character - Full form of Ascii is American Standard Code for Information Interchange. It is a character "Encoding Scheme". Originally based on the English alphabet, every character or number

Program Sort text data by soundex value - Insert line in the Linked List. Create a new node. Save data into new node. First, we handle the case where 'data' should be the first element. Get soundex code for a string.

Finds Prime Number in C++ The Language - In C++ coding, we take a 'For Loop' which will start from 1 up to number that has entered to check whether it is Prime Number or not with in for loop we set an 'IF' condition and placed

Check Whether Number is Strong Number - How to check Strong Numbers using loop in C. What is Strong number? Strong number is a special number whose sum of factorial of digits is equal to the original number. 145 is

Test Using DFS Whether a Directed Graph - This C++ Program checks whether a directed graph is weakly connected or not. We can do "DFS" V times starting from every vertex. If any DFS, doesn't visit all vertices, then graph