4. Define a polymorphic function of type: shimmy :: [a] -> a -> [a] which takes an input list and another value (of the same type as the input list's elements) and outputs a list based on the input list, but where every element is preceded by and followed by the second input. For example shimmy [1,2,3] 0 = [0,1,0,2,0,3,0] and shimmy 0 0 = [0]

4. Define a polymorphic function of type: shimmy :: [a] -> a -> [a] which takes an input list and another value (of the same type as the input list's elements) and outputs a list based on the input list, but where every element is preceded by and followed by the second input. For example shimmy [1,2,3] 0 = [0,1,0,2,0,3,0] and shimmy 0 0 = [0]

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

The question is in bold and the rest is there for support , to explain concepts Write a function triple_riffle(mylist) which takes as input a list (which for convenience we will always take with length a multiple of 3) and outputs the result of a 3-way riffle shuffle . For example: an input of range(9) should output [6,3,0,7,4,1,8,5,2]. Write a function triple_riffle_repeat(mylist,n) which takes as input a list (again with length a multiple of 3) and outputs the result of doing a 3-way riffle shuffle n times. A Faro shuffle is when a deck of cards is split exactly in half and then the two halves are interleaved exactly. There are two versions: an out-shuffle where the card in position 1 stays where it is (and likewise the card in the last position stays there), and an in-shuffle where the card in position 1 moves to position 2 (and the card in last position moves up one). The following code prints the result of a Faro out-shuffle on the list [1,2,...,52]. deck = list(range(1,53))…
Question 1: Adding matrices Write a function that adds two matrices together using list comprehensions. The function should take in two 2D lists of the same dimensions. Try to implement this in one line! def add_matrices (x, y): ⠀⠀ >>> matrix1 = [[1, 3], [2, 0]] * >>> matrix2 = [[-3, 0], [1, 2]] >>>add_matrices (matrix1, matrix2) [[-2, 3], [3, 2]] >>> matrix4 = [[ 1, -2, 3], [-4, 5, -6]] >>> matrix5 = [[-1, 2, -3], [4, 5, 6]] ☐☐☐ *** ▪▪▪ >>> add_matrices (matrix4, matrix5) [[0, 0, 0], [0, 0, 0]] |||||| "*** YOUR CODE HERE ***"
Python help
Program in C
I need help being able to make a function that adds an item to the back of a doubly linked list to add an animal to the end of the list in C++ Here's what I got so far with the code #include <iostream> #include <string> using namespace std; class node { public: string data;// Data item node* next; // Point to next node }; class linkedList { public: // Variables? (Attributes) node* headptr; // Functions (methods) linkedList() { headptr = nullptr; } // Add an item to front of list void addFront(string x) { // Declare a pointer variable node* p; // Create a new node, and store its address in p p = new node; // Put x into data field of the new node // Can also put p -> data = x, same thing. (*p).data = x; // Set next pointer of node to previous front item (*p).next = headptr; //Update the…
Write a function inde which returns the index (start from 1) of the occurrence of a given value. Use helper function. Two functions are enough.inde(1, [1,2,1,1,2,2,1]) → [1,3,4,7] Write a function nele which repeats each element in a list n times. Use helper function. Two functions only.nele([1,2],3) → [1,1,1,2,2,2] Write a function isfact to determine if a positive integer is a factorial number. Do not use any formula such as T(n)=n(n+1)/2. Do it in recursive fashion. Two functions are enough.isfact(120) → true
Define a function named insert at(words list, word) which takes a list of words and a word as parameters. The function inserts the parameter word into the list at the index specified by the length of the parameter word. For example, consider the following code fragment: words_list = ['fish', 'barrel', 'sand'] insert_at (words_list, 'if') print(words_1ist) produces ['fish', 'barrel', 'if', 'sand'] The length of the parameter word is 2, so the function inserts "if" into the given list at index 2. Note: the list is changed in place (i.e. the function updates the original list and it does not return a new list). For example: Test Result words_list = ['fish', 'barel', 'shooting', 'sand', 'bank'] ['fish', 'barrel', 'shooting', 'sand', 'like', 'bank'] insert_at (words_list, 'like') print (words_list) words_list = ['cat', 'the', 'bag', 'let', 'out', 'can'] ['cat', 'the', 'bag', 'let', 'sand', 'out', 'can'] insert_at (words_list, 'sand') print(words_list) words_list = ['it', 'the', 'the',…
Need help with sml programming language. I need to define a function called countNegative (val countNegative = fn : int list -> int) that takes a list of integers as an argument and that returns a count of the number of negative integers in the list. For example, countNegative([3,17,~9,34,~7,2]) should return 2.
Define a function named get_unique_sorted(list1, list2) that takes two integer lists as parameters. The function combines the values from the two parameter lists and produces a new list that is sorted and contains no duplicates. For example: Test Result list1 = [3, 5, 1, -4, 2] [3, 5, 1, -4, 2] [1, 7, -2, 6, 9] [-4, -2, 1, 2, 3, 5, 6, 7, 9] list2 = [1, 7, -2, 6, 9] list3 = get_unique_sorted(list1, list2) print(list1, list2, list3) list1 = [13, -5, 14] [13, -5, 14] [38, 14, -2] [-5, -2, 13, 14, 38] list2 = [38, 14, -2] list3 = get_unique_sorted (1list1, list2) print(list1, list2, list3)
In Python: Create a function Matrix_transpose() utilizing List comprehension techniques that takes a 2d list containing user generated/input elements of type int as its argument then returns the reference to a new 2d list that is the transpose of the original. Assume the matrix is rectangular. Show the funtion works with different values. Do not use any python packages to create the funtion.
Python Please Define a function max_run(lst: list) -> int to find the maximum run in a list. A run is a subsequence with identifical values. For example, in [1, 1, 2, 2, 3, 4, 4, 4, 2, 4, 4], the runs are [1, 1], [2, 2], [3], [4, 4, 4], [2], and [4, 4]. The longest run is [4, 4, 4], which has 3 elements. max_run([1, 1, 2, 2, 3, 4, 4, 4, 2, 4, 4]) should return 3. max_run([]) == 0, max_run([1, 2, 3]) = 1, and max_run([1, 2, 1, 1]) = 2.