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

Turn the Screen Saver on or off

C++ Language & Monoalphabetic Cypher - A substitution cipher is a method of encoding by which units of 'plaintext are replaced' with ciphertext, according to a regular system; the "units" may be "single letters", pairs of letters

C code format Time and Date into a string - Abbreviated weekday name, Full weekday name, Abbreviated month name, Full month name, Standard date and time string, Last two digits of year, Day of month as a decimal

Postfix Increment Operator Overloadings - Increments ++ & Decrements -- operator are overloaded in best possible way, increase the value of a data member by 1 if "++ operator" operates on an object and decrease value of

Find Fibonacci Series Understanding Logic - The Fibonacci series is infinite but we can not make a C++ program that display an "infinite" output. In program, we take input the "range" in integer upto which Fibonacci series will be

Implementation for Linked List in the C++ - Test if the list is logically empty. Return true if empty, false otherwise. Make the list logically "empty". Return an 'iterator' representing the header node. Return an iterator representing

C Swap two numbers using XOR Operator - C programming code to swap two numbers using XOR operator. Generally swaping two number requires three variables. Let's take look at procedure of swaping two numbers.

Program to Store Information of Students - In this c program code, a structure, student is created. This structure has three members: name (string), roll (integer) and marks (float). Then, we created a structure array of size 10

Implement A Heuristic to Find the Vertex - Problem takes E edges as input and outputs vertex cover of the graph, implementing the following heuristic. There is no "Polynomial" time algorithm "invented up to date" to find