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 > API and Miscellaneous Code Examples

How to retrieve a Pocket PC device's name

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.

C Language codings Relational Operators - A relational operator checks the relationship between two operands. If the relation is true, it returns 1; if the relation is false, it returns value 0. C program to demonstrate working

The C++ Language While Loop Statement - The statements within the while loop would keep on getting executed till the "condition" being tested remains "true". When condition becomes false, the control passes to the first

Calculating Difference Between two Time - Ask to enter two time periods and these two periods are stored in structure variables t1 t2 respectively. The computeTimeDifference() Function calculates the Difference Between

Sort Rows of the Matrix Ascending Order - Program code sorts the rows of the matrix in ascending & columns in descending order. This program accepts matrix. Then sorts the row in an ascending order & the columns in

Virtual Calendar shows the current month - Draws box with "month and year" in header. Displays current time in footer of box. Prints dates within box. Scans user key and retuen its scan code. Detemines first day of month.

Construct a Random Graph by the Method - Generates a undirected random graph for the given number "edges and vertexes". The time complexity of this algorithm is O(v*e). Takes the input of the number of vertexes & edges

Shortest Path Between two Vertices Using - This is a C++ Program to check whether path exists between two given nodes. The idea is to run the 'Depth First search' algorithm with the given source node, if during 'dfs' we visit