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
What are Instruction Codes and Operands in Computer Architecture?
A computer instruction is a binary code that determines the micro-operations in a sequence for a computer. They are saved in the memory along with the information. Each computer has its specific group of instructions.They can be categorized into two elements as Operation codes (Opcodes) and Address. Opcodes specify the operation for specific instructions. An address determines the registers or the areas that can be used for that operation. Operands are definite elements of computer instruction that show what information is to be operated on.It consists of 12 bits of memory that are required to define the address as the ...
Read MoreDifference between Series Resonance and Parallel Resonance
In an AC electric circuit, when the capacitive reactance is balanced by the inductive reactance at some given frequency, then this condition in the circuit is referred as resonance. The frequency of the supply voltage at which resonance occurs in the circuit is called resonant frequency. At the resonance in the circuit, the reactance of the capacitor and inductor cancel each other. Also, at the condition of resonance, no reactive power is taken from the source.Based on the arrangement of capacitor and inductor in the electric circuit, the resonance is divided in two types viz. −Series resonanceParallel resonanceIn this article, we ...
Read MoreCooling Methods of a Transformer
When the transformer is in operation, heat is generated due to copper losses in the windings and iron losses in the core. The removal of heat from the transformer is known as cooling of the transformer.Transformer Cooling MethodsFor the dry type transformersAir Natural (AN) CoolingAir Forced (AF) or Air Blast (AB) CoolingFor oil immersed type transformersOil Natural Air Natural (ONAN) CoolingOil Natural Air Forced (ONAF) CoolingOil Forced Air Forced (OFAF) CoolingOil Forced Water Forced (OFWF) CoolingAir Natural (AN) CoolingThe air natural (AN) cooling is used in dry type, self-cooled transformers. In this method, the natural circulation of surrounding air is ...
Read MoreXOR Linked List – A Memory Efficient Doubly Linked List
Linked List The linked list is a linear data structure containing elements called nodes. Each node consists of two main components: data (payload of that node) and a pointer to the next node in the list. They are simple and efficient to use providing easy allocation and deallocation of memory. Doubly Linked List Doubly linked list is a special type of linked list which again consists of a basic element called nodes. Each node consists of three main components: data (payload of that node), a pointer to the previous node of the sequence and a pointer to the next ...
Read MoreSort numbers stored on different machines
In today’s world with a large amount of data and interconnected systems, a vast amount of data is created and stored across various machines. One challenging challenge is to sort this data stored across multiple devices. Sorting being a fundamental operation in computations is used for optimal retrieval, search and analysis of data. But with distributed systems and various interconnected machines, this task of sorting becomes difficult and important. Problem Statement Given an array containing N linked lists that depict N different machines. Each of these linked lists contains some variable number of numbers in sorted order. The task is ...
Read MorePrint unique rows in a given Binary matrix
In computer science, binary matrix holds a very strong position containing a lot of information as the data is depicted using 0’s and 1’s which is the language of computers. In binary matrix, unique row refers to a row that is not identical to any other row in the matrix. Each unique row contains unique information that is not present anywhere else in the matrix except the row itself. Discovering these unique rows give information about relationships between rows, patterns in the matrix and identification of critical elements. Problem Statement Given a binary matrix mat[] containing 0’s and 1’s. The ...
Read MoreGiven a sequence of words, print all anagrams together
Anagrams − An anagram is a word or a phrase formed by rearranging the alphabets of another word or phrase, usually once. Some examples of anagrams are given below − Top - Pot Silent - Listen Post - Stop Dog - God Problem Statement Given an array of words arr[]. For the given array print all the anagrams together. Sample Example 1 Input arr[] = {“star”, “god”, “vile”, “save”, “evil”, “care”, “arts”, “race”, “dog”, “vase”} Output arts star care race dog god evil vile save vase ...
Read MoreFind the interval which contains the maximum number of concurrent meetings
Given a scenario of a company where meetings are held during fixed time slots. These slots might be overlapping or distant. Thus, optimizing meeting efficiency is important in order to accommodate maximum meetings without any conflicts between schedules. In the problem given, we’ll be going through such an optimizing meeting efficiency problem. Problem Statement Given a two-dimensional array time[][] containing the start time and end time of all the meetings that are scheduled for that day. The task is to find the time interval when most of the meetings are occurring. Sample Example 1 Input: time[][] = {{1, 5}, {2, 6}, {3, 7}, {4, ...
Read MoreDesign an efficient data structure for given operations
In order to design efficient data structures for specific operations, the time and space complexity of the given operations for the data structure created is important. Looking into some basic operations and how they can be efficiently optimized − insert() − Inserts an element to the data structure Dynamic Arrays, Hash Tables, Binary Search Trees and Balanced Search Trees like AVL Trees or Red-Black Trees are the most efficient choice of data structures providing O(1) complexity for insertions operation. delete() − Deletes an element from the data structure Hash tables approach the deletion process in O(1) time while Binary Search Trees and Balanced Search ...
Read MoreMaximum level sum in N-ary Tree
The N-ary tree is a tree data structure where each node can have a maximum of N children where N is a positive integer (N >= 0). N-ary trees are used in many applications like file systems, organizational charts and syntax trees in programming languages. Example of N-ary tree with N = 4. A / / \ \ B C D E / | \ ...
Read More