1 The Simple Case Of A Fixed Per Unit Tax Is Indicative Of More Complicated Ones Con 2857311

1. The simple case of a fixed per-unit tax is indicative of more complicated ones. Consider a proportional sales tax and a progressive sales tax. How do the tax revenues, and quantities produced compare in these various cases? 2. Explain how value can be created simply by exchange even when nothing new is produced? [This is true for a monetary and for a barter economy]. 3. Explain how competitive privately issued currencies would work automatically to provide consumers with protection against inflation? 4. Would interest exist in a pure exchange economy where no production occurred? Explain. 5. Briefly contrast the static and dynamic views of monopoly and the policies appropriate for each 6. Which is more important, fighting recessions or fighting inflation?

 
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
ORDER NOW

1 The School Of Information Technology Amp Engineering Site Would Like To Help Its M 2766222

1.

The School of Information Technology & Engineering (SITE) would like to help its Master of Networking students with placement in various companies and firms. To facilitate this, they need to design a database with the primary purpose of scheduling interviews and facilitating searches by students and companies that are looking for candidates. MIT’s IT Manager provided following business rules to the software developer:

Complete the information-level design for the new database “MIT training” that satisfies the constraints and user view requirements given below. In order to complete the information-level design you are required to answer questions given below 1(a) – (e)

User view 1 requirement: The database should have information about students, job openings, companies, interviewers and interviews. Student’s first name, last name, student id number, driver’s license number and expected graduation date must be recorded.

User view 2 requirements: Companies post job openings that students can apply for. For each job posting, the date, application deadline of the posting, title of the position, base salary, minimum requirements, and description are recorded.

User view 3 requirements: One student can apply for many open positions (Job postings) in different companies, and the date and time of each application is recorded. Students should also be able to see the status of their application (whether there will be a follow-up interview and whether they were turned down for the position).

User view 4 requirements: Interviews can be facilitated by the University and interviews are conducted by the respective companies. It is required to keep track of date and time of the interview, conference room location, which employees interviewed which students, as well as the result of the interview. A company from the Business School reserves MIT conference rooms and the company needs to specify the resources needed (e.g. computer, projector, etc.).

User view 5 requirements: An interviewer is an employee of a company and he/she has an employee id, telephone number and position title.

User view 5 requirements: A company has an identifier, name, main contact number and main fax number.

a. Analyse the all user requirements, identify and list all entities described in each user requirement.

(5 Marks)

b. Add attributes to these entities and represent these entities (or Tables) and attributes as a collection of Tables and attributes. You are required to arrange them as given in the example below.

NB: Select a suitable primary key for each table and underline it.

Eg. Student (StudentID, Fname,…….

(10 Marks)

c. Outline all relationships between entities.

Eg. : One students can apply for many open positions (Job postings) in all companies – One-to-many,

(5 Marks)

d. Determine the functional dependences.

Eg. StudentID àFname, address, ……

(10 Marks)

e. Then normalise these tables. Make the normalization to 3NF. Show every step in the process.

(10 Marks)

2. Represent the structure of your database visually by using the entity-relationship (E-R) diagram. If you make any assumptions about data that doesn’t appear in the problem, these must be clearly described.

You need to use Visio or any other software tool to create the ER diagram.

(15 Marks)

3. Build this model using MS Access/MS SQL Serverby creating these tables and Relationships. Populate these tables with appropriate data, include at least 3 records in each table.

(10 Marks)

4. Give one example of a type report that can be obtained from this “MIT training” database.

(5 Marks)

 
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
ORDER NOW

1 The Speedway Clinical Laboratory Is A Scientific Blood Testing Facility That Recei 2818849

1. The Speedway Clinical Laboratory is a scientific blood-testing facility that receivessamples from local hospitals and clinics. The blood samples are passed through severalautomated tests, and the results are printed through a central computer that readsand stores the information about each sample that is tested.

Management is concerned about the quality of the service it provides and wants toestablish quality-control limits as a measure for the quality of its tests. Such managerialpractice is viewed as significant, because incorrect analysis of a sample can leadto a wrong diagnosis by the physician, which in turn might cost the life of a patient.

For this reason, 100 blood samples were collected at random each day after they hadgone through testing. After retesting was performed manually on this sample, theresults were:

Day

Incorrect Analysis

Day

Incorrect Analysis

Day

Incorrect Analysis

1

8

8

6

15

2

2

3

9

3

16

1

3

1

10

1

17

0

4

0

11

4

18

6

5

4

12

6

19

3

6

2

13

5

20

2

7

9

14

10

 
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
ORDER NOW

1 The Structural Model Of An Economy Is Given As Below C 400 0 8y D Consumption Func 1754241

1. The structural model of an economy is given as below

C=400+0.8Yd Consumption function

I=350 Investment

G=450 Government expenditure

T=200 Tax

i) Derive the savings function (2 marks)

ii) Derive the government expenditure and tax multiplier (4 marks)

iii) Compute equilibrium income and consumption (4 marks)

 
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
ORDER NOW

1 The Task Of Any Business Is To Deliver At A Profit 775678

1. The task of any business is to deliver ________ at a profit.

 
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
ORDER NOW

1 The Value Of F B Ds Along Closed Path In A Magnetic Field Is Given By 6 28 X 10 T 203860

The value of F B. ds along closed path in a magnetic field is given by 6.28 X 10 T.m. What is the total current that passes througn this closed path?

 
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
ORDER NOW

1 The Traveling Salesman Problem Tsp Is A Famous Problem For Which There Is No Known 2835379

1. The Traveling Salesman problem (TSP) is a famous problem for which there is no known,

tractable solution (though efficient, approximate solutions exist). Given a list of cities and the

distances in between, the task is to find the shortest possible tour (a closed walk in which all

edges are distinct) that visits each city exactly once.

Consider the following algorithm for solving the TSP:

n = number of cities

m = n x n matrix of distances between cities

min = (infinity)

for all possible tours, do:

find the length of the tour

if length

min = length

store tour

a) What is the worst-case (big-O) complexity of this algorithm in terms of n (number of

cities)? You may assume that matrix lookup is O(1), and that the body of the ifstatement

is also O(1). You need not count the if-statement or the for-loop conditional

(i.e., testing to see when the for-loop is done), or any of the initializations at the start of

the algorithm. Clearly show the justification for your answer.

b) Given your complexity analysis, assume that the time required for the algorithm to run

when n = 10 is 1 second. Calculate the time required for n = 20 and show your work.

2. Suppose an algorithm solves a problem of size x in at most the number of steps listed in each

question below. Calculate the asymptotic time complexity (big-T or big-theta) for each example

below. Show your work, including values for c and x0along the way.

a) T(x) = 1

b) T(x) = 5x – 2

c) T(x) =3x^3 + 2 + x^2

d) T(x) = log (x * 2x!)

Document Preview:

ECS 32B: Fall 2018 Homework Assignment 1 Due Date: No later than Saturday, October 13, 9:00pm 0. Make sure to clearly identify your name, student number, and your discussion section on the work you submit. Submit only one pdf file via Canvas…do not submit a separate file for each problem. 1. The Traveling Salesman problem (TSP) is a famous problem for which there is no known, tractable solution (though efficient, approximate solutions exist). Given a list of cities and the distances in between, the task is to find the shortest possible tour (a closed walk in which all edges are distinct) that visits each city exactly once. Consider the following algorithm for solving the TSP: n = number of cities m = n x n matrix of distances between cities min = (infinity) for all possible tours, do: find the length of the tour if length

Attachments:

ECS-32B-homew….pdf

 
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
ORDER NOW

1 The Traveling Salesman Problem Tsp Is A Famous Problem For Which There Is No Known 2835377

1. The Traveling Salesman problem (TSP) is a famous problem for which there is no known,

tractable solution (though efficient, approximate solutions exist). Given a list of cities and the

distances in between, the task is to find the shortest possible tour (a closed walk in which all

edges are distinct) that visits each city exactly once.

Consider the following algorithm for solving the TSP:

n = number of cities

m = n x n matrix of distances between cities

min = (infinity)

for all possible tours, do:

find the length of the tour

if length

min = length

store tour

a) What is the worst-case (big-O) complexity of this algorithm in terms of n (number of

cities)? You may assume that matrix lookup is O(1), and that the body of the ifstatement

is also O(1). You need not count the if-statement or the for-loop conditional

(i.e., testing to see when the for-loop is done), or any of the initializations at the start of

the algorithm. Clearly show the justification for your answer.

b) Given your complexity analysis, assume that the time required for the algorithm to run

when n = 10 is 1 second. Calculate the time required for n = 20 and show your work.

2. Suppose an algorithm solves a problem of size x in at most the number of steps listed in each

question below. Calculate the asymptotic time complexity (big-T or big-theta) for each example

below. Show your work, including values for c and x0along the way.

a) T(x) = 1

b) T(x) = 5x – 2

c) T(x) =3x^3+ 2 + x2

d) T(x) = log (x * 2x!)

 
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
ORDER NOW

1 The Various Rates Of Financial Products Are Gold 735 Oz Gold Rs 13000 10gms Re Usd 1551927

1. The various rates of financial products are:

Gold – $735/Oz; Gold – Rs. 13000/10gms; Re/USD – Rs. 48; Oil – $148

Analyze the rate fluctuation in the price of above products & prepare a report for data between Feb 2008 to 31 march 2009.

 
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
ORDER NOW

1 The Various Rates Of Financial Products Are Gold 735 Oz Gold Rs 13000 10gms Re Usd 1549140

1. The various rates of financial products are:

Gold – $735/Oz; Gold – Rs. 13000/10gms; Re/USD – Rs. 48; Oil – $148

Analyze the rate fluctuation in the price of above products & prepare a report for data between Feb 2008 to 31 march 2009.

 
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
ORDER NOW