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 > Date Time Code Examples

Check if year is a leap-year

C++ Finds Convex Hull of A Set of Points - Program to implement "Jarvis March" to find convex hull. The idea of Jarvis's Algorithm is simple, we start from the 'leftmost point' (or point with minimum x coordinate value) and

Generate Random Partition out of a Given - Program 'takes the input' of a set of integers or characters. It firstly generates the random partition of the "Length of the Set". Starting from the beginning, it 'prints the number' of

C Programs Depth First Binary Tree Search - C program, using recursion, performs a depth first search traversal. Depth-first search (DFS) is an algorithm for 'Traversing or Searching' a tree, 'tree structure' or graph. The concept of

C Programming Recursive Directory Walk - Declare the object is a file, declare directory, declare directory that could not be read, symbolic link, The object is NOT a symbolic link and is one for, which stat() could not be

C++ Program Finds HCF of Two Numbers - To find the HCF ('Highest Common Factor') or GCD (Greatest Common Divisor) of 2 or more numbers, make prime factors of the numbers and choose the common prime factors. Then

Pass Structure as an argument to Function - We have a function 'printStudentInfo()' which takes structure Student as an 'argument' and 'prints the details' of student using structure varaible. The important point to note here is

C Swap 2 Numbers using Bitwise Operator - Swap two number using bitwise operator in C programming. There are tons of discussions going around the internet to swap 2 numbers without using temporary variable. We can...

Singly Linked list Program Using functions - In C++, under the simplest form, each node is composed of data and a reference ('a link') to the next node in the sequence. This structure allows for efficient insertion or removal of the