Computer Science: An Overview (13th Edition) (What's New in Computer Science)
13th Edition
ISBN: 9780134875460
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 5, Problem 1CRP
Program Plan Intro
Expert Solution & Answer
Explanation of Solution
Example of algorithm:
The algorithm is unceremoniously defined as the set of statement or steps being performed to achieve a desired result. Figure 5.1 states: “An algorithm is an ordered set of unambiguous, executable steps that defines a terminating process”.
Take the example of the process for making tea.
- Pour water in vessel.
- Add tea leaves in the vessel.
- Put the vessel to boil.
The above set of statements conform an informal statement that describes the steps to complete a particular task. But these statements have no relation or don’t conform to the formal definition of the algorithm. The above statements are not conforming because there is ambiguity in each step, which means there is no perfect ending point for the particular set of statements.
Want to see more full solutions like this?
Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
Write a simple code (python). Given a list of n elments with each element between 1 and n. determine whether there are any duplicates.
Then find the following:
1. What does the algorithms compute?
2. What is its basic operation?
3. How many times is the basic operation executed?
4. What is the efficiency class of the algorithm?
Keep in mind it's an Analysis of Algorithms course.
Give an example of a dynamic, quicksort algorithm and a greedy
algorithm. Don' t forget to include the title, a brief description of
the algorithm, the algorithm's input and output, and the functions
that contain the algorithm's instructions.
RECURSIVE PYTHON
The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the fibonacci() function, which takes in an index, n, and returns the nth value in the sequence. Any negative index values should return -1.
Ex: If the input is:
7
the output is:
fibonacci(7) is 13
Note: Use recursion and DO NOT use any loops.
# TODO: Write recursive fibonacci() functiondef fibonacci():
if __name__ == "__main__": start_num = int(input()) print('fibonacci({}) is {}'.format(start_num, fibonacci(start_num)))
Chapter 5 Solutions
Computer Science: An Overview (13th Edition) (What's New in Computer Science)
Ch. 5.1 - Prob. 1QECh. 5.1 - Prob. 2QECh. 5.1 - Prob. 3QECh. 5.1 - Suppose the insertion sort as presented in Figure...Ch. 5.2 - A primitive in one context might turn out to be a...Ch. 5.2 - Prob. 2QECh. 5.2 - The Euclidean algorithm finds the greatest common...Ch. 5.2 - Describe a collection of primitives that are used...Ch. 5.3 - Prob. 2QECh. 5.3 - Prob. 3QE
Ch. 5.3 - Prob. 4QECh. 5.4 - Modify the sequential search function in Figure...Ch. 5.4 - Prob. 2QECh. 5.4 - Some of the popular programming languages today...Ch. 5.4 - Suppose the insertion sort as presented in Figure...Ch. 5.4 - Prob. 5QECh. 5.4 - Prob. 6QECh. 5.4 - Prob. 7QECh. 5.5 - What names are interrogated by the binary search...Ch. 5.5 - Prob. 2QECh. 5.5 - What sequence of numbers would be printed by the...Ch. 5.5 - What is the termination condition in the recursive...Ch. 5.6 - Prob. 1QECh. 5.6 - Give an example of an algorithm in each of the...Ch. 5.6 - List the classes (n2), (log2n), (n), and (n3) in...Ch. 5.6 - Prob. 4QECh. 5.6 - Prob. 5QECh. 5.6 - Prob. 6QECh. 5.6 - Prob. 7QECh. 5.6 - Suppose that both a program and the hardware that...Ch. 5 - Prob. 1CRPCh. 5 - Prob. 2CRPCh. 5 - Prob. 3CRPCh. 5 - Select a subject with which you are familiar and...Ch. 5 - Does the following program represent an algorithm...Ch. 5 - Prob. 6CRPCh. 5 - Prob. 7CRPCh. 5 - Prob. 8CRPCh. 5 - What must be done to translate a posttest loop...Ch. 5 - Design an algorithm that when given an arrangement...Ch. 5 - Prob. 11CRPCh. 5 - Design an algorithm for determining the day of the...Ch. 5 - What is the difference between a formal...Ch. 5 - Prob. 14CRPCh. 5 - Prob. 15CRPCh. 5 - The following is a multiplication problem in...Ch. 5 - Prob. 17CRPCh. 5 - Four prospectors with only one lantern must walk...Ch. 5 - Starting with a large wine glass and a small wine...Ch. 5 - Two bees, named Romeo and Juliet, live in...Ch. 5 - What letters are interrogated by the binary search...Ch. 5 - The following algorithm is designed to print the...Ch. 5 - What sequence of numbers is printed by the...Ch. 5 - Prob. 24CRPCh. 5 - What letters are interrogated by the binary search...Ch. 5 - Prob. 26CRPCh. 5 - Identity the termination condition in each of the...Ch. 5 - Identity the body of the following loop structure...Ch. 5 - Prob. 29CRPCh. 5 - Design a recursive version of the Euclidean...Ch. 5 - Prob. 31CRPCh. 5 - Identify the important constituents of the control...Ch. 5 - Identify the termination condition in the...Ch. 5 - Call the function MysteryPrint (defined below)...Ch. 5 - Prob. 35CRPCh. 5 - Prob. 36CRPCh. 5 - Prob. 37CRPCh. 5 - The factorial of 0 is defined to be 1. The...Ch. 5 - a. Suppose you must sort a list of five names, and...Ch. 5 - The puzzle called the Towers of Hanoi consists of...Ch. 5 - Prob. 41CRPCh. 5 - Develop two algorithms, one based on a loop...Ch. 5 - Design an algorithm to find the square root of a...Ch. 5 - Prob. 44CRPCh. 5 - Prob. 45CRPCh. 5 - Design an algorithm that, given a list of five or...Ch. 5 - Prob. 47CRPCh. 5 - Prob. 48CRPCh. 5 - Prob. 49CRPCh. 5 - Prob. 50CRPCh. 5 - Prob. 51CRPCh. 5 - Does the loop in the following routine terminate?...Ch. 5 - Prob. 53CRPCh. 5 - Prob. 54CRPCh. 5 - The following program segment is designed to find...Ch. 5 - a. Identity the preconditions for the sequential...Ch. 5 - Prob. 57CRPCh. 5 - Prob. 1SICh. 5 - Prob. 2SICh. 5 - Prob. 3SICh. 5 - Prob. 4SICh. 5 - Prob. 5SICh. 5 - Is it ethical to design an algorithm for...Ch. 5 - Prob. 7SICh. 5 - Prob. 8SI
Knowledge Booster
Similar questions
- C programming Implement an encoder. When completed, your program should be able to accept a short sentence from the user and display an encrypted version of it. For simplicity, let us assume one case of letters throughout, say CAPITALS. We can use a substitution method to scramble a sentence and then use the reverse of this process to recover it. If we take two rows of the alphabet and shift the bottom row along a specified amount (our key), we can then read the letters in our sentence from the top row and use the substituted letter from the bottom row to form the encrypted sentence. A B C D E F G H I J K L M N O P Q R S T U V W X Y Z X Y Z A B C D E F G H I J K L M N O P Q R S T U V W In the example above, the key is 3, hence the second row is shifted by three characters along. Take, for instance, the sentence “HELLO”. Each letter of your message should be replaced by the letter in the alphabet that comes three letters before. For “HELLO” that would be: EBIIL Your program is required…arrow_forwardusing recursion python Consider the English alphabet consisting of 26 lowercase letters: a, b, c, · · ·, x, y, z. • To this order, letters appear earlier are defined smaller. For example, the letter a is smaller than the letter b, and z is the largest letter since it appears last in the alphabet. • The least letter of an English word is the smallest letter that appears in that word. For example, the least letter of “Saturday” is “a”, and the least letter of “hello” is “e”. You are asked to write a program consisting of a function and a main interface as follows. (a) function recur_least_letters(l): Goal: collects all the least letters of words in list l (one least letter for each word) and returns the string of the obtained least letters in the order that the corresponding words appear in list l. • Input: a list l of English words • Output: string of all the least letters of words appearing in list l • Example: input: l = [‘today’, ‘is’, ‘saturday’] → output: “aia” Recursion is…arrow_forwardExercise 1.A set W of strings of symbols is defined recursively by a, b, and d belong to W. If x belongs to W, so does a(x)d. Provide 3 strings made of 3 letters each belonging to W and show the procedure used to obtain them. Provide 3 strings made of at least 5 letters each belonging to W and show the procedure used to obtain them.arrow_forward
- A graph is a collection of vertices and edges G(V, E). A weighted graph has weights (numbers, etc.) on every edge. A multigraph can have more than one edges between any vertices. Explain why a person should use a weighted graph instead of a multigraph. Give examples. An adjacency matrix might be a better choice for speeding up a program, however, it consumes huge memory for large graphs. How this situation can be improved? What programming constructs better suit graph representation? Explain with examplearrow_forwardImplement a sorting algorithm of your choice in Java and What are some factors to consider when determining which sorting algorithm would be best to utilize? In your answer, specifically think of and give a real-life scenario where: A given sorting algorithm is used One algorithm outperforms the other Please and Thank youarrow_forwardUse JFLAP to represent a Turing machine that represents the following algorithm. given alphabet is a, b, c, and x. and the regx is (a+b+c)m where m>= 3, make a machine that reads the first character places an x backs up and puts the original character down. The machine is then to ff past ALL a,b,c then ff past all x to the next a,b,c. read that character replace it with an x, rewind past all x, past all a,b,c to the next blank and put it down. Continue until there are only blanks past the x characters.arrow_forward
- Consider the Sort-and-Count algorithm explained in section 5.3 of our text: "Counting Inversions"Suppose that the initial list is: 92 71 36 91 27 48 14 34 81 26 24 65 78 51 37 22 Sort-and-Count makes two recursive calls. The first recursive call inputs the first half of the initial list: 92 71 36 91 27 48 14 34 and returns the sorted version of the first half, as well as the number of inversions found in the first half (22). The second recursive call inputs the second half of the initial list: 81 26 24 65 78 51 37 22 and returns the sorted version of the second half, as well as the number of inversions found in the second half (19). Sort-and-Count then calls Merge-and-Count. To Merge-and-Count, Sort-and-Count passes the sorted versions of the two halves of the original list: 14 27 34 36 48 71 91 92, and 22 24 26 37 51 65 78 81 Merge-and-Count begins merging the two half-lists together, while counting…arrow_forwardHello, can you please help me do exercise 3 (with subparts 1,2,3, and 4)? Thank you so much!arrow_forwardPython In the football league, there are n teams divided equally into four divisions. Within each division, every team plays every other team twice per season. What is the time complexity of this procedure? State all assumptions and show workings. Detailed answer pleasearrow_forward
- Consider the definition of Fibonacci series: where Fo = 0, F1 = 1, F, = 1, and the recursive term is defined as Fn+1 = Fn + Fn-1- Given these, prove FoF1 + F¡F2 + ...+ F2n-1Fan F, using mathematical induction.arrow_forwardDevelop two algorithms, one based on a loop structure and the other on a recursive structure, to print the daily salary of a worker who each day is paid 2.5 times the previous day’s salary (starting with one penny for the first day’s work) for a 30-day period. What problems relating to number storage are you likely to encounter if you implement your solutions on an actual machine?arrow_forwardWrite a C program to traverse a maze, A maze is a two dimensional table with values 0 and 1, A 1 mean a way and a 0 mean a block. The maze has 8 directions to visit from any cell, except the first and the last row. The directions are east, west, north ,north-west..... Given is a sample maze. Find the way through the maze. 0 0 1 0 1 0 1 0 1 0 0 0 0 1 1 0 1 1 0 0 0 0 0 1 0 0 1 0 1 0 0 0 1 0 1 Output should have a path (excluding wrong moves) specified by rows and columns of the elements traversed from beginning to end of the maze.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