Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Articles by Nishu Kumari
Page 5 of 9
C++ Program to convert Decimal Numbers to Octal
In a computer system, the octal number is expressed in the octal numeral system while the decimal number is in the decimal numeral system. The octal number is in base 8 while the decimal number is in base 10. In this article, we will write a C++ program that converts a decimal number into an octal number. Examples of decimal numbers and their corresponding octal numbers are as follows. ...
Read MoreC++ Program to Store and Display Information Using Structure
A structure is a collection of items of different data types. It is very useful in creating complex data structures with different data type records. A structure is defined with the struct keyword. In this article, we will store and display information of an employee using a structure. An example of a structure is as follows: struct employee { int empID; char name[50]; int salary; char department[50]; }; Store Information in Structure and Display It In this program, we store and display employee information using a ...
Read MoreC++ Program to Perform Preorder Recursive Traversal of a Given Binary Tree
In this article, we'll show you how to write a C++ program to perform a preorder recursive traversal of a binary tree. A binary tree is a tree where each node has zero, one, or two children. Even an empty tree is called a valid binary tree. Traversal means visiting all the nodes in a tree exactly once. In preorder traversal, we visit the root first, then the left child, and finally the right child. Let's take a small binary tree and see an example: Here, we start at the root(3), then go to the left child (6), ...
Read MoreC++ Program to Perform Inorder Recursive Traversal of a Given Binary Tree
Tree traversal is a form of graph traversal. It involves checking or printing each node in the tree exactly once. The inorder traversal of a binary tree involves visiting each of the nodes in the tree in the order (Left, Root, Right). An example of Inorder traversal of a binary tree is as follows. Here, we start at the leftmost node(5), move up to 6, then to 2, then to root 3, and continue to the right side with 9 then 4 and 8. Using Recursion for Inorder Traversal Recursion is a technique where a function ...
Read MoreC++ Program to Perform Postorder Recursive Traversal of a Given Binary Tree
A binary tree is a tree data structure where each node has zero, one, or two children. Even an empty tree is called a valid binary tree. Our goal is to write a C++ program to perform postorder recursive traversal on a given binary tree. Traversal means visiting all the nodes in a tree exactly once. In postorder traversal, we visit the left child (left subtree) first, then the right child (right subtree), and finally the root node. Let's take a small binary tree and look at an example. Here, we first ...
Read MoreC++ Program to Find Transpose of a Matrix
A matrix is a rectangular array of numbers arranged in rows and columns. To find the transpose of a matrix, we arrange the rows of the original matrix as columns in a new matrix. Similarly, the columns can also be arranged as rows. An example of the transpose of a matrix is as follows: Finding Transpose of a Matrix To find the transpose of a matrix in C++, we use multidimensional arrays to store matrix values in rows and columns. Then, we swap the rows and columns to get the transpose. Below are the steps we followed: ...
Read MoreC++ Program to Access Elements of an Array Using Pointer
In this article, we'll show you how to write a C++ program to access elements of an array using pointer. A pointer is a variable that holds the memory address of another variable, allowing us to reference it directly. In other words, pointers point to a memory location and obtaining the value stored at that location is called dereferencing the pointer. By using pointers, we can access and work with array elements through their memory addresses. Let's look at a simple example: Input: An array: [10, 20, 30, 40, 50] // We'll use a pointer to access ...
Read MoreC++ program to Reverse a Sentence Using Recursion
In this article, we will write a C++ program to reverse a sentence using recursion. Reversing a sentence means changing the order of all its characters in each word, so the first character moves to the end, the last character comes to the front, and the middle characters follow in the opposite order. Let's understand this with an example: // Example 1 Input: Welcome to tutorialspoint! // After reversing the sentence Output: !tniopslairotut ot emocleW // Example 2 Input: Learning C++ with tutorialspoint is fun // After reversing the sentence Output: nuf si tniopslairotut htiw ++C gninraeL ...
Read MoreC++ Program to Display Armstrong Number Between Two Intervals
In this article, we will understand how to display all the prime numbers from 1 to N in Java. All possible positive numbers from 1 to infinity are called natural numbers. A number is a prime number if its only factors are 1 and itself and cannot be divided by any other number. 11 is a prime number. Its factors are 1 and 11 itself. Some examples of prime numbers are 2, 3, 5, 7, 11, 13, and so on. 2 is the only even prime number. All other prime numbers are odd numbers. Below is a demonstration of the ...
Read MoreC++ Program to Add Two Matrix Using Multi-dimensional Arrays
A matrix is a rectangular array of numbers arranged in rows and columns. To add two matrices, they must be the same size. We add each number in the first matrix to the number in the same position in the second matrix to get a new matrix An example of the addition of two matrices is as follow: Adding Two Matrices Using Multidimensional Arrays To add two matrices in C++, we use multidimensional arrays. These arrays help us store matrix values in rows and columns, just like a real matrix. Then, we add the two matrices stored ...
Read More