What is the type F# would infer for this function?let rec myFun L1 L2 =match L1 with| | -> L2| e:[] -> let first::rest = L2%3Drest| e:rest -> let e2::rest2 = L2myFun rest rest2Your answer should be in the format Suppose I wanted to build a list L containing 1, 2, 3, 5 in that orderWhich of the following successfully build this list?O a. let L = [1,2,3,5]b.Jet L = 1::2::3::5::[]O c. let L = [1]@[2]@[3]@[5]d. let L = [1]@[2]@[3,5]%3Dе.let K = [2]@[3]@[5] let L = 1::K

Suppose I wanted to build a list L containing 1, 2, 3 Which of the following successfully build this list? a. let L = [1,2,3,5] O b. Jet L = 1::2::3::5::[] O c. let L = [1]@[2]@[3]@[5] O d. let L = [1]@[2]@[3,5] е. let K = [21@[3]@[5] let L = 1::K

Suppose I wanted to build a list L containing 1, 2, 3 Which of the following successfully build this list? a. let L = [1,2,3,5] O b. Jet L = 1::2::3::5::[] O c. let L = [1]@[2]@[3]@[5] O d. let L = [1]@[2]@[3,5] е. let K = [21@[3]@[5] let L = 1::K

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Assuming that data is a correctly created list, then the fact that lists are mutable means that the following statement: data[9] = max(data) / data[-3] %3! O a. Is illegal. O b. Maybe illegal if the list contains floats. O cls fully correct. O d. Can be executed if and only if the list contains at least nine elements. O e. Can be executed if and only if the list contains at least 10 elements.
Implement a program that creates an unsorted list by using a linked list implemented by yourself. NOT allowed to use LinkedList class or any other classes that offers list functions. It is REQUIRED to use an ItemType class and a NodeType struct to solve this. Use C++! The “data.txt” file has three lines of data 100, 110, 120, 130, 140, 150, 160 100, 130, 160 1@0, 2@3, 3@END You need to create an empty unsorted list add the numbers from the first line to list using putItem() function. Then print all the current keys to command line in one line using printAll(). delete the numbers given by the second line in the list by using deleteItem() function. Then print all the current keys to command line in one line using printAll().. putItem () the numbers in the third line of the data file to the corresponding location in The list. For example, 1@0 means adding number 1 at position 0 of the list. Then print all the current keys to command line in one line…
Please write it in Python Write a delete function that takes as an argument a list l and an elem element and returns the list obtained from l by deleting all occurrences of elem. Example: delete([4, 7, 12, 4, 4, 0, 4, 5], 4) return => [7, 12, 0, 5]. Write a function insere_milieu that takes as an argument a list l and an element elem and returns the list obtained from l by adding elem "in the middle" of l, that is: If the length of l is even, the item is added once, in the middle of the list. If the length of l is odd: the element is added on either side of the central element. Example: insere_milieu([4, 7, 12, 3], 0) return => [4, 7, 0, 12, 3] and insere_milieu([9, 3, 5, 6, 2], 1) return => [9, 3, 1, 5, 1, 6, 2]. Write a cutting function that takes as an argument a list of numbers l and a threshold number and returns two lists: the first is obtained from l keeping only the numbers below or equal to the threshold; the second is obtained from l keeping only the…
In Python, A list may contain {0,1,2}, find the number of strings of size n that do not contain two 1's next to eachother. For example. there would be 8 lists of size 2 that are approved. and list size of 3 has 27 (3*3*3) possible but the lists of [X,1,1],[1,1,X],[1,1,1] are not accepted. the n(3) = (27 - 3) Any python pros have any idea for this tricky recursive problem
In this Homework, you are going to write a program that implements a sorted list using dynamic allocated arrays. DataFile.txt contains the information of poker cards. 1. C: clubs (lowest), D: diamonds, H: hearts, S: spades (highest) 2. 2 (lowest), 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K, A 3. No Joker cards 4. Any C cards are lower than any D cards. DataFile Content (You can write the file specification into your program.): H4, C8, HJ,C9,D10,D5,DK,D2,S7,DJ, H3, H6,S10,HK,DQ,C2,CJ,C4,CQ,D8,C3,SA,S2, HQ, S8, C6,D9,S3,SQ ,C5, S4, H5, SJ,D3, H8,CK,S6,D7,59,H2, CA,C7,H7,DA,D4,H9,D6,HA,H10, S5, C10 H4, D5, HK, D2 H4, HK, SK C9,C10 For examples, DJ means J of Diamonds; H7 means 7 of hearts. Your job 1. Create a list by dynamic allocated array and set the size to 20
In C# Suppose variable nums contains a list of integers.List«Integer> nums = Arrays.asList(1, 1, 2, 3, 4, 1, 3, 2, 4, 3, 3, 1);var nums = new List«int> { 1, 1, 2, 3, 4, 1, 3, 2, 4, 3, 3, 1 }Using Java Stream API *or* LINQ, write a short code that prints the following.For each section indicate the platform (whether the solution is given in Java orC# LINQ).A) Print all numbers.B) Print the sum() of the numbers.C) count how many times number '1' appears in the list.
Complete the doctring.def average_daily_temp(high_temps: List[int], low_temps: List[int]) -> List[float]: """high_temps and low_temps are daily high and low temperatures for a series of days. Return a new list of temperatures where each item is the daily average. Precondition: len(high_temps) == len(low_temps) >>> average_daily_temp([26, 27, 27, 28, 27, 26], [20, 20, 20, 20, 21, 21]) [23.0, 23.5, 23.5, 24.0, 24.0, 23.5] """
Consider the following class that inherits from the built-in list class: class BoundedList (list): def _init_(self, bound): list._init_(self) self.bound = bound Suppose that we want this class to act like a list, except that when append is called, if there are self.bound items in the list already, the first item in the list gets removed. Which of the following methods will properly overload append to work this way? def append(self, item): if len(self) >= self.bound: self.pop(0) list.append(self, item) def append (self, item): if len(self) >= self.bound: self.remove (0) list. append (self, item) def append(self, item): if len(self) >= self.bound: self.pop(0) self.append (item) def append(self, item): list. append (self,item) if len(self) > self.bound: self.pop(0)
A-1: Let l = [−1, −2, . . . , −10] be an existing list. Construct a new list from l by dividing each evennumber element in l by 2. Print the new list. Do not use NUMPY library.A-2: Create a new list containing the following elements using list comprehension:[1, −1, 2, −2, 3, −3, ..., 9, −9]A-3: Consider the following coded string. Create a list of all contiguous (connected without space) lettersin the order of their appearance."Vjg dguv rtqitcou ctg ytkvvgp uq vjcv eqorwvkpi ocejkpgu ecp rgthqto vjgoswkemn{0 Cnuq. vjg dguv rtqitcou ctg ytkvvgp uq vjcv jwocp dgkpiu ecp wpfgtuvcpfvjgo engctn{0 C iqqf guuc{kuv cpf c iqqf rtqitcoogt jcxg c nqv kp eqooqp0"A-4: In the list obtained after executing task(s) from Part(A-3), remove newline characters (if any).A-5: For the list obtained after executing task(s) from Part(A-4), for each word in the list do thefollowing: Breakdown the word into list of letters. Convert each of the above letters into integer, using ord() function. Update the…
Assume that list1 is an object of class type ArrayList<String> of Java (similar to KWArrayList class) and it has the following values: “A+” “B+” “C+” “D+” “E+” the instruction list1.remove(2); will change the list to “A+” “C+” “D+” “E+” “A+” “B+” “D+” “E+” “B+” “C+” “D+” “E+” “A+” “B+” “C+” “E+”
Consider the following declaration: public class tClass{ private String I list; private int count; // number of items stored in list The following fragment can be used to check if the array is empty? if (list.length == 0) if (length == 0) (c) if (list == 0) if (count 0)
IN JAVA PLEASE, need help finding an element in the list /** * Returns whether the given value exists in the list. * @param value - value to be searched. * @return true if specified value is present in the list, false otherwise. */ public int indexOf(int value) { //Implement this method return -1; }