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 to Only Combine Selected Worksheets into One in Excel?
You've come to the perfect place if you've ever needed to combine only particular worksheets from a large Excel workbook with other worksheets into a single, well-organized worksheet. Excel offers strong capabilities that make it possible for you to automate your data management and analysis operations. It is simpler to analyse and show your data efficiently when you combine a few worksheets to compile pertinent data from several sources and produce a consolidated perspective. You will be guided step-by-step through the process of merging particular worksheets into one during this tutorial. This technique will assist you in maintaining control over ...
Read MoreHow to Only Allow Unique Values in Excel?
Excel is an effective tool for managing and analysing data, and keeping accuracy and preventing duplication can depend on your data only having unique values. Excel has a number of built-in tools and functions that can assist you in limiting entries to unique values only, regardless of whether you're dealing with a tiny dataset or a huge spreadsheet. By using these methods, you can improve data integrity, streamline your workflow, and gain critical time. You'll discover how to avoid duplicate entries in one column or across several columns, enabling you to preserve the accuracy of your data and get rid ...
Read MoreHow to Only Allow Negative Numbers in Excel?
Powerful spreadsheet software like Excel provides a wide range of functions to help you manage and analyse your data. To ensure that positive or zero values are not accepted, you might want to limit the entry of numbers to just negative values in some circumstances. Enforcing this restriction can assist maintain data accuracy and prevent errors, whether you're working on financial modelling, budgeting, or any other scenario where negative numbers are necessary. You will learn how to configure Excel such that only negative numbers can be entered, restricting the entry of any positive or zero values, by carefully following the ...
Read MoreGolang program to implement a weighted interval scheduling algorithm
The Weighted Interval Scheduling Problem revolves around a set of intervals, each having an associated weight. In this article, we will implement the Weighted Interval Scheduling algorithm in go, using two methods: Recursive and Dynamic Programming. This classic optimization problem involves selecting non-overlapping intervals with maximum total weight. Explanation Recursive Method The Recursive Method takes a straightforward yet elegant approach. It examines each interval one by one and considers two scenarios − whether to include the current interval or skip it. This method utilises recursion to explore all possible combinations of intervals, calculating the maximum weight. While ...
Read MoreGolang program to implement a treap
In this article, we will explore the implementation of a Treap data structure in Golang using two different methods. A Treap is a combination of a binary search tree and a binary heap, making it an efficient data structure for maintaining a set of ordered elements while also ensuring balanced priority. The first method will utilise a recursive approach for building and maintaining the Treap, while the second method will implement an iterative approach. The examples below showcase the creation and traversal of a randomised binary search tree, Explanation A Treap is a cool combination of two other structures, a ...
Read MoreGolang program to implement a bitset
A BitSet is a data structure that represents a fixed-size set of binary values, where each value can be either 0 or 1. It is commonly used for efficiently storing and manipulating large sets of boolean values. In this article, we will implement a bitset in go, using two different methods, the first one involves the use of slice of booleans as well as the second one involves using bit manipulation with unsigned integers. Implementation here means that we are going to perform various operations like setting, clearing and testing of individual bits within a bitset data structure. Explanation ...
Read MoreGolang program to implement a double ended priority queue
A Double Ended Priority Queue, in short DEPQ is a data structure that extends the functionality of a standard priority queue. In this article, we will implement a double ended priority queue in Golang using two methods: the first method uses two separate heaps for maximum and minimum priorities, while the second method augments a single heap with additional information for efficient queries. In the code examples we are going to perform the operations like insertion retrieval, deletion and updation. Explanation Double ended priority queue is a data structure that allows insertion and deletion operations and it allows efficient ...
Read MoreGolang program to implement a hash table with linear probing
Hash tables are efficient data structures used to store key-value pairs, making them essential for various applications. Linear probing is a collision resolution technique that helps handle situations when two keys map to the same index in the hash table. In this article, we will explore the implementation of a Hash Table with Linear Probing in Golang, using arrays and maps, gaining insights into their workings and practical applications. In the below examples we are going to perform insertion and retrieval operations using a hash mechanism and collision resolution strategy. Explanation In the below example, keys [10 , 25, ...
Read MoreGolang program to implement a deque using doubly linked list
A deque is a versatile data structure that allows insertion and deletion of elements from both ends efficiently. The doubly linked list provides an excellent foundation for building a deque as it allows easy traversal in both directions. In this article, we will explore deque using doubly linked lists in go with two methods: using a custom doubly linked list and using the built-in container/list package in Golang. Here in the below examples we will showcase the operations of a double ended queue, we will perform the insertion and deletion operations at both the ends. Explanation As you can see ...
Read MoreBit and Byte Organized Memory
In the field of computer, the terms “Bit”, “Byte”, and “Memory” are very commonly used. Memory is defined as a property of a device responsible for storing information. Bit and Bytes are two fundamental measurement units of memory capacity. A bit is used to represent a binary digit, either a 0 or a 1. While the term byte is used to specify a group of 8-bits. In computer systems, digital memory can be organized either in bits or bytes. In this article, we will discuss the various important concepts related to the topic “bit and byte organized memory”. Concept of ...
Read More