The C++ Modulus Operator [mod or % operator]
The C++ language provides a built-in mechanism, the modulus operator (mod or %), that computes the remainder that results from performing integer division.
C Programming
Find the middle element of linked list in C
In order to find middle element of linked list in one pass, you need to maintain two pointers, one increment at each node while other increments after two nodes at a time. By having this arrangement, when first pointer reaches end, second pointer will point to middle element of linked list.
Why Learn C as first programming language?
There are hundreds of programming languages used in the professional industry and university/college academics. One needs to be familiar and able to program with at least few programming languages to be successful.
Free Programming Abstractions Course – SEE
Stanford Engineering Everywhere (SEE) offers few computer science courses to students online and at no charge. Programming Abstractions course covers advanced programming topics such as recursion, algorithmic analysis, and data abstraction using the C++ programming language, which is similar to both C and Java.
C Implementation of Base64 Encoding and Decoding
Base64 encoding and decoding schemes are commonly used to encode binary data. Normally this is required when textual data needs to be transferred over the network or similar media and make sure that data is transferred without any modification. Base64 is commonly used in a number of applications, including email via MIME, and storing complex data in XML. This is a very simple implementation of base64 encoding and decoding in C programming language. There are number of C libraries available for encoding and decoding as well i.e. libb64, OpenSSL Base64, Apple’s Implementations, arduino-base64 etc.
Kruskal’s Algorithm
This is the implementation of Kruskal’s Algorithm in C and C++ Programming Languages. This algorithm is directly based on the generic MST (Minimum Spanning Tree) algorithm. Kruskal’s algorithm is a greedy algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. It finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized.
Porter’s Algorithm in C
Originally written in 1979 at Computer Laboratory, Cambridge (England), it was reprinted in 1997 in the book “Readings in Information Retrieval”. Initially it was written in BCPL language. Here is the list of implementations in other programming languages including C, Java and Pearl implementations done by author himself.
Introduction to C++ – Lecture Notes
This post contains lecture notes of “Introduction to C++” course which is taught at MIT OpenCourseWare. OCW is a free and open publication of material from thousands of MIT courses, covering the entire MIT curriculum. There’s no signup, no enrollment, and no start or end dates.
Microsoft C++ REST SDK
Microsoft C++ REST SDK version 1.0 codename Casablanca is open source project hosted at GitHub, and takes advantage of the
Add time using structures in C++
This is a C++ implementation of adding time using structures. A structure is a convenient tool for handling a group of logically related data items. Structure help to organize complex data is a more meaningful way. It is powerful concept that we may after need to use in our program Design.
Test Driven Development for Embedded C
TDD is a modern programming practice C developers need to know. It’s a different way to program—unit tests are written in a tight feedback loop with the production code, assuring your code does what you think. You get valuable feedback every few minutes. You find mistakes before they become bugs. You get early warning of design problems. You get immediate notification of side effect defects. You get to spend more time adding valuable features to your product.
Cracking the Coding Interview: 150 Programming Interview Questions and Solutions
The book “Cracking the Coding Interview” is a comprehensive guidebook designed to help individuals prepare for technical interviews at top-tier technology companies such as Google, Microsoft, and Facebook. The book covers a wide range of topics, including data structures, algorithms, system design, and more.