Ahmad wanted an algorithm to list her favourite games. He wanted to be able to enter a favourite game to be added to the list. He did not want duplicated on the final list but did want to be told, having entered proposed game, either that it was a duplicate or that had been added to the list. Or he can enter the list of favourites and then the algorithm will delete the duplicated one

Ahmad wanted an algorithm to list her favourite games. He wanted to be able to enter a favourite game to be added to the list. He did not want duplicated on the final list but did want to be told, having entered proposed game, either that it was a duplicate or that had been added to the list. Or he can enter the list of favourites and then the algorithm will delete the duplicated one

Np Ms Office 365/Excel 2016 I Ntermed

1st Edition

ISBN:9781337508841

Author:Carey

Publisher:Carey

Chapter5: Working With Excel Tables, Pivottables, And Pivotcharts

Section: Chapter Questions

Problem 3.3CP

See similar textbooks

Similar questions

Suppose a line segment starts at (x0, y0) and ends at (x1, y1) where, x0, y0, x1 and y1 are sequentially the first, second, third and fourth pair of digits from the left in your student ID. STUDENT ID: 21341040 Q:- Simulate the midpoint line drawing algorithm to find the first four intermediary pixels of this line after (x0, y0); or, all of them if the line reaches (x1, y1) in less than four pixels.
Write a python program to: Find all rows with a title of "Limitless" Find all rows with a director of "Robert Rodrigues" and a type of "Movie" Find all rows with either a date_added of "2019-07-31" or director of "Robert Altman" Find all rows with a director of "Orson Welles","Aditya Kripalani" or "Sam Raimi". Find all rows that have a date_added value between May 1, 2019 and June 1,2019 Drop all rows with a NaN value in the director column. Identify all days when only one movie was added to Netflix catalog. Note: the question come with a csv file that contains all the necessary data. the csv file looks like this
Consider printing neatly the silly text “This week has seven datesin it ok” in a column with width M = 11. This is represented as the printing neatlyinstance M;l1, ... , ln=11; 4, 4, 3, 5, 5, 2, 2, 2. (a) Fill in the birdAdvice[0..n] andcost[0..n] tables for this example. The original instance, its solution, and its cost arein the bottom row. (b) When filling in this last row, give solutions and costs associatedwith each of the possible bird answers
Suppose you have a knapsack that can carry up to 17 pounds. You can only put certain items, and each item has a weight and a value. You want to put the items that will give you the highest possible value, but you can only carry up to 15 pounds. Here are the items you can put and their weights and values: I Weight value Value/Weight 1 2 10 5 2 4 30 7.5 3 6 50 8.33 4 9 70 7.78 5 10 80 8 Table 1: Caption Your task is to solve the Knapsack Problem using a greedy approach.Hints:- Sort the items by their value-to-weight ratio in descending order. Start with the item with the highest value-to-weight ratio and add it to the knapsack. - Continue adding items to the knapsack in descending order of their value-to-weight ratio until the knapsack is full or there are no more items left. - Your solution should output the total value of the items in the knapsack and the list of items that you have put. -This…
D1) Suppose that we have t = 5 treatments and we can only have blocks of size three. .(a) Find the smallest BIBD (fewest number of blocks). Give the values of r and λ .(b) If we could have blocks of size four, can we run a BIBD? Is there an advantage over the design in part (a)? .(c) Write out the layout of the design from part (b) showing how to arrange the treatments in blocks.
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
The problem of finding one string within another comes up quite often. Searching through files on disk, DNA searches, and even Google rely on strategies for efficiently searching through text using mostly algorithms. The brute-force algorithm is very straightforward and quite widely used which actually performs pretty well in most cases.Using the brute-force search algorithm, look for the patterns in their text and also determine how far you need to search by calculating for the pattern shift.PatternsText(i)thingEverything(ii)babaaababaa
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.
Let’s consider a long, quiet country road with houses scattered very sparsely along it. (We can 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. Give the psudo code.
Substitution ciphers are encryption/decryption algorithms that replace one letter or number with another. The first attested use of a substitution cipher in military affairs was by Julius Caesar, described by him in Gallic Wars (cf. Kahn pp83-84). In caesar cipher , you replace each letter by 3rd letter on. If it is out of bound (later than Z), then round to the head (letter A) and continue the shift. For example:meet me after the toga party PHHW PH DIWHU WKH WRJD SDUWB Please write a program in Java to implement the Caesar Cipher: a. Implement the encryption algorithm. Ask the user to input one all lower case normal sentence (called plaintext) using the nextLine method, and then output the encrypted text (called ciphertext). b. Implement the decryption algorithm. Ask the user to input one encrypted sentence (i.e. ciphertext) using the nextLine method, and then output the decrypted text (i.e. plaintext).
In the Flipping Pancakes box, the original algorithm given requires at most 2n − 3 flips in the worst case. The claim is made that the new algorithm, which requires at most (5n + 5)/3 flips, is a better algorithm. How many pancakes do you need to have before the second algorithm is indeed faster? Perform a selection sort on the list 7, 4, 2, 9, 6. Show the list after each exchange that has an effect on the list ordering. The selection sort algorithm could be modified to stop when the unsorted section of the list contains only one number because one number must be in the correct position. Show that this modification would have no effect on the number of comparisons required to sort an n-element list.
You are given a 2 by n grid, where the cell on row i column j contains a non-negative number ai,j . You can start at either cell in the lefttmost column, and your goal is to reach either cell in the rightmost column by a sequence of moves. You can move to an adjacent cell (if it exists) in each of the 4 cardinal directions (up,down, left and right). A path achieves a score equal to the sum of values in its cells. Note that a cell which is used twice in a path only counts its value once to the score of that path.Design an algorithm which runs in O(n) time and finds a path of minimum score from the leftmost column to the rightmost column.