1. Using the above class map, write function void map::mapToGraph(graph &g){...} to create a graph g that represents thelegal moves in the map m. Each vertex should represent a cell, and each edge should represent a legal move betweenadjacent cells.2. Write a recursive function findPathRecursive(graph &g, stack &moves) that looks for a path from the start islandto the destination island. If a path from the start to the destination exists, your function should call the map::printPath()function that should print a sequence of correct moves (Go left, Go right, Go down, Go up, etc.). If no path from thestart to the destination exists, the program should print, "No path exists". If a solution exists the solver should alsosimulate the solution to each map by calling the map::print() function. The map::print() function prints out a mapvisualization, with the goal and current position of the car in the map at each move, marked to show the progress. Hint:consider recursive-DFS.3. Write a function findPathNon Recursive1(graph &g, stack &moves) that does the same thing as in 2, but by usingstack and without using recursion. If a path from the start to the destination exists, your function should call themap::printPath() function that should print a sequence of correct moves (Go left, Go right, Go down, Go up, etc.). If nopath from the start to the destination exists, the program should print, "No path exists". If a solution exists the solvershould also simulate the solution to each map by calling the map::print() function. The map::print() function prints out amap visualization, with the goal and current position of the car in the map at each move, marked to show the progress.Hint: consider stack-based DFS.4. Write a function findPathNon Recursive2(graph &g, queue &moves) that does the same thing as in 2, but byusing queue and without using recursion. If a path from the start to the destination exists, your function should call themap::printPath() function that should print a sequence of correct moves (Go left, Go right, Go down, Go up, etc.). If nopath from the start to the destination exists, the program should print, "No path exists". If a solution exists the solvershould also simulate the solution to each map by calling the map::print() function. The map::print() function prints out amap visualization, with the goal and current position of the car in the map at each move, marked to show the progress.Hint: consider queue-based BFS.The code you submit should apply all three findPath functions to each map, one after the other.The map input files named map1.txt, map2.txt, and map3.txt can be downloaded from the canvas. Example of a mapinput file:710Start - OXXXXXXXXX00000000XXOXOXOXOXXXOXOXOX0000XXOXXXOXXXX0000000XXXXXXXXX000Z - Destination

The code you submit should apply all three findPath functions to each map, one after the other. The map input files named map1.txt, map2.txt, and map3.txt can be downloaded from the canvas. Example of a map input file: 7 10 Start - OXXXXXXXXX 00000000XX OXOXOXOXXX OXOXOX0000 XXOXXXOXXX X0000000XX XXXXXXX000Z - Destination

The code you submit should apply all three findPath functions to each map, one after the other. The map input files named map1.txt, map2.txt, and map3.txt can be downloaded from the canvas. Example of a map input file: 7 10 Start - OXXXXXXXXX 00000000XX OXOXOXOXXX OXOXOX0000 XXOXXXOXXX X0000000XX XXXXXXX000Z - Destination

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 10PE

See similar textbooks

Similar questions

function myCompose(f,g){// TODO: return (f o g);// that is, a function that returns f(g(x)) when invoked on x.}
Write a recursive Java function displayOutIn that displays two items from an array list at one instance from out-to-in. until one or last two items displayed and the process stops. For example, given array A = {15, 74, 106, 10, 9, 86, 34} the displayOutIn function displays the following: 15, 34 74, 86 106, 9 10
python assignment Matrix class Implement a matrix class (in matrix.py). a) The initializer should take a list of lists as an argument, where each outer list is a row, and each value in an inner list is a value in the corresponding row. b) Implement the __str__ method to nicely format the string representation of the matrix: one line per row, two characters per number (%2d) and a space between numbers. For example: m = Matrix([[1,0,0],[0,1,0],[0,0,1]]) print(m)> 1 0 0> 0 1 0> 0 0 1 c) Implement a method scale(factor) that returns a new matrix where each value is multiplied by scale. For example: m = Matrix([[1,2,3],[4,5,6],[7,8,9]])n = m.scale(2)print(n)> 2 4 6> 8 10 12>14 16 18print(m)> 1 2 3> 4 5 6> 7 8 9 d) Implement a method transpose() that returns a new matrix that has been transposed. Transposing flips a matrix over its diagonal: it switches rows and columns. m = Matrix([[1,2,3],[4,5,6],[7,8,9]])print(m)> 1 2 3> 4 5 6> 7 8…
Computer Science Write in Javascript please and use high order functions liek map or filter or reduce let obj = [ { mode: "hot" }, { temp: "low" }, { mode: "cold } ] I want to create a function that get object by key such as: myFunc("mode"); returns { mode: "hot" } next call of myFunc("mode") returns { mode: "cold
In C++ Question A linked list is said to contain a cycle if any node is visited more than once while traversing the list. Given a pointer to the head of a linked list, determine if it contains a cycle. If it does, return 1. Otherwise, return 0. Example: head refers to the list of nodes 1 → 2 → 3 → 1 → NULL. There is a cycle where node 3 points back to node 1, so return 1. Function Description: Complete the has cycle function provided in the moodle assignment folder. It has the following parameter: • SinglyLinkedListNode pointer head: a reference to the head of the list. Returns: • int: 1 if there is a cycle or 0 if there is not. Note: if the list is empty, head will be null. Input Format: The code stub reads from stdin and passes the appropriate argument to your function. The custom test cases format will not be described for this question due to its complexity. Expand the section for the main function and review the code if you would like to figure out how to create…
Computer Science Java Programming ******* Write a Java application that will, given an appropriate data structure, will be able to track the following module and its dependencies as well as implement an appropriate search algorithm to create the correct graph for any given module. The graph will show all the corresponding dependent modules in their correct order of dependency. Must use Stack, either Double ArrayList or Linked List, and simple search to implement this. Module A: Dependencies: B D E K L Module B: Dependencies: F G M Module C: Dependencies: F Module D: Dependencies: G Module E: Dependencies: B A Module F: Dependencies: B Module G: Dependencies: NONE Module K: Dependencies: M Module L: Dependencies: Q Module M: Dependencies: A Module Q: Dependencies: NONE Ensure that dependencies are only visited only once. To test: Input A Your Output: Module A. Dependencies: B F G M D E K M L Q
Exercise 7. Write in pseudo-code a function that computes the height of a binary tree. Assume that a node is represented by the following class: class Node{ } public int key; public node left; public node right; I have written the first lines of the function: you need to finish the pseudo-code (Hint: the easiest approach is to write a recursive function). public int height (Node t) { if (t== null) return -1; else
Maze Runner Function - Implementation of this function is done in a1_partd.py We describe a maze as having row x col cells. For example if row was 3, and col was 4, then we would have a grid of cells as follows. We describe a wall by the two cell numbers the wall separates. If every single wall existed, there would be (row-1)(col) + (col-1)(row) walls. 0 | 1 | 2 | 3 4 | 5 | 6 | 7 8 | 9 | 10 | 11 A Maze class (which you do not need to implement) describes a maze as mentioned above. This class is defined in maze.py. It has methods that you can use to travel through the maze (i.e. figure out where you are, find a neighbour cell etc.) use a recursive maze runner function: def find_path(maze, from_cell, to_cell); The find_path function will find a path from cell number from_cell to cell number to_cell and will return it as a list containing all the cell numbers along the path, from the from_cell to the to_cell. You are allowed to use this function as a wrapper to a recursive function that…
A- Declare a self-referential structure for a linked list having one data StudentNode field called GPA (float), and one pointer to StudentNode called next. B- Write a non-recursive function - that counts all the GPAS that are less than or equal to 2 in your linked list starting from the head of the list. Example: If the list is 1.9->2->3.5->4->1.8, the function should return 3. C- Write a recursive function that prints all the GPAS that are higher or equal to 3.5 in your linked list starting from the head of the list. Example: If the list is 1.9->2->3.5->4->1.8, the function should print: 3.5->4.
Topical Information Use C++. This lab will help you practice with dynamic memory (NOT mixed with classes). Program Information Heat flow through a rod can be simulated fairly easily in a computer program. We can simulate the rod using an array of temperatures. The rod begins all at the same temperature (user determined), but holding some position(s) of the rod at constant temperature (holding a match or ice cube to the rod) provides a [set of] heat source(s) (or sink(s)). To update the temperature at each time step (second?), you take the average of the positions on each side from the previous time step (and at the current position). For instance, if the following was the initial state of the rod: +------+------+------+------+------+------+------+------+ | 10 | 10 | 10 | 10 | 10 | 10 | 10 | 10 | +------+------+------+------+------+------+------+------+ And then the user specifies that there is a heat source at the left end of 100 degrees:…
Recursive function tracing: drawing Recursion Tree for Smallest(a, 0, 6), where vector a contains the following numbers: a = {4, 5, 10, 1, 20, 23, 2}. • clearly label each recursive call’s parameters• clearly label what each call returns to its caller //Return smallest element in sublist a[first...last] int Smallest (vector<int> a, int first, int last){ if (first==last) return a[first]; mid = (first+last)/2; //integer division l1 = Smallest(a, first, mid); l2 = Smallest (a, mid+1, last); if (l1>l2) return l2; else return l1; }
3. Largest: a recursive function that computes the largest value for an integer array of positiveand negative values. For example, for the array below, the function largest should return 22,which is the largest value in the array. You can assume there are no more 20 integers in thearray. Think of how to formulate the recurrence relation in this problem yourself.