Learn Programming in C++ with Free Lessons & Tips

The study is a method in which we gain knowledge which in turn leads to the broadening of our mindset and the significance of it is that we implement this knowledge in our daily life which is called common sense.
The purpose of the study does not only pass the examination and get a degree. Instead, it is to do good for society with acquired knowledge and also to support the development of the country.

The essential tips for smart study are as below:

- Always read the answer of any question by putting in mind "Why."

- Relate the concepts with a real-life example: Suppose I want to understand the concept of network congestion control in the computer network. In a computer network, nobody can see in reality how the data is transferred. We can imagine. But I can relate this concept with traffic on the road. Let passengers are data, and Traffic light signals or traffic policeman are acted as a congestion control mechanism. Similarly, Leaky bucket algorithm is the congestion control mechanism in the computer network. I hope you understand what I want to say.

- Solve last five years sample papers or question bank.

- Study the essential units for examination point of view. Try to choose those units which have numerical

- Go through all topics of the selected group completely, so that you can attempt

- Attempt all answers in the form of points with headings rather than writing whole paragraphs.

- Join online groups for discussion and doubts

Follow the above tips. You will be able to get success. I hope you enjoyed the article as well as follow and share the above tips.

Advantages of C++

- C++ is a profoundly convenient dialect and is frequently the dialect of decision for multi-gadget, multi-stage application advancement.

- C++ is a protest situated programming dialect and incorporates classes, legacy, polymorphism, information deliberation and embodiment.

- C++ has a productive capacity library.

- C++ permits particular case dealing with, and work over-burdening which are impractical in C.

- C++ is a great, productive and quick dialect. It finds an extensive variety of uses – from GUI applications to 3D illustrations for diversions to constant numerical recreations.

This post attempts to collect the few pearls among the dozens of bad C++ books.

Unlike many other programming languages, which are often picked up on the go from tutorials found on the internet, only a few can quickly pick up C++ without studying a well written C++ book. Fact is, C++ is so big and complex, that there are many horrible C++ books out there especially in Indian markets.

In this post, I would like to recommend some books which are a must read to become a C++ professional. Here goes my list

1) C++ Primer by Stanley Lippman, Josee Lajoie. (don't get confused with C++ Primer Plus) Must read for people with no programming experience.

2) A Tour of C++ by Bjarne Stroustrup. For people who are already familiar with C++ or say, experienced programmers in C++

3) Effective C++, Effective Modern C++ & Effective STL by Scott Meyers -- Best practices book, again for people with prior knowledge of C++

Above mentioned books will help anyone to understand and get some level of expertise in C++ with the right basics. Soon I will post a list of books for advanced programmers.

Hope this will end the search for good books on C++.

Q. Swap two numbers using the following function. Complete the function. You won't be allowed to use a temporary variable to swap the two numbers.

void swap ( ... )

{

  /* Swap code goes here */

}

int main ()

{

  int a[2] = {2,3};

  /* print the array so that a[0] is 3 and a[1] is 2 */

  /* swap function call and print code goes here */

}

Depth First Traversals:
(a) Inorder (Left, Root, Right) : 4 2 5 1 3
(b) Preorder (Root, Left, Right) : 1 2 4 5 3
(c) Postorder (Left, Right, Root) : 4 5 2 3 1

Trees are one of the data structures like Stacks, Queue, Link List but unlike them its efficient in searching and storing data.

trees can be traversed in different ways

Inorder Traversal:

Algorithm Inorder(tree)   1. Traverse the left subtree, i.e., call Inorder(left-subtree)   2. Visit the root.   3. Traverse the right subtree, i.e., call Inorder(right-subtree)

Uses of Inorder
In case of binary search trees (BST), Inorder traversal gives nodes in non-decreasing order. To get nodes of BST in non-increasing order, a variation of Inorder traversal where Inorder itraversal s reversed, can be used.
Example: Inorder traversal for the above given figure is 4 2 5 1 3.

Preorder Traversal:

Algorithm Preorder(tree)   1. Visit the root.   2. Traverse the left subtree, i.e., call Preorder(left-subtree)   3. Traverse the right subtree, i.e., call Preorder(right-subtree) 

Uses of Preorder
Preorder traversal is used to create a copy of the tree. Preorder traversal is also used to get prefix expression on of an expression tree.
Example: Preorder traversal for the above given figure is 1 2 4 5 3.

Practice Preorder Traversal

Postorder Traversal:

Algorithm Postorder(tree)   1. Traverse the left subtree, i.e., call Postorder(left-subtree)   2. Traverse the right subtree, i.e., call Postorder(right-subtree)   3. Visit the root.

Uses of Postorder
Postorder traversal is used to delete the tree. 

I hope you find these notes helpful.

Q 1. Explain the terms:

1. Procedure Oriented Programming
2. Object Oriented Programming

Ans. Procedure Oriented Programming: In Procedure Oriented Programming:

1. Programs are divided into procedures/ functions.
2. It is procedure centric.
3. Supports modular programming.
4. POP employs top-down style of programming.
5. When program size increase then difficult to manage the program’s complexity.
6. Data can flow freely among the different functions.
7. Refer figure 1.1 in your book.

More about POP:

Procedural programming is a programming paradigm, derived fromstructured programming, based upon the concept of the procedure call. Procedures, also known as routines, subroutines, or functions (not to be confused with mathematical functions, but similar to those used in functional programming), simply contain a series of computational steps to be carried out. Any given procedure might be called at any point during a program's execution, including by other procedures or itself. Procedural programming languages include C, Go, Fortran, Pascal, and BASIC.

Computer processors provide hardware support for procedural programming through a stack register and instructions for calling procedures and returning from them. Hardware support for other types of programming is possible, but no attempt was commercially successful (for example Lisp machines or Java processors).

Object Oriented Programming: In Object Oriented Programming:

1. Programs are divided into number of classes and objects.
2. It is data centric.
3. Supports Encapsulation, Polymorphism, Abstraction, Inheritance, Class, Objects and Message passing.
4. OOP employs bottom-up style of programming.
5. Easily maintain the complexity of program size.
6. Data is more secure and closely tied with functions so it can’t move freely among the functions.
7. Refer figure 1.2 in your book.

More about OOP: -

1. It implements real life scenario.
2. In OOP, programmer not only defines data types but also deals with operations applied for data structures.
3. Much suitable for large projects.
4. OOP provides a clear modular structure for programs.
5. Implementation details are hidden from other modules and other modules has a clearly defined interface.
6. It is easy to maintain and modify existing code as new objects can be created with small differences to existing ones.
7. More reliable software development is possible.

Object-oriented programming (OOP) is a programming paradigm based on the concept of "objects", which may contain data, in the form of fields, often known as attributes; and code, in the form of procedures, often known asmethods. A feature of objects is that an object's procedures can access and often modify the data fields of the object with which they are associated (objects have a notion of "this" or "self"). In OOP, computer programs are designed by making them out of objects that interact with one another. There is significant diversity of OOP languages, but the most popular ones areclass-based, meaning that objects are instances of classes, which typically also determine their type.

Significant object-oriented languages include Java, C++, C#, Python, PHP, Ruby, Perl, Delphi, Objective-C, Swift, Common Lisp, and Smalltalk.

Short Answer Questions For Chapter-3 Computer Science Class-XI-CBSE

1. What is Microprocessor and its use?

Ans: A microprocessor is a semiconductor chip and used to processes all the information in the computer with help of memory. Microprocessor is manufactured using the Large Scale integration (LSI) or Very Large Scale Integration (VLSI), which includes Arithmetic Logic Unit (ALU), Control Unit (CU) and Central Processing Unit (CPU) on a single chip.

2. When and who has invented the computer memory?

Ans: The concept of memory was recognized by Burks, Goldstine, and Von Neumann in 1946.

3. What is register and what is the relationship with flip-flops?

Ans: A register is a very small amount of very fast memory that is built into the CPU. The flip-flops are the smallest unit of hardware to store binary information. Several flip-flops put together to form a register.

4. What is Bus? And what are the types?

Ans: A Bus is used to transmit the data. It carries the data from one part of computer to another.  There are three types of buses.

• Data Bus,
• Address Bus and
• Control Bus.

5. What is the role of different type of buses?

Ans:

• Data Bus used to carry the data from one location to another.
• Address Bus used to carry the address of the location.
• Control Bus carries the mode i.e. read or write.

6. What do you mean by Microprocessor bit structure/

Ans: Microprocessor bit structure indicates the width of the registers. A 16-bit microprocessor can process data and memory addresses that are represented by 16 bits.

7. What are the types of memory?

Ans: Computer Memory is basically two types:

• Primary memory and
• Secondary memory.

8. What is Primary Memory?

Ans: Primary Memory is internal memory of the computer. RAM and ROM both form part of primary memory. The primary memory provides main working space to the computer.

9. What do you mean by RAM and ROM?

Ans:

• RAM stands for Random Access Memory, is volatile memory, which loses their content on the failure of power supply.
• ROM stands for Read Only Memory, is non-volatile memory, which does not lose their content on the failure of power supply.

10. What is Secondary memory?

Ans: Secondary memory is external and permanent memory and concerned with magnetic memory. It can be stored on storage media like floppy disks, magnetic disks, magnetic tapes, etc.

Before we start with pointers you must know what is a variable and a datatype.

int a;

This is the basic line in every program in 'C' . It means that we are asking the compiler to give us 2 bytes of space in memory and label that space as 'a'.

Now every block of memory has an address(the variable names are only to make our work easy. imagine remembering xx000345= x230989+xx0044563 instead of C= A+ B;)

This addresses can also be stored in variable and that variable is aclled pointer.

so pointers are variable storing the address of another variable.

int* b; means that "b" is going to store the address of a variable whose datatype is "int".

b=&a; // now b points to a;

Have you ever thought why do we need a datatype for a pointer even though it doesn't store a value.??

The Data type is needed when dereferencing the pointer so it knows how much data it should read. For example dereferencing a chart pointer should read the next byte from the adress it is pointing to while an int pointer should read 2 bytes.

Now what do we mean by dereferncing?

Dereferencing a pointer means getting the value that is stored in the memory location pointed by the pointer. The operator * is used to do this, and is called the dereferencing operator.

There is a lot to be discussed in pointers. like pointer to pointer, pointer arithmetic, pointer to function, object, structure array, constant pointer etc.

 We shall do that in series to follow.