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
Programming Articles
Page 1744 of 2547
Java JSON Processing (JSON-P) with Example
Introduction Java programs can operate with JSON data due to the strong Java JSON Processing (JSON-P) API. Web servers and clients frequently exchange data using the lightweight JSON data transfer standard. JSON-P offers the Object Model API and the Streaming API as its two primary methods for processing JSON data. Let us talk about these two strategies and use examples to show how they work and what they can do. We hope that our readers will learn about the Object Model API and Streaming API, together with Programming examples, by understanding this article's explanations on Java JSON Processing (JSON-P) with ...
Read MoreWhat\'s the best RESTful web framework to use with Java
Introduction Let us talk about what’s the best Java RESTful web framework to use with Java language. We know there are a lot of frameworks available but the “Spring Boot” is the best choice among other Java frameworks. Here we will talk about the usage of the RestTemplate and integration of various data formats including JSON, XML, and HTML using the Spring Boot framework. We will also discuss various approaches to handling HTTP requests. We will learn why Spring Boot is the ideal framework for creating RESTful web services in Java by understanding this article. Support of HTTP in ...
Read MoreDoes it make sense to choose JavaScript instead of Java for server-side programming and why
Introduction We know that over a period of time JavaScript has gained popularity for its versatility and it’s easy to use. Java remains a top choice for server-side programming due to its reliability, scalability, and large ecosystem. Let us discuss about why choosing Java as a server-side programming language over JavaScript is a better choice. We will talk about different approaches to explain the strengths of Java. Firstly, we will discuss the stability and robustness of Java by using Spring boot. Then we will explain the scalability and performance of Java. At last, we will explain the advantage of server-side ...
Read MoreIs Java dying at the hands of Oracle What future is there for Java?
Introduction Java is a widely used programming language since 1995 and Java has played a very important role in software development. Although there are many issues regarding its future due to events involving Oracle. Let us discuss these concerns and explore different viewpoints surrounding future of Java. We will explain whether Java is dying at the hands Oracle's influence or if it has the potential for a promising future. In this article at first, we will discuss about the challenges faced due by Oracle and the simplicity of coding in Java language. After that we will also discuss Java's ...
Read MoreC++ Program to append an element into an array
An array is a linear sequential data structure to hold homogeneous data in consecutive memory locations. Like other data structures, an array also must-have features to insert, delete, traverse and update elements in some efficient way. In C++, our arrays are static. There are a few dynamic array structures also available in C++. For a static array, there may be a Z number of elements that can be stored inside that array. And till now we have n elements into it. In this article, we will see how to insert an element at the end of an array (which is ...
Read MoreWhat are different types of Tries?
Introduction In this tutorial, we will understand different types of tries and their uses. Tries are tree-like data structures that are mostly used for operations like string searching. There are various types of trie and they are used as per the task requirement. Generally, trie tries are of three types: Standard trie, compressed trie, and suffix trie. We elaborate on the meaning of each type of trie. What is Trie A trie is a sorted binary tree also called a digital tree or a prefix tree. It has nodes that are used to store data or alphabets. Each node can ...
Read MoreHow to sort the string based on the number of matchsticks for representation?
Introduction In this tutorial, we implement an approach to sort a string on the basis of the number of matchsticks required for its representation. In this approach, we use N numbers of matchsticks and sort an array. The array can contain numbers, words, or both. Matchsticks are used to arrange them in the shape of a particular number or character. Demonstration 1 Input = Arr = ["1", "3", "4"] Output = The sorted array is 1 4 3 Explanation In the above input array, the array elements are 1, 3, and 4 Number of matchsticks required for ...
Read MoreHow to alphabetically sort an array while converting numbers into words?
Introduction This tutorial deals with the problem of sorting an array alphabetically while each number is converted into words. To translate numbers into words means changing numbers to their number names. Like, 65 is sixty-five. Here, we consider a numerical array, convert all array elements to words and arrange them alphabetically. Print the sorted array elements after converting words to their respective numbers. Demonstration 1 Input = Arr = {13, 1, 6, 7} Output = 1 7 6 13 Explanation The input array elements are 13, 1, 6, 7 The output with alphabetically sorted elements is 1 7 ...
Read MoreRange Update Queries to XOR with 1 in a Binary Array
Introduction In this tutorial, we find an approach to find the range update Queries to XOR with 1 in a binary array. To implement the approach we use a binary array which is an array consisting of 0 and 1. The range update queries are the queries which are used to modify the binary array within the given upper and lower limit of a range. The upper and lower limits are the index of binary array elements. The elements lying in that range are updated with defined operations. XOR is one of the bitwise operations standing for exclusive OR. Its ...
Read MoreQueries to search an element in an array and move it to front after every query
Introduction In this tutorial, the task is to use queries to search for an element in an array. It is to push to the front after every query in C++. To implement this task, it takes an array A with elements from 1 to 5 and a query array Q for finding the element in A and moving it to the front of the array. The output is the index number of the searched elements. We use two methods for moving array elements to the front as per the query array. Naive Approach − Iterate through the array of ...
Read More