assembly assignment - open to bidding

assembly assignment 1. Write a Declaration that organizes memory storage to support the manipulations of Reference to a published article. a) Choose the sizes for each of the following attribute elements: Author's Last Name, Author's First Name, Author's Middle Initial, Title of Article, Journal Name, Volume, Issue Number, Publication Year, Page Numbers. Example of actual usage in an application: Frost, Jack, X., "Happy Holidays in the Middle of Summer", Worldwide Multicultural Celebrations, 15:4( July 2013), pp. 83-199. b) Modify the declaration to support multiple co-authors. The exact number of co-authors is not known at the time of the declaration, assume a maximum of 15: Last Name, First Initial, Author's Middle Initial, ..., & Last Name, First Initial, Author's Middle Initial Title of Article, Journal Name, Volume, Issue Number, Publication Year, Page Numbers. Example of actual usage in an application: Frostinella, J., Elf, B., Tall Elf, K., & Rose Cheeks Elf, R., "Sweet Tooth and Warm Hearths," Glorious Holidays Everyday, 2103:112(November - December 2013), pp. 903 - 1125. c) Modify the declaration in (1b) to support several references, up to a maximum of 100. 2. Write a declaration to organize memory for a Sales Record or Invoice. The elements of the Record are: a) Item Number, Item Description, Item Quantity, Item Unit Price, Discount, Rebate, Tax, Sales Commission, Total Price, Savings, Amount or Bill to Pay b) Extend the declaration to support up to a maximum of 500 sales records. 3. Write a declaration to organize memory for an Inventory Report. A single Inventory Record has the following elements: a) Part Number, Quantity on Hand, Quantity Requested, Unit Price, Stock-out Flag, Quantity to Reorder, Total Value b) Extend the declaration to support up to a maximum of 1000 inventory records. 4. Write declaration to support the following patterns of numbers, (to be eventually manipulated as ASCII art in a computer game: a) 1 2 3 4 5 6 7 8 9 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 1 2 3 4 5 6 1 2 3 4 5 1 2 3 4 1 2 3 1 2 1 b) 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 0 -1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 0 -1 -1 -1 -1 1 1 1 1 1 1 1 1 1 1 0 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 1 0 -1 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 0 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 0 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 c) Pascal's triangle 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 1 1 7 21 35 35 21 7 1 1 8 28 56 70 56 28 8 1 1 9 36 84 126 126 84 36 9 1 1 10 45 120 210 256 210 120 45 10 1 4. Additions and Subtractions: a) Given the following list of numbers, add them together and store the sum in a memory location labelled TotalValue 1, 3, 6, 10, 15, 21, 28, 36, 45 b) Given the following 2 lists of numbers, add the values on the first list, store the sum in a memory location labelled TopLoad. Then repeatedly subtract each of the values on the second list from TopLoad; store the final result in BottomLoad; make sure the value of TopLoad is not changed during the manipulations, once the sum has been calculated and stored in TopLoad List 1: 1 10 45 120 210 256 210 120 45 10 1 List 2: 1 9 36 84 126 126 84 36 9 1 c) Given the following 2 lists of numbers, perform what may be described as "Inner Addition" and "Inner Subtraction": For inner addition, add each entry in List 2 to the corresponding item in List 1. For inner subtraction, subtract each entry in List 2 from the corresponding item in List 2. In each case, sto