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
Programming Articles
Page 405 of 2544
C# Program to View the Access Date and Time of a File
Welcome to this thorough tutorial on creating a C# program to view the access date and time of a file. Whether you're a novice or an intermediate C# programmer, this guide aims to provide you with the insights necessary to effectively use C# for file date and time retrieval. Introduction to C# and File Operations C#, a statically-typed, multi-paradigm programming language developed by Microsoft, is popular in various domains including web and desktop applications, game development, and more. One of its powerful features is its robust support for file operations, including reading and writing files, as well as retrieving file ...
Read MoreC# Program to Trap Events From File
Welcome to our comprehensive guide on creating a C# program to trap events from a file. Whether you are a beginner or an intermediate C# programmer, this article will provide you with the knowledge and skills to effectively use C# for file event handling. Introduction to File Events File events are system-level notifications that occur when a file or directory is created, modified, deleted, or renamed. Monitoring these events allows a program to react to changes in the file system, which can be useful in a variety of scenarios such as log monitoring, file synchronization, and more. Understanding FileSystemWatcher In ...
Read MoreC# Program to Split a String Collections into Groups
Welcome to this comprehensive tutorial on creating a C# program to split a collection of strings into groups using Language Integrated Query (LINQ). Whether you're a novice or an intermediate programmer, this guide will provide you with the insights necessary to understand the power of LINQ in C# and its applications in data manipulation. Understanding the Concept of Grouping in LINQ Grouping is a powerful concept in data manipulation. It involves organizing data into categories based on specified criteria. Grouping is essential when dealing with large datasets as it helps in simplifying data analysis and extraction of meaningful insights. In ...
Read MoreMaximum distance between two points in coordinate plane using Rotating Caliper’s Method
In C++ we have a predefined function sqrt that returns the square root of any number. The Rotating Caliper’s Method is the technique used to solve the algorithmic or computational geometry. Visual Representation of Rotating Caliper’s MethodThe hand rotation shows the real example of a rotating caliper graph, whenever the hand rotates the perpendicular direction is shown. We can also understand this concept by using a polygon shape. In this article, we are going to find the maximum distance of two coordinate points using Rotating Caliper’s Method. Syntax The following syntax used in the program − vector name ...
Read MoreC# Program To Sort Student Names in Descending Order Using LINQ
Welcome to this comprehensive tutorial on how to create a C# program that sorts student names in descending order using Language Integrated Query (LINQ). This article is tailored to beginners and intermediate programmers who want to grasp the fundamentals of LINQ in C# and understand its applications in data manipulation. Introduction to C# and LINQ C# is a statically typed, multi-paradigm programming language developed by Microsoft as part of the .NET initiative. It's popular for web and desktop applications, and more recently, in game development using the Unity game engine. LINQ (Language Integrated Query) is a powerful feature in C# ...
Read MoreFind the Number of \'X\' Total Shapes
In this problem, we need to find the total number of ‘X’ shapes in the given matrix. We can construct the single ‘X’ shape using 1 or more adjacent ‘X’ elements. We can use the DFS (depth−first search) technique to solve the problem. For each ‘X’ element, we can find all adjacent elements using DFS and count it as a single ‘X’ shape. If we find a new ‘X’, we find its adjacent again. Here, we will use the iterative and recursive DFS to find the total number of ‘X” shapes. Problem statement − We have given a matrix[] of ...
Read MoreSum of Minimum and Maximum Elements of all Subarrays of Size K.
In this problem, we need to take the maximum and minimum elements of all sub−array of length K and add them to get the answer. The first solution approach is that traverse through all sub−arrays of size K, find the minimum and maximum element of each sub−array, and add them. The optimized approach to solve the problem is using the deque data structure. We will store the index of the minimum and maximum elements of the subarray in the deque. Problem statement − We have given an array nums[] containing N positive or negative integer values. We have also ...
Read MoreReduce the Array to Atmost one Element by the Given Operations
In this problem, we will reduce the array size to 1 or 0 by performing the given operations in each turn. We can sort the array in each turn to get the maximum elements in each iteration. Also, we can use the head data structure to improve the performance of the code. Problem statement − We have given a nums[] array. We need to decrease the array by performing the below operations. Choose two maximum elements of the array. If both elements are the same, remove both elements from the array. If both elements are not the same, remove ...
Read MoreRearrange and Update Array Elements as Specified by the given Queries
In this problem, we will perform the given queries on the array elements. The queries contain the circular left rotation, right rotation, and updation of the array element. The logical part of solving the problem is array rotation. The naïve approach to rotating the array in the left direction is to replace each element with the next element and the last element with the first element. We can use the deque data structure to rotate the array efficiently. Problem statement − We have given an arr[] array containing the integer values. Also, we have given a queries[] array containing ...
Read MorePrint all Prime Levels of a Binary Tree
In this problem, we will print all prime levels of the given binary tree. We will use the level order traversal technique to traverse each binary tree level and check whether all nodes contain the prime integer for the particular level. Problem statement − We have given a binary tree and need to print all prime levels of the binary tree. It is given that if all nodes of any binary tree contain a prime integer, we can say a particular level is a prime level. Sample examples Input ...
Read More