Articles on C Programming - MYCPLUS - C and C++ Programming Resources

Tag: C Programming

Writing UDP Data Sender and Receiver in C

The sender program is a UDP datagram sender that can be configured through command line options. It initializes Winsock, creates a UDP socket, and either connects to a recipient’s IP address or uses sendto() to send datagram messages. The receiver program complements the sender by receiving UDP datagrams.

ICMP Ping Program in C

This sample illustrates how an ICMP ping app can be written using the SOCK_RAW socket type and IPPROTO_ICMP protocol. By creating a raw socket, the underlying layer does not change the protocol header so that when we submit the ICMP header nothing is changed so that the receiving end will see an ICMP packet. Additionally, we use the record route IP option to get a round trip path to the endpoint. Note that the size of the IP option header that records the route is limited to nine IP addresses.

graphics: graphics.h Header File

This is the graphics.h header file which contains all the graphics functions and their implementations. It is quite nice to have a look at header files just to know more about functions and their parameters. Also it tells about different structures, enums defined in the file for specific purpose.

Print Pyramids and Diamonds Shapes in C Programming

So, here in this article I will demonstrate how you can print pyramids and diamonds using for loop and if condition using C Programming. Building a pyramid in c programming is quite easy, but you must have the understanding of how for loop works. With some slight modifications you can print different shapes as well.

The C++ program to find the Shortest Path

This C++ program finds the shortest path between two cities, provided that the map of the two...

PC to PC Communication in C

This is a C program to demonstrate PC to PC Communication via RS232 port. Chat with only 3-wire connection. This program is tested with Turbo C++ editor Version 3.0. How ever, authors are not responsible for any damages that may happen to your computer. Please contact us if any problem exits.

Find the longest common sub-sequence between two strings: Dynamic Programming Algorithm

This C program finds the longest common sub-sequence between two strings. It implements the most famous dynamic programming algorithm. Dynamic programming is a computational technique used to solve complex problems by breaking them down into smaller subproblems and solving each subproblem only once, storing the solution to each subproblem and using it to solve larger problems.

Smith-Waterman Algorithm – The Optimal Pairwise Sequence Alignment Problem

The Smith-Waterman algorithm is used for comparing two sequences, typically biological sequences like DNA, RNA, or proteins. It finds the local similarities between the sequences, identifying regions where they match or align.