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 > Windows and Controls Code Examples

Perform Remote Shutdown on NT machine

C Program Codes Finds Area of Trapezium - C Language program to calculates the area of trapezium. The Formula used in this program are Area = (1/2) * (x + y) * h where x and y are the Two Bases of Trapezium & h is the height.

C check uppercase or lowercase characters - Code Step by Step descriptive logic to check Uppercase and Lowercase alphabets. Input a character from user. Store it in some variable say ch. Character is uppercase alphabet if(ch

C++ Programming Finds Length of Strings - To find the length of the string in 'C++', ask to enter the string and then Find the Length the that string using function "strlen()" of string.h library and display the length value of a string

C++ Checking if a Given Graph is Bipartite - Bipartite Graph is a graph in which the set of 'vertices' can be divided into 2 sets such that all vertex should be present in either set 1 or set 2 but not both, and there should no edge

C Program Codes write data in DMA Mode - Motor on, command code, cylinder no. Sense Interrupt Command. Reading ST0 in data register. Initialization DMA Mode. Supplying Mode Byte. Supplying channel no. on port 10.

C Convert UpperCase String to LowerCase - In C Language program code, user would be asked to enter a String (it can be in complete uppercase or partial uppercase) and then the program would convert it into a complete(all

Printing 100 Ramanujan Numbers 2 Ways - C++ Sample code Print first 100 "Ramanujan Numbers" by TWO WAYS 1st way is printing ramunajan numbers from RN taking RN from 0 to INFINITY & print first 100 numbers. 2nd

Checks Given Graph is Strongly Connected - If there exists "Multiple Strongly Connected" component, graph is not strongly connected, it is otherwise. Implementation of Kosaraju's Algorithm to "Print all SCCs". Fills Stack with