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 > Files Directories Drives Code Examples

Getting the Long Filename





Convert Strings to UpperCase use Pointers - C program to 'convert string' from Lowercase to uppercase string using loop. All characters are represented as an integer value known as "ASCII" value. Where A is represented with 65

Program Code Calculates the Value of nCr - This C Program to Calculates the value of nCr. The algorithm used in this program is nCr = n! /((n-r)!r!) and We need to Find all the Possible combination of the value n&r. A combination

Create an Array of Chars in C++ Language - String is a "sequence of characters". char data type is used to represent one single character in C++. So if you want to use a String in your program then you can use an "array of chars".

C++ Code Find Largest of Three Numbers - To find the largest number among the three numbers in C++, enter three numbers, now checking which one is the "largest number". After finding the largest number, we display

Compile Ttime Polymorphism in The C++ - In this C++ example, we have two functions with "same name" but different number of arguments. Based on how many parameters we pass during Function call "Determines"

C Add two numbers and display their sum - C program code input two numbers from user and calculate their sum. C program to add 2 numbers and printing their sum as output. How to add two numbers in C programming.

Program Remove given Word from String - This program takes string and its substring as input, removes the Substring from the string. Take a string, its substring as input and Store it in the array str[] & key[] respectively. Store

C++ Program to Implement Pairing Heap - In this, Insert item x into the 'priority queue', maintaining heap order. Return a pointer to the node containing the new item. Find the 'smallest' item in the priority queue. Return