Implement the following Racket functions: Transitive?   Input: a list of pairs, L. Interpreting L as a binary relation, Transitive? returns #t if L is a transitive relation and #f otherwise. Examples: (display "Transitive? \n")     (Transitive? '((a b) (b c) (a c)))   ---> #t (Transitive? '((a a) (b b) (c c))) ---> #t  (Transitive? '((a b) (b a)))  ---> #f (Transitive? '((a b) (b a) (a a))) ---> #f (Transitive? '((a b) (b a) (a a) (b b))) ---> #t (Transitive? '())---> #t

Write a struct ‘Student’ that has member variables: (string) first name, (int) age and (double) fee. Create a sorted (in ascending order according to the age) linked list of three instances of the struct Student. The age of the students must be 21, 24 and 27. Write a function to insert the new instances (elements of the linked list), and insert three instance whose member variable have age (i) 20, (ii) 23 and (iii) 29. Write a function to remove the instances from the linked list, and remove the instances whose member variables have age (i) 21 and (ii) 29. Write a function to count the elements of the linked list. Write a function to search the elements from the linked list, and implement the function to search an element whose age is 23. Write a function to print the linked list on the console. Consider the Student struct as defined above. Create a stack of 5objects of the class. Implement the following (i) push an element to the stack (ii) pop an element from the stack (iii) get the…

In C++, can I get a code example for a function that will return the intersection items for two sets. It will return/print out the shared (intersection) items for them. I am looking for an actual function preferably for a set class, comparing one instance of a set class with another, but definitely NOT a STL keyword. Thank you.

What is the value of the median-of-3 for the following list. [80, 47, 41, 21, 40, 68, 78, 18, 75, 46, 30] Notes: • Your answer should be a single valid, non-negative, literal Python int value. For example, 123 is a valid int literal. • This question is asking about before any partition operation is carried out. • This is not asking for the median-of-3 index. • You can pre-check your answer (to check it's a valid, non-negative, literal int).

Coding language: C++. (Try to avoid linked lists if possible please). Add comments. Thanks. • Each functionality component must be implemented as a separate function, though the function does not need to be declared and defined separately • No global variables are allowed • No separate.hor.hpp are allowed • You may not use any of the hash tables, or hashing functions provided by the STL or Boost library to implement your hash table • Appropriate, informative messages must be provided for prompts and outputs You must implement a hash table using the Double Hashing collision strategy and the mid-square base 10 hashing function with an R of 2. Your collision strategy must be implemented as a separate function, though it may be implemented inside your insert/search/delete functions, and should halt an insert / search/delete functions, and should halt an insert/search/delete after table size number of collisions. Your hash function must be implemented as a separate function. Your hash table…

Complete the Swap() method in main.c to exchange the values of the num field of two Number struct objects, num1 and num2.

Given: (3,6) int numi, num2, newNum; double x, y; Which of the following assignments are valid? If an assignment is not valid, state the reason. a. numl = 35; b.newNum = numl - num2; c.numl = 5;num2 = 2 + numl;numl = num2 I 3; d. numl * num2 = newNum; e.x = 12 * numl - 15.3; f.numl * 2 = newNum + num2; g. x / y = x * y; h. num2 = numl % 2.0; i.newNum = static_cast<int> (x) % 5; j.x = x + y - 5; k. newNum = numl + static_cast<int> (4.6/2);

Find the body for:def find_first_occurrence(msg: str, string_to_find: str) -> int:    """Return the index of the first occurence of string_to_find    in msg, or -1 if it does not occur, ignoring case.        >>> find_first_occurrence('October holidays: Halloween and Thanksgiving', 'H')    8    >>> find_first_occurrence('Because DEC 25 == OCT 31', 'H')    -1    >>> find_first_occurrence('hip hip hooray', 'ip')    1    """

Which of the following statements regarding linked lists and arrays is correct? Group of answer choices: a. A dynamically resizable array makes insertions at the beginning of an array very efficient.   b. Using a doubly linked list is more efficient than an array when accessing the ith element of a structure.   c. A dynamically resizable array is another name for a linked list.   d. Any type of list tends to be better than an array when there are a set number of maximum items known beforehand.   e. If many deletions at any place in the structure were common, a linked list implementation would likely be preferable to an array