Assignment information objectives

Memory Analysis - Programming Assignment
Page 11 of 17 
Top of Form
ASSIGNMENT INFORMATION

1. 
   Objectives:
   
   • 
     Understand and apply how to measure the memory needs of simple code fragments
     
   • 
     Understand and apply how to measure the memory needs of different implementations of bag data structure
     
   • 
     Understand and apply how to measure the memory needs of different implementations of stacks and queues 
     

Learn:

• 
  Watch the provided videos (if any)
  
• 
  As needed, study and watch the learning materials included with the module.
  

FOR ALL TASKS:

• 
  Define all the classes in the new package: alg.analysis.memory
  
• 
  Write a small program (or reuse a previous one) that will perform the following operations.
  
• 
  Include the code in the source code zip file
  
• 
  Include the execution sample in the execution PDF file.
  
• 
  Include the answer to the question/tasks below in the answers PDF file.
  
• 
  For the computations below explain your result in details. Do not put only a number as the result, but the logic how you obtained that number.
  
• 
  Modify the test class to print at the beginning of the output the message (where you replace my name with your name):
  

• 
  Memory Analysis - Task ... - by Mihai Boicu (replacint ... as appropriate for each subtask: 1a, 1b, 1c, 2a, ...)
  

Task 1: Analyze the memory needs for simple loops

• 
  Compute the memory needs for the sum of first 100 integers
  

• 
  Hint: https://mymasonportal.gmu.edu/bbcswebdav/pid-16948266-dt-content-rid-234884526_1/xid-234884526_1
  

• 
  Compute the memory needs for TwoSum method 
  

• 
  Hint: https://mymasonportal.gmu.edu/bbcswebdav/pid-16948266-dt-content-rid-234889819_1/xid-234889819_1
  

• 
  Compute the memory needs for ThreeSum method 
  

• 
  Hint (brute force method, recommended): https://mymasonportal.gmu.edu/bbcswebdav/pid-16948266-dt-content-rid-234882462_1/xid-234882462_1
  

• 
  Hint (optimized method, partial solution): https://mymasonportal.gmu.edu/bbcswebdav/pid-16948266-dt-content-rid-234882463_1/xid-234882463_1
  

Task 2: Analyze the memory needs for bags

• 
  Compute the memory needs for a fixed capacity bag with the capacity of 100 of ints
  

• 
  Hint: https://mymasonportal.gmu.edu/bbcswebdav/pid-16948266-dt-content-rid-234882464_1/xid-234882464_1 
  

• 
  Compute the memory needs for a dynamic capcity bag of longs with the initial capacity of 10 and in which we added 23 elements.
  

• 
  Hint: https://mymasonportal.gmu.edu/bbcswebdav/pid-16948266-dt-content-rid-260383222_1/xid-260383222_1
  

• 
  Compute the memory needs for a linked list bag of Strings in which we added 17 elements.
  

Task 3: Analyze the memory needs for stacks and queues

• 
  Compute the memory needs for a fixed capacity queue of Rectangles with a capacity of 20
  
• 
  Compute the memory needs for a dynamic capacity stack of Doubles with the initial capacity of 10, in which we performed the following operations: push 17 elements, pop 5, push 30 elements. 
  
• 
  Compute the memory needs for a linked list queue of Booleans in which we performed the following operations: enqueue 5 elements, dequeue 2 elements, enqueue 7 elements.
  

Grading: 0.80 points (see grading rubric for details)
Global Submission Instruction:

• 
  You must follow the instructions described in the folder: "512 All Modules", subfolder "A00 Global Instructions", item "Programming Assignment Submission"
  

Submission:

• 
  EXECUTION PDF FILE
  
• 
  ANSWERS PDF FILE
  
• 
  SOURCE CODE ZIP FILE
  

Bottom of Form