Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
AmitDiwan has Published 9818 Articles
AmitDiwan
2K+ Views
The determinant of a matrix can be calculated only for a square matrix by multiplying the first row cofactor by the determinant of the corresponding cofactor and adding them with alternate signs to get the final result.$$A = \begin{bmatrix}a & b & c\d & e &f \g & h &i ... Read More
AmitDiwan
1K+ Views
A number whose sum of its digits powered with its respective position equals to the number itself is called a disarium number.The noOfDigits(int num) function takes the number and return the number of digits by constantly dividing the number by 10 while there is only ones place left. On each ... Read More
AmitDiwan
159 Views
Let us first define the struct that would represent a tree node that contains the int key and its left and right node child. If this is the first node to be created then it’s a root node otherwise a child node.struct Node { int data; struct Node ... Read More
AmitDiwan
324 Views
Let us first define the struct that would represent a tree node that contains a character key and a vector of Node *.struct Node{ char key; vector children; };Next we create our createNode(int key) function that takes an int key value and assign it to the key member ... Read More
AmitDiwan
214 Views
The density of a binary tree is calculated by dividing its size by its height.Binary tree density = size/height.Let us first define the struct that would represent a tree node that contains the data and its left and right node child. If this is the first node to be created ... Read More
AmitDiwan
382 Views
The deletion is to be performed by replacing the deleted mode by bottom and rightmost node.Let us first define the struct that would represent a tree node that contains the data and its left and right node child. If this is the first node to be created then it’s a ... Read More
AmitDiwan
195 Views
To find the length of the diagonal we put the value of side in 2*side*sin (900/14). The value of sin (900/14) = 0.9.ExampleLet us see the following implementation to get the regular Heptagon diagonal from its side − Live Demo#include using namespace std; int main(){ float side = 12; ... Read More
AmitDiwan
257 Views
Demlo numbers are palindromic numbers that are generated by the square of number of form 11..1 given that the number is less than 10 digits.Let us first declare the string variables −string demNum = "1111"; string square = "";Now, we loop till the length of the demNum string. Inside the ... Read More
AmitDiwan
224 Views
Let us first define our binary tree using a class containing int data, btree_node * rightChild, btree_node * leftChild. The leftChild and rightChild are pointers to btree_node. All the members in our class are public.class btree_node { public: int data; btree_node* leftChild; ... Read More