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 > Code Snippets Code Examples

Date-Time applet

Program Finds the Longest Path in a DAG - Program to find longest path in DAG. Given a weighted directed acyclic graph and a source vertex s in it, find the longest distances from s to all other vertices in the given graph. Create

Check the Alphabet is Vowel or Consonant - C program takes the Character value as input and checks whether that character is a vowel or consonant using if-else statement. Since a user allowed to enter an alphabet Lowercase

Volumes & Areas of geometric shapes in c - C program coding to calculate area, volume, perimeter of a particular geometric shape. Square, rectangle, circle, triangle, rhombus, parallelogram, trapezium, quadrilateral,...

Code print all unique elements in an array - C Program to read elements in an array and print all unique element present in array. C program to find unique/distinct elements in an array. Logic to print all unique elements...

Check a Number is Positive Negative or 0 - We will use the above logic inside if to check number for Negative, Positive or Zero. Step by step Descriptive Logic to check negative, positive or zero. Input a number from user in

Using Local variable in The C++ Language - Local variables are declared inside the braces of any "user defined function", main function, loops or control statements(if, if-else etc) and have their scope limited inside those "braces"

C If Expression is Correctly Parenthesized - C program code takes a expression as input and checks if the expression is correctly parenthesized. Take a expression as input and store it in the array. Check for the "(" ...

C++ Programs to Implement Skew Heap - Inserting element "into the heap". Deleting "maximum element" from the heap. Merge two heaps. Print the 'maximum element' of the heap. And merge the present heap with