In Haskell Write a function equal that returns whether two sets are equal. equal :: Set...

In Haskell

Write a function equal that returns whether two sets are equal.

equal :: Set -> Set -> Bool

Expert Solution

import Data.List

equal :: (Eq set) => [set] -> [set] -> Bool ---function declaration

equal a b = null (a \\ b) && null (a \\ b) -------function definition

main = do ------main function

putStrLn "check the given sets are equal or not:"

print("[1,2,3,4] and [1,2,3,4] are equal or not ")

print(equal [1,2,3,4] [1,2,3,4]) --- function calling

print("[2,3,4] and [1,2,3,4] are equal or not ")

print(equal [2,3,4] [1,2,3,4]) -----functioncalling

program and sample output

venereology answered 3 years ago

1. Write a Racket function (set-equal? L1 L2) that tests whether L1 and L2 are equal....

1. Write a Racket function (set-equal? L1 L2) that tests whether L1 and L2 are equal. Two sets are equal if they contain exactly the same members, ignoring ordering (or in other words, two sets are equal if they are a subset of each other). For example (set-equal? '(1 (2 3)) '((3 2) 1)) ---> #t (set-equal? '(1 2 3) '((3 2)1)) ---> #f (set-equal? '(1 2 3) '((1 2 3))) ---> #f 2. Two common operations on sets are...

haskell : write a function that reverse the first three element of a list, but not...

haskell : write a function that reverse the first three element of a list, but not the rest. example [1,2,3,4,5,6] == [3,2,1,4,5,6]

Write a Haskell function combine :: Int -> Int -> Int -> Int with the following...

Write a Haskell function combine :: Int -> Int -> Int -> Int with the following behavior: • When x, y, and z all correspond to digit values (i.e., integers between 0 and 9, inclusive), combine x y z returns the integer given by the sequence of digits x y z. (That is, x is treated as the digit in the hundreds place, y is treated as the digit in the tens place, and z is treated as the digit...

C++ The minimum function. (a) Write a function that takes two integers and returns the value...

C++ The minimum function. (a) Write a function that takes two integers and returns the value of the smaller one. In the main() function provide 5 test cases to verify its correctness. (b) Write the function that takes two characters and return the smaller one in the lexicographical order. Write the main() function that tests that functions for 5 different pairs of character type variables. (c) Write a generic function that takes two numeric objects and returns the value of...

a. Write a c++ function called IsPalindrome that receives a 3-digit number and returns whether it...

a. Write a c++ function called IsPalindrome that receives a 3-digit number and returns whether it is palindrome or not. [2.5 marks] b. Write a c++ function, called GCD that receives two parameters n, d, and prints their greatest common divisor [2.5 marks] Now after you created the two functions, you have to write a main function that can call the above functions according to user choice. Write a menu that allows the user to select from the following options...

Can someone show me how to write a Haskell function using snd on a list of...

Can someone show me how to write a Haskell function using snd on a list of tuples to create a new list of just the second element in each tuple? Ex. [(‘m’, False), (‘w’, False), (‘n’, True)] would evaluate to [False, False, True].

In Python: Write a function called sum_odd that takes two parameters, then calculates and returns the...

In Python: Write a function called sum_odd that takes two parameters, then calculates and returns the sum of the odd numbers between the two given integers. The sum should include the two given integers if they are odd. You can assume the arguments will always be positive integers, and the first smaller than or equal to the second. To get full credit on this problem, you must define at least 1 function, use at least 1 loop, and use at...

Write a function sublist that takes two lists as arguments, and returns true if the first...

Write a function sublist that takes two lists as arguments, and returns true if the first list appears as a contiguous sublist somewhere within the second list, and false otherwise. > (sublist ’(c d e) ’(a b c d e f g)) #t > (sublist ’(a c e) ’(a b c d e f g)) #f Write a function lgrep that returns the “lines” within a list that contain a given sublist. Use the sublist function implemented in previous exercise...

Write a python function comparing two binary trees and returns whethere they are same. Input two...

Write a python function comparing two binary trees and returns whethere they are same. Input two binary tress and output true or false. True= They are the same, False= They are not . Test the function .

Write a program in java to determine whether a given function F from the set {0,1,2,3,...,m}...

Write a program in java to determine whether a given function F from the set {0,1,2,3,...,m} to (0,1,2,3,...,n} is one-to-one and/or onto. The inputs to your program will be: - an integer m - an integer n, and - a two dimensional boolean array F of size (m+1) x (n+1), where F[ i , j ] = 1 if F(i) = j.

Question