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
Create a space at the beginning of a UITextField
To create space at the beginning of a UITextField in Swift, you can set the leftView property of the text field to a UIView with the desired width. By default, UITextField does not provide a margin on the left or right side and this is the most common requirement to have space for a better user interface. In this article, you will see an example of how to add a left margin to the text field. In this example, we first create a view controller and then an email address text field. First, we will see the default text field ...
Read MoreHow to submit a form on Enter button using jQuery?
jQuery- a very popular JavaScript library that simplifies the process of HTML document manipulation, event handling, and animation. It consists of a set of functions that are used to traverse, manipulate, and modify HTML elements on the page. It is also cross-browser compatible and works seamlessly with most modern browsers. We always used forms on our websites whether in the form of the login page, contact us section, etc. There we always have to submit the form by clicking the button but how it can be possible to submit a form using the Enter key? Submitting a form is a ...
Read MoreLinked List Allocation
A dynamic memory allocation method used in computer programming is called linked list allocation. In this method, a linked list data structure is used to distribute memory. Memory is divided into a number of blocks of similar size when allocating a linked list. In the linked list, each block is symbolized by a node. A pointer to the following piece of memory is present at each node in the linked list. The final node in the linked list has a null pointer that serves as a marker for the list's conclusion. Linked list data structure and its implementation in memory ...
Read MoreLevels in a File Management System
File management is an important aspect of computer use, especially as we rely more and more on digital storage to keep track of important data. A file management system assists users in organizing and managing their files, making it easier to find, access, and modify data as needed. The system is typically organized into three levels: file level, directory level, and disc level. Each level is critical in file management and necessitates careful attention to ensure that files are organized, accessible, and secure. Effective file management can boost productivity, save time, and lower the likelihood of data loss. In ...
Read MoreLeast Slack Time (LST) scheduling Algorithm in real-time systems
The Least Slack Time (LST) scheduling algorithm is a real-time scheduling algorithm that prioritizes tasks based on the amount of time remaining before a task's deadline. The LST algorithm's basic idea is to schedule the task with the least slack time first because it has the least amount of time before its deadline. Real-time systems are intended to handle tasks or jobs with strict time constraints. These tasks are frequently carried out in a periodic or ad hoc fashion, with each task having a specific deadline by which it must be completed. Real-time scheduling algorithms aid in the completion of ...
Read MoreLamportís Algorithm for Mutual Exclusion in Distributed System
Multiple processes that are running on various machines or nodes and interacting with one another to accomplish a single objective makeup distributed systems. In these systems, it's crucial to make sure that only one process is able to utilize a shared resource at once to prevent conflicts and data inconsistencies. One way to make sure that only one function is using a shared resource at once is through the use of mutual exclusion and Lamport's Algorithm is one of many accessible mutual exclusion algorithms. Lamportís Algorithm A centralized mutual exclusion algorithm called Lamport's Algorithm employs timestamps to determine the sequence ...
Read MoreLamport\'s Bakery Algorithm
A synchronization method called Lamport's Bakery method addresses the critical section issue in parallel computing systems. When more than one process needs to utilize a shared resource at once but only one process can do so, this is known as the critical section problem. To avoid conflicts and guarantee the accuracy of the system, the challenge is to make sure that each process uses the resource in a way that is mutually exclusive. Pseudo code for Lamport's Bakery Algorithm Here the Pseudo code for Lamport’s Bakery Algorithm − Initialize an array, called choosing, of size N, where N is ...
Read MoreKaiOS Operating System
KaiOS is a mobile operating system that is designed to run on low-powered phones and IoT devices. It offers a middle ground between traditional flip phones and full-fledged smartphones, supporting features like 4G LTE, GPS, and Wi-Fi. Originally based on Firefox OS, KaiOS is now web-based and offers users a few extra apps beyond calling and texting, making it a good option for those who want more than a basic phone but don't need all the features of a smartphone. Developing for KaiOS To develop an app for KaiOS, you will need to use web technologies such as HTML, ...
Read MoreGolang program to return the values from the block
In this golang article, we will learn how to return the values from the block using external function, an anonymous function. A block is created using curly braces where the scope of variables remains inside the block and not outside of it. Example 1 In this Example, two values of x and y are added in the code block and z will be assigned the added value. Then, call the function getResult in which another x and y are added and assigned to z in the code block. package main import "fmt" func main() { ...
Read MoreGolang program to convert milliseconds to minutes and seconds
In this golang article, we will write Go language programs to convert milliseconds to minutes and seconds using various methods. Milliseconds are converted to minutes and seconds mathematically using different set of logics. Algorithm Step 1 − Import the required packages in the program Step 2 − Create a main function Step 3 − In the main take milliseconds value and convert it into minutes and seconds using different logics mathematically Step 4 − Then, print the output using Printf function from the fmt package Example 1 In this Example, we will take the milliseconds value. Then, the ...
Read More