3- Suppose you have the information of some of chickens farms (F1 , F2 ) as fallow: D G chicken discount price $ chicken Age chicken new Numbers of total farms no in months color rate chicken price chicken in the farm price S 1 F1 B 1000 3. F2 4 2000 F2 B 1500 F1 2000 6. F1 1500 F2 3000 1- Find the chicken price depending on the chicken age and color as fallow : Chicken age >= 6 months and chicken color B→ 3$ Chicken age >= 6 months and chicken color W → 2.5$ chicken age <6 months and chicken color B → 2$ chicken age < 6 months and chicken color W → 1.5$ 2- Find the discount rate depending on chicken color as fallow : Chicken color B> -3% ,chicken color W→-2% 3- Find the new chicken price for each farm, where new price=old price+(discount rate*old price) 4 Find the total price for each farm.

3- Suppose you have the information of some of chickens farms (F1 , F2 ) as fallow: D G chicken discount price $ chicken Age chicken new Numbers of total farms no in months color rate chicken price chicken in the farm price S 1 F1 B 1000 3. F2 4 2000 F2 B 1500 F1 2000 6. F1 1500 F2 3000 1- Find the chicken price depending on the chicken age and color as fallow : Chicken age >= 6 months and chicken color B→ 3$ Chicken age >= 6 months and chicken color W → 2.5$ chicken age <6 months and chicken color B → 2$ chicken age < 6 months and chicken color W → 1.5$ 2- Find the discount rate depending on chicken color as fallow : Chicken color B> -3% ,chicken color W→-2% 3- Find the new chicken price for each farm, where new price=old price+(discount rate*old price) 4 Find the total price for each farm.

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

1. Which one(s) are the prefixes of the string P = "aaabbaaa" that are also suffixes of P? (Select all that applies.) Group of answer choices a) 'a' b) 'aa' c) 'aaa' d) ' ' (=>an empty string) 2. Which of the following problems is solved using dynamic programming? Group of answer choices a) Matrix chain multiplication problem b) Knapsack problem c) Longest common subsequence (LCS) problem d) All of the above 3. We can detect some useful information hidden in the topology of the market network before and after a market crash using an MST algorithm. Group of answer choices a) True b) False 4. ABCDEFG and XZACKDFWGH have ACDFG as a longest common subsequence. Group of answer choices a) True b) False
Consider the following snapshot of a system: Allocation: A B C DT0 0 0 1 2T1 1 0 0 0T2 1 3 5 4T3 0 6 3 2T4 0 0 1 4 Max: A B C DT0 3 0 1 2T1 1 7 5 0T2 2 3 5 6T3 0 6 5 3T4 0 6 5 6 Available: A B C D2 5 1 0 Answer using the banker’s algorithm. If you think the system is in an unsafe state, write "unsafe" in the answer box, otherwise, write the process sequence that satisfies the safe state. While answering the question write only the id of the Tasks separated with comma, (e.g., for sequence <T4,T2,T1,T0,T3> write only 4,2,1,0,3 ).
Case Study:Consider an online shopping website that maintains a shopping cart. A user can search productsand place order and can make payment for it either online or cash on delivery. If a user placean order of amount RS 2500 or above he gets home delivery of the product for free, otherwisehe has to pay Rs 250 extra for home delivery. There are different types of users based onmembership Guest User (No membership), Gold User, Platinum User. Guest user doesn’t getany discount, Gold user gets 5% off on every product, Platinum User get 7.5% on everyproduct. Question No. 2: Draw Activity diagram for the case study above ? Question No. 3: Draw Class diagram for the case study above. ?
Suppose a business person launches new cinema at Islamabad and ask his team to develop a ticket system for box office. He assigns some requirements about system that how should it work. The requirements are such a way that there are only '5' number of box office windows in the theatre. Each window can have at max '20' number of people waiting in line. To start with, only one window is opened. If the number of people waiting in line in that window exceeds 20, then the next window is opened and people can join the line in that window. Likewise, if both the first and second windows have n number of people waiting in each queue, then a third window is opened. This can go on until the maximum number of windows w is reached. Let us assume that once a window is opened it never closes. A new window is only opened if all open windows are full. Each person can buy only one ticket. So, the system should not allot more than one ticket per person. Let us assume that the system issues one ticket…
Assume that agents, objects, and preferences are as shown below. Is it possible for serial dictatorship to produce the allocation 1C, 2D, 3B, 4A? If yes, write an order which results in this allocation (your answer should consist of four numbers, so 1342 indicates that agent 1 chooses first, 3 second, 4 third, and 2 fourth) Agent 1: A > B > C > D Agent 2: A > D > C > B Agent 3: B > C > D > A Agent 4: B > A > D > C
Consider printing neatly the silly text “This week has seven dates in it ok” in a column with width M = 11. This is represented as the printing neatly instance M;l1, ... , ln=11; 4, 4, 3, 5, 5, 2, 2, 2. (a) Fill in the birdAdvice[0..n] and cost[0..n] tables for this example. The original instance, its solution, and its cost are in the bottom row.(b) When filling in this last row, give solutions and costs associated with each of the possible bird answers. explain in detail
Let M be an NFA with k states.we used NFA to DFA coversion method and converted M into a DFA M' which has 335 states.Which of the following is possible value of k(the number of states in M)? option a) 7 option b) 8 option c) 9 option d) 6
In a column with a width of M = 11, imagine printing the absurd text "This week has seven days in it, okay" neatly. The printing instance M;l1,..., ln=11; 4, 4, 3, 5, 5, 2, 2, 2 is used to symbolise this. (a) Complete the cost[0..n] and birdAdvice[0..n] tables for this case. The lowest row contains the initial instance, its solution, and its expense. (b) When completing this final row, include solutions and prices related to each of the potential bird responses.
Three persons P1, P2, and P3 were invited by their friend F to make some smørbrød (sandwich made of bread, eggs, and tomato) together. To make a portion of smørbrød, three ingredients are needed: a slice of bread, a slice of tomato, and a slice of an egg. Each of these persons P1, P2, P3 has only one type of each of the ingredients: person P1 has slices of bread person P2 has slices of tomato; person P3 has slices of egg. We assume that persons P1, P2, and P3 each has an unlimited supply of these ingredients (i.e., slices of bread, slices of tomato, slices of egg), respectively. Their friend F, who invited them, also has an unlimited supply of all the ingredients. Here is what happens: the host F puts two random ingredients on the table. Then the invited person who has the third ingredient picks up these other two ingredients, and makes the smørbrød (i.e., takes a slice of bread, puts on it a slice of tomato, and puts on top a slice of egg), and then eats the smørbrød. The host of…
Given R=ABCDEFGand F = {CF→B, B→C, FB→E, CBE→F, E→AG, FA→B,BG→FE, BA→CG}The following is a minimal cover: A. (CFD, FBD, BED, BAD, BDG) B. CFD→BEAG C. CF→B, FB→E, E→AG, FA→B, BA→G D. CF→B, B→C, FB→E, E→AG, FA→B, BG→F, BA→G
A police academy has just brought in a batch of new recruits. All recruits are given an aptitude test and a fitness test. Suppose a researcher wants to know if there is a significant difference in aptitude scores based on a recruits’ fitness level. Recruits are ranked on a scale of 1 – 3 for fitness (1 = lowest fitness category, 3 = highest fitness category). Using “ApScore” as your dependent variable and “FitGroup” as your independent variable, conduct a One-Way, Between Subjects, ANOVA, at α = 0.05, to see if there is a significant difference on the aptitude test between fitness groups. Identify the correct values for dfbetween and dfwithin A. dfbetween = 7 dfwithin = 7 B. dfbetween = 13 dfwithin = 2 C. dfbetween = 2 dfwithin = 13 D. dfbetween = 2 dfwithin = 2
The New York Knicks and the Chicago Bulls are readyfor the best-of-seven NBA Eastern finals. The two teams areevenly matched, but the home team wins 60% of the gamesbetween the two teams. The sequence of home and awaygames is to be chosen by the Knicks. The Knicks have thehome edge and will be the home team for four of the sevenscheduled games. They have the following choices (hometeam is listed for each game):Sequence 1: NY, NY, CHIC, CHIC, NY, CHIC, NYSequence 2: NY, NY, CHIC, CHIC, CHIC, NY, NYUse simulation to show that either sequence gives the Knicksthe same chance of winning the series.