Suppose that you are given a list of four integers (8, 7, 2, 3). Assume that the allowable operation is “swapping two adjacent numbers” if the first number is greater than the second number. For example, two numbers x and y in the list ( …, x, y, …) can be swapped if x is greater than y. You are asked to sort the list in ascending order. Draw the entire state space (i.e., the search tree) for sorting the list of the four numbers. Note that if you have found the sorted list, you still need to continue to find all possible paths to the sorted list. When the entire state space has been searched, you can stop the search method.

Suppose that you are given a list of four integers (8, 7, 2, 3). Assume that the allowable operation is “swapping two adjacent numbers” if the first number is greater than the second number. For example, two numbers x and y in the list ( …, x, y, …) can be swapped if x is greater than y. You are asked to sort the list in ascending order. Draw the entire state space (i.e., the search tree) for sorting the list of the four numbers. Note that if you have found the sorted list, you still need to continue to find all possible paths to the sorted list. When the entire state space has been searched, you can stop the search method.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 16PE

See similar textbooks

Similar questions

Complete the function getLetterFrequency() to return a list containing the number of times each letter of the alphabet occurs in the string passed to it. The Oth index corresponds to the letter "a" or "A", the 1st corresponds to the letter "b" or "B", ..., the 25th corresponds to "z" or "Z". You should ignore any non-alphabet characters that occur in the string. But make sure that both lowercase and uppercase letters contribute to the same count. You must use the ord() function to convert letters into indexed based values. Note that you can offset a number by ord("a") or ord("A") to get the index that you need. You should use at least some of the (or all of) following string methods: • isalpha() lower() • upper() • isupper() • islower() and the following string functions: ord() len()
1. Analyze the word finder with wild card characters scenario to form the algorithm and compute the time complexity. You are given a list of characters with size n, m. You need to read character data provided as input into this list. There is also a list of p words that you need to find in the given problem. You can only search in left, right, up and down direction from a position. There are two wild characters *' and '+' ,if there is any instance of wild card characters for example '+' appears you can match whatever character in your word that you are searching at this position (only one character). Similarly, if you got wildcard *' you can skip any number of characters ( A sequence of characters not necessary same in between the characters) but the last character should be matched in the given data. This means you are not allowed to match a first and last character with *' wildeard. Input: The first line of the input will give you two integers n and m. From the next line you will get…
For this exercise, a list of non-negative numbers will be given, for which the following operation can be done: subtract 1 from two contiguous elements from the list. It must say whether after any number of operations the list can be converted to a list of zeros. EntryThe input will be a list of non-negative integers x_i such that 0 <= x_i <= 2000000000. ". DepartureIf the given list can be converted to a list of zeros with the operation defined above, print "YES", otherwise, print "NO". Examples Input Example 1 1 2Output Example 1 NOT Input Example 2 2 4 2Output Example 2 YES
Let I be a list of integers. Below, there are four expressions that involve the list I. Without even knowing the contents of l, match the expressions to the lists that were evaluated from them. [sorted (1) [i] for i in [8,7,6,5,4,3,2,1,0]] [97, 91, 63, 58, 49, 36, 22, 18, 12] [i[0] for i in enumerate (1)] [0, 1, 2, 3, 4, 5, 6, 7, 8] [i**2-13*i+12 for i in 1] [0, 49, 112, 148, 160, 251, 348, 366, 388] [i%8 for i in l] [1776, 3162, 840, 0, 7110, 8160, 102, 210, 2622] [sum (1[:i]) for i in range (len (1))] [1, 7, 4, 4, 3, 1, 2, 6, 2]
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
WRITE THE MAIN.CPP FOR THIS PROGRAM a. Write a version of the sequential search algorithm that can be used to search a sorted list. (1, 2) b. Consider the following list: 2, 20, 38, 41, 49, 56, 62, 70, 88, 95, 100, 135, 145 Using a sequential search on ordered lists, that you designed in (a), how many comparisons are required to determine whether the following items are in the list? (Recall that comparisons mean item comparisons, not index comparisons.) (1, 2) 2 57 88 70 135 Write a program to test the function you designed. Note: Have the function,seqOrdSearch, return -1 if the item is not found in the list. (return the index of the item if found).
C Language Write a program to take two numerical lists of the same length ended with sentinel value and store the lists in array X and array Y, each of which has 20 elements. Let N be the actual number of data values in each list. Store the product of corresponding elements of array X and array Y into third array Z of size 20. Display the square root of the sum of the items in array Z. Make up your own data and be sure to test your program on at least one data set with number exactly 20 items.
The Bubble Sort for a list of numbers x0, x1, . . . , xn works as follows: (i) if x0 > x1, switch their values; (ii) now do the same for x1 and x2, then for x2 and x3, all the way down the list to xn−1 and xn; (iii) if at least one switch was made go back to (i), otherwise you’re done. When you’re done you will have x0 x1 x2 · · · xn. Write a program BubbleSort.py to ask the user for the number n. Generate n + 1 random numbers x0, x1, . . . , xn on the interval [0, 1] using random.random(). Bubble sort the numbers and present them in increasing order. I’m sure you can find code to do this online but WRITE YOUR OWN CODE
Given the list: int x[] ={4,2,5,3,6,0,7,1}; Write a C function that finds the lowest two values in the list. This must work for any list. Can someone please go through this step by step for me? Thank you!
n=6 and A=(3,5,4,1,3,2). Draw only the right half of the corresponding walkthrough as shown in P.155, showing only the list A at the end
Implement a function to remove duplicates from a list using an efficient algorithm.