Write a lisp function f9 that removes duplicates from a list. Example: (f9 ‘(c (a b) c d (a b))) returns (c (a b) d) should mainly just use cond car and cdr

C++

C++ program for the following please: Create a generic function print(ls, n) that prints to standardoutput the first n elements of list ls. The elements are printed on separatelines. If ls has less than n elements, then the entire list is printed

F# system function such as min and list.map are not allowed write a function in F# elimDuplicates that takes a list of integers and eliminates consecutive duplicates; replacing them with a single instance of the value. Order is preserved and non- consecutive duplicates are unaffected. Examples: > elimDuplicates [1; 2; 2; 3; 3; 3; 4; 4; 4; 4; 5; 5; 5; 5; 5];; val it : int list = [1; 2; 3; 4; 5] > elimDuplicates [1; 2; 2; 1; 3; 3; 1; 4; 4; 1; 5; 5; 1];; val it : int list = [1; 2; 1; 3; 1; 4; 1; 5; 1]

Rewrite the following class template as a template function bool math_func(int a, double b, long c) { if(a*b==c) { return true} else {return false;} }

Question: First write a function mulByDigit :: Int -> BigInt -> BigInt   which takes an integer digit and a big integer, and returns the big integer list which is the result of multiplying the big integer with the digit. You should get the following behavior: ghci> mulByDigit 9 [9,9,9,9] [8,9,9,9,1]   Your implementation should not be recursive. Now, using mulByDigit, fill in the implementation of bigMul :: BigInt -> BigInt -> BigInt   Again, you have to fill in implementations for f , base , args only. Once you are done, you should get the following behavior at the prompt: ghci> bigMul [9,9,9,9] [9,9,9,9] [9,9,9,8,0,0,0,1] ghci> bigMul [9,9,9,9,9] [9,9,9,9,9] [9,9,9,9,8,0,0,0,0,1] ghci> bigMul [4,3,7,2] [1,6,3,2,9] [7,1,3,9,0,3,8,8] ghci> bigMul [9,9,9,9] [0] []   Your implementation should not be recursive.     Code:  import Prelude hiding (replicate, sum)import Data.List (foldl') foldLeft :: (a -> b -> a) -> a -> [b] -> afoldLeft =…

In c++, how do I display the last node in a linked list?

in #lang scheme

Suppose a node of a linked list is defined as follows in your program:    typedef struct{  int data;  struct Node* link;  } Node;    Write the definition of a function, printOdd(), which displays all the odd numbers of a linked list. What will be the time complexity of printOdd()? Express the time complexity in terms of Big-O notation.

write a user defined function to find nth element from a list using LISP ( use car and cdr functions)