Define the rule echoN(LST0, LST1, CNT). This rule determines when LST1 consists of only CNT repetitions of the elements in list LSTO. *don't worry if it infinitely loops on determining the source list (i.e. echoN(A,[a,a,b,b],1).) e.g.: | ?- echoN([a,b], [a,a,b,b], A). A = 1 ? yes |?- echoN([a,b], A, 1). A = [a.a,b,b] ? yes | ?- echoN([a, [b.c],d], A. 2). A = [a,a,a, [b.c],[b.c],[b.c].d.d.d] ? yes

Define the rule echoN(LST0, LST1, CNT). This rule determines when LST1 consists of only CNT repetitions of the elements in list LSTO. *don't worry if it infinitely loops on determining the source list (i.e. echoN(A,[a,a,b,b],1).) e.g.: | ?- echoN([a,b], [a,a,b,b], A). A = 1 ? yes |?- echoN([a,b], A, 1). A = [a.a,b,b] ? yes | ?- echoN([a, [b.c],d], A. 2). A = [a,a,a, [b.c],[b.c],[b.c].d.d.d] ? yes

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

CODE in RACKET ONLY flatten-1: takes a list and "flattens" any nested lists by one level. E.g., > (flatten-1 '(a (b c) d)) '(a b c d) > (flatten-1 '((a) (b ((c) (d))) ((e f)))) '(a b ((c) (d)) (e f)) > (flatten-1 (flatten-1 '((a) (b ((c) (d))) ((e f))))) '(a b (c) (d) e f) > (flatten-1 (flatten-1 (flatten-1 '((a) (b ((c) (d))) ((e f)))))) '(a b c d e f)
The function interleave_lists in python takes two parameters, L1 and L2, both lists. Notice that the lists may have different lengths. The function accumulates a new list by appending alternating items from L1 and L2 until one list has been exhausted. The remaining items from the other list are then appended to the end of the new list, and the new list is returned. For example, if L1 = ["hop", "skip", "jump", "rest"] and L2 = ["up", "down"], then the function would return the list: ["hop", "up", "skip", "down", "jump", "rest"]. HINT: Python has a built-in function min() which is helpful here. Initialize accumulator variable newlist to be an empty list Set min_length = min(len(L1), len(L2)), the smaller of the two list lengths Use a for loop to iterate k over range(min_length) to do the first part of this function's work. On each iteration, append to newlist the item from index k in L1, and then append the item from index k in L2 (two appends on each iteration). AFTER the loop…
Write a function that takes in a list and returns the first nonzero entry. def nonzero(lst): ……………. Returns the first nonzero element of a list >>> nonzero ([1, 2, 3]) 1 >>> nonzero ( [0, 1, 2]) 1 >>> nonzero ( [0, 0, 0, 0, 0, 0, 5, 0, 61]) 5 "*** YOUR CODE HERE ***"
A- Declare a self-referential structure for a linked list having one data StudentNode field called GPA (float), and one pointer to StudentNode called next. B- Write a non-recursive function - that counts all the GPAS that are less than or equal to 2 in your linked list starting from the head of the list. Example: If the list is 1.9->2->3.5->4->1.8, the function should return 3. C- Write a recursive function that prints all the GPAS that are higher or equal to 3.5 in your linked list starting from the head of the list. Example: If the list is 1.9->2->3.5->4->1.8, the function should print: 3.5->4.
Define the function (siftNum lst). This function should resolve to all the numbers in the list, lst. For example: (siftNum '(a 8 2 1 m l 90 p 2)) resolves to '(8 2 1 1 90 2).
JAVA CODE Learning Objectives: Detailed understanding of the linked list and its implementation. Practice with inorder sorting. Practice with use of Java exceptions. Practice use of generics. You have been provided with java code for SomeList<T> class. This code is for a general linked list implementation where the elements are not ordered. For this assignment you will modify the code provided to create a SortedList<T> class that will maintain elements in a linked list in ascending order and allow the removal of objects from both the front and back. You will be required to add methods for inserting an object in order (InsertInorder) and removing an object from the front or back. You will write a test program, ListTest, that inserts 25 random integers, between 0 and 100, into the linked list resulting in an in-order list. Your code to remove an object must include the exception NoSuchElementException. Demonstrate your code by displaying the ordered linked list and…
1. a function that takes in a list (L), and creates a copy of L. note: The function should return a pointer to the first element in the new L. [iteration and recursion]. 2. a function that takes in 2 sorted linked lists, and merges them into a single sorted list. note: This must be done in-place, and it must run in O(n+m).
emacs/lisp function Write a function that takes one parameter that is a list of numbers and returns true (t) if all the elements of the list are multiples of the first one and nil otherwise. This said, a list generated by the function make-multiples could be passed to this new function and the result should be true. On the other hand, show an example of a list that could not have been generated by the first function for which the result is still true.
Exercise G -- Implement a function halves that takes a list of integers and divides each element of the list by two (using the integer division operator //) NOTE use the map function combined with a lambda expression to do the division with a neat solution halves : List Int -> List Int halves xs = [ ] --remove this line and implement your halves function here
Write a function toSentence : string list -> string = that takes a string list and concatenates its elements by adding a space in between each element, however it adds both a period and a space (* ") if the element of the list succeeding it begins with a capital letter. Empty strings ignored as if we had the list without them. *" are to be # toSentence ["";"That 's" ;"one";"small";"step";"for";" man ,";"";"one";"giant ";"leap";"for";"mankind"; Neil";" Armstrong"];;
Write a function with the signature below that returns the sum of the last k elements of a singly linked list that contains integers. int returnSumOfLastKNodes(Node* head, int k) Example: 10 -> 5->8->15->11->9->23 10 represents the head node, returnSumOfLastKNodes(Node* head, 4) will return 58.
What is the type of variable L3 and what is its value if L1 and L2 are lists? L3 = [i for i in set (L1) if i in L2] L3 is a tuple with elements that are both in L1 and L2 L3 is a set with elements common between the lists L2 and L3. L3 is a list with all the elements in L1 and L2 L3 is a list that contains only the elements that are common between the lists (without duplicates).