Write an algorithm as following: 1- Create a list called Numbers 2- Prompt the user to enter Integer number between (30-100)numbers to the list 3- Keep asking the user to enter his friend name until he enter 0 to exit from the loop 4- Once the user press 0 "Display a message for the user to "press a space bar" to print all numbers above 50 5- Once you print and all, then display a message said “Thank you " You can use the OUBUILD syntax to write your algorithm

Write an algorithm as following: 1- Create a list called Numbers 2- Prompt the user to enter Integer number between (30-100)numbers to the list 3- Keep asking the user to enter his friend name until he enter 0 to exit from the loop 4- Once the user press 0 "Display a message for the user to "press a space bar" to print all numbers above 50 5- Once you print and all, then display a message said “Thank you " You can use the OUBUILD syntax to write your algorithm

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

Answer with proper explanation and step by step solution.
Please assist me with these questions. Devise an algorithm to receive a positive number, n, and output all prime numbers that are smaller than n and have the digit 5. For example, if n is 100, the program should output 5, 53 and 59. Your solution should have a main algorithm and two sub-algorithms, let's call them prime(num) and has5(num). Trace your algorithm and sub-sub-algorithm for the input 15. You should provide pre- and post-conditions for all your 3 (sub)algorithms. I also need help with creating JavaScript code for the flowchart provided below. Note: You will have to implement several functions that require multiple inputs (e.g., 12, 2, -3, 6, -11, -3, 1, -1). In these cases, accept as input a comma-delimited string (i.e., "12,2,-3,6,-11,-3,1,-1"). Then, break the comma-delimited string into a series of integers for processing with your algorithm. Thank you
Describe the algorithm to solve this problem.
Write pseudocode to solve the following problem. Must use iterative dynamic programming (tabulation) and run in O(n) time. Input: positive integer n Output: two non-negative integer x and y where n = x185 + y120 Example: if n=1230 then x=6 and y=1 (1314 = 6(185) + 1(120))
The following code implements Newton's algorithm for finding the square root of a number using repetition: n = 17 # we want the square root of 17 for exampleg = 4 # our guess is 4 initiallyerror = 0.0000000001 # we want to stop when we are this closewhile abs(n - (g**2)) > error: g = g - ((g**2 - n)/(2 * g))# g holds the square root of n at this point Implement this algorithm in a function sqRoot(n), that returns the square root using recursion. Assume that the function will be called with positive numbers only. Note: Your initial guess cannot be zero!
Please use python language. Write a recursive program to find the sum of first n numbers. sum = 1 +2 + 3 + …….n