Write a function that has two linked-list head pointers as parameters. Assume that the linked list's items are ordered by the < operator. On each list, every item is less than the next item on the same list. The function should create a new linked list that contains all the items on both lists, and the new linked list should also be ordered ( so that every item is less than the next item on the list). The function should return a head pointer for the newly constructed linked list. e.g, 1-> 2-> 33-> 4 ->5 =>1-> 2 -> 3-> 3 -> 4 -> 5

Write a function that has two linked-list head pointers as parameters. Assume that the linked list's items are ordered by the < operator. On each list, every item is less than the next item on the same list. The function should create a new linked list that contains all the items on both lists, and the new linked list should also be ordered ( so that every item is less than the next item on the list). The function should return a head pointer for the newly constructed linked list. e.g, 1-> 2-> 33-> 4 ->5 =>1-> 2 -> 3-> 3 -> 4 -> 5

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

program
Write a user defined function named as “length_list” function that finds the length of a list of list_node_t nodes. This code should fit with the following code.Partial Code: #include <stdio.h> #include <stdlib.h> /* gives access to malloc */ #define SENT -1 typedef struct list_node_s { int digit; struct list_node_s *restp; } list_node_t; list_node_t *get_list(void); int main(void) { list_node_t *x;int y; x=get_list(); printf("%d\n",x->digit); printf("%d\n",x->restp->digit); printf("%d\n",x->restp->restp->digit); // your length_list function should be called from here printf("Length is: %d",y); } /* * Forms a linked list of an input list of integers * terminated by SENT */ list_node_t * get_list(void) { int data; list_node_t *ansp; [20]scanf("%d", &data); if (data == SENT) { ansp = NULL; } else { ansp = (list_node_t *)malloc(sizeof (list_node_t)); ansp->digit = data; ansp->restp = get_list(); } return (ansp);
Look at the two functions Merge-and-Count & Sort-and-Count. You are also given an array- Awesome_Array= 3 7 10 14 18 19 2 11 Merge-and-Count (A, B){ curA = 0; curB = 0; count = 0; mergedList = empty list while (not at end of A && not at end of B){ a = A[curA]; b = B[curB]; if (a < b) append a to mergedList; curA++; else append b to mergedList; curB++; count = count + number of elements left in A } if (at end of A) append rest of B to mergedList; else append rest of A to mergedList; return (count, mergedList); } Sort-and-Count(L){ if list L has one element return (0, L) Divide the list into two halves A and B (rA, A) ← Sort-and-Count(A) (rB, B) ← Sort-and-Count(B) (rC, L) ← Merge-and-Count(A, B) total_count =…
Question 6 Full explain this question
C++ code please: Create a generic functionprint_if(start, stop, condition, out)that prints to output stream out all the elements in the range[start,stop) that satisfy the unary predicate condition. The elements are printed on separate lines. The arguments start and stopare bidirectional iterators. Test your function by printing all the stringsmore than 3 characters long in some vector of strings
JS Write a function named list_concat that has a single parameter. This parameter will be a list/array. The parameter's entries will be strings. Your function needs to return a string. The returned string's value should be the concatention of all of the entries in the parameter with a space after each entry. Sample test cases: list_concat(["single"]) evaluates to "single list_concat(["limit", "break", "ready"]) evaluates to "limit break ready
Question 1: Faro Shuffle A faro shuffle involves splitting a deck of cards into two piles, then taking cards exactly alternating between the two piles. Write a function (faro-shuffle lst0 lst1),which consumes two (listof Any). The function produces a list which contains all the items in 1st0 and 1st1, interleaved. That is, the first item in the result is the first item from 1st0, the second is the first item from 1st1, the third is the second item from 1st0, the fourth is the second item from 1st1, and so on. If 1st0 and 1stl are not of equal length, the extra items should be included at the end. Here are some examples: 1 (check-expect (faro-shuffle (list "a" "b" "c") (list "A" "B" "C")) (list "a" "A" "b" "B" "c" "C")) 3 (check-expect (faro-shuffle (list 1 3 5) (list 2 4 6 8 10)) (list 1 2 3 4 5 6 8 10)) 2 4 Submit your solution in the file a06q1.rkt.
a Write a function cutF2 that returns its argument with the first two items removed. It should not change the argument, but should return a copy without the first two items. >>> testList = [0,1, 2,3,4,5,6,7]+ >>> cut1(testList) >>> print (testList) #Note: returns modified copy [2, 3, 4,5,6,7]- #Note: original unchanged [0, 1, 2, 3, 4, 5, 6, 7]
11. Write a function called intersect() that takes 2 parameters, both lists. It thenprints, one per line, all items in the first list that are also in the second.>>> intersect([-3, 4, 76], [19, 27, 4, -3])-34>>> intersect([1, 4, 76], [19, 27, 5, -3])
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.
C++ CODİNG. I want you to write some functions using given struct and please create a class. When you write functions you need to use pointers, ccreate linked list. struct node { char data; node *right; node *down; } First function has to Display all the rows starting with a specific character Second function Display all the columns starting with a specific character Third one Delete all the rows starting with a specific character. And also You need to use header file. You do not need to write main function, as i said before ı just want to functions.
1) Define a global variable Emps that is an array of pointers to employee structs. 2) Change your createEmployee function to add the new employee to the Emps array. It should place it in the first slot that contains a NULL. 3) Write a listEmployees function that will call your display function on each employee in the array. 4) Change main to have a loop that looks for user commands. • If the user types HIRE, you should call createEmployee. If the user types LIST, you should call listEmployees. • If the user types QUIT, you should exit the loop, which will then cause the program to exit. 5) Write a findEmployee function that takes a string parameter and returns the employee pointer with that name or NULL if no such person exists. Change main to add a FIND name command that will find and display a single employee.