Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Expert Solution & Answer
Chapter 12, Problem 41CRP
Explanation of Solution
The number of different paths and time required to compute the distances between cities:
Travelling salesman problem deals with the optimization of the path of travel through different cities.
Each pair of city is connected by a unique road. There are
So, the total number of paths is as follows:
Therefore, there are
Now, time taken to compute length of a path is one microsecond
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Suppose a biking environment consists of n ≥ 3 landmarks,which are linked by bike route in a cyclical manner. That is, thereis a bike route between landmark 1 and 2, between landmark 2 and 3,and so on until we link landmark n back to landmark 1. In the centerof these is a mountain which has a bike route to every single landmark.Besides these, there are no other bike routes in the biking environment.You can think of the landmarks and the single mountain as nodes, andthe bike routes as edges, which altogether form a graph G. A path is asequence of bike routes.What is the number of paths of length 2 in the graph in termsof n?What is the number of cycles of length 3 in the graph in termsof n?What is the number of cycles in the graph in terms of n?
Write python code for this :
Prepare a Dataset of 300 samples of Random Values of two Variables in range(1-1000). Let’s call these
variables as X and Y such that X > Y. The Values of Remainder and Quotient is to be calculated for each
sample (X, Y) pair such that Remainder = X % Y and Quotient = X / Y.
Design a Neural Network Architecture and Pipeline that can take X and Y as input as input and Predict the
values of Remainder and Quotient. You are to choose which Error Function you should be using. Derive
the weight update Equations.
Train the model for above generated Dataset for 10 epochs for all weights of the network using Python
code from scratch and show the weight updates. Also, verify if this reduces the error or not.
Let M be the PDA defined by Q = {q, q0 , q1 , q2}, Σ = {a,b}, Γ = {a}, F := {q , q1}.δ(q0 , a , Z0) = {(q, Z0 ) } δ(q , a, Z0) = {(q , aZ0)} δ(q , a, a) = {(q , aa)} δ(q , b , a) = {(q1 ,e)} δ(q1 , b , a) = {(q1 ,e)} δ(q1 , b, Z0 ) = {(q2 , e)}
Describe the CFG and the language accepted by M
Chapter 12 Solutions
Computer Science: An Overview (12th Edition)
Ch. 12.1 - Prob. 1QECh. 12.1 - Prob. 2QECh. 12.1 - Prob. 3QECh. 12.1 - Prob. 4QECh. 12.2 - Prob. 1QECh. 12.2 - Prob. 2QECh. 12.2 - Prob. 3QECh. 12.2 - Prob. 4QECh. 12.2 - Prob. 5QECh. 12.3 - Prob. 1QE
Ch. 12.3 - Prob. 3QECh. 12.3 - Prob. 5QECh. 12.3 - Prob. 6QECh. 12.4 - Prob. 1QECh. 12.4 - Prob. 2QECh. 12.4 - Prob. 3QECh. 12.5 - Prob. 1QECh. 12.5 - Prob. 2QECh. 12.5 - Prob. 4QECh. 12.5 - Prob. 5QECh. 12.6 - Prob. 1QECh. 12.6 - Prob. 2QECh. 12.6 - Prob. 3QECh. 12.6 - Prob. 4QECh. 12 - Prob. 1CRPCh. 12 - Prob. 2CRPCh. 12 - Prob. 3CRPCh. 12 - In each of the following cases, write a program...Ch. 12 - Prob. 5CRPCh. 12 - Describe the function computed by the following...Ch. 12 - Describe the function computed by the following...Ch. 12 - Write a Bare Bones program that computes the...Ch. 12 - Prob. 9CRPCh. 12 - In this chapter we saw how the statement copy...Ch. 12 - Prob. 11CRPCh. 12 - Prob. 12CRPCh. 12 - Prob. 13CRPCh. 12 - Prob. 14CRPCh. 12 - Prob. 15CRPCh. 12 - Prob. 16CRPCh. 12 - Prob. 17CRPCh. 12 - Prob. 18CRPCh. 12 - Prob. 19CRPCh. 12 - Analyze the validity of the following pair of...Ch. 12 - Analyze the validity of the statement The cook on...Ch. 12 - Suppose you were in a country where each person...Ch. 12 - Prob. 23CRPCh. 12 - Prob. 24CRPCh. 12 - Suppose you needed to find out if anyone in a...Ch. 12 - Prob. 26CRPCh. 12 - Prob. 27CRPCh. 12 - Prob. 28CRPCh. 12 - Prob. 29CRPCh. 12 - Prob. 30CRPCh. 12 - Prob. 31CRPCh. 12 - Suppose a lottery is based on correctly picking...Ch. 12 - Is the following algorithm deterministic? Explain...Ch. 12 - Prob. 34CRPCh. 12 - Prob. 35CRPCh. 12 - Does the following algorithm have a polynomial or...Ch. 12 - Prob. 37CRPCh. 12 - Summarize the distinction between stating that a...Ch. 12 - Prob. 39CRPCh. 12 - Prob. 40CRPCh. 12 - Prob. 41CRPCh. 12 - Prob. 42CRPCh. 12 - Prob. 43CRPCh. 12 - Prob. 44CRPCh. 12 - Prob. 46CRPCh. 12 - Prob. 48CRPCh. 12 - Prob. 49CRPCh. 12 - Prob. 50CRPCh. 12 - Prob. 51CRPCh. 12 - Prob. 52CRPCh. 12 - Prob. 1SICh. 12 - Prob. 2SICh. 12 - Prob. 3SICh. 12 - Prob. 4SICh. 12 - Prob. 5SICh. 12 - Prob. 6SICh. 12 - Prob. 7SICh. 12 - Prob. 8SI
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- A group of individuals are living on an island when a visitor arrives with an unusual order: all blue-eyed people must leave the island immediately. Every evening at 8:00 p.m., a flight will depart. Everyone can see everyone else's eye colour, but no one knows their own (nor is anyone allowed to tell them). Furthermore, they have no idea how many people have blue eyes, but they do know that at least one person has. How long will it take for the blue-eyed individuals to leave?arrow_forwardOn an island, a group of people are living until a visitor arrives with an odd directive: everyone with blue eyes must leave the island as quickly as possible. Every evening, a flight will depart at 8:00. Everyone can see the colour of everyone else's eyes, but they are blind to their own (nor is anyone allowed to tell them). They also do not know the number of persons who have blue eyes, but they do know that at least one person has them. How long will it take the folks with blue eyes to leave?arrow_forwardExamine how the iterative and recursive algorithms compare on the same network. Do they have the same duration?arrow_forward
- Consider a satellite moving around the earth along the equator and recording some data (air-pressure, temperature, height etc.) for scientific investigation. The data thus obtained is stored in a database where the key to each data entry is the longitude of the point. We require this data to be sorted, but each of the n data entries might have been misplaced by no more than k positions from the correct sorted order (k is a predefined constant, depending on the speed of the satellite). Design a worst-case time and space efficient algorithm for sorting such a dataset.arrow_forwardThe area of an arbitrary triangle can be computed using the formula area = √(s(s–a)(s–b)(s–c)) where the square root is applied to the entire product (Links to an external site.) and where a, b, and c are the lengths of the sides, and s is the semiperimeter of the triangle given (Links to an external site.) by the formula: s = (a + b + c)/2 EXTRA CREDIT: 10 points for adding a function named getInput that initializes the three side lengths from outside of main. Write a void function named (Links to an external site.) triangle that computes the area and perimeter (as well as the semiperimeter which will be used to compute the area) of a triangle based (Links to an external site.) on the length of the sides. The function should use five parameters (Links to an external site.)—three value (Links to an external site.) parameters (Links to an external site.) that provide the lengths of the edges and two reference parameters (Links to an external site.) that store (Links to an external…arrow_forwardA salesman has a number of cities to visit. They want to calculate the total number of possible paths they could take, visiting each city once before returning home. Return the total number of possible paths a salesman can travel, given n cities. If we have cities A, B and C, possible paths would be: A - B -> C A -> C -> B B -> A -> C B -> C -> A C -> B -> A C -> A > B which gives us 6 as the possible number of paths. Examples paths (4) → 24arrow_forward
- Computer science. Correct answer will be upvoted else downvoted. Think about a n by n chessboard. Its columns are numbered from 1 to n from the top to the base. Its sections are numbered from 1 to n from the passed on to one side. A cell on a convergence of x-th line and y-th section is indicated (x,y). The fundamental corner to corner of the chessboard is cells (x,x) for all 1≤x≤n. A stage of {1,2,3,… ,n} is composed on the fundamental slanting of the chessboard. There is actually one number composed on every one of the cells. The issue is to segment the cells under and on the principle askew (there are by and large 1+2+… +n such cells) into n associated areas fulfilling the accompanying imperatives: Each district ought to be associated. That implies that we can move from any cell of a locale to some other cell of a similar area visiting just cells of a similar district and moving from a cell to a neighboring cell. The x-th area ought to contain cell on the fundamental…arrow_forwardModeling the spread of a virus like COVID-19 using recursion. Let N = total population (assumed constant, disregarding deaths, births, immigration, and emigration). S n = number who are susceptible to the disease at time n (n is in weeks). I n = number who are infected (and contagious) at time n. R n = number who are recovered (and not contagiuous) at time n. The total population is divided between these three groups: N = S n + I n + R n There are several hidden assumptions here that may or may not apply to COVID-19, such as a recovered person is assumed to not be able to get the disease a second time, at least within the time window being examined. On week 0 (the start), you assume a certain small number of people have the infection (just to get things going). Everyone else is initially susceptible, and no one is recovered. There are two constants of interest: Let period = time period that it takes for an infected person to recover (recover meaning they become not infectious to…arrow_forwarda) Explain on Simulated Annealing algorithm behaves at very high temperatures, and how it behaves at very low temperatures. (b) Imagine the implementation of Simulated Annealing algorithm in real life. Let's say, you have a caretaker at your home. Your home has a garden and it has a fountain with a network of pipes that contains 150 faucets. You informed your caretaker that you are going for short holiday to Langkawi for 3 days and when you return you would like the fountain to spray as high as possible. Your caretaker knows that it is impossible to check all faucets within 3 days to obtain an optimal setting. You can use Simulated Annealing algorithm to maximize the height of the fountain, also can assume whether a faucet can be ON or OFF and measuring the water height. Adding to that, you can make any other assumptions required for this scenario, explain clearly using Simulated Annealing algorithm.arrow_forward
- Newton is a brilliant mathematician and solving triangles problems fascinates him. Today he is given a sequence of positive integers V1, V2, .., VN. You must choose three elements Vx, Vy, Vz (x, y, z is vertices) such that the triangle formed have these properties: |XY|= Vz, |XZ|=Vy, |YZ|=Vx and the angle |ZYXZ|= 0 satisfies cose2P/Q, where 0 should be maximum possible. Find any such triangle or determine that it does not exist. Develop a python code which prints the value of x, y, z in a single line and print "Invalid" if not possible. Test Case: 412 5872 Result: 321arrow_forwardUsing Python programming language. There are exactly N people living in a certain parallel universe. The Ith of these N people claim to be the parent of exactly Ai off these N people. However, some of these people may be lying - the person may either be telling the truth (in which case they have exactly Ai children) or lying down (in which case they can have any number of children). It is known that each person has at most one parent. Furthermore, as one would expect, a person's child is not allowed to also be their ancestor. What is the maximum possible number of truth tellers in this universe Required Output 2 Possible input 1 2 10arrow_forwardLet l be a line in the x-yplane. If l is a vertical line, its equation is x = a for some real number a. Suppose l is not a vertical line and its slope is m. Then the equation of l is y = mx + b, where b is the y-intercept. If l passes through the point (x₀, y₀), the equation of l can be written as y - y₀ = m(x - x₀). If (x₁, y₁) and (x₂, y₂) are two points in the x-y plane and x₁ ≠ x₂, the slope of line passing through these points is m = (y₂ - y₁)/(x₂ - x₁). Instructions Write a program that prompts the user for two points in the x-y plane. Input should be entered in the following order: Input x₁ Input y₁ Input x₂arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education