Consider the following problem, and determine which aspects listed below are ambiguous (i.e., you can think of multiple interpretations). Select all that apply. Develop an algorithm to find a walking path between two university classrooms such that it takes no longer than 15 minutes (based standard walking speed) and the amount of shade cover is maximum. A way to decide which of two appropriate length paths is best. O The amount of time that can be used to find a path. O Which university campus should be supported. O The maximum length of the path. O Which physical campus locations can be included in the path.

Consider the following problem, and determine which aspects listed below are ambiguous (i.e., you can think of multiple interpretations). Select all that apply. Develop an algorithm to find a walking path between two university classrooms such that it takes no longer than 15 minutes (based standard walking speed) and the amount of shade cover is maximum. A way to decide which of two appropriate length paths is best. O The amount of time that can be used to find a path. O Which university campus should be supported. O The maximum length of the path. O Which physical campus locations can be included in the path.

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

The search algorithm developed will be used for users to search the catalog for all items matching the search keyword(s), and there are a total of 15000 items in the catalog. During development, three different algorithms were created. • Algorithm A runs in constant time, with a maximum runtime of 1.10 seconds and returns all matching results. ● Algorithm B runs in logarithmic time, with a maximum runtime of 0.3 seconds, and returns only the first result. ● Algorithm C runs in linear time, with a maximum runtime of 1.50 seconds and returns all matching results. Which algorithm would be the least suitable for the requirements stated? In your answer, justify your choice by explaining why you picked that algorithm, and why you did not pick the other two algorithms.OND OND OND DAD
Let's consider a long, quiet country road with houses scattered very sparsely along it. (Picture the road as a long line segment with an eastern endpoint and a western endpoint.) Further let’s suppose that despite the bucolic setting, the residents of all these houses are avid cell phone users. You want to place cell phone base stations at certain points along the road, so that every house is within four miles of one of the base stations. Give an efficient algorithm that achieves this goal using as few base stations as possible. Prove its correctness and explain its time complexity.
You are the TA for the FCP course in environment engineering. You are given the midsem and endsem marks for the N Students in the course. A student P is said to dominate a student Q, if the midsem and endsem marks of P are both greater than the respective midsem and endsem marks of Q. Design an efficient algorithm for finding all the students that are not dominated by any other student in the class. Analyse the time complexity as well
Consider a billboard that consists of n vertical panels of width 1 and varying integer heights, hanged down and held by a horizontal roller from the top. The panel i has a height hi. hi For the objective of placing two banners, it is allowed to move each panel up by any integer length using the roller. Once the necessary moves are completed, you may place two banners completely inside of the panels. Based on the above description, what is the maximum total area that you can provide for the two posters? Input The first line of input contains one integer n (1
CThere is a road, the starting coordinate is 0, and the coordinatesof the line are given to draw a black line, for example, five linesegments for drawing black lines, (5, 6), (1, 2), (4, 8), (7 , 9)and (5, 8), as shown belowOutput:Length of the black line on the road: 6Maximum number of overlaps: 3Maximum number of overlaps Length of black line: 2 The first row is a positive integer N, there are N line segments for drawing black lines.Then there are the integer values of the start point coordinates and the end point coordinates of the line segment of the black line. Sample 15160 180150 200280 300290 330190 210Output:Length of the black line on the road: 110Maximum number of overlaps: 2Maximum number of overlaps Length of black line: 40 Sample 21120 120Output:Length of the black line on the road: 0Maximum number of overlaps: 0Maximum number of overlaps Length of black line: 0
Consider a billboard that consists of n vertical panels of width 1 and varying integer heights, hanged down and held by a horizontal roller from the top. The panel i has a height h For the objective of placing two banners, it is allowed to move each panel up by any integer length using the roller. Once the necessary moves are completed, you may place two banners completely inside of the panels. Based on the above description, what is the maximum total area that you can provide for the two posters? Output Print a single integer- the maximum total area the two posters can cover together. Example 1: 6 Input: Output: 18 Input The first line of input contains one integer n (1
Devon designs a computer algorithm that gives users a movie recommendation based on information entered into a viewer profile. Users are asked to rate the recommendation as either "good" or "bad." After testing the algorithm, Devon concludes that the algorithm offers good movie recommendations in 87% of all cases, with a 3% margin of error. Devon expects the algorithm to offer approximately 5,000 movie recommendations this month, and he wants to calculate the number of recommendations that are expected to be "good." What would the likely range of "good" recommendations be? A. 1,400 to 4,550 good recommendations B. 4,100 to 4,550 good recommendations C.4,200 to 4,500 good recommendations D. 4,285 to 4,459 good recommendations
Write and implement the best first search algorithm where we have given the Start state and Goal state and we want to reach the goal state. 4 7 3 1 8 2 5 6 Initial state 1 2 3 8 4 7 6 5 Goal state
You are given the midsem and endsem marks for the N Students in the course. A student P is said to dominate a student Q, if the midsem and endsem marks of P are both greater than the respective midsem and endsem marks of Q. Design an efficient algorithm for finding all the students that are not dominated by any other student in the class.
There are a set of courses, each of them requiring a set of disjoint time intervals. For example, a course could require the time from 9am to 11am and 2pm to 3pm and 4pm to 5pm. You want to know, given a number K, if it’s possible to take at least K courses. You can only take one course at any single point in time (i.e. any two courses you choose can’t overlap). Show that the problem is NP-complete, which means that choosing courses is indeed a difficult thing in our life. Use a reduction from the Independent set problem.
an iterative algorithm for separating n VLSI chips into those that are good and those that are bad by testing two chips at a time and learning either that they are the same or that they are different. To help, at least half of the chips are promised to be good. Now design (much easier) a randomized algorithm for this problem. Here are some hints.Randomly select one of the chips. What is the probability that the chip is good? How can you learn whether or not the selected chip is good? If it is good, how can you easily partition the chips into good and bad chips? If the chip is not good, what should your algorithm do? When should the algorithm stop? What is the expected running time of this algorithm?
In the maze-solving program presented in this chapter, the program un marks each square as it retreats during its backtracking phase. Since this removes the marks from the blind alleys that the program tries along the way, this process ensures that the final path will be displayed correctly.. However, if the goal is to find the finish square in the shortest possible time, it is more efficient to leave these markers in place. Discuss how this change affects the efficiency of the algorithm. In what situations would this new approach improve the program's performance?