Did you know that a beautiful gold triangle was introduced to India in the early 13th century? Well, I'm referring to the famous South Asian candy, Samosa. I think it's hard to write it while thinking about Samosa, especially if you're so hungry right now; so let's not get into any recipe or food game. You have N boxes in Samosas, where each box is a cube. To pack the box, you need to use a rubber band (pseudo-circular, elastic band) by placing it next to the box (4 faces of a cube). The rubber band A (R1, R2) has an initial radius of R1 and can be expanded in size up to R2 without breaking. You can pack a cubic box of side length L using a 4 * L round rubber band (see Notes for clarity). Given the M- band bands and their first radius and the main radius, we need to match (provide) some rubber bands and boxes. The box needs at least one rubber band to pack and of course, each rubber band can be used to pack at least one box. Find the maximum number of boxes we can pack

Did you know that a beautiful gold triangle was introduced to India in the early 13th century? Well, I'm referring to the famous South Asian candy, Samosa. I think it's hard to write it while thinking about Samosa, especially if you're so hungry right now; so let's not get into any recipe or food game. You have N boxes in Samosas, where each box is a cube. To pack the box, you need to use a rubber band (pseudo-circular, elastic band) by placing it next to the box (4 faces of a cube). The rubber band A (R1, R2) has an initial radius of R1 and can be expanded in size up to R2 without breaking. You can pack a cubic box of side length L using a 4 * L round rubber band (see Notes for clarity). Given the M- band bands and their first radius and the main radius, we need to match (provide) some rubber bands and boxes. The box needs at least one rubber band to pack and of course, each rubber band can be used to pack at least one box. Find the maximum number of boxes we can pack

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

This needs to be done in Java! (Sales Commission Calculator) A large company pays its salespeople on a commission basis. The salespeople receive $200 per week plus 9% of their gross sales for that week. For example, a salesperson who sells $5,000 worth of merchandise in a week receives $200 plus 9% of $5,000, or a total of $650. You’ve been supplied with a list of the items sold by each salesperson. The values of these items are shown below. Develop a Java application that inputs one salesperson’s items sold for last week and calculates and displays that salesperson’s earnings. There’s no limit to the number of items that can be sold. Item Value 1 239.99 2 129.75 3 99.95 4 350.89 Example Output: Enter number sold of product #1: 10Enter number sold of product #2: 20Enter number sold of product #3: 30Enter number sold of product #4: 40Earnings this week: $2182.61 NOTES: Do not create a separate class for this program. Create the…
Use Python & Don't use any python Library. You can use Random.randint() only. 3. Suppose you have been hired to develop a musical chair game. In this game there will be 7 participants and all of them will be moving clockwise around a set of 7 chairs organized in a circular manner while music will be played in the background. You will control the music using random numbers between 0-3.lf the generated random number is 1, you will stop the music and if the number of participants who are still in the game is n, the participants at position (n/2) will be eliminated. Each time a participant is eliminated, a chair will be removed and you have to print the player names who are still in the game. The game will end when there will be only one participant left. At the end of the game, display the name of the winner. [Hint: You will need to invoke a built-in method to generate a random number between 0 (inclusive) to 3 (inclusive)]
One way to put a list of people into teams is by counting off. For example, if the list of people is: ['paul', 'francois', 'andrew', 'sue', 'steve', 'arnold', 'tom', 'danny', 'nick', 'anna', 'dan', 'diane', 'michelle', 'jeremy', 'karen'] and the number of teams desired is four, then you assign the people to teams 0, 1, 2, 3, 0, 1, 2, 3, etc. like this: [['paul', 'steve', 'nick', 'michelle'], ['francois', 'arnold', 'anna', 'jeremy'], ['andrew', 'tom', 'dan', 'karen'], ['sue', 'danny', 'diane']] Write the code for the following function. Do not assume that the list of people will divide evenly into the desired number of teams. If the list of people does not divide evenly into the desired number of teams, the teams will simply have unequal sizes. Do not assume that the number of people is at least as large as the number of teams. If there aren't enough people to cover the teams, some (or even all) teams will simply be empty. Hint: The range function will be very helpful. def form_teams…
Using Python For this assignment, we’re going to build our own song remixing solution. As an example: given the following American children’s song (this is ONE of the 3 songs I’m giving you in the starter code that includes the data you'll use for your program): SONG = ['old macdonald had a farm - ee-i-ee-i-o.', 'and on that farm he had a cow - ee-i-ee-i-o.', 'with a moo moo here and a moo moo there', 'here a moo - there a moo - everywhere a moo moo', 'old macdonald had a farm - ee-i-ee-i-o.' ] Do This: Create a solution that allows users to: Load a new song from our playlist When requested, show the title of the song you’re currently remixing Continue the above operations on demand, until the user explicitly quits your program. Note that there is punctuation in some of the songs we've given you. When you remix a song, you should remove the punctuation (see the example reverse below). If you are unable to perform the remix, do NOT remove any…
In cpp Room contains nx n cubes (in rows and in columns). Each cube is white or black. You can get out of a white cube by going in one of the four directions horizontally or vertically (but you can't go outside the room). You can enter a black cube, but you can't exit it. There is a mouse and a piece of cheese in the room. The mouse is in a cube (0,0) - white, and the cheese in a cube (n-1, n-1) - black. The mouse can move from cube to cube according to the rules described above. Write a program that finds all the ways in which the mouse can move to the cheese, and if any, display it with ‘*’.
Write a program in C++ using C-style and array to allow the user to calculate the distance between cities on a map. Sounds pretty complicated, eh? Don't worry, we'll make a few simplifications here: The distances are calculated in map units on the 2D map. Each city is given a set of coordinates relative to some point on the map. We'll call this origin (0,0). There can only be a finite number of cities in the system at a given time (you decide this maximum). But in order to make the system useful, we'll have to add a few other features: Each city has a name in addition to its coordinates (you can assume a maximum length for these names; but they must be able to hold spaces: Los Angeles, New York, etc.). The user selects what action to take from a menu: 1) Enter city Information 2) calculate Distance between two cities 3) Print All cities 4) Quit Make sure you allow them to choose their options by both the number and the capitalized letter(s) of the choice. They cannot…
Language is C++ The purpose of this project is to test your ability to use files, strings (Strings?), and libraries effectively in program design. A popular past-time is the word search puzzle (if you don't believe me, look in your daily paper and in the news stand in the check-out line at the grocery store). In such a puzzle, a grid of letters is presented which presumably contains words. However, the words are cleverly hidden among the other letters. Their camouflage is aided by them being aligned in many different orientations: horizontal, vertical, diagonal, and sometimes even backwards! The person's goal is to find the words and circle each one. Most often the person is also given a list of the words which should be found: apple hananabs pear mpearoap banana npsgrape grape uleapnbm orange aenuraol agrafnel epanqust bananais located backwards across the top row. appledrops down from the last ain banana. pearis forwards from the first pin apple. grapeis on the line below this.…
Your objective is to write the solution to the 9 × 9 sudoku puzzle below. You must write in the digits 1 through 9 in each row such that no digit is repeated vertically, horizontally and in each box. In your solution, write each row on itsown line; and for each row, write each digit enclosed in square braces. For instance, if the row is (1, 2, 3, 4, 5, 6, 7, 8, 9), then you would type [1][2][3][4][5][6][7][8][9] for that row.
Language is C++ Rare Collection. We can make arrays of custom objects just like we’ve done with ints and strings. While it’s possible to make both 1D and 2D arrays of objects (and more), for this assignment we’ll start you out with just one dimensional arrays: directions as follows in the pictures
IN JAVA Alice and Bob are playing a board game with a deck of nine cards. For each digit between 1 to 9, there is one card with that digit on it. Alice and Bob each draw two cards after shuffling the cards, and see the digits on their own cards without revealing the digits to each other. Then Alice gives her two cards to Bob. Bob sees the digits on Alice’s cards and lays all the four cards on the table in increasing order by the digits. Cards are laid facing down. Bob tells Alice the positions of her two cards. The goal of Alice is to guess the digits on Bob’s two cards. Can Alice uniquely determine these two digits and guess them correctly? Input The input has two integers p,q (1≤p<q≤9) on the first line, giving the digits on Alice’s cards. The next line has a string containing two ‘A’s and two ‘B’s, giving the positions of Alice’s and Bob’s cards on the table. It is guaranteed that Bob correctly sorts the cards and gives the correct positions of Alice’s cards. Output If Alice can…
Java Code Dreamworld is known for his uniqueness and there are 2 different denomination coins in Dreamworld, 1-cent coins and 2 cents coins. They have two faces - heads and tails. Your job is to find a number of ways to make a line order for these coins using the so that their total value is N cents. The only condition in line planning is that the first coin in the plan should have heads at the top. All other coins can have tails or heads at the top. Take N = 2 as an example. Possible arrangements are (1H, 1H), (2H), (1H, 1T), where H is primary and T is the tail. So, there are 3 possible plans that cost 2 cents. Input: 1 3 Output: 8 00
In the classic problem FizzBuzz, you are told to print the numbers from 1 to n. However,when the number is divisible by 3, print "Fizz''. When it is divisible by 5, print "Buzz''. When it isdivisible by 3 and 5, print"FizzBuzz''. In this problem, you are asked to do this in a multithreaded way.Implement a multithreaded version of FizzBuzz with four threads. One thread checks for divisibilityof 3 and prints"Fizz''. Another thread is responsible for divisibility of 5 and prints"Buzz''. A third threadis responsible for divisibility of 3 and 5 and prints "FizzBuzz''. A fourth thread does the numbers.