There are 50 lighting lamps, numbered 1 to 50, on a car race track. Initially all lamps are off. 10 cars numbered from 1 to 10 complete the track on the race track one by one. So, after a car completes track, the next car stars completing the the track. When the car passes in front of the lamp, if the number of the lamp is exactly divided by the number of the car, the lighted lamp turns OFF and the dimed lamp is turned ON. Write the program that finds out and displays on the screen which lamps are ON and which lamps are OFF, after the tenth car comples the track. After 18 cars finish race track driving : Lanps that are ON : 149 11 12 13 14 15 17 18 19 20 21 23 27 29 31 35 37 41 42 43 44 47 Lanps that are 0FF : 235678 18 16 22 24 25 26 28 30 32 33 34 36 38 39 40 45 46 48 49 50

There are 50 lighting lamps, numbered 1 to 50, on a car race track. Initially all lamps are off. 10 cars numbered from 1 to 10 complete the track on the race track one by one. So, after a car completes track, the next car stars completing the the track. When the car passes in front of the lamp, if the number of the lamp is exactly divided by the number of the car, the lighted lamp turns OFF and the dimed lamp is turned ON. Write the program that finds out and displays on the screen which lamps are ON and which lamps are OFF, after the tenth car comples the track. After 18 cars finish race track driving : Lanps that are ON : 149 11 12 13 14 15 17 18 19 20 21 23 27 29 31 35 37 41 42 43 44 47 Lanps that are 0FF : 235678 18 16 22 24 25 26 28 30 32 33 34 36 38 39 40 45 46 48 49 50

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

A flight of stairs has 10 steps numbered 1 to 10 as shown in the figure below. i. How many ways could you climb up the set of stairs, assuming that you can skip any number of stairs with each step, but you must end on step 10 and you can only go up, never down and never remaining on the same step. ii. How many ways could you climb up the set of stairs, assuming you take exactly 4 steps. Again, your staircase climb ends on step 10. JAlthough there are different ways in which you could solve this problem, model the problem as a balls and bins problem for full credit.
Given two integers, a and b, return true if a can be divided evenly by b. Return false otherwise. Examples divides Evenly (98, 7) true // 98/7 = 14 → divides Evenly (85, 4) false // 85/4 = 21.25 → Notes a will always be greater than or equal to b.
1. Determine if the expression: (!( a>=b) || !( a==c )) is True or False. Given the value of a is 2, b is 10 and c is -5. 2. Determine if the expression: ! (!(a>b) && ( a==c) || ( a>=b ) ) is True or False. Given the value of a is 2, b is 10 and c is -5. 3. Determine if the expression: !( b>c ) || ( c<5 ) is True or False. Given the value of b is 10 and c is -5.
The automatic soft-drinks vending machine (SVM) is free and self checking every 10 minutes. After receiving the cash, the SVM waits for the user to select the desired drink. After the user makes a choice, the SVM checks whether the amount of cash entered by the customer is enough to buy the drink. If it is enough, the selected drink will be output; otherwise, it will wait for the user to continue to invest in cash. If the user does not make up the cash within one minute, the cash will be returned. During the purchase process, if the user presses the "Cancel" button, the cash will be returned. Task: draw a state chart diagram for the SVM.
a) In the Hi-Lo game, the player begins with a score of 1000. The player is prompted for the number of points to risk and a second prompt asks the player to choose either High or Low. The player's choice of either High or Low is compared to random number between 1 and 13, inclusive. If the number is between 1 and 6 inclusive, then it is considered "low". A number between 8 and 13 inclusive is "high". The number 7 is neither high nor low, and the player loses the points at risk. If the player had guessed correctly, the points at risk are doubled and added to the total points. For a wrong choice, the player loses the points at risk. Create a HiLo application based on this specification. Application output should look similar to: High Low Gane RULES 1 through 6_are lou Nunbers 8 through 13 are high Number ? is neither high or low You have 1000 points. Enter points to risk: 500 Predict (1=High, 0=Low): 0 Nunber is 4 You win. Play again? y You have 2808 points. b) Modify the application to…
Practicing Loops. Einstein Private Elementary school has three classes in each of its 9 grades. 27 classes in total. It has kindergarten (grade 0) though 8th grade. The school allows parents to pay tuition over the nine-month school year. Tuition for kindergarten is $90 dollars every month. Tuition for the other grades is $50 times the grade level every month. (1st grade is $50 a month, second grade is $100 a month, etc.) Design a programming solution that outputs nine tuition payment bills for each of the 27 classrooms. Each bill must contain the grade number (0 through 8), the classroom number (1 through 3), the month (1 through 9) and the amount of the tuition due. Your output should look something like: Grade Classroom Month Tuition 0 1 1 90 0 1 2 90 0 1 3 90 0 1 4 90 ... 8 3 7 400 8 3…
Primary U.S. interstate highways are numbered 1-99. Odd numbers (like the 5 or 95) go north/south, and evens (like the 10 or 90) go east/west. Auxiliary highways are numbered 100-999, and service the primary highway indicated by the rightmost two digits. Thus, I-405 services I-5, and I-290 services I-90. Given a highway number, indicate whether it is a primary or auxiliary highway. If auxiliary, indicate what primary highway it serves. Also indicate if the (primary) highway runs north/south or east/west. Ex: If the input is: 90 the output is: I-90 is primary, going east/west. Ex: If the input is: 290 the output is: I-290 is auxiliary, serving I-90, going east/west. Ex: If the input is: 0 or any number not between 1 and 999, the output is: 0 is not a valid interstate highway number. This is the code I have but for some reason I keep getting errors. what am doing wrong? import java.util.Scanner; public class LabProgram {public static void main(String[] args) {Scanner scnr = new…
Assume you are playing a card game using a standard 52-card deck. You are dealt a hand of cards that are all the same suit, hearts. You are dealt first a 5, then a 3, then 8, and finally 4. You first grab the 8. Next you grab the 5 and place it in front of the 8. Then you take the 4 and place it in front of the 5. Finally, you take the 3 and place it in front of the 4. Which sorting algorithm is most similar to how you sorted your hand?Group of answer choices 1.Merge Sort 2.Selection Sort 3.Quick Sort 4.Insertion Sort
S-O-S is an internationally recognized distress signal. It consists of a sequence of 3 short signals, followed by 3 long signals, followed by 3 short signals, and then a pause. This pattern is then repeated over and over (indefinitely). Write an Arduino program that blinks the onboard LED in this manner. Your challenge is to turn the LED on no more than 3 times in the loop function.
Implement programs involving the use of while, do..while and for loop statement. Objectives: Topics Covered: Implementing programs using loops. Description FRIDAY THE 13TH When will Friday the 13th occur in 1990? Write a program that will find all months in 1990 in which the 13th falls on a Friday. You need to know the following. 1. January 1, 1990 was on a Monday. 2. September, April, June, and November have thirty days, all the rest have 31 except for February which has 28 except in leap years when it has 29. 3. 1990 is not a leap year. Note: To make it fair for everyone, you may not use any built-in date functions from your computer language. Sample Output if Applicable Sample Run In 1990, Friday the 13th occurs in the months: APRIL
PYTHON CODE FOR- Suppose an insurance company is insuring against burglary that happens with probability 0.1. The customer's wealth will be 40,000 if his or her home was broken in, and 50,000 otherwise. The insurance company pays 10,000 if a burglary happens, and 0 otherwise. The insurance policy costs 1,000. Simulate the average payoff to the insurance company if it sells to 100, 1000, or 10000 customers. Plot the histogram on a figure.
Control Loops: A high school 1000 students and 1000 lockers. The principal plays the following game: She asks dthe first student to open all the lockers. Shen then asks the second student to close all the even-numbered lockers. The third student is asked to check every third locker. If it is open, the student closes it; if it is closed, the student opens it. The remaining students continue this game . In general, the nth student checks every nth locker. If the locker is open, the student closes it; if it is closed, the student opens it. After all the students have taken their turns, some of the lockers are open and some are closed. Write a program thatprompts the user to enter the number of lockers in a school. After the game is over, the program outputs the number of lockers and the locker numbers of the lockers that are open. Test run your program for the following inputs: 1000, 5000, 10,000. Do you see any pattern developing for the locker numbers that are open in the output?…