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 > Graphics Games Programming Code Examples

Bouncing ball





C++ Program Displays Factors of Number - Find all 'factors' of an integer using for loop & if statement. Takes a positive integer from an user & displays all the factors of that number. In this program, an integer entered by user is

C Find Prime Numbers Between the Range - The program takes the range and finds all the 'Prime Numbers' between the range & prints. Lets first take the range of numbers between which you have to find the prime numbers as

C Program to Find Reverse of any number - C program code to input a number from user and find reverse of the given number using for loop. Input number to find reverse. Store it in some variable say j. Declare & initialize...

C Program Compare two Text or Data files - Firstly Declare two file pointers for two files. Open 2 files in read mode. Now Inside while loop read both files character by character. Check both characters whether they're equal

Multiple If Statements in C Programming - The statements inside the body of "if" only execute if the given condition returns true. If the condition returns false then statements inside "if" are skipped. Else and else..if are...

C++ Performs Searching Based on Locality - Searching based on Locality of Reference and also called Principle of locality. So Depending on the memory access pattern data elements are "reallocated". In general search, 80% time

Get Highest Frequency Character in String - C Program finds 'highest frequency' character in a string. C Program checks which character has 'occured more number' of times & checks how many times these character has occured

Implementations Quadratic Probing Hashs - Internal method to test if a positive number is prime. Not efficient algorithm. Using Internal method to return a prime number at least as large as n. Assumes "n > 0". Insert item x into