= set of binary strings with the substring 11, M = set of binary strings that end in 10. . (6 pts) Construct the DFAS that accept L and M, respectively, by completing the transition diagrams below. Use the left DFA for L and the right DFA for M.

Attempt to unify the following pairs of expressions. Either show their most general unifiers or explain why they will not unify. p(A,B,c) and p(Q,r,S)

(ABET 2) Construct a regular expression corresponding to the following set: {binary strings such that every odd position is a 1}. You may assume that the even positions can be a 0 or 1.

Exercise 1: (Design of algorithm to find greatest common divisor) In mathematics, the greatest common divisor (gcd) of two or more integers is the largest positive integer that divides each of the integers. For example, the gcd of 8 and 12 is 4. Why? Divisors of 8 are 1, 2, 4, 8. Divisors of 12 are 1, 2, 4, 6, 12 Thus, the common divisors of 8 and 12 are 1, 2, 4. Out of these common divisors, the greatest one is 4. Therefore, the greatest common divisor (gcd) of 8 and 12 is 4. Write a programming code for a function FindGCD(m,n) that find the greatest common divisor. You can use any language of Java/C++/Python/Octave. Find GCD Algorithm: Step 1 Make an array to store common divisors of two integers m, n. Step 2 Check all the integers from 1 to minimun(m,n) whether they divide both m, n. If yes, add it to the array. Step 3 Return the maximum number in the array.

31. Need C, C++, Java, Python, or Perl code for the below question. Important: Do not copy codes from prepinsta.com.

String to integer ATOI (requires use of INT_MAX and INT_MIN): Implement the myAtoi(string s) function, which converts a string to a 32-bit signed integer (similar to C/C++'s atoi function). The algorithm for myAtoi(string s) is as follows: Read in and ignore any leading whitespace. Check if the next character (if not already at the end of the string) is '-' or '+'. Read this character in if it is either. This determines if the final result is negative or positive respectively. Assume the result is positive if neither is present. Read in next the characters until the next non-digit character or the end of the input is reached. The rest of the string is ignored. Convert these digits into an integer (i.e. "123" -> 123, "0032" -> 32). If no digits were read, then the integer is 0. Change the sign as necessary (from step 2). If the integer is out of the 32-bit signed integer range [-231, 231 - 1], then clamp the integer so that it remains in the range. Specifically, integers less…

8. Verilog.(a) What does statement "always @ (sel or b or c)" mean?(b) Give any two Verilog statements which can be synthesized. And give any two different statements which cannot be synthesized.(c) What is the difference between blocking statements and non-blocking statements? Give an example of each.

Synchronization (Social Distancing Problem) C++ multithreading At a playground, kids love to play on a play play structure. However, due to an ongoing pandemic, socialdistancing needs to be enforced. There are two types of kids—vaccinated, and non-vaccinated. The vaccinated kids have immunity against the virus hence don’t need social distancing. The non-vaccinated kids needs to maintain social distancing for their safety. The park managers came up with a solution that both the vaccinated and non-vaccinated kids cannot play at the play structure simultaneously.Below is a pseudocode for a solution using semaphores that allows any number of vaccinated kids on the play structure at the same time, but only one non-vaccinated kid. (All the kids are represented as  threads.) If a non-vaccinated kid is playing at the structure, no other kid (either vaccinated or nonvaccinated) can be allowed. Any number of vaccinated kids can be at the play structure together. The solution must implement the…

Define Get statement .

C++ This a question to create a C string function. Create a function strfind(cs, c) that returns the index of the first occurrence of character c in C string cs. In case c is not found, −1 is returned. Implement the function as efficiently as possible.