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
How do I disable Strict Mode in MySQL?
The handling of missing or incorrect values in queries that change the data is governed by MySQL Strict Mode. This contains the CREATE TABLE, UPDATE, and INSERT statements. When attempting to process the query with MySQL Strict Mode enabled, which is the default setting, invalid or missing data may result in warnings or failures. When Strict Mode is turned off, the identical query would have its missing or incorrect data modified and would result in a straightforward warning. This could appear to be the desired outcome, but with Strict Mode turned off, certain activities might have unanticipated effects. For instance, ...
Read MoreCollecting MySQL Statistics and Metrics
In this article, we are going to learn about collecting Mysql statistics and Metrics. Performance Dashboard View statistics about server performance in a dashboard. Open a query tab, choose the Management tab, and then click Dashboard in the Performance section of the Navigator sidebar to display the dashboard. The informational structure of the Administration - Dashboard tab is depicted in the following image. Performance: Dashboard Network Status This displays data on network traffic that the MySQL server has transmitted and received via client connections. The incoming network traffic, outgoing network traffic, and client connections are examples of data ...
Read MoreWhy can't a Priority Queue wrap around like an ordinary Queue?
Introduction A queue is an abstract Data type that inserts elements from the Rear end and removes them from the Front end. There are three types of queues: Simple Queue, Priority Queue, and Circular Queue. In this tutorial, we understand why we cannot wrap around a Priority queue and the reasons for it. Priority Queue It is a unique queue that is not based on the FIFO principle for Queue operations. What makes it unique? It is the priority of its elements for removing or deQueue. Each element of the priority queue has some priority and they are removed based ...
Read MoreWhat is an in-memory Queue in Data Structures?
Introduction In this tutorial, we will learn about the in-memory queue in the data structure. A queue is a general data structure that inserts and removes elements with some pattern. It uses the First In First Out approach for its processing. An array and linked lists are used to implement a queue. In-Memory Queue A queue can be visualized as a continuous memory (using an array queue) for storing data types. It is stored in secondary memory. In-memory Queue is different from a simple queue only in terms of its storage area. It is stored in the RAM of your ...
Read MoreTurn a Queue into Priority Queue
Introduction A queue is a linear data structure that follows the FIFO principle for inserting and removing elements and has no close ending. It is functional on both ends. In this tutorial, we will learn how to turn a queue into a priority Queue and understand the meaning of queue and priority queue in the data structure. What is Queue? Queue in data structure resembles the queue in real life and is used to handle multiple data. It is an ordered list in which elements are entered on the rear end and removed from the front end. In this, the ...
Read MoreTime and Space Complexity Analysis of Queue operations
Introduction Queue is a linear data structure that uses the FIFO approach for inserting and removing its elements. It can be implemented by using arrays and linked lists. In this tutorial, we will analyze the time and space complexity of array based queue for its different operation. Queue Implementation Using Array The principle of Queue is its FIFO approach and it states that the element that enters first in the Queue will be the first to be removed from it. Its elements are inserted at the Rear end. Queue elements are removed from the Front end. The real-life example of ...
Read MoreShould we declare it as Queue or Priority Queue while using Priority Queue in Java?
Introduction The queue is a linear data structure that follows the FIFO approach to insert and extract its data. A priority Queue is a structured Queue, where all data have some priorities for their processing. In Java, a queue or priority queue is an interface. In this tutorial, we will examine whether we should declare a queue or priority queue as a Priority Queue in Java. Queue A Queue in Java is an interface and that interface belongs to java.util package. The queue interface extends the Collection Interface and this interface has several methods. Queue uses FIFO (First In First ...
Read MoreGolang program to read and print all files from zip file
Golang has packages like os, io, and Archie/zip that can be used to read and print all the files from a zipped file. A zip file is a compressed collection of a set of files/folders. The OS package is used for performing copy operations, the io pacakge is for reading and writing operations whereas the archive/zip package is for unzipping and zipping the file. In this article, we are going to learn about using all these packages to perform the copy and unzipping of the files and printing the same. Method 1: Using io and os package This program uses ...
Read MoreGolang program to get all files present in a directory
Golang has OS package such as OS.open(), os.closs(), os.copy() and move more that are used for performing different operations with the external files. Similiary we have io package in golang that is used for performing read and write operations on the external file. Here in this article, we are going to use these two packages to print all the files in the given directory. Method 1: Using OS Package This program opens the provided directory and reads its contents using the os package. A slice of os.FileInfo objects, which are returned by the Readdir function and include details about each ...
Read MoreDifference between Unit Testing and Sandwich Testing
Unit testing and sandwich testing are two different types of software testing techniques. In Unit testing, the individual units of a software product are tested in isolation from the rest of the application. Sandwich testing, on the other hand, focuses on testing the interactions between multiple units of a software product. Read this article to learn more about unit testing and sandwich testing and how these two testing techniques are different from each other. What is Unit Testing? Unit testing is a type of testing in which a single module is tested at a time. Unit testing checks if the ...
Read More