A given Knapsack with maximal Weight capacity is 8Kg. There are some items can be chosen and taken into Knapsack. Each item has own weight and profit shown as follows. Please find the maximal profit of Knapsack after some items are selected and put into this Knapsack and its maximal Weight capacity isn't exceeded. item ID Weight 4Kg 5Kg 2Kg 1kg 6Kg A B C D E Profit 4500 5700 2250 1100 8700 The maximal profit of this Knapsack to taken some items and total weight is no exceeded the weight capacity : The last item is taken and put into this Knapsack is: The second item is taken and put into this Knapsack is : The first item is taken and put into this Knapsack is:

A performance venue hosts many concerts a year. Performers perform several times a year for the concerts. Each concert has one or more performers and has a name and a specified seating arrangement. A concert is held in one (and only one) of several concert halls, each of which has a room number and the number of seats. Each concert generates revenues from the sales of tickets. Assume that the price of the ticket is the same for the same concert, but different prices for different concerts.Identify several attributes and a key field for each entity. Represent this situation of concerts and performers with an E-R diagram

In the game of 10-pin bowling the bowler has two attempts to knock down pins for every frame of 10-pins, and scores a point for each pin knocked down. If all the pins are knocked down with two attempts, the bowler gets a bonus - whatever score they obtain with their next bowl is doubled. If all the pins are knocked down on the 1st attempt, no 2nd attempt is allowed, and the bowler gets a bonus – whatever score they obtain on their next two bowls are doubled. A student attempts to capture this scoring system in VHDL code, a fragment of which is shown in Figure Q4. Q4 (a) Draw the state transition diagram described by the VHDL of Figure Q4. Discuss whether the VHDL of Figure Q4 correctly scores a game of 10-pin bowling. (b) elsif CLK='1' and CLK'event and UPD='1' then case present state is when throwl => frame := frame + 1; + resize (unsigned (N), 9) score := score if N = w1010" then present state score := score + resize (unsigned (N), 9) present state + resize (unsigned (N),9) if N =…

There are a set of courses, each of them requiring a set of disjoint time intervals. For example, a course could require the time from 9am to 11am and 2pm to 3pm and 4pm to 5pm. You want to know, given a number K, if it’s possible to take at least K courses. You can only take one course at any single point in time (i.e. any two courses you choose can’t overlap). Show that the problem is NP-complete, which means that choosing courses is indeed a difficult thing in our life. Use a reduction from the Independent set problem.

There are three financial aid counselors. If a student’s last initial is from A – H, let them know that their counselor is Jon Stewart. If a student’s last initial is from I – Q, let them know that their counselor is Chelsea Handler. If a student’s last initial is from R – Z, let them know that their counselor is Brian Williams.Ask student for the FICO score, if it’s less than 660 tell that this student cannot have a loan.