Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
DFA is the short form for the deterministic finite automata and NFA is for the Non-deterministic finite automata. Now, let us understand in detail about these two finite automata.DFAA Deterministic Finite automata is a five-tuple automata. Following is the definition of DFA −M=(Q, Σ, δ, q0, F)Where, Q : Finite set called states.Σ : Finite set called alphabets.δ : Q × Σ → Q is the transition function.q0 ϵ Q is the start or initial state.F : Final or accept state.NFANFA also has five states same as DFA, but with different transition function, as shown follows −δ: Q X Σ ... Read More
There are several ways to run a script on startup in Linux, depending on your specific distribution and the type of script you are trying to run. Using systemd − On systems that use systemd, you can create a systemd service file for your script and configure it to run on startup. Using cron − You can use the cron daemon to schedule your script to run at startup. You can add a line to the cron table (crontab) to run your script at a specific time on startup. Using init.d − On systems that use the older init.d ... Read More
The main operation performed by operating system is to carries out is the allocation of resources and services, such as allocation of the following −MemoryDevicesProcessorsInformationThe operating system includes programs that are helpful to manage these resources, such as a traffic controller, a scheduler, memory management module, I/O programs, and a file system.Functions of Operating SystemsLet us discuss the function of the operating system (OS) in detail.SecurityThe operating system uses a password protection to protect user data it also prevents unauthorized access to programs and user data, but for external functionality we need to install malware software to protect the system.Control ... Read More
The aim of this article is to implement a program maximum count of characters that can replace? by at most A 0s and B 1s with no adjacent duplicates. Given a couple of integers A and B, both of which that represent the number of 0s and 1s that are accessible, and a string Str with only the special characters "*" and "?" The aim is to determine the greatest number of characters that may be used in the '?' position without causing any neighboring characters to be identical. Example 1 Let us give the input string str = ... Read More
Hermite_e series is also known as probabilist's Hermite polynomial or the physicist's Hermite polynomial. It is available in mathematics which is used to calculate the sum of weighted hermites polynomials. In some particular cases of the quantum mechanics, the Hermite_e series the weight function is given as e^(−x^2). Calculating Hermite_e series The following is the formula for Hermite_e series. H_n(x) = (−1)^n\:e^(x^2/2)\:d^n/dx^n(e^(−x^2/2)) Where, H_n(x) is the nth Hermite polynomial of degree n x is the independent variable d^n/dx^n denotes the nth derivative with respect to x. In Numpy library we have the function namely, polynomial.hermite.hermder() to ... Read More
A Band pass filter is the filter which passes the frequencies within the given range of frequencies and rejects the frequencies which are outside the defined range. The Butterworth band pass filter designed to have the frequency response flat as much as possible to be in the pass band. The following are the specifications of the digital band pass butter worth filter. The sampling rate of the filter is around 40 kHz. The pass band edge frequencies are in the range of 1400 Hz to 2100 Hz. The stop band edge frequencies are within the range of 1050 Hz ... Read More
The aim of this article is to implement a program Minimize count of alternating subsequences to divide a given binary string with subsequence number. Here, you are provided with a binary string as part of the issue. In order to prevent any subsequence from including adjacent zeros and ones, we must reduce the number of subsequences and output the subsequence number that corresponds to each string element. A subsequence represents a sequence which can be created by taking the supplied sequence and eliminating zero or more members while maintaining the initial position of the elements that remain. Input Let ... Read More
The aim of this article is to implement a program to find the count of alphabetic and alphanumeric strings from a given array of strings. As we know, a string is a group of characters that ends with the null character "\0" in C programming. Characters from the C string are kept in a character array. A C string differs from a character array in that it ends with the distinctive character "\0." Input arr[] = {“snmd”, “nej7dnr”, “snmd”, “dltmdj”, “lbwm2p6”} Output 3 2 “snmd”: 2 “nej7dnr”: 1 “dltmdj”: 1 “lbwn2p6”: 1 Explanation The strings ... Read More
The aim of this article is to implement a program to convert a string Str1 to Str2 by moving B to right and A to left without crossover. As we know, a string is a group of characters that ends with the null character "\0" in C programming. Characters from the C String are kept in a character array. A C string differs from a character array in that it ends with the distinctive character "\0". Example Let us take the input strings, str1 = “#B#A#”, and str2 = “##BA#” Output obtained here is: Yes Explanation − 'B' ... Read More
The aim of this article is to implement a program to obtain the count of sum of “10” subsequences for each 1 in string with A 1s, B 10s and C 0s. Example Let us take the Input: A = 1, B = 2, C = 3 Output obtained here is : 14 Explanation A = 1 denotes. There is a single "1" string, B = 2 denotes, there is a pair of "10" strings, and C = 3 denotes, there is a trio of "0" strings. The string that results from concatenation is "11010000". Five ... Read More