The Ancient Mesopotamians associated each of their deities with a sacred number. Anartist has created figurines of the main deities with the weight corresponding to theirrespective number. The artist wants to ship the figurines to an art gallery using boxeseach holding a maximum weight of 90 kilograms. The numbers in the table representthe weight in kilograms of the figurines:figurineAdadAnumEaEnlilGirraIshtarMardukNinlilNinurtaNuskanumber / weight [kg]6604050101510455010Shamash2014ShakanSin30(a) Find the lower bound & for the number of boxes required to fit all figurines.(b) Use the first fit decreasing algorithm to estimate the minimum number of boxesrequired to ship all figurines. Does the first fit decreasing algorithm give an optimalsolution?(c) Find by trial and error a solution needing only l boxes.

(a) As it is given that the maximum weight that a box can hold is 90 Kg and there are various…

I the lower bound for the number of boxes required the first fit decreasing algorithm to estimate the mi ired to ship all figurines. Does the first fit decreasing tion? I by trial and error a solution needing only & boxes

I the lower bound for the number of boxes required the first fit decreasing algorithm to estimate the mi ired to ship all figurines. Does the first fit decreasing tion? I by trial and error a solution needing only & boxes

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

Q1. Given a 2d grid map of '1's (land) and '0's (water),count the number of islands.An island is surrounded by water and is formed byconnecting adjacent lands horizontally or vertically.You may assume all four edges of the grid are all surrounded by water. Example 1: 11110110101100000000Answer: 1 Example 2: 11000110000010000011Answer: 3""" def num_islands(grid): count = 0 for i in range(len(grid)): for j, col in enumerate(grid[i]): if col == 1: dfs(grid, i, j) count += 1 Please code it.
CThere is a road, the starting coordinate is 0, and the coordinatesof the line are given to draw a black line, for example, five linesegments for drawing black lines, (5, 6), (1, 2), (4, 8), (7 , 9)and (5, 8), as shown belowOutput:Length of the black line on the road: 6Maximum number of overlaps: 3Maximum number of overlaps Length of black line: 2 The first row is a positive integer N, there are N line segments for drawing black lines.Then there are the integer values of the start point coordinates and the end point coordinates of the line segment of the black line. Sample 15160 180150 200280 300290 330190 210Output:Length of the black line on the road: 110Maximum number of overlaps: 2Maximum number of overlaps Length of black line: 40 Sample 21120 120Output:Length of the black line on the road: 0Maximum number of overlaps: 0Maximum number of overlaps Length of black line: 0
An airline association assigns three-letter codes to represent airport locations. For example, the airport code for Clark, Pampanga, is CPP. Notice that repetition is allowed in forming this code. How many airport codes are possible?
Consider two traffic lights in a junction that each one has a 7-segment display to show the remaining time. The traffic lights are working as follows: State1: Traffic light 1=GREEN Traffic light 2=RED for 10 seconds,State2: Traffic light 1=YELLOW Traffic light 2=YELLOW for 2 seconds,State3: Traffic light 1=RED Traffic light 2=GREEN for 6 seconds,GOTO State1 During each step, the amount of remaining time should be displayed on the 7-segment and it should be updated every one second. For example in State 1, the display shows 9, then after a second it shows 8, and ... finally, it shows 0 for one second, and the control moves to State 2Write an 8051 assembly program according to the Edsim51 configuration, LED 0, LED1 and LED 2 construct the first traffic light, and LED 3, LED 4, and LED 5 can be used for the 2nd traffic light. Assume that the lookup table for 7segment exists on memory at address 0F00h
a. There are ten Egyptian stone statutes standing in a row in an art gallery hall. A new curator wants to move them so that the statues are ordered by their height. How should this be done to minimize the total distance that the statues are moved?
Correct answer will be upvoted else downvoted. table can be addressed as a square shape with stature h and width w, isolated into h×w cells. Let (i,j) signify the cell in the I-th line and the j-th segment of the square shape (1≤i≤h; 1≤j≤w). Into every cell of the table you can either put a plate or keep it unfilled. As every visitor must be situated close to their plate, you can just put plates on the edge of the table — into the first or the last line of the square shape, or into the first or the last segment. Officially, for every cell (i,j) you put a plate into, no less than one of the accompanying conditions should be fulfilled: i=1, i=h, j=1, j=w. To make the visitors agreeable, no two plates should be placed into cells that have a typical side or corner. All in all, if cell (i,j) contains a plate, you can't place plates into cells (i−1,j), (i,j−1), (i+1,j), (i,j+1), (i−1,j−1), (i−1,j+1), (i+1,j−1), (i+1,j+1). Put whatever number plates on the table as could be…
Please help computer graphics question Let Z be the set of real integers and R the set of real numbers. The sampling process may be viewed as partitioning the x-y plane into a grid, with the central coordinates of each grid being from the Cartesian product Z2, that is a set of all ordered pairs (zi, zj), with zi and zj being integers from Z. Then, f(x, y) is a digital image if (x, y) are integers from Z2 and f is a function that assigns a gray-level value (that is, a real number from the set R) to each distinct coordinate pair (x, y). What happens to the digital image if the gray levels also are integers? a) The Digital image then becomes a 2-D function whose coordinates and amplitude values are integers b) The Digital image then becomes a 1-D function whose coordinates and amplitude values are integers c) The gray level can never be integer d) None of the mentioned
Consider printing neatly the silly text “This week has seven datesin it ok” in a column with width M = 11. This is represented as the printing neatlyinstance M;l1, ... , ln=11; 4, 4, 3, 5, 5, 2, 2, 2. (a) Fill in the birdAdvice[0..n] andcost[0..n] tables for this example. The original instance, its solution, and its cost arein the bottom row. (b) When filling in this last row, give solutions and costs associatedwith each of the possible bird answers
A grid needs a system for numbering the tiles in order to allow random-access lookup.For instance, the rows and columns of a square grid provide a natural numbering for the tiles. Create plans for hexagonal and triangular grids. Create a rule for identifying the neighbourhood (i.e., nearby tiles) of a certain tile in the grid using the numbering scheme. For instance, the neighbourhood of tile I j in a four-connected square grid with indices of I for rows and j for columns may be described as neighbourhood(i, j) = I 1, j, I j 1.
A robot starts on a point marked “A” on a rectangular grid of points. The starting point is always the top left point on the grid. The robot can move left, right, up or down, moving from one point to the next. By moving in steps going left, right, up or down, the robot would like to reach a point marked “B”, which is always the bottom right point in the grid. Sometimes, points are marked as “x”, and the robot is not allowed to visit them at all. A robot is never allowed to visit a point more than once. In how many ways can the robot move from A to B and visit all points along the way? For example, in the following grid, represented in text as A . . . . B there is only one path from A to B: In the following grid, represented in text as A . . x x B there is still only one path (we're lucky because of the two x's): However, in the grid A . . . x B there are no ways for the robot to move from A to B and visit all points that are not marked with “x”. Write a single…
4. Asap so the below Create a python program that will except a 3x3 matrix and new scale value from user, then conduct a basic 2D transformation of scaling on the matrix. Use your own creativity. Don't use numpy.??
1.Translate the symbols into words using the following representations:P: Dianne is a college freshman.Q: Dianne is a class officer.a.P v Q b. P ^ Q c. ~P ^ Q d. P v ~Q e. P ⇔ Q2.Translate the words into symbols using the following representationsP: Jasmine is a student.Q Jasmine is a Filipinaa.Jasmine is a student and she is a Filipina.b.Jasmine is a student and she not is a Filipina.c.Jasmine is not a student nor is she a Filipina.d.If Jasmine is a student, then she is a Filipina.e.If Jasmine is not a Filipina, then she is not a student.3.Given the Conditional Statement. “If the angles in a triangle measures 450 – 450 -900, then it is an isosceles right triangle. Construct a statement as to the following:a.Conjunction b. Disjunction c. Negation d. Biconditional