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.
Read More
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.
Read More
The goal of these columns is to explore object-orientation through practical object-oriented programming. This time, we look at C++, but in the future we will explore other areas of object-orientation. Learning an object-oriented language-a whole new way of programming-will pave the way for many exciting topics down the road.
Read More
Google Code University website provides tutorials and sample course content so CS students and...
Read More
A binary tree is made of nodes, where each node contains a “left” pointer, a...
Read More
This tutorial covers many topics in VGA programming in the C programming language. Tutorial assumes that the programmers have a comprehensive understanding of C and should also have a familiarity with DOS and BIOS function calls and interrupts. Knowledge of trigonometry and geometry would also be helpful.
Read More
The basic aim of mycplus.com website was to develop a website for students of C/C++ and data structures. There are lots of tutorials and source code covering different aspects of C/C++ programming language. Today I have decided to write few articles about data structures and their implementation in C/C++.
Read More
