[Problem 3] Consider the list of values L = [4,2,0,7,6,1,8,5,3] and the following image where we have paired indices of list L with the values of L at those indices. In addition, assume a straight line segment connecting each value on the left side with its equal value on the right side, ie. we link 0 with 0, 1 with 1, 2 with 2,., and 8 with 8 using a straight line. 0 1 2 3 4 5 6 7 8 4 2076 1 8 5 3 Using the modified version of the merge sort only, count the number of line segment crossing which occurs in this configuration. You cannot use drawing to solve this problem.

[Problem 3] Consider the list of values L = [4,2,0,7,6,1,8,5,3] and the following image where we have paired indices of list L with the values of L at those indices. In addition, assume a straight line segment connecting each value on the left side with its equal value on the right side, ie. we link 0 with 0, 1 with 1, 2 with 2,., and 8 with 8 using a straight line. 0 1 2 3 4 5 6 7 8 4 2076 1 8 5 3 Using the modified version of the merge sort only, count the number of line segment crossing which occurs in this configuration. You cannot use drawing to solve this problem.

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

Consider an unordered list L[0:5] = {23, 14, 98, 45, 67, 53} of data elements. Let us search for the key K = 53. Obviously, the search progresses down the list comparing key K with each of the elements in the list until it finds it as the last element in the list. In the case of searching for the key K = 110, the search progresses but falls off the list thereby deeming it to be an unsuccessful search. Write procedure code for LINEAR_SEARCH_ORDERED and UNORDERED
To add the two polynomials, we assume that the singly linked lists' nodes are organized in decreasing order of the variable x's exponents.The goal is to generate a new list of nodes reflecting the sum of P1 and P2. This is accomplished by combining the COEFF fields of nodes with comparable powers of variable x in lists P1 and P2, and then adding a new node in the resultant list P1 + P2. The procedure's core is presented below.P1 and P2 are the beginning pointers of the singly linked lists that symbolize polynomials P1 and P2. Furthermore, PTR1 and PTR2 are two temporary pointers that are originally set to P1 and P2, respectively. Procedure code should be written.
Given a singly linked list L, where x and y are two data elements that occupy the nodes NODEX and NODEY with PREVIOUSX as the node, which is the previous node of NODEX, write a pseudo-code to swap the date x and y in list L by manipulating the links only (data swapping is not allowed). Assume that x and y are available in the list and are neither neighbors nor the end nodes of list L. For example, given the list L shown in Figure P6.10(a), with L, NODEX, NODEY and PREVIOUSX marked on it, the swapping should yield the list shown in Figure P6.10(b). NODEX and NODEY are neither immediate neighbors nor the end nodes of list L. PREVIOUS X NODE X PREVIOUS X எக்க்கக்கா எத்த்தக்க (a) Before swapping g and x NODE Y NODE Y (b) After swapping g and x Linked Lists 193 NODE X Figure P6.10. Swapping of elements in a singly linked list by manipulating links
Given a singly linked list L, where x and y are two data elements that occupy the nodes NODEX and NODEY with PREVIOUSX as the node, which is the previous node of NODEX, write a pseudo-code to swap the date x and y in list L by manipulating the links only (data swapping is not allowed). Assume that x and y are available in the list and are neither neighbors nor the end nodes of list L. For example, given the list L shown in Figure P6.10(a), with L, NODEX, NODEY and PREVIOUSX marked on it, the swapping should yield the list shown in Figure P6.10(b). NODEX and NODEY are neither immediate neighbors nor the end nodes of list L. PREVIOUS X NODE Y 00 bodo a X С NODE X PREVIOUS X g W (a) Before swapping g and x NODE Y Linked Lists 193 NODE X (b) After swapping g and x addada. Figure P6.10. Swapping of elements in a singly linked list by manipulating links
To add the two polynomials, assume that the singly linked lists' nodes are sorted in decreasing order of the variable x's exponents.The goal is to generate a new list of nodes representing the sum of P1 and P2. This is accomplished by combining the COEFF fields of nodes with identical powers of variable x in lists P1 and P2, and then creating a new node in the resultant list P1 + P2. The procedure's crux is presented below.P1 and P2 are the start pointers of the singly linked lists that represent polynomials P1 and P2. PTR1 and PTR2 are two temporary pointers that are initially set to P1 and P2, respectively. Make procedural code.
Consider the elliptic curve group based on the equation y = x + ax +b mod p where a = = 2, b = 1, and p = 5. This curve contains the point P (0, 1). We will use the Double and Add algorithm to efficiently compute 63P. In the space below enter a comma separated list of the points that are considered during the computation of 63 P when using the Double and Add algorithm. Begin the list with P and end with 63 P. If the point at infinity occurs in your list, please enter it as (0, inf).
b. Given 1st = [30, 1, 12, 14, 10, 0], how many elements are in 1st? What is the index of the first element in 1st? What is the index of the last element in 1st? What is 1st [2]? What is 1st[-2]?
Given a linked list of N nodes such that it may contain a loop. A loop here means that the last node of the link list is connected to the node at position X(1-based index). If the link list does not have any loop, X=0. Remove the loop from the linked list, if it is present, i.e. unlink the last node which is forming the loop. Example 1: Input: N = 3 value[] = {1,3,4} X = 2 Output: 1 Explanation: The link li. st looks like 1 -> 3 -> 4 ^ | |____|
Exercise Generate a log-log plot of your period T vs. dynamic mass ma. This is the same plot that you drew on the log-log graphing paper from your materials pack. Perform these steps: 1. Define lists or numpy arrays that contain your experimental data. For example, md = [0.10, 0,15, 0.20] defines a list of dynamic masses 0.1, 0.15 and 0.20 kg, and T = [0.75, 0.83, 0.91] defines a list of periods (in seconds). 2. Generate a log-log plot of T vs. ma that shows your data as points (not lines!) using plt.loglog() with the 'o' option. The dynamic mass should be on the horizontal (x) axis. 3. Add grid lines for both the "major" and "minor" ticks, and both axes. Look up the documentation of plt.grid() to see how this is done. Remember that you can get the documentation for any command by running it in a cell of its own and appending a question mark, e.g. plt.grid?. 4. The axis tick labels will likely show up in scientific notation (e.g. 6 × 10−²). For our values (mostly in the 0.1...1 kg…
SO You have been given two integer arrays/lists (ARR1 and ARR2) of size N and M, respectively. You need to print their intersection; An intersection for this problem can be defined when both the arrays/lists contain a particular value or to put it in other words, when there is a common value that exists in both the arrays/lists.Note :Input arrays/lists can contain duplicate elements.The intersection elements printed would be in the order they appear in the first sorted array/list (ARR1).Input format :The first line of input contains an integer 'N' representing the size of the first array/list.The second line contains 'N' single space separated integers representing the elements of the first the array/list.The third line contains an integer 'M' representing the size of the second array/list.The fourth line contains 'M' single space separated integers representing the elements of the second array/list.Output format :Print the intersection elements. Each element is printed in a separate…
Create a vector x with the elements: O, 1/2, 2/3, 3/4, 4/5,...
Question 2: The game of "FastestPath" consists of a path (a 1-D array) with n positive integers to represent n cities in a path (except the first index which has always value 0). The aim of the game is to move from the source city (located at index 0) to destination (located at last index) in the shortest time. The value at each index shows the travel time to enter the city located in the corresponding index. Here is a sample path where there are 6 cities (n is 6): |0 5 |90 | 7 61 | 12 Always start the game from the first city and there are two types of moves. You can either move to the adjacent city or jump over the adjacent city to land two cities over. The total travel time of a game is the sum of the travel times of the visited cities. In the path shown above, there are several ways to get to the end. Starting in the first city, our time so far is 0. We could travel to city 2, then travel to city 4, then travel to last city for a total travel time of 90 + 61 + 12 = 163. However, a…