Shared Write a function shared(L1:List[int], L2:List[int]) -> List[int] that returns a list of strings that appears in both L1 and L2. The list you return may have the elements in any order but may not contain duplicates. Examples shared ([0,1,2,3], [3,2,1]) == [1,2,3] # or [3,2,1] or [1,2,3] ... shared ([0,1,2,3,1], [6,7,8]) == [] shared ([2,1,2,3,1], [1,2,1,2]) == [2,1] # or [1,2] Your Answer: 1 # Put your answer here 2 Submit

Shared Write a function shared(L1:List[int], L2:List[int]) -> List[int] that returns a list of strings that appears in both L1 and L2. The list you return may have the elements in any order but may not contain duplicates. Examples shared ([0,1,2,3], [3,2,1]) == [1,2,3] # or [3,2,1] or [1,2,3] ... shared ([0,1,2,3,1], [6,7,8]) == [] shared ([2,1,2,3,1], [1,2,1,2]) == [2,1] # or [1,2] Your Answer: 1 # Put your answer here 2 Submit

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

A difference between a list and tuple is that a tuplecannot be sliced, while a list can. A) False B) True C) True, but only for numeric lists/tuples D) Depends on the size of the list/tuple
In C++ create a linked list ADT that does the following: initializes a linked list add a node to the end of a linked list displays linked list add a node to the beginning to a linked list Add the ability to search through a linked list to find an exact value match
please go in to the detail and explain the purpose and function to each line & function of code listed below. #include <stdio.h> //Represent a node of the singly linked list struct node{ int data; struct node *next; }; //Represent the head and tail of the singly linked list struct node *head, *tail = NULL; //addNode() will add a new node to the list void addNode(int data) { //Create a new node struct node *newNode = (struct node*)malloc(sizeof(struct node)); newNode->data = data; newNode->next = NULL; //Checks if the list is empty if(head == NULL) { //If list is empty, both head and tail will point to new node head = newNode; tail = newNode; } else { //newNode will be added after tail such that tail's next will point to newNode tail->next = newNode; //newNode will become new tail of the list tail = newNode; } }…
C Language In a linear linked list, write a function that deletes the element in the middle of the list (free this memory location) (if the list has 100 or 101 elements, it will delete the 50th element). The function will take a list as a parameter and return the updated list.
C++The List class represents a linked list of dynamically allocated elements. The list has only one member variable head which is a pointer that leads to the first element. See the following code for the copy constructor to List. List (const List & list) { for (int i = 0; i <list.size (); i ++) { push_back (list [i]); } } What problems does the copy constructor have? Select one or more options: 1. List (const List & list) {} does not define a copy constructor. 2. The list parameter should not be constant. 3. The new elements will be added to the wrong list. 4. Copy becomes shallow rather than deep. 5. The copy will create dangling pointers. 6. Copying will create memory leaks. 7. The condition must be: i <size () 8. head is never initialized.
Write a function called chop_list that takes a list, modifies it by removing the first and last elements, and return a list. For example: list1=[1,2,3,4,5] -> chop_list( list1) =[2,3,4] list2=["a", "b", "e", "f") -> chop_list( list2) =["b","e"]
O problem 12 Language/Type: Related Links: Author: Java ListNodes LinkedLists LinkedIntList.java Marty Stepp Write the code necessary to convert the following sequence of ListNode objects: list -> [5] -> [4] -> [3] / Into this sequence of ListNode objects: list [4] -> [5] -> [3] / Assume that you are using ListNode class as defined in lecture and section: public class ListNode { public int data; // data stored in this node public ListNode next; // a link to the next node in the list } public ListNode () { ode() {...} public ListNode(int data) { ... } public ListNode(int data, ListNode next) { ... }
struct insert_at_back_of_sll { // Function takes a constant Book as a parameter, inserts that book at the // back of a singly linked list, and returns nothing. void operator()(const Book& book) { /// TO-DO (3) /// // Write the lines of code to insert "book" at the back of "my_sll". Since // the SLL has no size() function and no tail pointer, you must walk the // list looking for the last node. // // HINT: Do not attempt to insert after "my_sll.end()". // ///// END-T0-DO (3) ||||// } std::forward_list& my_sll; };
In OCaml Programming Language, write a function: val prime_separator : int list -> int list * int list = <fun> that takes an integer list as an input, and returns a pair of integer lists where the prime numbers are in the first while the composite numbers are in the second returned list. #prime_separator [1; 2; 3; 4; 5; 6; 7; 8; 9; 10; 11];; - : int list * int list = ([11; 7; 5; 3; 2], [10; 9; 8; 6; 4; 1])
C++ PROGRAM DATA STRUCTURES Write a function to swap nodes in a Doubly Linked list.
I) The pointer variable first points to the first node of a linked list. The declaration of the node is given below. struct Node { Before: q Write C++ code to insert a new node q in the front of the linked list shown below. After insertion the node pointed to by q becomes the first node of the linked list. first After: first }; q int data; Node* next;
1 = [1, 2, 3, 4, 5] # defining a list a = sum_sqr_list(1) # function call print(a) # printing result [15, 55]