Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
The foundation of database systems is a broad vocabulary that facilitates communication about the numerous facets of data storage, administration, and retrieval. In order to further your comprehension, we will go through the important terms used in database systems in this article, along with comprehensive explanations and applicable examples. Entity − An entity is a specific real-world thing or idea that we wish to represent and keep data about. For instance, students, professors, courses, and departments might all be considered entities in a university database Attribute − An attribute is a representation of a particular quality or trait of ... Read More
In this problem, we will count the number of elements removed from the array before they are inserted in the array. The logical part for solving the problem is that check for all numbers that its position in the remove[] array before its position in the insert[] array. If yes, we can count that particular element of the remove[] array in the answer. However, we will use the map data structure to improve the performance of the code. Problem statement − We have given an insert[] and remove[] arrays containing first N integers. The insert[] array represents the order of ... Read More
In this problem, we will find the largest multiple of 3 using the array elements. The naïve approach is that generate all possible combinations of array elements and check whether it is divisible by 3. In this way, keep track of the maximum possible multiple of 3. The efficient approach is using three queues. We can use queues to store elements based on the remainder after dividing it into 3. After that, we can remove some elements from the queue to make a multiple of 3 from the remaining array elements. Problem statement − We have given an array ... Read More
Modern information management rely heavily on database systems because they make it possible to store, retrieve, and manipulate massive volumes of data effectively. Designing reliable and scalable databases requires a thorough understanding of the principles and architecture of database systems. The essential ideas and complexities of database systems will be covered in detail in this article, along with examples from everyday life to show how they might be used in real-world situations. Concepts of Database Systems Data − Data is the central component of every database system. The information that has to be handled and saved is represented by ... Read More
In this problem, we will find the K nearest point from the origin in the 2D plane from the given N points. We can use the standard Euclidean distance formula to calculate the distance between the origin and each given point. After that, we can store the points with distance in the array, sort the array according to the distance, and take the first K points. However, we can also use the priority queue to store the 2D points according to their distance from the origin. After that, we can deque the queue for K times. Problem statement − ... Read More
In this problem, we will convert the number N to M by adding the one prime factor of N to itself and updating it in each operation. We will use the breadth−first search algorithm to solve the problem. We will find the prime factor of each updated N and insert it into the queue after adding it to the prime factor of N. Also, we will define functions to find the smallest prime factor of a particular number. Problem statement − We have given N and M integer values. We need to count the minimum number of operations required to ... Read More
Stored Procedures are essential to database management systems (DBMS) because they boost security, increase performance, and encourage code reuse. A group of SQL statements are included within pre-compiled database objects known as stored procedures. They can be called by apps or other database objects and are saved in the database. In this post, we will go into the details of SQL Persistent Stored Modules (PSM), a procedural programming language extension for SQL, and examine the idea of stored procedures. Understanding Stored Procedures Stored Procedures are database objects that have already been pre-compiled and include a collection of SQL statements. They ... Read More
In this problem, we will convert the linked list to the complete binary tree. We can assume the linked list as an array. The pth element of the linked list is the parent node of the binary tree's 2*p + 1 and 2*p + 2 elements. So, we can traverse through each element of the linked list and construct the binary tree. Problem statement − We have given a linked list containing N nodes. We need to construct the complete binary tree from the given linked list. Also, print the in−order traversal of the binary tree. Note − In the ... Read More
We can disable a jQuery UI draggable widget with the help of its draggable disabled option. jQuery is a javascript library that helps us manipulate the DOM easily and efficiently using its various helper methods and properties. It allows us to add interactivity to the DOM as well as add and change the CSS styles of the DOM elements. Syntax $(element).draggable({ disabled: true }) We will be using the following jQuery link in our application − The above-provided code snippet is a link tag that imports the CSS file from the jQuery UI library. Example ... Read More
In this problem, we will check whether we can get the permutation of 1 to N elements given array using the BFS (Breadth−first search) traversal with the given binary tree. Here, we will traverse the tree and find all possible permutations using the BFS traversal. After that, we can check whether any BFS traversal result matches the array permutation. Problem statement − We have given an array of size containing the first N positive integers in random order. Also, we have given a tree containing the first N numbers as a tree node. We need to check whether we ... Read More