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 on Trending Technologies
Technical articles with clear explanations and examples
Check if a linked list is Circular Linked List in C++
Here we will see, hoe to check a linked list is circular linked list or not. To check whether the linked list is circular or not, we will store the header node into some other variable, then traverse the list, if we get null at the next part of any node, then that is not circular, otherwise we will check the next node is same as the stored node or not, if so then that is circular.Example#include using namespace std; class Node{ public: int data; Node *next; }; Node* getNode(int data){ Node *newNode = new ...
Read MoreHow to access the fields of an interface in Java?
An interface in Java is a specification of method prototypes. Whenever you need to guide the programmer or, make a contract specifying how the methods and fields of a type should be you can define an interface. By default, All the members (methods and fields) of an interface are public.All the methods in an interface are public and abstract (except static and default).All the fields of an interface are public, static and, final by default.If you declare/define fields without public or, static or, final or, all the three modifiers. Java compiler places them on your behalf.ExampleIn the following Java program, ...
Read MoreC++ program for length of the longest word in a sentence
Given with the sentence of multiple strings and the task is to find the length of the longest string in the sentence.ExampleInput-: hello I am here Output-: maximum length of a word is: 5 Input-: tutorials point is the best learning platform Output-: maximum length of a word is: 9Approach used in the below program is as follows −Input the string in an array of stringsTraverse the loop till the end of a sentence is not foundTraverse one particular string of a sentence and calculate its length. Store the length in a variablePass the integer values of length of strings ...
Read MoreC++ program for multiplication of array elements
Given with an array of integer elements and the task is to multiply the elements of an array and display it.ExampleInput-: arr[]={1, 2, 3, 4, 5, 6, 7} Output-: 1 x 2 x 3 x 4 x 5 x 6 x 7 = 5040 Input-: arr[]={3, 4, 6, 2, 7, 8, 4} Output-: 3 x 4 x 6 x 2 x 7 x 8 x 4 = 32256Approach used in the below program is as follows −Initialize temporary variable to store the final result with 1Start loop from 0 to n where n is the size of an arrayKeep multiplying ...
Read MoreIs it possible to instantiate Type-parameter in Java?
Generics is a concept in Java where you can enable a class, interface and, method, accept all (reference) types as parameters. In other words it is the concept which enables the users to choose the reference type that a method, constructor of a class accepts, dynamically. By defining a class as generic you are making it type-safe i.e. it can act up on any datatype.Exampleclass Student { T age; Student(T age){ this.age = age; } public void display() { System.out.println("Value of age: "+this.age); } } public class GenericsExample { ...
Read MoreC++ program to check for ISBN
Given with the sequence and the task is to identify whether the given sequence is sa ISBN number or not.What is an ISBN numberISBN stands for International Standard Book Number is a 10 digit number till December 2006 and now it is revised to 13 digit number from 1 January 2007. Given below is the implementation of 10 digits ISBN.ISBN digit has a pattern in it as −Starting 9 digits of a number represents Title, Publisher and Group of the book. The value of first 9 digit can range from 0 - 9Last 1 digit checks whether the ISBN is ...
Read MoreAre Generics applied at compile time or run time?
Generics is a concept in Java where you can enable a class, interface and, method, accept all (reference) types as parameters. In other words it is the concept which enables the users to choose the reference type that a method, constructor of a class accepts, dynamically. By defining a class as generic you are making it type-safe i.e. it can act up on any datatype.Exampleclass Student{ T age; Student(T age){ this.age = age; } public void display() { System.out.println("Value of age: "+this.age); } } public class GenericsExample { ...
Read MoreBFS vs DFS for Binary Tree in C++?
BFS (Breadth First Search) − It is a tree traversal algorithm that is also known as Level Order Tree Traversal. In this traversal we will traverse the tree row by row i.e. 1st row, then 2nd row, and so on.DFS (Depth First Search ) − It is a tree traversal algorithm that traverses the structure to its deepest node. There are three most used methods that are used to traverse the tree using DFS. it goes into depth of each node as the root node and then goes to the next one.Solved for a TreeLet’s find the traversal of a ...
Read MoreCan you create an array of Generics type in Java?
Generics is a concept in Java where you can enable a class, interface and, method, accept all (reference) types as parameters. In other words it is the concept which enables the users to choose the reference type that a method, constructor of a class accepts, dynamically. By defining a class as generic you are making it type-safe i.e. it can act up on any datatype.Exampleclass Student{ T age; Student(T age){ this.age = age; } public void display() { System.out.println("Value of age: "+this.age); } } public class GenericsExample { ...
Read MoreTribonacci Word in C++
The Tribonacci Word is a sequence of digits. This is similar to the Fibonacci Words. Tribonacci Word is constructed by repeated concatenation of three previous stringsT(n) = T(n - 1) + T(n - 2) + T(n - 3)The first few strings to start, are {1, 12, 1213} So the next one will be 1213 + 12 + 1 = 1213121Algorithmtribonacci_word(n): Begin first := 1, second := 12, third := 1213 print first, second, third for i in range 3 to n, do temp := third third := third + second + ...
Read More