Logic-2> make_bricks prev next | chance We want to make a row of bricks that is goal inches long. We have a number of small bricks (1 inch each) and big bricks (5 inches each). Return True if it is possible to make the goal by choosing from the given bricks. This is a little harder than it looks and can be done without any loops. See also: Introduction to Make Bricks make_bricks(3, 1, 8) → True 1,9) → False make_bricks(3, make_bricks(3, 2, 10)→ True Go ...Save, Compile, Run (ctrl-enter)

Logic-2> make_bricks prev next | chance We want to make a row of bricks that is goal inches long. We have a number of small bricks (1 inch each) and big bricks (5 inches each). Return True if it is possible to make the goal by choosing from the given bricks. This is a little harder than it looks and can be done without any loops. See also: Introduction to Make Bricks make_bricks(3, 1, 8) → True 1,9) → False make_bricks(3, make_bricks(3, 2, 10)→ True Go ...Save, Compile, Run (ctrl-enter)

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

You have a fence post located at the point (x,y) where a goat is tethered by a rope. You also have a house, which is a rectangle with diagonally opposite corners at the points bottom-left: (x1,y1) and top-right: (x2,y2). You want to pick a length of rope that guarantees the goat cannot reach the house. Determine the minimum distance from the fence post to the house, so that you can make sure to use a shorter rope. Recall that the distance formula is: sqrt( (x2−x1)^2+(y2−y1)^2 ) The input consists of a single line containing six space-separated integer values: x, y, x1, y1, x2, and y2. You are guaranteed that x1<x2 and y1<y2, and that (x,y) is strictly outside the axis-aligned rectangle with corners at (x1,y1) and (x2,y2). Return the minimum distance from the goat’s post to the house as a floating-point value from main(). Learning Objectives Be able to create a program with a lesser template. Be able to calculate the min/max of integers. Be able to write a mathematical…
._4Give back an you please give me a code that runs properly this time and give a proper output not an empty one Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.A region is captured by flipping all 'O's into 'X's in that surrounded region.For example, for the following board,X X X XX O O XX X O XX O X XAfter capturing all regions, the board becomesX X X XX X X XX X X XX O X XThe algorithm should take an input file, named “input.txt”, and output the resulting board in the console.Sample input.txt6X X X X X OX O X O O XX X O O O XX X X O X XX O X X O OX X X X X XThe first line is a number indicating the size of the board; in the above example, 6 means the board is .Output for in console:X X X X X OX X X X X XX X X X X XX X X X X XX X X X O OX X X X X X.
This is my code for a random guess game and whoever has the shortest distance to number 21 wins the game. I need help with looping this game so that it would show these things:Numbers of hands played:Dealer Wins: Player Wins:and if the player randon guess is 21 the code would then exit and say thanks for playing. import random win = 21 dealer = 50 print('Player pick a number between 1-100') guess = random.randint(0,100) print('Player Guess:') print(guess) dealerdist = abs(dealer-win) playerdist = abs(guess-win) if (playerdist > dealerdist): print('Dealer Wins!') if (playerdist < dealerdist): print('Player Wins!')
I was provided with the following code. However, when executing it goes to an infite loop and cannot seem to ppass by that. public int compares(Card c1, Card c2){ // TODO: implement this method if(c1.getSuit() > c2.getSuit()) return 1; if(c1.getSuit() < c2.getSuit()) return -1; else { if(c1.getRank() > c2.getRank()) return 1; if (c1.getRank() < c2.getRank()) return -1; else return 0; } public void quickSortRec(Card[] cardArray, int first, int last) { if (first < last) { int splitPoint; splitPoint = split(cardArray, first, last); quickSortRec(cardArray, first, splitPoint); quickSortRec(cardArray, splitPoint + 1, last); }} public int split(Card[] cardArray, int first, int last){ Card splitValue = cardArray[first]; while(first <= last) { while(compares(cardArray[first],splitValue) == -1) { first++;…
Can you implement the Student class using the concepts of encapsulation? A solution is placed in the "solution" section to help you, but we would suggest you try to solve it on your own first. You are given a Student class in the editor. Your task is to add two fields: ● String name ● String rollNumber and provide getter/setters for these fields: ● getName ● setName ● getRollNumber ● setRollNumber Implement this class according to the rules of encapsulation. Input # Checking all fields and getters/setters Output # Expecting perfectly defined fields and getter/setters. There is no need to add constructors in this class.
Suppose you can buy chocolate bars from a vending machine for $1 each.Inside every chocolate bar is a coupon. You can redeem 7 coupons for 1chocolate bar from the machine.For example, if you have $20, you can initially buy 20 chocolate bars.This gives you 20 coupons. You can redeem 14 coupons for 2 additionalchocolate bars. These 2 chocolate bars have 2 more coupons, so you now have atotal of 8 coupons. This gives you enough to redeem for 1 final chocolate bar.Write a recursive function that would accept the amount of dollars andcoupons as its parameters and output the total number of chocolate bars thatcan be bought (including those redeemed via coupons).Write a test program in C++that would allow the user to enter amount of dollarsand then use the recursive function to compute the number of chocolate barsthe user can buy, and output the number to the screen.
The third logical operator is OR(). This returns TRUE when any of its inputs is TRUE. For example, OR(FALSE, TRUE, FALSE) returns TRUE since the second input is TRUE, but OR(FALSE, FALSE, FALSE) returns FALSE since all its inputs are FALSE. In column H, find women who are white or have over 12 years of school In column I, find women who match the previous condition and get unemployment insurance benefits. In cell A28, define a filter to return only the rows that match conditions in column I. please show the excel solution of "is white or has over 12 years experience"and " is white or has over 12 years experience) and gets unemployment insurance benefits?",thank you :) Has young kids? Is head of household? Gets unemployment insurance benefits? Is white or has over 12 years experience? (Is white or has over 12 years experience) and gets unemployment insurance benefits? FALSE TRUE TRUE FALSE FALSE FALSE FALSE TRUE TRUE FALSE FALSE FALSE TRUE TRUE TRUE…
can you solve this please? Adopt appropriate Java animation code to implement the video in the file “test4.wmv” and given that the parametric equation for a circle. x=r*cos(t) y=r*sin(t) with t in range [0, 2p] and r is the radius of the circle. (the circle goes in a loop like in the images, i did my best to try to explain it , please try to do it ) and here is a sample of what they want me to use : package javaapplication1;import java.awt.*;import java.awt.event.*;import javax.swing.*;import java.awt.geom.*;import java.util.Random;import javax.imageio.*;import java.io.File;import java.io.IOException;import java.awt.image.BufferedImage;import java.awt.event.*;import java.util.Calendar; public class JavaApplication1 extends JApplet { public static void main(String[] args) { JFrame frame=new JFrame(); frame.setTitle("hello"); frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); JApplet applete =new JavaApplication1(); applete.init();…
c++ prgoram which traces the mouse's path to the cheese. Тhe mouse must go this road in RED LINE, and can enter the black box where the cheese is
Implement the design of the Patient class so that the following output is produced:[For BMI, the formula is BMI = weight/height^2, where weight is in kg and height inmeters] Driver Code # Write your code herep1 = Patient("A", 55, 63.0, 158.0)p1.printDetails()print("====================")p2 = Patient("B", 53, 61.0, 149.0)p2.printDetails() Output
The number of permutations of a set of n items taken r at a time is given by the followingformulan!/r!(n−r)!: where n! is the factorial of n, r! is the factorial of r, and (n-r)! is thefactorial of the result of n-r. The factorial of a number n can be solved using the followingformula: n!=e−nnn√ 2πn.If there are 18 people in your class and you want to divide the class into programming teams of 3members, you can compute the number of different teams that can be arranged using this formula(n!/r!(n−r)!).Write a C++ program that determines the number of potential team arrangements. You will needto use the double type for this computation. Use the Lab Template you set-up last week, properformatting, and appropriate comments in your code. The output must be labeled clearly andformatted neatly.
The concentration (C) of insulin in the body is described by the following equation C = C0e^-40t / M Where C0 = 85 pmol/L is the initial insulin concentration, t is time in minutes, M is the person mass in kg. a) Write code that will calculate the insulin concentration of two people with weighs 60 Kg and 100 Kg. Simulate the insulin concentration for 4 minutes in steps of 0.1 minute. b) Plot the insulin concentration of the two people on the same graph. For the first curve plot a magenta solid line, square marker, cyan for MarkerFaceColor, and MarkerSize of 6. For the second curve plot a black dashed line with LineWidth of 2. c) Your plot should have a title, a legend, and appropriate labels for the x and y axis.