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
Programming Articles
Page 224 of 2544
Profile Application using Python Flask and MySQL
Flask is one of the web frameworks which provide libraries to build light weight web applications in python. It is a micro framework, developed by Armin Ronacher who runs an international group of python enthusiasts (POCCO). Flask works on WSGI toolkit and jinja2 template engines. For creating the profile application using python flask and MySQL we have to follow the below mentioned steps one by one. Step − 1 Install the virtual environment by executing the below mentioned command in the command prompt. pip install virtualenv Once the virtual environment is created we can create the new virtual environment into ...
Read MoreDifference Between InputStream and OutputStream in Java
InputStream and OutputStream both are the abstraction process which can be implemented to access the low level data sets as pointers . They are the signified APIs to specify a particular data sequence of an operation by following some individual steps. The InputStream rearranges a data set as an ordered stream of bytes which actually reads the data from a file or received by using a network system. After ending the stream process it will return -1 as an integer value as Java does not contain any unsigned byte as data type. An OutputStream is a streamed process which mainly ...
Read MoreDifference between Inheritance and Interface in Java
Inheritance is a Method to create a hierarchy between multiple classes by replicating some properties from others. There are various types of inheritance present in Java, such as single inheritance, multiple inheritance, multilevel inheritance, hybrid inheritance, and hierarchical inheritance. Interface is the blueprint of a particular class which consists of the constant and abstract class. The interface class allows a machine to apply some specific properties on an object or a class. It is totally an abstract method which helps to perform the Java abstraction on a collection by specifying the behavior of a class. Now the task ...
Read MoreHow to Iterate LinkedList in Java?
The LinkedHashMap Class is similar to HashMap. But it has an additional feature in comparison to HashMap. The LinkedList class belongs to the java.util package. A doubly linked list is how LinkedList stores its elements. Given that our operations typically include insertion and deletion, LinkedList is the best option. The java.util package contains the LinkedList collection framework. It acts as an implementation of the non-contiguous LinkedList data structure, which saves elements in memory. Methods Used There are five main methods that you can use for iterating HashMap − Using the for loop Making use of a while loop Using ...
Read MorePriority Queue using Queue and Heapdict module in Python
The priority Queue is the abstract data type which is similar to the queue or stack, in which each element is attached with a priority. Here the priority determines the order of the elements to be dequeued from the queue and the higher priority elements are dequeued before the elements with the lower priority. The priority queues will be implemented using different data structures such as heaps, arrays or balanced trees. The most commonly used implementation is the heap, which is the binary tree based data structure having the value of each node greater than or equal to the values ...
Read MoreHow to Iterate the Vector Elements in the Reverse Order in Java?
The Vector class has been a part of the Java collection system since Java version 1.2. Vectors are sometimes known as Dynamic Arrays because, unlike ordinary arrays, they can expand and contract in size. Ensuring thread-safety, Vectors are synchronized. While there exists a third approach that involves using Apache Commons to iterate through the vector in reverse, this method necessitates the downloading of additional jar files and packages, which is not widely supported by most systems. Essentially, there are only two primary methods to traverse through vector elements in reverse order. Methods Used There are two methods used here − ...
Read MoreHow to iterate over a 2D list (list of lists) in Java?
A data structure known as a 2D list or list of lists can be utilised for saving a collection of data in a two-dimensional format. A row in the 2D list is represented by each inner list in this list of lists. A 2D list could be utilised, for instance, to store the data for a chessboard, where every component in the list corresponds to a single square on the board. Methods Used A 2D list can be iterated in one of the two methods that follow − Using Loops Using iterator Method 1: Employing Loops There are ...
Read MoreHow to Iterate LinkedHashMap in Reverse Order in Java?
The LinkedHashMap serves the purpose of maintaining the precise order of element addition. It elucidates the method for accessing elements in the sequence they were inserted. In addition to storing values based on their keys, the LinkedHashMap class expands upon the functionalities of the Hash Map class and implements the Map interface. It exclusively accommodates unique elements or mappings. It affords us the flexibility to utilize various data types, such as text, float, integer, etc., for assigning keys and values. By initially reversing the elements, we can alter the order of elements in the linked hash map. Subsequently, we can ...
Read MoreGolang program to implement a Trie data structure
A trie is a data structure like tree that is used to store and search a dynamic set of strings. It is useful while working with the data where keys share common prefix like dictionary words. Trie is different from the other retrieval data structures owing to its efficient string manipulation and retrieval properties. In this article we will learn to implement Trie data structure in Go programming language. Explanation The Trie, also known as a retrieval tree is a type of tree data structure that is commonly used for storing and managing collections of strings. It offers access, to ...
Read MoreGo Language Program to Implement Floyd\'s Triangle
Floyd's Triangle is a right-angled triangular pattern of numbers, named after the renowned American computer scientist Robert W. Floyd. Using sequences of natural integers starting at 1 and increasing by 1 in each row, we build this triangle. In this article, we are going to implement Floyd's Triangle in go, implementation here means we are going to create floyd's triangle and then print it. Explanation Floyd's Triangle, much like Pascal's Triangle, is a triangular arrangement of the natural numbers with a right angle. There is progression of numbers from left to right across the table, starting at 1 in each ...
Read More