Python 14. What would be the return of the following function if (p1;p2) input pair is: "saabrabar";"br"?def parse_string1(p1, p2):c = list(p1)k = 0| = len(c) - 1while I != k - 1:if c[k] in p2:k += 1else:c[k], c[I] = c[1], c[k]|-= 1return ".join(c) ,"brbrsaaaa""rbbraaaas""rbrbasaaa""rrbbaaasa"All of the mentioned

''' Online Python Compiler. Code, Compile, Run and Debug…

14. What would be the return of the following function if (p1;p2) input pair is: "saabrabar";"br"? def parse_string1(p1, p2): = list(p1) k = 0 | = len(c) - 1 while I != k - 1: C = if c[k] in p2: k += 1 else: c[k], c[l] = c[I], c[k] |-= 1 return ".join(c) n "brbrsaaaa" "rbbraaaas" "rbrbasaaa" "rrbbaaasa" All of the mentioned

14. What would be the return of the following function if (p1;p2) input pair is: "saabrabar";"br"? def parse_string1(p1, p2): = list(p1) k = 0 | = len(c) - 1 while I != k - 1: C = if c[k] in p2: k += 1 else: c[k], c[l] = c[I], c[k] |-= 1 return ".join(c) n "brbrsaaaa" "rbbraaaas" "rbrbasaaa" "rrbbaaasa" All of the mentioned

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

Write a function that gets a linked list of ints, and reverses it. For example - on input 1 -> 2 -> 3 -> 4, after the function finishes the execution, the list becomes 4 -> 3 -> 2 -> 1 - If the list has one element, then it doesn’t change - If the list is empty, then it doesn’t change You may use the data fields in the struct and the functions provided in LL.h and LL.c. // reverses a linked list void LL_reverse(LL_t* list); Test for the Function; void test_q3() { LL_t* lst = LLcreate(); LL_add_to_tail(lst, 1); LL_add_to_tail(lst, 3); LL_add_to_tail(lst, 8); LL_add_to_tail(lst, 4); LL_add_to_tail(lst, 3); LL_reverse(lst); intcorrect[] = {3,4,8,3,1}; inti; node_t* n = lst->head; for(i=0;i<5;i++) { if (n==NULL) { printf("Q3 ERROR: node %d==NULL unexpected\n", i); return; } if (n->data != correct[i]) { printf("Q3 ERROR: node%d->data==%d, expected %d\n", i, n->data, correct[i]); return; } n = n->next; } if (n==NULL) printf("Q3 ok\n"); } Support File…
Consider the following function headers and type contracts: def aragorn(x: int, y: str, z: float) -> str: def gandalf(x: list) -> list: def elrond(x: list, y: bool) -> bool: If the following code runs without errors, what is a header and type contract for treebeard? a = aragorn(11, 'good', 2.0) b = treebeard(5, gandalf([1, 2, 3]), a) print(elrond(gandalf([4, 5]), b))
C. Consider the following function headers and type contracts:def aragorn(x: int, y: str, z: float) -> str:def gandalf(x: list) -> list:def elrond(x: list, y: bool) -> bool:If the following code runs without errors, what is a header and type contractfor treebeard?a = aragorn(11, 'good', 2.0)b = treebeard(5, gandalf([1, 2, 3]), a)print(elrond(gandalf([4, 5]), b))Write the header and type contract for treebeard.
Suppose a node of a linked list is defined as follows in your program: typedef struct{ int data; struct Node* link; } Node; Write the definition of a function, printOdd(), which displays all the odd numbers of a linked list. What will be the time complexity of printOdd()? Express the time complexity in terms of Big-O notation.
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.
In Ocaml Write a function l3_of_3l : ’a list * ’b list * ’c list -> (’a * ’b * ’c) list = that transforms a triple of lists into lists of triples. If lengths don’t match then ignore leftover elements. examples l3_of_3l ([1;2;3] ,[1.;2.] ,[ ’ a ’; ’b ’; ’c ’; ’d ’]) ;;- : ( int * float * char ) list = [(1 , 1. , ’a ’) ; (2 , 2. ,’b ’) ]l3_of_3l ([1.;2.] ,[ ’ a ’; ’b ’; ’c ’; ’d ’] ,[1;2;3]) ;;- : ( float * char * int ) list = [(1. , ’a ’ , 1) ; (2. , ’b’ , 2) ]
List of triples or a triple of lists? Write a function l3_of_3l : ’a list * ’b list * ’c list -> (’a * ’b * ’c) list = that transforms a triple of lists into lists of triples. If lengths don’t match then ignore leftover elements. examples l3_of_3l ([1;2;3],[1.;2.],[’a’;’b’;’c’;’d’]);; - : (int * float * char) list = [(1, 1., ’a’); (2, 2., ’b’)] l3_of_3l ([1.;2.],[’a’;’b’;’c’;’d’],[1;2;3]);; - : (float * char * int) list = [(1., ’a’, 1); (2., ’b’, 2)]
Write a function, namely fourslicebidirectionSearch(), that will slice a list of integers into four slices and applies bidirection search to each slice. Note that a length of list could be any size and must be at least 4.
Question 2: Write a function that takes a list of distinct integers l, and an integer k. Your function then finds the index of the integer in l, whose removal from l results in a list whose sum is k. For example, given [3,6,4,1,5,2] and 18, your function should return index 0, which corresponds to 3 in the list. Because, when 3 is removed from the list, the sum of the remaining list [6,4,1,5,2] is 18. You can assume that the given problem is always solvable. """ def removeOne(l, k):
Consider the following function that takes reference to head of a Doubly Linked List as parameter. Assume that anode of doubly linked list has previous pointer as prev and next pointer as next.void fun(struct node **head_ref){struct node *temp = NULL;struct node *current = *head_ref;while (current != NULL){temp = current->prev;current->prev = current->next;current->next = temp;current = current->prev;}if(temp != NULL )*head_ref = temp->prev;}Assume that reference of head of following doubly linked list is passed to above function 1 <--> 2 <--> 3 <--> 4 <--> 5 <-->6. What should be the modified linked list after the function call? Note: solve as soon as possible
Suppose you have two objects of Doubly Linked List D1 and D2. Each object is representing a different Doubly Linked List. Write a function to concatenate both doubly linked lists. The concatenation function must return the address of head node of concatenated Doubly Linked List, and it must take two Node* parameters. You need to keep in mind all exceptional cases for example what if either one of the doubly linked lists is empty? Perform this task on paper, take a clear picture of solution and paste it in answer section.
Consider the following function access_element_by_index that returns the iterator to the element at the index i in the list l. typedef std::list<int> int_list; int_list::iterator access_element_by_index(size_t I, int_list &) { assert( ? ); … } Assume the first element of the list is at the index 0, the second at the index 1, and so on. If the function is required to return an iterator that can be dereferenced, determine the precondition of the function, and write an assertion to validate it. (You don’t need to implement the functions).