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 > Common Dialogs Code Examples

Displaying The Common Save Dialog





Queue C++ Code Using Class and Member - This represents the queue dequeue function. Every time another object or customer enters the line to wait, they join the "end of the line" and represent the "enqueue function". Queue

Print the Kind of Rotation the AVL Tree is - Program to print the kind of rotation that is performed when an 'Element is inserted' or deleted from tree. In Discrete Mathematics, tree rotation is an operation on a binary tree

C++ Sorts a given Data using Stooge Sort - Stooge sort is a recursive sorting algorithm. It Divides the Array into 2 overlapping parts, 2/3 each. Sort the first part. Sort second part and again sort the first part. Then Print the Result

C Language Finding the Sum of G.P Series - C Language program is used to Find the Sum of the geometric progression series. Here G.P stands for geometric progression. Geometric progression, or GP, is a sequence where each

The C++ language Check Leap Year or Not - To check whether the input year is a leap year or not a "leap year" in C++ Programming, you have to enter the year and start checking for the leap year. To check that the year is a leap

C Codes Size of Structure Sizeof Operator - C structure is collection of elements of the different data types. Size of the structure can be evaluated using "sizeof operator". Sizeof is operator not function. Sizeof operator takes

C++ Byte Alignment in a struct Algorithm - Get size of the current type. Align depens on the next type and also alignment defined by #pragam pack(#). Offset will be minimum of this size. If the "size of next type" is less than

C++ Finds Maximum Element in an Arrays - Construct "Binary Search" tree for "unsorted" data array. For the 'Maximum element' move the pointer to the rightmost child node. This value will be the minimum value among data.