Calculate the number of points a publication provides

Assignment Help Data Structure & Algorithms
Reference no: EM13334539

In this exercise you shall work with a system of records for publications associated with research and development.

In order to refine the task we take only two types of publications: books and journal articles. For all publications, we register a unique publication number, title, year of publication, subject, author and institutional affiliation (Hine, UIN, NTNU, University etc). For books, we record the number of pages, while articles we record the journals they are published in. The article gives 2 points, while the books will be calculated with 0.02 points per page book contains.

We get the following classes diagram:

Create classes in the class diagram above with the following specifications:

Each class will have __ init__ () which takes appropriate attributes as the argument (s). See description above.

Publication Index contains a list of objects of subclasses of Publication.

For any object (book, article) shall be able to:

• Calculate the number of points a publication provides.
• Find / Change values ??for all attributes.
• Using print () where all the attributes of a publication is printed.

For Publikasjontregister shall be made two ways:

• Prints all the products that are registered in the register
• Find the number of points as a particular institution has earned.Send the name of the institution as an argument.

Reference no: EM13334539

Questions Cloud

Write a program that first prompts the user : Write a program that first prompts the user (repeatedly , if necessary) to supply a single digit(0,1,2..9) The program should repeatedly prompt the user for integer values until a sentinel value of 0 is entered to terminate the program.
Where z is marginal utility per dollar spen : Where z is marginal utility per dollar spent, x is the amount spent on product A, and y is the amount spent on product B.
Explain the case if the constant c were not multiplied by n : For the following, use the function U= V^(a) n^(1-a) exp(bS/n) + cn 1.find dU in terms of S, V , and n where a, b, and c are constants. 2. Show explicitly that U=ST -PV +?n. 3. Show that this would not be the case if the constant c were not multip..
What arguments would make for allowing insurers to set rates : what arguments would you make for allowing insurers to set their own rates and be regulated by market or competitive forces. what arguments would you make for continuing regulatory approval of insurance rates.
Calculate the number of points a publication provides : In this exercise you shall work with a system of records for publications associated with research and development.
How many patient days does the hospital need to break even : How many patient days does the hospital need to break even and what level of revenue is needed to earn a target income of $540,000?
How many people must attend for the sorority to break even : Each person would pay $40 to attend; 200 attendees are expected Will the event be profitable for the sorority? Show computations and how many people must attend for the sorority to break even?
What was the work done on the object : a variable force f(x) =8x^3 -2x acts on a 2.4 kg objects movinf it from x=0.2 to x=1.4 m. what was the work done on the object
Important task confronting international marketers : what is the meaning of " the most challenging and important task confronting international marketers is cultural judgments because judgments are derived from experience that is the result of acculturation in the home country"

Reviews

Write a Review

Data Structure & Algorithms Questions & Answers

  Prepare a japplet with a jbutton

Prepare a JApplet with a JButton labeled Who is number one and when the user clicks on button, display your favorite sports team. Save the document as JNumberOne.java.

  Designing asp.net assignment

Design an ASP.NET assignment with Visual Studio.NET 2005. Create an event handler that assigns the entry in the TextBox control to Label control's Text property when the consumer clicks the Button control.

  Sorting algorithm to put whole array in order

Assume you have the array of 1000 records in which only few are out of order and they are not very far from their correct positions.

  Primitives-remove ambiguities in algorithm-s representation

Describe how the use of primitives helps remove ambiguities in an algorithm's representation.

  Linear-time algorithm for computing the strong component

On the basis of a linear-time algorithm for computing the strong component containing a given vertex v, describe a simple quadratic-time algorithm for computing the strong components of a digraph.

  Discuss the business problem

Provide a clear statement of the aims and objectives of the data analytics study and the possible outcomes in terms of discovered knowledge and its potential application towards solution of the problem. In this section you need to discuss the busi..

  Will simulate the step by step execution of lru algorithm

The algorithms will be simulated based on a reference string (a sequence of pages that are to be accessed) that will be either read from the keyboard or randomly generated.

  Running time analyses of all the methods

You need to give the running time analyses of all the methods in terms of the Big O notation. Include your running time analyses in the source file of the CompressedSuffixTrie class and comment out them.

  Determine effective transfer rate

Assume a network transmits 1024 byte packets having a 128-byte header and a four byte checksum. If a workstation on the network is guaranteed to be able to transmit one packet every x time units,

  Question about pointerlists

Whenever the pointer of a list or a tree is manipulated, procedure that performs this operation must be considered to be in a critical section.

  Explain method for combining two trees-heap-order property

Assume two binary trees, T 1 and T 2 , hold entries satisfying heap-order property. Explain method for combining T 1 and T 2 into a tree T whose internal nodes hold union of entries

  Find the minimum cost path from a designated node

Find the Minimum Cost Path from a designated start node to a designated destination node in a graph.

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd