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
Articles by Sunidhi Bansal
Page 70 of 81
list operator = in C++ STL
Given is the task to show the functionality list operator = function in C++ in STL.What is List in STL?List are containers that allow constant time insertion and deletion anywhere in sequence. List are implemented as doubly linked lists. List allow non-contiguous memory allocation. List perform better insertion extraction and moving of element in any position in container than array, vector and deque. In List the direct access to the element is slow and list is similar to forward_list, but forward list objects are single linked lists and they can only be iterated forwards.What is use of operator = ?This ...
Read MoreRatio_less () function in C++
Given is the task to show the working of ratio_less () function in C++.The function ratio_less() checks if the value of ratio1 is less than ratio2. It returns a Boolean constant “value” which returns true if ratio1 is less than ratio2 else returns false.ExampleInput: 1/3 and 3/9 Output: 1/3 is less than 3/9. Input: 1/4 and 1/8 Output: 1/4 is not less than 1/8.SyntaxTemplate ratio_lessParametersThis function accepts two template parameters one is ratio1 and another one is ratio2 which are to be compared.ExplanationIn this function, if the value of ratio1 is less than the value of ratio2 then this ...
Read Morehypot( ), hypotf( ), hypotl( ) in C++
In this article we will be discussing the working, syntax and examples of hypot( ), hypotf( ), hypotl( ) function in C++.hypot( ) functionThis function is used to compute the hypotenuse of a right angled triangle. This function returns the square root of sum of square of two variables. It is a function of header file.What is hypotenuse?Hypotenuse is the longest side of the right angle triangle. Below is the graphical representation of a hypotenuse in a right angle triangle.In above figure AC side of the triangle is a hypotenuse.The formula to calculate hypotenuse is −$$H = \sqrt{x^2+Y^2}$$SyntaxData type ...
Read Morelist begin( ) and list end( ) in C++ STL
Given is the task to show the functionality list begin( ) and list end( ) function in C++ in STL.What is List in STLList is a data structure that allows constant time insertion and deletion anywhere in sequence. Lists are implemented as doubly linked lists. Lists allow non-contiguous memory allocation. List perform better insertion extraction and moving of element in any position in container than array, vector and deque. In List the direct access to the element is slow and list is similar to forward_list, but forward list objects are single linked lists and they can only be iterated forwards.What ...
Read MoreElements present in first array and not in second using STL in C++
We have two arrays, the task is to compare the two arrays and find the numbers present in first array but not in the second array, using Standard Template Library (STL) in C++.ExampleInput: array1[ ] = {1, 2, 3, 4, 5, 7} array2[ ] = {2, 3, 4, 5, 6, 8} Output: 1, 7 Input: array1[ ] = {1, 20, 33, 45, 67} array2[ ] = {1, 12, 13, 114, 15, 13} Output: 20, 33, 45, 67Approach used in the below program is as follows −In this program we want to find the elements which are present in the first ...
Read MoreProcess Synchronization in C/C++
Process synchronization is the technique to overcome the problem of concurrent access to shared data which can result in data inconsistency. A cooperating process is the one which can affect or be affected by other process which will lead to inconsistency in processes data therefore Process synchronization is required for consistency of data.The Critical-Section ProblemEvery process has a reserved segment of code which is known as Critical Section. In this section, process can change common variables, update tables, write files, etc. The key point to note about critical section is that when one process is executing in its critical section, ...
Read MorePrinting source of a C program itself
Given the task is to print the written C program itself.We have to write a C program which will print itself. So, we can use file system in C to print the contents of the file of which we are writing the code, like we are writing the code in “code 1.c” file, so we open the file in the read mode and read all the contents of the file and print the results on the output screen.But, before opening a file in read mode, we must know the name of the file we are writing code in. So, we ...
Read MoreProduct of non-repeating (distinct) elements in an Array in C++
We are given with an array of repeating or duplicate elements and the task is to find the product of all those elements which are non-repeating or distinct in the given array and display the results.ExampleInput-: arr[] = {2, 1, 1, 2, 3, 4, 5, 5 } Output-: 120 Explanation-: Since 1, 2 and 5 are repeating more than once so we will take them into consideration for their first occurrence. So result will be 1 * 2 * 3 * 4 * 5 = 120 Input-: arr[] = {1, 10, 9, 4, 2, 10, 10, 45, 4 } ...
Read MoreProgram for Mobius Function in C++
Given a number n; the task is to find the Mobius function of the number n.What is Mobius Function?A Mobius function is number theory function which is defined by$$\mu(n)\equiv\begin{cases}0\1\(-1)^{k}\end{cases}$$n= 0 If n has one or more than one repeated factorsn= 1 If n=1n= (-1)k If n is product of k distinct prime numbersExampleInput: N = 17 Output: -1 Explanation: Prime factors: 17, k = 1, (-1)^k 🠠(-1)^1 = -1 Input: N = 6 Output: 1 Explanation: prime factors: 2 and 3, k = 2 (-1)^k 🠠(-1)^2 = 1 Input: N = 25 Output: 0 Explanation: Prime factor is ...
Read MoreC Program for Hexagonal Pattern
We are given with an integer ‘n’ and the task is to generate the hexagonal pattern and display the final output.ExampleInput-: n=5 Output-:Input-: n = 4 Output-:Approach we are using in the given program is as follows −Input the number ‘n’ from userDivide the entire pattern into three parts i.e. upper part, middle part and lower part Start loop i for printing the upper part of the pattern from i to 0 and i to be less than n and keep incrementing the value of i Start loop m for printing the middle part of the pattern from m to ...
Read More