From the following list of train rapid transit system (one way): School : A->B->C->D Work 1 : E->B->F->G->H Work 2 : B->N->E Work 3 : H->D->N Question: Design an algorithm to read the train rapid transit system routes list and print the number of tickets we need to purchase if we want to visit all places minimal twice. The complexity of the algorithm must be O(V+E). V is the number of places. E-> is the number of transits. PS: Use Tarjan’s or Kosaraju’s strongly connected component algorithm.

From the following list of train rapid transit system (one way): School : A->B->C->D Work 1 : E->B->F->G->H Work 2 : B->N->E Work 3 : H->D->N Question: Design an algorithm to read the train rapid transit system routes list and print the number of tickets we need to purchase if we want to visit all places minimal twice. The complexity of the algorithm must be O(V+E). V is the number of places. E-> is the number of transits. PS: Use Tarjan’s or Kosaraju’s strongly connected component algorithm.

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

See similar textbooks

Similar questions

Concepts of programming language Consider the following JavaScript program: var a, y, c;function sub1() {var b, z, c;function sub2() {var a, b, y;. . .}. . .}function sub3() {var a, x, w;. . .}List all the variables, along with the program units where they are declared,that are visible in the bodies of sub2 when the sequence of function call is:“sub1 calls sub3 and sub3 calls sub2”, assuming dynamic scoping is used.
Question 2.1 Given a positive integer, N, the ’3N+1’ sequence starting from N is defined as follows: If N is an even number, then divide N by twoto get a new value for N If N is an odd number, then multiply N by 3 and add 1to get a new value for N. Continue to generate numbers in thisway until N becomes equal to 1 For example, starting from N = 3 the complete ’3N+1’ sequence would be: 3, 10, 5, 16, 8, 4, 2, 1 Write code to ask the user to enter a positive integer (N)in the main()function. Write a function sequence() that receives the integer value N and display the ‘3N+1’ sequence starting from the integer value that was received (entered by the user). The function must also count and return the numbers that the sequence consists of. Thereturned value must be displayed from the main() function. Question 2.2 Write a function createPassword()with no return value to randomly select 8 capital letters from the alphabet. The function receives the address of the first characters of the…
IN HASKELL PROGRAMMING LANGUAGE PLEASE In case you do not know it: the game is played on a 3x3 grid that is initially empty. Two players are playing, by alternatingly making moves. A move by a player places their token (an X for player 1, an O for player 2) into a cell that was empty. We are using algebraic notations for indexing the positions in the board, with A,B,C indexing the columns and 1,2,3 the rows. Specifically, these coordinates would be used in the implementation for moves made by a human player. If the X X O Figure 1: Sample board position same token appears 3 times in any of the three columns, three rows or two main diagonals the game is over and that player wins. If the grid is filled without that happening the game is a draw. For the depicted board, we have Xs in positions C3 and A2, and an O in position B1. It would be O’s turn to make a move; a legal move would be C2, but it is not a good move, because X can force a win by responding A1. O cannot force a win, but…
C++ Figure 6.9 #include <iostream>#include <cstdlib> // contains prototypes for functions srand and rand#include <ctime> // contains prototype for function timeusing namespace std; unsigned int rollDice(); // rolls dice, calculates and displays sum int main() {// scoped enumeration with constants that represent the game status enum class Status {CONTINUE, WON, LOST}; // all caps in constants // randomize random number generator using current timesrand(static_cast<unsigned int>(time(0))); unsigned int myPoint{0}; // point if no win or loss on first rollStatus gameStatus; // can be CONTINUE, WON or LOSTunsigned int sumOfDice{rollDice()}; // first roll of the dice // determine game status and point (if needed) based on first rollswitch (sumOfDice) {case 7: // win with 7 on first rollcase 11: // win with 11 on first roll gameStatus = Status::WON;break;case 2: // lose with 2 on first rollcase 3: // lose with 3 on first rollcase 12: // lose with 12 on first roll…
Question P .You have been tasked with taking a list of employee names and asked to do the following: 1. sort them by their last name 2. create a list of user names based on the first 5 characters of their last name and the first 2 characters of their first name (sometimes in business called their "Five and Two"). In python, complete both these tasks by only using lambda functions. Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line
Topic: Concepts of programming Language 4. a) Consider the following JavaScript program: var a, y, c;function sub1() {var b, z, c;function sub2() {var a, b, y;. . .}. . .}function sub3() {var a, x, w;. . .}List all the variables, along with the program units where they are declared,that are visible in the bodies of sub2 when the sequence of function call is:“sub1 calls sub3 and sub3 calls sub2”, assuming dynamic scoping is used.
Must be new solution and run on GNU Common Lisp! Using Lisp, write a program that solves the Missionaries and Cannibals problem that uses a DFS( depth first search). It should use (mac start end). Start is the current state (which can be (3 3 l) and End is the goal state (which can be (0 0 r). This should output the sequences of moves needed to reach the end state from the start state. This should print nil if there is no solution. For example, the call should be something like this! Call: (mac '(3 3 l) '(0 0 r)) Output: ((3 3 l) (2 2 r) (3 2 l) (3 0 r) (3 1 l) (1 1 r) (2 2 l) (0 2 r) (0 3 l) (0 1 r) (1 1 l) (0 0 r))
QUESTION 2: Write a Python program to accomplish the following tasks: 1. Create a function called "Load_Dataset". The function should read the attached dataset "Wheat_Seeds" into a data frame. task: 2 create a function called "Calculate_Accuracy" that uses the data frame and then applies the tree machine learning classification algorithms. Finally, call this function to compute and display the accuracy for each algorithm.
Q1: Assignment Difficulty Dan has a list of problems suitable for Assignment 4. The difficulties of these problems are stored in a list of integers a. The i-th problem’s difficulty is represented by a[i] (the higher the integer, the more difficult the problem). Dan is too busy eating saltines to worry about Assignment 4 decisions, so he asks Michael the TA to select at least two problems from the list for the assignment. Since there are many possible subsets of the problems to consider and Michael has a life, he decides to consider only sublists (definition follows) of the list of problems. To make grading the assignment easier, Michael wants to pick problems that don’t vary too much in difficulty. What is the smallest difference between the difficulties of the most difficult selected problem and the least difficult selected problem he can achieve by selecting a sublist of length at least 2 of the original list of problems? Definition: A sublist of a list a is any list you can obtain…
Question 2 Using the incomplete programming code given, complete the code using dynamic programming with memory function, to reproduce the results in the following Table 1. (C++) #include<iostream>using namespace std; // max knapsack capacity // *** WRITE YOUR CODE HERE ***// num of items // *** WRITE YOUR CODE HERE ***// weight of each item // *** WRITE YOUR CODE HERE ***// value of each item // *** WRITE YOUR CODE HERE ***// variable for dynamic programming matrix // *** WRITE YOUR CODE HERE *** //==========================================// Dynamic programming function: recursive// ========================================= // ALGORITHM F(i,j) // int value // if F[i,j] is not filled yet (-1): // (start with j = W, i = n) // if capacity j < current item's weight w[i]: // value = recall F(i-1, j) // else: // we can include current item,…
While statements may start and stop anywhere in the flexible manner popularized by Algol60, most modern programming languages insist that statements finish with an end sign like a semicolon or colon. To the contrary, Python and a handful of other programming languages adhere to a set structure in which statements start in a certain column and stop at the end of a line of code unless continuation marks are provided for each statement. Discover how readability, writability, and security are affected by a file's fixed or free format in the following paragraphs.
1. a.An algorithm can be specified in various ways. Identify and explain four ways in which an algorithm can be specified. b. (b). Two algorithms A, B sort the same problem. When you go through each algorithm and break them down into their primitive operations, each can be represented as follows:A = 2n7 + 100n4 + 26n + 50 B = 7n4 + 22n2 + nlogn + 200For very large values of n, which of the algorithms A or B will runin the shortest time to solve the problem and why? (c). Two Computer Science students, Priscilla and Julius, are discussing how to compare two algorithms for solving a given problem. Priscilla suggests that they should use the execution times of the algorithms as criterion; but Julius insists that they should use the number of statements the algorithms execute as criterion. (i). Discuss the reasons why both criteria they are considering are not good for comparing algorithms.(ii). Recommend an ideal solution/criterion that they should rather use for comparing algorithms