Write a java code to implement four new functions DFA Union: Given Two DFAs, M1 and M2, create a DFA which accepts the union of the languages of M1 and M2. Intersection: Given Two DFAs, M1 and M2, create a DFA which accepts the intersection of the languages of M1 and M2. Difference: Given Two DFAs, M1 and M2, create a DFA which accepts the set difference of the languages of M1 and M2, that is, L(M1) - L(M2), the set of strings accepted by M1 but not M2. Complement: Given DFA M, create a DFA which accepts the complement of the language of M.

Program in C

code a python function (sat) that solves the satisfiability of the clause set by running through all truth assignments. In case the clause set is satisfiable it should output a satisfying assignment. A full (truth) assignment should be represented by a list of literals.

Design an implementation of an Abstract Data Type consisting of a set with the following operations: insert(S, x) Insert x into the set S. delete(S, x) Delete x fromthe set S. member(S, x) Return true if x ∈ S, false otherwise. position(S, x) Return the number of elements of S less than x. concatenate(S, T) Set S to the union of S and T, assuming every element in S is smaller than every element of T. All operations involving n-element sets are to take time O(log n).

Develop a system/application in Prolog that will allow grader to: load a set of student’s grades (see samples from the Table C below) query student’s final letter grade (A, B, C, etc.) by a given student’s name. query student(s) whose grade matches to the input letter grade (e.g., A). For example, show student(s) whose final letter grade is A. There are 3 types of grades for each student—HWs, Exams, and Project, with a weight of 20%, 40% and 40%, respectively, to the 100-point final. Table A and B show how the final grades (in points and letter) are computed. Table C shows samples of students’ grades. You will define the execution instructions to answer the following questions so that grader can test out your application in Prolog: how to load your source code to Prolog runtime/compiler how to load students’ grades to Prolog runtime/compiler how to query student’s letter grade how to query student(s) whose letter grade matches to an input letter grade Please DO NOT hard code any…

In Lisp

use c++ programming language to create a derived, or child class for Cylinder, that is, a Cone class. The same function, with the same parameters, is used. However, the formula is different for a cone. // The formula is: V = (1/3) * pi * (r^2) * h

This is in c++. Create a class of function objects called StartsWith that satisfies the following specification: when initialized with character c, an object of this class behaves as a unary predicate that determines if its string argument starts with c. For example, StartsWith(’a’) is a function object that can be used as a unary predicate to determine if a string starts with an a. So, StartsWith(’a’)("alice") would return true but StartsWith(’a’)("bob") would return false. The function objects should return false when called on an empty string. Test your function objects by using one of them together with the STL algorithm count_if to count the number of strings that start with some letter in some vector of strings. So basically, I want a class that returns true or false based on if the name that is typed starts with the character that I put down.

Example 2: Let f and g be functions from the set of integers to the set of integers defined by f (x)= 2x+3 and g(x)= 3x+2. What is the composition of f and g, and also the composition of g and f?