Structures - C++ tutorial

Category: C++ tutorials > Programming - Difficulty:

Sequential lists are collection of objects that can be entered or extracted in a sequential way. They don’t provide access to objects in the middle on the list. You can only access a specific object each time you extract it. The two classes named “Queue” and ”Stack” which belong to the “System.Collections” namespace provide you with this kind of functionality, each of them in a slightly different way. The Queue class offers you access to the first object on the list, whereas the Stack class offers you access to the last object on the list. By first and last we mean the first and last object that entered the list. So, the Queue class is a First-in, First-out collection(FIFO Collection) whereas the Stack class is a Last-in, First-out(LIFO Collection). In this tutorial you will create and use both classes to see how they behave when entering and extracting data. You will usually work with such collections with temporary and disposable data. For a more permanent use, arrays provide much better functionality.

This tutorial starts from the very beginning, and goes to the more complicated areas of the C/C++ programming. A nice tutorial, if you are beginner, and want to get good C/C++ knowledge to continue to the more advanced levels.

Designed for beginners in C++, this tutorial presents several examples showing you how to cout/cin, work with arrays, and display data.

This lesson, as can be presumed from its title, will teach you what is ASCII code, how does it affect programmer’s variables and what is the difference between number and numerical figure. This one's easy... Hope you still haven't pulled back; just when I hit you in the face with hardcore code in next few lessons, don't say I caught you off guard :) Developing your own program, even as simple as calculator can give you nice, productive feeling.

It is possible to define more than one constructor function in a class. This is known as constructor overloading.