1. Execute Prim’s minimum spanning tree algorithm by hand on the graph below showing how the data structures evolve specifically indicating when the distance from a fringe vertex to the tree is updated. Clearly indicate which edges become part of the minimum spanning tree and in which order. Start at vertex A. A B G F I H C E D 2 2 2 2 1 1 3 3 4 5 4 6 6 7 8 2. Execute Kruskal’s algorithm on the weighted tree shown below. Assume that edges of equal weight will be in the priority queue in alphabetical order. Clearly show what happens each time an edge is removed from the priority queue and how the dynamic equivalence relation changes on each step and show the final minimum spanning tree that is generated. 3. Give an example of a weighted graph for which the minimum spanning tree is unique. Indicate what the minimum spanning tree is for that graph. Give another example of a weighted graph that has more than one minimum spanning tree. Show two different minimum spanning trees for that graph. What determines whether a graph has more than one minimum spanning tree? 4. Given the following adjacency lists (with edge weights in parentheses) for a directed graph: A: B(5), C(3), D(1) B: C(1), D(3) C: B(3), D(7), E(1) D: A(6), C(3) E: F(5) F: D(3), A(4) Execute Dijkstra’s shortest-path algorithm by hand on this graph, showing how the data structures evolve, with A as the starting vertex. Clearly indicate which edges become part of the shortest path and in which order. Grading Rubric Problem Meets Does Not Meet Problem 1 10 points 0 points Indicated when the distance from a fringe vertex to the tree was updated (3) Did not indicate when the distance from a fringe vertex to the tree was updated (0) Indicated which edges became part of the minimum spanning tree and in which order (3) Did not indicate which edges became part of the minimum spanning tree and in which order (0) Provided the correct final minimum spanning tree (4) Did not provide the correct final minimum spanning tree (0) Problem 2 10 points 0 points Showed what happened each time an edge was removed from the priority queue (3) Did not show what happened each time an edge was removed from the priority queue (0) Showed how the dynamic equivalence relation changed on each step (3) Did not show how the dynamic equivalence relation changed on each step (0) Provided the correct final minimum spanning tree (4) Did not provide the correct final minimum spanning tree (0) Problem 3 10 points 0 points Provided a correct example of a weighted graph for which the minimum spanning tree is unique (2) Did not provide a correct example of a weighted graph for which the minimum spanning tree is unique (0) Provided the correct unique minimum spanning tree for that graph (2) Did not provide the correct unique minimum spanning tree for that graph (0) Provided a correct example of a weighted graph that has more than one minimum spanning tree (2) Did not provide a correct example of a weighted graph that has more than one minimum spanning tree (0) Provided two correct distinct minimum spanning trees for that graph (2) Did not provide two correct distinct minimum spanning trees for that graph (0) Correctly explained what determines whether a graph has more than one minimum spanning tree (2) Did not correctly explain what determines whether a graph has more than one minimum spanning tree (0) Problem 4 10 points 0 points Clearly indicated which edges became part of the shortest path and in which order (5) Did not clearly indicate which edges became part of the shortest path and in which order (0) Provided correct final shortest path tree (5) Did not provide correct final shortest path tree (0)
Consider the following directed graph for each of the problems: 1. Perform a breadth-first search on the graph assuming that the vertices and adjacency lists are listed in alphabetical order. Show the breadth-first search tree that is generated. 2. Perform a depth-first search on the graph assuming that the vertices and adjacency lists are listed in alphabetical order. Classify each edge as tree, forward, back or cross edge. Label each vertex with its start and finish time. 3. Remove all the back edges from the graph so it becomes a DAG. Perform a depth-first search recording the start and finish times. Using those finish times, provide the topological order that is produced. Provide one breadth-first topological order for that graph. 4. Determine the strongly connected components of the graph using the algorithm provided in the sample problems. Show the final depth-first search of the transpose graph labeled with its start and finish times. Identify the strongly connected components based on that search. Grading Rubric Problem Meets Does Not Meet Problem 1 10 points 0 points Breadth-first search was done correctly assuming alphabetical vertex and adjacency lists (5) Breadth-first search was not done correctly assuming alphabetical vertex and adjacency lists (0) Tree provided is a correct breadth-first search tree (5) Tree provided is not a correct breadthfirst search tree (0) Problem 2 10 points 0 points Performed a correct depth-first search (3) Did not perform a correct depth-first search (0) Tree edges correctly labeled (1) Tree edges not correctly labeled (0) Back edges correctly labeled (1) Back edges not correctly labeled (0) Forward edges correctly labeled (1) Forward edges not correctly labeled (0) Cross edges correctly labeled (1) Cross edges not correctly labeled (0) Provided correct start and finish times (3) Did not provide correct start and finish times (0) Problem 3 10 points 0 points Correctly transformed the graph into a DAG (2) Did not correctly transform the graph into a DAG (0) Provided correct start and finish times (3) Did not provide correct start and finish times (0) Provided correct topological order from finish times (3) Did not provide correct topological order from finish times (0) Provided correct breadth-first topological order (2) Did not provide correct breadth-first topological order (0) Problem 4 10 points 0 points Correctly transposed graph (2) Did not correctly transpose graph (0) Provided correct start and finish times (4) Did not provide correct start and finish times (0) Provided correct strongly connected components (2) Did not provide correct strongly connected components (0)
Project 2 involves writing an analysis of the results that you obtained in first project. You are to submit a paper that discusses the results of your analysis. Your paper should include the following items: A brief introduction of the sorting algorithm that you have selected and how the two versions of the algorithm compare including: o High-level pseudocode for the sorting algorithms o A Big-Θ analysis of the two versions of the algorithm o An explanation of your approach to avoiding the problems associated with JVM warm-up o A discussion of the critical operation that you chose to count with an explanation of why you selected it An analysis of the results of your study, which should include: o graph of critical operations for both algorithms and one for the execution times o a comparison of the performance of the two versions of the algorithm o a comparison of the critical operation results and the actual execution time measurements o a discussion of the significance of the coefficient of variance results and how it reflects the data sensitivity of your algorithm o how your results compare to your Big-Θ analysis A conclusion that summarizes the important observations of your study If for any reason, it was necessary to revise the program you submitted in project 1, the revised source code should also be included along with the paper. Grading Rubric Criteria Meets Does Not Meet 100 points 0 points Introduction 35 points 0 points Contains a brief description of the sorting algorithm together with highlevel pseudocode for the algorithm (10) Does not contain a brief description of the sorting algorithm together with high-level pseudocode for the algorithm (0) Contains a correct Big-Θ analysis of the algorithm (10) Does not contain a correct Big-Θ analysis of the algorithm (0) Contains an explanation of your approach to avoiding the problems associated with JVM warm-up (10) Does not contain an explanation of your approach to avoiding the problems associated with JVM warmup (0) Contains a discussion of the critical operation that you chose to count with an explanation of why you selected it (5) Does not contain a discussion of the critical operation that you chose to count with an explanation of why you selected it (0) Analysis 50 points 0 points Contains a graph of critical operations and one for the execution times (20) Does not contain a graph of critical operations and one for the execution times (10) Contains a comparison of the performance of the two versions of the algorithm (5) Does not contain a comparison of the performance of the two versions of the algorithm (0) Contains a comparison of the critical operation results and the actual execution time measurements (10) Does not contain a comparison of the critical operation results and the actual execution time measurements (0) Contains a discussion of the significance of the coefficient of variation results and how it reflects the data sensitivity of your algorithm (5) Does not contain a discussion of the significance of the coefficient of variation results and how it reflects the data sensitivity of your algorithm (0) Contains a discussion of how your results compare to your Big-Θ analysis (10) Does not contain a discussion of how your results compare to your Big-Θ analysis (0) Conclusion 15 points 0 points Contains a conclusion that summarizes the important observations of your study (20) Does not contain a conclusion that summarizes the important observations of your study (0)
The first project involves benchmarking the behavior of Java implementations of one of the following sorting algorithms, bubble sort, selection sort, insertion sort, Shell sort, merge sort, quick sort or heap sort. You must post your selection in the “Ask the Professor” conference. No more than five students may select any one algorithm. You must write the code to perform the benchmarking of the algorithm you selected. Your program must include both an iterative and recursive version of the algorithm. You do not have to write the sorting algorithms yourself, you may take them from some source, but you must reference your source. You must identify some critical operation to count that reflects the overall performance and modify each version so that it counts that operation. In addition to counting critical operations you must measure the actual run time in nanoseconds. In addition, you should examine the result of each call to verify that the data has been properly sorted to verify the correctness of the algorithm. If the array is not sorted, an exception should be thrown. It should also randomly generate data to pass to the sorting methods. It should produce 50 data sets for each value of n, the size of the data set and average the result of those 50 runs. The exact same data must be used for the iterative and the recursive algorithms. It should also create 10 different sizes of data sets. Choose sizes that will clearly demonstrate the trend as n becomes large. Be sure that the data set sizes are evenly spaced so this data can be used to generate graphs in project 2 This project should consist of two separate programs. The first of those programs should perform the benchmarking described above and generate two data files, one containing the results from the iterative algorithm and the one containing the results of the recursive algorithm. The benchmarking program must be written to conform to the following design: +recursiveSort(inout int[] list) +iterativeSort(inout int[] list) +getCount() : int +getTime() : long «interface» SortInterface YourSort +main(in String[] args) BenchmarkSorts UnsortedException Exception The output files should contain 10 lines that correspond to the 10 data set sizes. The first value on each line should be the data set size followed by 50 pairs of values. Each pair represents the critical element count and the time in nanoseconds for each of the 50 runs of that data set size. The second program should produce the report. It should allow the user to select the input file using JFileChooser. The report should contain one line for each data set size and five columns and should be displayed using a JTable. The first column should contain the data set size the second the average of the critical counts for the 50 runs and the third the coefficient of variance of those 50 values expressed as a percentage. The fourth and fifth column should contain similar data for the times. The coefficient of variance of the critical operation counts and time measurement for the 50 runs of each data set size provide a way to gauge the data sensitivity of the algorithm. Shown below is an example of how the report should look: On the due date for project 1, you are to submit a .zip file that includes the source code for both programs. All the classes should be in the default package. You must research the issue of JVM warm-up necessary for properly benchmarking Java programs and ensure that your code performs the necessary warm-up so the time measurements are accurate. Grading Rubric Criteria Meets Does Not Meet 100 points 0 points Design 20 points 0 points Implemented the required design (20) Did not implement the required design (0) Input 20 points 0 points Created 10 different sizes of data sets (10) Did not create 10 different sizes of data sets (0) Produced 50 data sets for each value of n (10) Did not produce 50 data sets for each value of n (0) Sorting Algorithm Benchmark Calculations 35 points 0 points Correctly averaged the count and time results of the 50 data sets (10) Did not correctly average the count and time results of the 50 data sets Calculated the coefficient of variance of the critical operation counts and time measurement (5) Did not calculate the coefficient of variance of the critical operation counts and time measurement (0) Included correct sorting algorithm and code to verify data was properly sorted (10) Did not Include correct sorting algorithm and code to verify data was properly sorted (0) Performed the necessary warm-up so the time measurements were accurate (10) Did not perform the necessary warmup so the time measurements were accurate (0) Output 25 points 0 points Output all the required data (15) Did not output all the required data (0) Output displayed in the required format (10) Output not displayed in the required format (0)
In this project you will construct a Java Swing GUI that uses event handlers, listeners and incorporates Java’s concurrency functionality and the use of threads. The following book may be useful to help you become comfortable with Thread processes. https://learning.oreilly.com/library/view/java-7-concurrency/9781849687881/index.html You should focus on the first 4 chapters. If you have previously signed up for the Safari account you don’t need to sign-up again. Just use this link: https://learning.oreilly.com/accounts/login/?next=/library/view/temporary-access/ If you have not previously requested a Safari account follow the details on this page to sign-up for your Safari Account: https://libguides.umuc.edu/safari You’ll need to sign in using your UMGC student email account. Once you sign in, you’ll have immediate access to the content, and you’ll shortly receive an e-mail from Safari prompting you to set up a password and complete your account creation (recommended). Students: Your UMUC e-mail account is your username + @student.umuc.edu (example: [email protected]). In addition, a zip file is included that includes several Oracle Java files that use different types of Swing components as well as threads. I recommend going through the reading and the examples to become familiar before attempting the final project. Assignment Details As a new engineer for a traffic congestion mitigation company, you have been tasked with developing a Java Swing GUI that displays time, traffic signals and other information for traffic analysts. The final GUI design is up to you but should include viewing ports/panels to display the following components of the simulation: 1. Current time stamps in 1 second intervals 2. Real-time Traffic light display for three major intersections 3. X, Y positions and speed of up to 3 cars as they traverse each of the 3 intersections Some of the details of the simulation are up to you but the following guidelines will set the guardrails: 1. The components listed above should run in separate threads. 2. Loop through the simulation with button(s) providing the ability to start, pause, stop and continue the simulation. 3. You will need to use basic distance formulas such as distance = Speed * time. Be sure to be consistent and define your units of measure (e.g. mile/hour, versus km/hour) 4. Assume a straight distance between each traffic light of 1000 meters. 5. Since you are traveling a straight line, you can assume Y = 0 for your X,Y positions. 6. Provide the ability to add more cars and intersections to the simulation through the GUI. 7. Don’t worry about physics. Assume cars will stop on a dime for red lights, and continue through yellow lights and green lights. 8. Document all assumptions and limitations of your simulation.Submission Requirements: 1. Submit all of your Java source files (each class should be in a separate .java file). These files should be zipped and submitted with the documentation. 2. UML class diagram showing the type of the class relationships. 3. Developer’s guide describing how to compile and execute the program. The guide should include a comprehensive test plan that includes evidence of testing each component of the menu with screen captures and descriptions supporting each test. Documentation includes Lessons learned. Your compressed zip file should be submitted to the Project 3 folder in LEO no later than the due date listed in the classroom calendar. Grading Rubric: Attribute Meets Design 20 points Designs a Java Swing GUI that uses event handlers, listeners and incorporates Java’s concurrency functionality and the use of threads. Functionality 40 points Contains no coding errors. Contains no compile warnings.Constructs a Java Swing GUI that uses event handlers, listeners and incorporates Java’s concurrency functionality and the use of threads Include viewing ports/panels to display the following components of the simulation: 1. Current time stamps in 1 second intervals 2. Real-time Traffic light display for three major intersections 3. X, Y positions and speed of up to 3 cars as they traverse each of the 3 intersections The components run in separate threads. Loop through the simulation with button(s) providing the ability to start, pause, stop and continue the simulation. Provides the ability to add more cars and intersections to the simulation through the GUI.Test Data 20 points Tests the application using multiple and varied test cases.Documentation and submission 20 points Source code files include header comment block, including file name, date, author, purpose, appropriate comments within the code, appropriate variable and function names, correct indentation. Submission includes Java source code files, Data files used to test your program, Configuration files used. Documentation includes a UML class diagram showing the type of the class relationships.Documentation includes a user’s Guide describing of how to set up and run your application. Documentation includes a test plan with sample input and expected results, test data and results and screen snapshots of some of your test cases. Documentation includes Lessons learned. Documents all assumptions and limitations of your simulation. Documentation is in an acceptable format. Document is well-organized. The font size should be 12 point. The page margins should be one inch. The paragraphs should be double spaced. All figures, tables, equations, and references should be properly labeled and formatted using APA style. The document should contain minimal spelling and grammatical errors. Any submissions that do not represent work originating from the student will be submitted to the Dean’s office and evaluated for possible academic integrity violations and sanctions.
In the project you will construct a Java Swing GUI that uses event handlers and listeners while expanding on the project 1 Shape theme. Before completing this exercise, be sure to review and try the Java class and inheritance examples and materials found in this free Safari resource: https://learning.oreilly.com/library/view/java-the-complete/9781260440249/ You should focus on Chapters 24, 25, 26, and 27 If you have previously signed up for the Safari account you don’t need to sign-up again. Just use this link: https://learning.oreilly.com/accounts/login/?next=/library/view/temporary-access/ If you have not previously requested a Safari account follow the details on this page to sign-up for your Safari Account: https://libguides.umuc.edu/safari You’ll need to sign in using your UMGC student email account. Once you sign in, you’ll have immediate access to the content, and you’ll shortly receive an e-mail from Safari prompting you to set up a password and complete your account creation (recommended). Students: Your UMUC e-mail account is your username + @student.umuc.edu (example: [email protected]). Assignment Details Design, implement and test a set of Java classes that allows a user to select a shape from a list of available shapes, enter appropriate dimensional parameters and then display that shape in a frame of your Swing-based GUI. For 3-D shapes consider loading an image from a file and displaying that as a representative. Your list of shapes should be similar, if not identical to the ones used in project one: Circle Square Triangle Rectangle Sphere Cube Cone Cylinder Torus Take advantage of various Swing AWT components including Layout Managers, Event Handlers, Listener Interfaces, Adapter Classes, Inner Classes, Buttons and other widgets as needed. Take your time on understanding how the graphical components and listeners work so you can easily display appropriate actions based on any event.Submission Requirements: 1. Submit all of your Java source files (each class should be in a separate .java file). These files should be zipped and submitted with the documentation. 2. UML class diagram showing the type of the class relationships. 3. Developer’s guide describing how to compile and execute the program. The guide should include a comprehensive test plan that includes evidence of testing each component of the menu with screen captures and descriptions supporting each test. Documentation includes Lessons learned. Your compressed zip file should be submitted to the Project 2 folder in LEO no later than the due date listed in the classroom calendar. Grading Rubric: Attribute Meets Design 20 points Designs a Java class Inheritance hierarchy that would satisfy the following isa and has-a relationships: Circle Square Triangle Rectangle Sphere Cube Cone Cylinder Torus Functionality 40 points Contains no coding errors. Contains no compile warnings. Constructs a Java Swing GUI that uses event handlers and listeners while expanding on the project 1 Shape theme. Displays shapes in a frame of your Swing-based GUI. For 3-D shapes consider loading an image from a file and displaying that as a representative. Uses various Swing AWT components including Layout Managers, Event Handlers, Listener Interfaces, Adapter Classes, Inner Classes, Buttons and other widgets. Test Data 20 points Tests the application using multiple and varied test cases. Documentation and submission 20 points Source code files include header comment block, including file name, date, author, purpose, appropriate comments within the code, appropriate variable and function names, correct indentation. Submission includes Java source code files, Data files used to test your program, Configuration files used. Documentation includes a UML class diagram showing the type of the class relationships. Documentation includes a user’s Guide describing of how to set up and run your application. Documentation includes a test plan with sample input and expected results, test data and results and screen snapshots of some of your test cases. Documentation includes Lessons learned. Documentation is in an acceptable format. Document is well-organized. The font size should be 12 point. The page margins should be one inch. The paragraphs should be double spaced. All figures, tables, equations, and references should be properly labeled and formatted using APA style. The document should contain minimal spelling and grammatical errors. Any submissions that do not represent work originating from the student will be submitted to the Dean’s office and evaluated for possible academic integrity violations and sanctions.
In the project you will use Java Inheritance to create a series of related classes with a “Shape” theme. Before completing this exercise, be sure to review and try the Java class and inheritance examples and materials found in this free Safari resource: https://learning.oreilly.com/library/view/java-the-complete/9781260440249/ You should focus on Chapters 6, 7 and 8. If you have previously signed up for the Safari account you don’t need to sign-up again. Just use this link: https://learning.oreilly.com/accounts/login/?next=/library/view/temporary-access/ If you have not previously requested a Safari account follow the details on this page to sign-up for your Safari Account: https://libguides.umuc.edu/safari You’ll need to sign in using your UMGC student email account. Once you sign in, you’ll have immediate access to the content, and you’ll shortly receive an e-mail from Safari prompting you to set up a password and complete your account creation (recommended). Students: Your UMUC e-mail account is your username + @student.umuc.edu (example: [email protected]). Note: Be sure to review is-a and has-a class relationships prior to starting this exercise as well. Assignment Details Design, implement and test a Java class Inheritance hierarchy that would satisfy the following is-a and has-a relationships: A Shape is an object A TwoDimensionalShape is a Shape A ThreeDimensionalShape is a Shape A Circle is a TwoDimensionalShape A Square is a TwoDimensionalShape A Triangle is a TwoDimensionalShape A Rectangle is a TwoDimensionalShape A Sphere is a ThreeDimensionalShape A Cube is a ThreeDimensionalShape A Cone is a ThreeDimensionalShape A Cylinder is a ThreeDimensionalShape A Torus is a ThreeDimensionalShape A Shape has a NumberofDimensions A TwoDimensionalShape has an area A ThreeDimensionalShape has a volume Note you should fill in additional methods and variables that make sense for each of the classes. Also some assumptions about shape types is appropriate and should be documented in the code and documents submitted. For example, type of triangle … Create a command line driven menu that allows a user to construct each of the TwoDimensional and ThreeDimensional Shape subclasses. The menu should continue to loop prompting for a specific class and then prompt for appropriate input parameters. The values returned should be the volume or area as appropriate to the shape. Error checks should be in developed to make sure appropriate menu items and types of data were input and prompt the user to enter to correct data. An option to exit the program should be available as well that will provide an appropriate Thank you message along with the current date and time. The following represents a possible menu session for a user: *********Welcome to the Java OO Shapes Program ********** Select from the menu below: 1. Construct a Circle 2. Construct a Rectangle 3. Construct a Square 4. Construct a Triangle 5. Construct a Sphere 6. Construct a Cube 7. Construct a Cone 8. Construct a Cylinder 9. Construct a Torus 10. Exit the program 2 You have selected a Rectangle What is the length? 4 What is the Width? 9.5 The area of the Rectangle is 38. Would you like to continue? (Y or N) 3 Sorry I do not understand. Enter Y or N Y Select from the menu below: 1. Construct a Circle 2. Construct a Rectangle 3. Construct a Square 4. Construct a Triangle 5. Construct a Sphere 6. Construct a Cube 7. Construct a Cone 8. Construct a Cylinder 9. Construct a Torus 10. Exit the program 10 Thanks for using the program. Today is Nov 11 at 1:40 PM. Submission Requirements: 1. Submit all of your Java source files (each class should be in a separate .java file). These files should be zipped and submitted with the documentation. 2. UML class diagram showing the type of the class relationships. 3. Developer’s guide describing how to compile and execute the program. The guide should include a comprehensive test plan that includes evidence of testing each component of the menu with screen captures and descriptions supporting each test. Documentation includes Lessons learned. Your compressed zip file should be submitted to the Project 1 folder in LEO no later than the due date listed in the classroom calendar. Grading Rubric: Attribute Meets Design 20 points Designs a Java class Inheritance hierarchy that would satisfy the following isa and has-a relationships: A Shape is an object A TwoDimensionalShape is a Shape A ThreeDimensionalShape is a Shape A Circle is a TwoDimensionalShape A Square is a TwoDimensionalShape A Triangle is a TwoDimensionalShape A Rectangle is a TwoDimensionalShape A Sphere is a ThreeDimensionalShape A Cube is a ThreeDimensionalShape A Cone is a ThreeDimensionalShape A Cylinder is a ThreeDimensionalShape A Torus is a ThreeDimensionalShape A Shape has a NumberofDimensions A TwoDimensionalShape has an area A ThreeDimensionalShape has a volume Functionality 40 points Contains no coding errors. Contains no compile warnings. Creates a command line driven menu that allows a user to construct each of the TwoDimensional and ThreeDimensional Shape subclasses. The menu should continue to loop prompting for a specific class and then prompt for appropriate input parameters. The values returned should be the volume or area as appropriate to the shape. Error checks should be in developed to make sure appropriate menu items and types of data were input and prompt the user to enter to correct data. An option to exit the program should be available as well that will provide an appropriate Thank you message along with the current date and time Test Data 20 points Tests the application using multiple and varied test cases. Documentation and submission 20 points Source code files include header comment block, including file name, date, author, purpose, appropriate comments within the code, appropriate variable and function names, correct indentation. Submission includes Java source code files, Data files used to test your program, Configuration files used. Documentation includes a UML class diagram showing the type of the class relationships. Documentation includes a user’s Guide describing of how to set up and run your application. Documentation includes a test plan with sample input and expected results, test data and results and screen snapshots of some of your test cases. Documentation includes Lessons learned. Documentation is in an acceptable format. Document is well-organized. The font size should be 12 point. The page margins should be one inch. The paragraphs should be double spaced. All figures, tables, equations, and references should be properly labeled and formatted using APA style. The document should contain minimal spelling and grammatical errors. Any submissions that do not represent work originating from the student will be submitted to the Dean’s office and evaluated for possible academic integrity violations and sanctions.
Examine the following relation and its attributes and answer the following questions. Assume these are the values for “all time”. Assume girls with the same name are the same person. GIRL GROUP AGE GAME CATEGORY PRICE Charlotte 5 year olds 5 Mirror Makeup 4.88 Susan 6 year olds 6 Lipstick Makeup 5.95 Jane 5 year olds 5 Chess Games 7.55 Susan 6 year olds 6 Checkers Games 5.95 Susan 6 year olds 6 Mirror Makeup 4.88 Carrie 6 year olds 6 Lipstick Makeup 5.95 Jacqueline 5 year olds 5 Visual Basic Prog. Languages 199.99 For each question below, please be sure to review the course content for additional reference material. 1) Is this relation in at least 1NF? Why or why not? 2) What is the primary key of the initial relation (assume the values shown are the only possible tuples for all time)? Remember that a primary key must be unique and not null. 3) Describe the specific data anomalies that exist if we DELETE the tuple containing Jacqueline. 4) Draw a functional dependency diagram for the initial relation. This diagram should agree with the primary key you selected in above. This can be drawn in any drawing tool. 5) Based on your diagram, what normal form is the initial relation in? Why? 6) If necessary, decompose the initial relation into a set of non-loss 3NF relations by showing the relations, attributes, and tuples. Show complete relations with attribute headings and all data values in the tuples of your relations. Determine the number of 3NF relations you end up with after normalization, write this number, and then circle the number. Additional References: • What is Normalization? https://www.guru99.com/database-normalization.html • What is a Primary Key? https://www.techopedia.com/definition/5547/primary-key • What are data anomalies? https://databasemanagement.fandom.com/wiki/Data_Anomalies • What is a functional dependency diagram? https://www.dlsweb.rmit.edu.au/Toolbox/ecommerce/dad_respak/dad_tutorial/html/dad_db3f_tu t.htm#:~:text=A%20set%20of%20Functional%20Dependencies,the%20direction%20of%20the %20dependency. • The Third Normal Form. https://www.geeksforgeeks.org/third-normal-form-3nf/ Grading rubric Attributes Meets Does Not Meet Normal form 20 points Student correctly identifies normal form of initial relation 0 points Major error in identification of normal form or not specified Primary key 25 points Student correctly identified primary key of initial relation 0 points Major error with identification of primary key or not specified Data anomalies 15 points Student correctly describes data anomalies 0 points Major errors with description of data anomalies or not specified Functional dependency diagram 15 points Student correctly develops functional dependency diagram of initial relation 0 points Major errors developing functional dependency diagram or not specified Normalized 3NF relations 25 points Student correctly develops the proper set of 3NF relations via normalization 0 points Major errors in development of proper set of 3NF relations or not specified
This assignment allows students to demonstrate their skills in designing relational databases to satisfy specific business rules and requirements. The deliverables for this assignment include an Entity Relationship Diagram (ERD) and the associated detailed documentation describing the database design and structure.In this assignment you will be provided with a description of an application (below) to create an ERD and design accompanying table layout using sound relational modeling concepts and practices. The relationships between the entities and the attributes for the entities will be identified and described. This database will provide the foundation for the follow-on assignment. The following paragraphs provide the background and summary of the business requirements.Scenario You are a database consultant with Ace Software, Inc. and have been assigned to develop a database for the Mom and Pop Johnson Video Store in old-town. Mom and Pop have been keeping their records of videos and DVDs purchased from distributors and rented to customers in stacks of invoices and piles of rental forms for years. They have finally decided to automate their record keeping with a relational database.You sit down with Mom and Pop to discuss their business and watch their operation for about a week. Mom and Pop rent legacy video/DVDs and discuss their need to move away from maintaining their rental records on paper. You discover for 1 title, they typically (but not always) offer two formats including a video (VCR) and DVD format. Both formats of a movie are kept in a separate plastic case when rented out. They have several copies of each rental movie.There are several videos and DVDs for each movie title. You learn that in their inventory, they have several thousand videos and DVDs, which they get wholesale from about a half dozen distributors. The video and DVD prices to them are based on the quantity of their shipment and the past business they have done with each company.The cost of a DVD rental might be different than the price of a video rental for the same movie, even from the same distributor. Each distributor provides different types of movies (e.g., suspense, horror, mystery, comedy, etc.). A single distributor may provide several different types of movies in both video and DVD format. It is possible to obtain the same movie from multiple distributors, and at different wholesale prices.Each video and DVD has a unique identification number that Mom and Pop assign in their inventory, in addition to the distributor’s serial number for the item. Each movie also has a unique identification number Mom and Pop assign in addition to the title, and any movie IDs the distributors use in their electronic catalogs. Distributors provide electronic catalogs to Mom and Pop and the information from these catalogs must be included in the database.Mom and Pop need to record when a video or DVD is rented, when a video or DVD is returned, and all customer charges such as late and damaged fees, failure to rewind fees, and taxes. They need a report of which videos are returned late because there are standard and late charges. On occasion there are discount prices for certain movies or types of movies. Customers want to rent movies based on actors or actresses, running length, type of movie, rating, year released, the director, and the academy awards won (by the movie, the actors, the actresses and/or the directors). Customers also want to know how many videos they have rented in the last month, year, and so forth. Mom and Pop need to keep only basic information on customers in their database, such as name, address, telephone numbers, etc.There must be no limit to the number of video and/or DVD copies of a movie that Mom and Pop can have in their inventory. Video/DVD ID numbers, movie ID numbers, and distributor ID numbers for videos, DVDs, and movies are all different. Also, each movie must be able to have an unlimited number of actors, actresses, directors, and academy awards (i.e., Oscars). Other types of awards (e.g., Golden Globe, People’s Choice, etc.) are not of interest for this application. The rental of equipment, sale of videos, DVDs, popcorn, etc., is not to be kept in the database.Directions Using this information, you should: 1. Review the course content that contains information about: a. Review the difference between a Conceptual Model and a Logical Model (keep in mind that for this assignment, we are not addressing a Physical Model). b. Review the readings about entities (e.g. tables), their attributes (e.g. fields), and the relationships that provide the linkage between pairs of entities (tables). c. Review what a key attribute is for an entity, as this is the main mechanism that can associate one entity to another, as a primary way of doing this in an RDBMS.2. For your data model: a. First, determine a list of entities needed for the Mom and Pop database. b. Second, determine a list of ‘preliminary’ attributes for each of your entities. These are noted as ‘preliminary’ as you may decide to later change/modify the list of attributes in each entity. Be sure to also identify a key field for each entity. c. Third, create relationship sentence pairs between those entities that are related. You should not have any many-to-many relationships. Hint: If you do have any many-to-many relationships in your preliminary design, you will need to break these down and use an association/intersection entity.3. Draw an ER model using an ER tool. a. Use either ERAssistant or Visio to create an entity/relationship diagram (ERD) showing all your entities, attributes, and relationships. b. You will find ERAssistant and Visio in the virtual Lab Broker. c. Keep in mind that all entities should be related to at least one other entity. d. Your ERD should have all one-to-many relationships and must not have any many-to-many relationships.e. Develop the ERD and save your work. This may take a few revisions before you get the model to your perfection. Shown below is an Example ERD using the ‘crows foot’ notation. Please note that the following model DOES NOT FULLY represent the Mom & Pop video store. This example shows you a model that contains (a) entities, (b) attributes, (c) key fields/attributes for each entity, and (d) the relationships that exist between each pair of entities. For this assignment, create either an ERAssistant or Visio model that represents YOUR Mom & Pop video store. Note that the model below does not show the Foreign Keys. For your model, be sure to include the FKs in the related entity. Figure 1: Example ERD4. Create ‘metadata’ (e.g., data about data) that describes each entity (table) along with the attributes (field/column) in the ERD. While this information can be done in the comments section of ERAssistant or denoted in Visio, consider using a spreadsheet to identify your metadata for the database. Keep in mind that metadata is typically kept in a “data dictionary” for a given project in the organization, but we’ll simply use a spreadsheet for this assignment. Please pay particular attention to the description of all primary key (via “PK”) and foreign key (via “FK”) columns, as these support the relationships that are designed between tables. A ‘starter’ example of the meta data is shown below. EXPAND on this example to fully describe the entities, attributes, and relationships in your database. (see the readings for this week). Example (starter) Meta Data Mom & Pop Database Entity Name Attributes PK/FK? Data Type Description Producer ID PK integer Primary Key for Producer entity CompanyName no varchar (255) Producer Company Name Country no varchar (255) Producer Country Movie ID PK int Primary key for Movie ProducerID FK int This is the FK that points to Producer Title no varchar (255) Title of Movie Duration no int Length of Movie Rating no char(1) Customer rating of Movie Customer_Movie xxx xxx Customer xxx xxx Figure 2: Example (partial) meta data for the database 5. Submit a Word document that contains two parts: (a) a screenshot of the ERD (completed in ERAssistant or Visio), AND your metadata. Name the file your last name, followed by Project 2. For example: Smith_Project_2.ERD. Grading rubric Attribute Meets Does Not Meet Entities and attributes 20 points Student identifies a large potential set of entities and their attributes for the application 0 points Major problems with identification of entities and their attributes Relationship sentence pairs 20 points Student properly formats all required relationship sentence pairs to describe one-to-many relationships 0 points Major problem with development of relationship sentences ERD 40 points ERD properly includes and depicts all entities, attributes and relationships identified 0 points ERD is missing many items and/or has major problems with relationships Metadata 20 points Spreadsheet of table specification metadata properly includes all tables, their columns, and all required details for the columns 0 points Major omissions for table specification metadataResources that you might explore: Note: If the videos are no longer available on YouTube, do a search for other relevant content. 1. Difference between conceptual logical and physical data model: 2. ER Diagramming using ERAssistant: https://www.youtube.com/watch?v=a6UCXWJZ2GE 3. ER Diagramming using Visio:
A typical Relational Database Management System (RDBMS) project initiates with a well-written justification statement that supports the technology used for the given project. For Project 1, write a justification paper, of at least 3 pages or more (12 point font, double-space, in APA format with cited references), to your boss explaining how a relational database solution can be applied to a current business problem or area for improvement (either context, of your choice). Assume that your boss knows nothing about relational database theory, so a clear high-level explanation is necessary. The goal of this paper is to obtain your boss’s approval to proceed with your stated project. Do not focus on technical aspects of a database management system, as our audience (our boss) may not be as technical as is the development staff. In your paper, focus on how the information will be captured, manipulated, managed, and shared, and describe the value the relational database brings to the organization. Include brief examples of how other industries (both domestic and international) have successfully used relational databases to increase efficiency. Your paper must follow all APA Style Guide requirements. All sources must be properly cited using APA guidelines. Include an APA title page and an APA References page. The title page and References pages are in addition to the minimum of 2 pages of body text for your paper. In your paper you must include an introduction section with a heading, body text topic sections as appropriate with headings, and a conclusion section with a heading. Note that APA requires 12 point Times Roman font throughout and 1″ margins. Submission: You must submit your well-organized Word or PDF document to the LEO assignment area before the due date. Assignment 1 grading rubric Attribute Meets Does Not Meet Business justification 70 points Paper thoroughly provides good business, non-technical explanation of the benefits of a relational database solution 0 points Paper doesn’t provide adequate business justification Length and formatting 10 points Paper meets required length and is well formatted 0 points Paper doesn’t meet required length and is not properly formatted Grammar, typos, punctuation 10 points Paper is well-written, wellorganized with minimal grammatical or spelling issues 0 points Major grammatical, typographical, and/or punctuation errors APA Requirements 10 points Paper meets APA citation, References page, and title page requirements 0 points Major problems with APA citations, Reference page, and/or title page
This project is intended to help you understand caches and performance of out-of-order processors.As with previous projects, for this project you will need VirtualBox and our project virtual machine. Just like in previous projects, you will put your answers in the reddish boxes in this Word document, and then submit it in Canvas (but this time the submitted file name should be PRJ2.docx).In each answer box, you must first provide your answer to the actual question (e.g. a number). You can then use square brackets to provide any explanations that the question is not asking for but that you feel might help us grade your answer. E.g. answer 9.7102 may be entered as 9.7102 [Because 9.71+0.0002 is 9.7102].For questions that are asking “why” and/or “explain”, the correct answer is one that concisely states the cause for what the question is describing, and also states what evidence you have for that. Guesswork, even when entirely correct, will only yield up to 50% of the points on such questions.Additional files to upload are specified in each part of this document. Do not archive (zip, rar, or anything else) the files when you submit them – each file should be uploaded separately, with the file name specified in this assignment. You will lose up to 20 points for not following the file submission and naming guidelines, and if any files are missing you will lose all the points for answers that are in any way related to a missing file (yes, this means an automatic zero score if the PRJ2.docx file is missing). Furthermore, if it is not VERY clear which submitted file matches which requested file, we will treat the submission as missing that file. The same is true if you submit multiple files that appear to match the same requested file (e.g. several files with the same name). In short, if there is any ambiguity about which submitted file(s) should be used for grading, the grading will be done as if those ambiguous files were not submitted at all.Most numerical answers should have at least two decimals of precision. Speedups should be computed to at least 4 decimals of precision, using the number of cycles, not the IPC (the IPC reported by report.pl is rounded to only two decimals). You lose points if you round to fewer decimals than required, or if you truncate digits instead of correctly rounding (e.g. a speedup of 3.141592 rounded to four decimals is 3.1416, not 3.1415).This project can be done either individually or in groups of two students. If doing this project as a two-student group, you can do the simulations and programming work together, but each student is responsible for his/her own project report, and each student will be graded based solely on what that student submits. Finally, no collaboration with other students or anyone else is allowed. If you do have a partner you have toprovide his/her name hereNone(enter None here if no partner) and his/her Canvas username hereNone. Note that this means that you cannot change partners once you begin working on the project, i.e. if you do any work with a partner you cannot “drop” your partner and submit the project as your own (or start working with someone else) because the collaboration you already had with your (original) partner then becomes unauthorized collaboration.In this project we will be using the FMM benchmark with 256 particles and single-core execution, and we will continue to use the cmp4-noc.conf configuration file. Remember to first restore the cmp4-noc.conf file to its default contents. Also, if your branch predictor changes from Project 1 can result in changing the results of the simulation even when using the default (Hybrid) predictor, you need to restore the original code of the simulator. Essentially, you need to undo all the changes made in Project 0 and Project 1. Then you can run the simulation:cd ~/sesc/apps/Splash2/fmmIf the fmm.mipseb file is not already present in this directory, then build it:makeand run the first simulation we will need for this projectexactly like this (this should be one linewhere all ‘-‘ characters are the normal “minus” character, the line has a single space between -ofmm.out and -efmm.err, a single space character between fmm.mipseb and –p, a single space between –p and 1, and no spaces, tabs, or anything else after that):~/sesc/sesc.opt -f Default -c ~/sesc/confs/cmp4-noc.conf -iInput/input.256 -ofmm.out-efmm.err fmm.mipseb –p 1In this command line the –c, -o, and –e simulator options should already be familiar. The –f option tells the simulator to save the report file as sesc_fmm.mipseb.Default instead of using a random string at the end. This way you can produce report files with the names you need for your Project 2 submission, without having to rename them.As with every simulation, you should verify that the simulated execution didn’t crash or terminate too soon due to misspelling of the command line. After a correct simulation, the fmm.err file should be empty, and fmm.out should begin with “Creating a two cluster, non uniform distribution for 256 particles” and have a “Total time for steps 3 to 5 : 0” line at the end. Having this does not guarantee that everything is OK, but it at least means that FMM did not exit prematurely.In this project, we will be modifying the data caches of the simulated processor, so let’s take a closer look at the [DMemory] section of the configuration file. It says that the structure the processor gets data from is of type “smpcache” (it’s a cache that can work in a multiprocessor, as we will see Project 3), which can store 32KBytes of data (size parameter), is 4-way set associative (assoc parameter), has a 64-byte block/line size (bsize parameter uses cacheLineSize, which is set to 64 earlier in the configuration file), is a write-back cache (writePolicy), uses LRU replacement policy, and has two ports with port occupancy of 1cycle (so it can handle two accesses every cycle), has a 1-cycle hit time, and takes 1 cycles to detect a miss. If there is a miss, the processor keeps track of it using the DMSHR (data miss handling registers) structure, which is described in the [DMSHR] section as a 64-entry structure where each entry can keep track of a miss to an entire 64-byte block. On a miss, the L1 cache requests data from the core’s local slice of the L2 cache, or from the on-chip router that connects it to the L2 slices of other cores. Note that in this project we will still be using only one core (Core 0) so it gets to use the entire L2 cache (all four slices). Looking at the [L2Slice] section, we see that each slice can store 1 megabyte of data (so the total L2 cache size is 4MB), that it is a 16-way set associative cache with a 64-byte block size, write-back policy, LRU replacement, 2 ports, 12-cycle hit time, that it needs 12 cycles to detect a miss, and that it uses a 64-entry MSHR to keep track of misses. When there is a miss, it is handed off to a local on-chip router, which uses the on-chip network (NOC) to deliver the message to a memory controller. It in turn uses the off-chip processor-memory bus to access the main memory, which is modeled in this configuration as an infinite cache with a 200-cycle hit delay. Recall that a real off-chip main memory has a similar delay but has much more complicated behavior, so this simplification is there mostly to avoid specifying the myriad main-memory parameters.Now let’s change some cache parameters and see how they affect performance. Before we make any changes to the cmp4-noc.conf file, we should save the original so we can restore the default configuration later. In general, you should be very careful about ensuring that you have the correct configuration. The values for one thing (e.g. L1 cache) can affect what happens in other things (e.g. L2 cache), so you should be able to restore the default parameters when needed.The miss rate is much smaller for the simulation with larger L1 cache. With less cache miss, there is less need of bringing data from L2 cache and main memory to L1 caches. Since the instruction number is the same for both simulations and the Average Memory Access Time (AMAD) = hitTime + missRate * missPenalty, the AMAD for smaller L1 cache increases. Smaller L1 cache thus requires more works done for reading data from L2 cache and main memory. Also, according to the write-backpolicy, more cache miss also requires dirty data to be write more frequently to main memory, leading more cycles required. Amdahl’s law merely considers the speedup directly coming from L1 cache. However, there is L2 cache access and main memory access, whose latency is much greater than L1, leading the overall speedup to decrease. Thus, the actual speedup is very different from the calculated one. The cache implementation in the simulator can only model LRU replacement policy – note that a RANDOM policy can be specified in the configuration file but the code that models the replacement policy will still implement LRU even when RANDOM is specified. Now we will explore what happens when we actually change the cache’s replacement policy. We will implement the NXLRU (Next to Least Recently Used). While LRU replaces the block that is the first in LRU order (i.e. the least recently used block) in the cache set, NXLRU should replace the block that is the second in LRU order in the set, i.e. the second-least-recently-used block in the set.To implement NXLRU, we need to modify the code of the simulator. The source file which implements the ‘smpcache’ (used for our L1 cache) is in SMPCache.h and SMCache.cpp in the sesc/src/libcmp/ directory. For much of the “basic” cache behavior, the SMPCache uses code in sesc/src/libsuc/CacheCore.h (and CacheCore.cpp). There are separate classes for CacheDM (for direct mapped caches) and CacheAssoc (for set-associative caches). Since direct-mapped caches do not have a replacement policy (they must replace the one line where the new block must go), we will be looking at the CacheAssoc class. First we must add “NXLRU” as an option that can be specified in the conf file and selected when a CacheAssoc object is constructed. Probably a good approach is to look for “LRU” in the code to see how this is done for LRU (and RANDOM), and then add NXLRU. Then we must actually implement this policy. The function that actually implements the cache’s replacement policy is the findLine2Replace method of the CacheAssoc class in CacheCore.cpp. The parameter supplied to this method is the new address that needs a line in the cache. Note that this method does not only implement the replacement policy because an actual replacement (replace one valid line with another) may not be needed. For example, when addr is already in the cache (a cache hit), this method returns the line that contains addr. When the set where addr belongs contains non-valid lines, one of those non-valid lines is used – a valid block may have a cache hit in the future, while a non-valid line cannot, so we should only replace a valid line if the set has no non-valid lines. Finally, when the set contains “locked” lines they are skipped, so the actual “LRU” policy implemented by findLine2Replace is “From the set where addr belongs, return the line that contains addr if there is such a line, otherwise return the invalid line that was accessed most recently if there are any invalid lines, otherwise return the least recently used line among the lines that are not locked”. Even that is not the complete specification because findLine2Replace must consider what should happen when all lines are valid and locked – in that case it returns 0 unless ignoreLocked is true, in which case it returns the least recently used line chosen among all the (valid and locked) lines in the set.Our NXLRU policy should treat hits and invalid lines just like the existing LRU policy, but when there is no hit and no invalid lines to return, the NXLRU policy should find the second-least-recently-used line among the non-locked lines. However, if only one non-locked line exists in the set, that line must be returned, and if all lines are valid and locked the second-least-recently-used one in the set should be returned.Note that you have to add the NXLRU policy as an option in the configuration file, i.e. it is not OK to just change the existing LRU (or RANDOM) code to actually follow the NXLRU policy. Changing the behavior of existing policies will change the behavior of all cache-like structures in the processor, including TLBs. We will want to change the replacement policy only in L1 caches and leave behavior of TLBs, L2 caches, etc. unchanged!Make the changes needed to implement the NXLRU replacement policy and then:Note: Because report.pl does not provide summary statistics on the L2 cache, you will have to directly examine the report file generated by SESC. This file begins with a copy of the configuration that was used, then reports how many events of each kind were observed in each part of the processor. Events in the DL1 cache of processor zero (the one running the application) are reported in lines that start with “P(0)_DL1:”. Events in the L2 cache are reported separately for each of the four slices. In the report file, the number of blocks requested by the L1 cache from the L2 cache is reported as lineFill (these become entire-block reads from the L2 cache), and the number of write-backs the L1 wants to do to the L2 is reported as writeBack (these become entire-block writes to the L2 cache).Now we will change the simulator to identify what kind of L1 cache miss we are having each time there is a miss – compulsory, conflict, or capacity. Recall that a miss is a compulsory miss if it would occur in an infinite-sized cache, i.e. if the block has never been in the cache before. A capacity miss is a non-compulsory miss that would occur even in a fully associative LRU cache that has the same block size and overall capacity, and a conflict miss is a miss that is neither a compulsory nor a capacity miss. The L1 cache in the simulator counts read and write misses in separate counters (which appear in the simulation report as readMiss and writeMiss number for each cache, e.g. there is line in the report for “P(0)_DL1:readMiss=something” in the report file. Now you need to have additional counters, which should appear in the simulation report file as compMiss,capMiss, and confMiss counters (these three values should add up to the readMiss+writeMiss value). Each of the new counters should count both read and write misses of that kind. It is OK to also have counters that count compulsory, capacity, and conflict misses separately for reads and writes, or to do this classification of misses for other caches. But report files that do not have the overall (reads+writes) items for P(0)_DL1:compMiss, P(0)_DL1:capMiss, and P(0)_DL1:comfMiss will not be graded. Some helpful notes for Part 3:In the simulator, there are two kinds of misses – normal misses and “half-misses”. A half-miss occurs when the processors loads/stores a data item, the corresponding block is not present in the cache, but a cache miss is already in progress for that block. Note that a half-miss would not occur if the cache was handling one access at a time – the block would be brought to the cache as a result of a “normal” miss, and the access that was a half-miss would be a hit. To avoid confusion, in Part 3 of this project, you should only be concerned with the “normal” misses, i.e. you should treat half-misses as cache hits.Another potentially confusing consideration is that it is possible to have an access that is a hit in a set-associative cache but it a miss in the fully associative cache that we are modeling to determine if a cache miss is a conflict miss. This can occur, for example, when a cache block B is not accessed for a long time, but the other blocks that map to the same cache set are also not accessed for a long time. In a fully-associative cache, block B would eventually be replaced because we need room in the cache for other blocks, but in the set-associative cache we need room in other sets so block B stays in the cache. When B is eventually accessed, we get a hit in the set-associative cache and a miss in the fully-associative cache. For Part 3 of this project, you can simply ignore this problem – your task is to only look at misses that do occur in the actual cache and determine whether these misses would be hits in infinite-size and/or fully-associative caches, so accesses that are hits in the set-associative cache can be ignored.
In this project you will create a unique 3 graphics scene composed of OpenGL graphic components using transformation methods. Requirements: 1. Using Netbeans or Eclipse, develop a JOGL application that displays a unique 3D scene. The scene has the following specifications: a. Size: minimum 640×480 b. Includes at least 6 different shapes c. Uses at least 6 different transformation methods 2. Use Java and JOGL for your implementation of OpenGL 3. All Java source code should be written using Google Java style guide. 4. Prepare, conduct and document a test plan verifying your application is working as expected. This plan should include a test matrix listing each method you tested, how you tested it, and the results of testing. Deliverables: 1. All Java source code used for this project. Code should adhere to the Google Java style guide. 2. Word or PDF file demonstrating with clearly labeled screen captures and associated well-written descriptions, the successful execution of your 3D graphics scene. The document should be wellwritten, well-organized, include the test plan, include page numbers, captions for all screen captures, and a title page including your name, class, section number and date. References should be included for all sources used and formatted in APA style. Grading guidelines: Attribute Meets Design 20 points Methods used to isolate functionality (10 points) Code is efficient without sacrificing readability and understanding. (5 points) Code can easily be used and maintained. (5 points) Functionality 50 points Uses Netbeans or Eclipse to develop a JOGL application that displays a unique 3D scene. (10 points) Size of scene is at least 640×480. (10 points) 2 Includes at least 6 different shapes. (10 points) Uses at least 6 different transformation methods (10 points) Use Java and JOGL for your implementation of OpenGL (10 points) Testing 10 points Prepares, conducts and documents a test plan verifying application is functioning properly. (10 points) Documentation and deliverables 20 points Submits all Java source code used for this project. (5 points) Code adheres to the Google Java style guide. (5 points) Submits Word or PDF file demonstrating with clearly labeled screen captures and associated well-written descriptions, the successful execution of your 3D graphics scene. (5 points) The document is well-written, well-organized, includes the test plan, includes page numbers, captions for all screen captures, and a title page including your name, class, section number and date. References are included for all sources used and formatted in APA style. (5 points)
In this project you will create a unique 3D animated scene composed of WebGL graphic components. The scene should include animation, lighting, textures, frame buffers and multiple objects. Requirements: 1. Using WebGL create a unique 3D animated scene. The scene has the following specifications: a. Size: minimum 640×480 b. Includes at least 10 different objects. c. Uses multiple lighting effects on different materials d. Uses multiple textures e. Includes radio buttons, slider bars or other widgets to turn on or off certain components of the animation. f. Uses frame buffers to organize the memory resources that are needed to render the scene. 2. Use WebGL 3. All JavaScript source code should be written using Google JavaScript style guide.( https://google.github.io/styleguide/jsguide.html) 4. Prepare, conduct and document a test plan verifying your application is working as expected. This plan should include a test matrix listing each method you tested, how you tested it, and the results of testing Deliverables: 1. All JavaScript source code used for this project. Code should adhere to the Google Javascript style guide. 2. Word or PDF file demonstrating with clearly labeled screen captures and associated well-written descriptions, the successful execution of your 3D WebGL animated scene. The document should be well-written, well-organized, include your test plan, include page numbers, captions for all screen captures, and a title page including your name, class, section number and date. References should be included for all sources used and formatted in APA style. Grading guidelines: Attribute Meets Design 20 points Methods used to isolate functionality (10 points) Code is efficient without sacrificing readability and understanding. (5 points) Code can easily be used and maintained. (5 points) Functionality 50 points Creates a unique 3D animated scene. (10 points) 2 Size is at least 640×480. (5 points) Includes at least 10 different objects. (5 points) Uses multiple lighting effects on different materials. (5 points) Uses multiple textures. (5 points) Includes radio buttons, slider bars or other widgets to turn on or off certain components of the animation. (10 points) Uses frame buffers to organize the memory resources that are needed to render the scene. (5 points) Uses WebGL (5 points) Testing 10 points Prepares, conducts and documents a test plan verifying the application is functioning properly. (10 points) Documentation and deliverables 20 points Submits all JavaScript source code used for this project. (5 points) Code adheres to the Google JavaScript style guide. (5 points) Submits Word or PDF file demonstrating with clearly labeled screen captures and associated well-written descriptions, the successful execution of your 3D Three.js scene. (5 points) The document is well-written, well-organized, includes the test plan, includes page numbers, captions for all screen captures, and a title page including your name, class, section number and date. References are included for all sources used and formatted in APA style. (5 points)
Ask the user if they are taking a class (enter y, Y, n or N). If they are not taking a class print “Thanks for using the system.” and close the program. If they are taking a class proceed to ask for a grade as listed below. If the input is any character other than Y, y, N or n print “Invalid input” and close. This should work regardless of capital or lowercase inputs. Use if / else if / else for this part. If and only if the user is taking a class, ask them to enter a letter grade (A, B, C, D, or F, uppercase or lowercase). If they enter uppercase or lowercase A or B, print “Great Job!” If they enter uppercase or lowercase C print “You’re doing alright.” If they enter uppercase or lowercase D or F print “You can improve.” If they enter anything else then print “Invalid grade.” Regardless of input then close (including invalid). Use a switch statement for this portion. Hint: remember cases can spill through until a break and remember the default case. This should ONLY run if the user is taking a class! (Remember nesting). Test CasesTest Case 1: Are you taking a class?: Thank you for using the system. Test Case 2: Are you taking a class?: Thank you for using the system. Test Case 3: Are you taking a class?: Invalid Input. Test Case 4: Are you taking a class?: Please enter a grade: Great Job! Test Case 5: Are you taking a class?: Please enter a grade: Great Job! Test Case 6: Are you taking a class?: Please enter a grade: You’re doing alright. Test Case 7: Are you taking a class?: Please enter a grade: You can improve. Test Case 8: Are you taking a class?: Please enter a grade: You can improve. Test Case 9: Are you taking a class?: Please enter a grade: Invalid grade.
OK, so the spam acronym is a stretch! Here is the gratuitous “true story”: You work at Millisoft, a leading software company. One day the CEO, Gill Bates, comes into your office sipping on a Jolt Cola. “I’ve decided that Millisoft is going to have a new spell checking product called “spam” and it’s yours to develop and implement! As an incentive, you’ll get a lifetime supply (two six-packs) of Jolt when it’s done.” Spell checking of this type is both useful to those of us hoo hav trubbel speling (or tpying) and also useful in biological databases where the user types in a sequence (e.g. a DNA or amino acid sequence) and the system reports back the near matches. How do we measure the similarity of two strings? The “edit distance” between two strings S1 and S2 is the minimum number of “edits” that need to be made to the strings to get the two strings to match. An “edit” is either a replacement of a symbol with another symbol or the deletion of a symbol. For example, the edit distance between “spam” and “xsam” is 2. We can first delete the “x” in “xsam” leading to “sam” and then delete the “p” in “spam” to also make “sam”. That’s two edits for an edit distance of 2. That’s the best possible in this case. Of course, another possible sequence of edits would have been to delete the “s” and “p” from “spam” to make “am” and delete the “x” and “s” from “xsam” to to make also “am”. That’s 4 edits which is not as good as 2. Here’s an ED function (edit distance function): def ED(first, second): ”’ Returns the edit distance between the strings first and second.”’ if first == ”: return len(second) elif second == ”: return len(first) elif first[0] == second[0]: return ED(first[1:], second[1:]) else substitution = 1 + ED(first[1:], second[1:]) deletion = 1 + ED(first[1:], second) insertion = 1 + ED(first, second[1:]) return min(substitution, deletion, insertion) Now, here’s ED in action: >>> ED(“spam”, “xsam”) 2 >>> ED(“foo”, “”) 3 >>> ED(“foo”, “bar”) 3 >>> ED(“hello”, “below”) 3 >>> ED(“yes”, “yelp”) 2It’s cute, but it’s slow! Try your ED function on a few pairs of long words. For example, here’s my attempt to observe the extraordinary slowness of this program! Exercise your originality in finding other pairs of very long words to try out! >>> ED(“extraordinary”, “originality”) Wait for a bit – you will get an answer (it’s 10). Since the recursive program is very slow, Gill has asked you to implement it using memoization. Write a new function called fastED(S1, S2) that computes the edit distance using a Python dictionary to memoize previously computed results. The dictionary can be a global variable in your file. After writing fastED(S1, S2), test it to make sure that its giving the write answer. Here are a few more test cases: >>> fastED(“antidisestablishment”, “antiquities”) 13 >>> fastED(“xylophone”, “yellow”) 7 >>> fastED(“follow”, “yellow”) 2 >>> fastEd(“lower”, “hover”) 2SPAM! Finally, your last task is to write a function getSuggestions() which takes a user’s input word and finds some words in the dictionary that are close in edit distance. This function is used a function called spam() that loads in a large master list of words and then repeatedly does the following: • The user is shown the prompt spell check> and prompted to type in a word. • If the word is in the master list, the program reports Correct. • If the word is not in the master list, the program should compute the edit distance between the word and every word in the master list. Then the 10 most similar words in order of smallest edit distance to larger edit distance should be reported. Finding those similar words is the job of getSuggestions().The code for spam() is in the provided template file. >>> spam() spell check> hello Correct spell check> spam Suggested alternatives: scam seam sham slam spa span spar spasm spat swam Computation time: 2.06932687759 secondsThe master list of words is in the file 3esl.txt which you should download into the same directory (folder) where your program resides. It is simply a file with 21877 words in alphabetical order. Save this file on your machine. • The program uses a while-loop for the repeating process of prompting the user and responding to their input. We will study loops soon but you won’t be writing your own loops in this assignment. • The following three lines will open the file 3esl.txt read it, and split it into a list called words. f = open(“3esl.txt”) contents = f.read() words = contents.split(” “) We’ll talk about the reason for the dot notations in a few weeks. You will also see this notation below, for the .time() and .sort() functions. • To prompt the user for input, we use the Python function input(S) which displays the string S and then waits for the user to enter a string and hit the return key. The string that was typed in by the user is now the value returned by the input function. For example userInput = input(“spell check> “) displays the string spell check>, waits for the user to type in a string, and then returns that string so that userInput now stores that string. We also use .strip()which removes any spaces at the start or end of the string. • In order to compute the amount of time that transpires between two points in your program, we use the following. o The line import time imports the time package; o The call time.time() captures the number of seconds (a floating point number) that have transpired since your program started. By capturing time.time() at two different places and subtracting the first value from the second, you can determine the elapsed time in that part of the program. • Once the suggestion list is obtained, the program sorts it. We use a fast sorting algorithm built into Python named sort. This function is used as follows: suggestions.sort() will modify suggestions by sorting it in increasing order. This will sort suggestions but will not return anything. For a list of tuples, the function sorts by the first element; so we get our suggestion list sorted by distance. • We need to report the top 10 words. However, you might later wish to change 10 to 12 or even 42. So, rather than having the number 10 inside your code (that is called a “magic number” and it’s a bad thing to have in your code), we define a global variable called HITS and use that in the spam(). If you later decide that you want to show a different number of similar words, you can simply change the value of that global variable.
Pascal’s TrianglePascal’s Triangle was developed by a French mathematician named Blaise Pascal. The rows are numbered starting with 0 and go all the way to n, just like list indices in Python. The triangle always starts with a single term in the 0th row, which is a [1]. The nth row of the triangle has n+1 terms, and each term is found by adding the values of the two terms above it. For example, row number 2 (actually the third row) has three terms: [1, 2, 1]. The row above it, row number 1, is [1, 1], and the row above that one, row 0, is just [1]. Pascal’s Triangle has several uses in mathematics, such as binomial expansions. (http://en.wikipedia.org/wiki/Pascal%27s_triangle contains more information.) See how the terms are obtained in the figure below.Task 1: Here are some examples of calling the pascal_row function: >>> pascal_row(0) [1] >>> pascal_row(1) [1, 1] >>> pascal_row(5) [1, 5, 10, 10, 5, 1]CS 115 – Hw 4 Task 2: Write a second function called pascal_triangle that takes as input a single integer n and returns a list of lists containing the values of the all the rows up to and including row n. Here are some examples of calling the pascal_triangle function: >>> pascal_triangle(0) [[1]] >>> pascal_triangle(1) [[1], [1, 1]] >>> pascal_triangle(5) [[1], [1, 1], [1, 2, 1], [1, 3, 3, 1], [1, 4, 6, 4, 1], [1, 5, 10, 10, 5, 1]]Task 3: Write two functions, named test_pascal_row and test_pascal_triangle,with no arguments. They should do what the name suggests – test the corresponding function. There should be at least four tests each. For testing, use assertions, in the way shown in the file assert_LCS_change.py that was posted online. In brief, each test asserts that a call of your function equals the value expected.
Overview https://learning.oreilly.com/library/view/java-7-concurrency/9781849687881/index.html You should focus on the first 4 chapters. If you have previously signed up for the Safari account you don’t need to sign-up again. Just use this link: https://learning.oreilly.com/accounts/login/?next=/library/view/temporary-access/ If you have not previously requested a Safari account follow the details on this page to sign-up for your Safari Account: https://libguides.umuc.edu/safari You’ll need to sign in using your UMGC student email account. Once you sign in, you’ll have immediate access to the content, and you’ll shortly receive an e-mail from Safari prompting you to set up a password and complete your account creation (recommended). Students: Your UMUC e-mail account is your username + @student.umuc.edu (example: [email protected]). In addition, a zip file is included that includes several Oracle Java files that use different types of Swing components as well as threads. I recommend going through the reading and the examples to become familiar before attempting the final project. Assignment Details As a new engineer for a traffic congestion mitigation company, you have been tasked with developing a Java Swing GUI that displays time, traffic signals and other information for traffic analysts. The final GUI design is up to you but should include viewing ports/panels to display the following components of the simulation: 1. Current time stamps in 1 second intervals 2. Real-time Traffic light display for three major intersections 3. X, Y positions and speed of up to 3 cars as they traverse each of the 3 intersectionsSome of the details of the simulation are up to you but the following guidelines will set the guardrails: 1. The components listed above should run in separate threads. 2. Loop through the simulation with button(s) providing the ability to start, pause, stop and continue the simulation. 3. You will need to use basic distance formulas such as distance = Speed * time. Be sure to be consistent and define your units of measure (e.g. mile/hour, versus km/hour) 4. Assume a straight distance between each traffic light of 1000 meters. 5. Since you are traveling a straight line, you can assume Y = 0 for your X,Y positions. 6. Provide the ability to add more cars and intersections to the simulation through the GUI. 7. Don’t worry about physics. Assume cars will stop on a dime for red lights, and continue through yellow lights and green lights. 8. Document all assumptions and limitations of your simulation.Submission Requirements: 1. Submit all of your Java source files (each class should be in a separate .java file). These files should be zipped and submitted with the documentation. 2. UML class diagram showing the type of the class relationships. 3. Developer’s guide describing how to compile and execute the program. The guide should include a comprehensive test plan that includes evidence of testing each component of the menu with screen captures and descriptions supporting each test. Documentation includes Lessons learned.Grading Rubric: Attribute Meets Design 20 points Designs a Java Swing GUI that uses event handlers, listeners and incorporates Java’s concurrency functionality and the use of threads. Functionality 40 points Contains no coding errors.Contains no compile warnings.Constructs a Java Swing GUI that uses event handlers, listeners and incorporates Java’s concurrency functionality and the use of threads Include viewing ports/panels to display the following components of the simulation: 1. Current time stamps in 1 second intervals 2. Real-time Traffic light display for three major intersections 3. X, Y positions and speed of up to 3 cars as they traverse each of the 3 intersectionsThe components run in separate threads.Loop through the simulation with button(s) providing the ability to start, pause, stop and continue the simulation.Provides the ability to add more cars and intersections to the simulation through the GUI.Test Data 20 points Tests the application using multiple and varied test cases.Documentation and submission 20 pointsSubmission includes Java source code files, Data files used to test your program, Configuration files used.Documentation includes a UML class diagram showing the type of the class relationships.Documentation includes a user’s Guide describing of how to set up and run your application.Documentation includes a test plan with sample input and expected results, test data and results and screen snapshots of some of your test cases.Documentation includes Lessons learned.Documents all assumptions and limitations of your simulation.Documentation is in an acceptable format.Document is well-organized. The font size should be 12 point. The page margins should be one inch. The paragraphs should be double spaced. All figures, tables, equations, and references should be properly labeled and formatted using APA style. The document should contain minimal spelling and grammatical errors.
Overview In the project you will construct a Java Swing GUI that uses event handlers and listeners while expanding on the project 1 Shape theme. Before completing this exercise, be sure to review and try the Java class and inheritance examples and materials found in this free Safari resource: https://learning.oreilly.com/library/view/java-the-complete/9781260440249/ You should focus on Chapters 24, 25, 26, and 27 If you have previously signed up for the Safari account you don’t need to sign-up again. Just use this link: https://learning.oreilly.com/accounts/login/?next=/library/view/temporary-access/ If you have not previously requested a Safari account follow the details on this page to sign-up for your Safari Account: https://libguides.umuc.edu/safari You’ll need to sign in using your UMGC student email account. Once you sign in, you’ll have immediate access to the content, and you’ll shortly receive an e-mail from Safari prompting you to set up a password and complete your account creation (recommended). Students: Your UMUC e-mail account is your username + @student.umuc.edu (example: [email protected]). Assignment Details Design, implement and test a set of Java classes that allows a user to select a shape from a list of available shapes, enter appropriate dimensional parameters and then display that shape in a frame of your Swing-based GUI. For 3-D shapes consider loading an image from a file and displaying that as a representative. Your list of shapes should be similar, if not identical to the ones used in project one: • Circle • Square • Triangle • Rectangle • Sphere • Cube • Cone • Cylinder • Torus Take advantage of various Swing AWT components including Layout Managers, Event Handlers, Listener Interfaces, Adapter Classes, Inner Classes, Buttons and other widgets as needed. Take your time on understanding how the graphical components and listeners work so you can easily display appropriate actions based on any event. Submission Requirements: 1. Submit all of your Java source files (each class should be in a separate .java file). These files should be zipped and submitted with the documentation. 2. UML class diagram showing the type of the class relationships. 3. Developer’s guide describing how to compile and execute the program. The guide should include a comprehensive test plan that includes evidence of testing each component of the menu with screen captures and descriptions supporting each test. Documentation includes Lessons learned.Grading Rubric: Attribute Meets Design 20 points Designs a Java class Inheritance hierarchy that would satisfy the following isa and has-a relationships: • Circle • Square • Triangle • Rectangle • Sphere • Cube • Cone • Cylinder • Torus Functionality 40 points Contains no coding errors.Contains no compile warnings. Constructs a Java Swing GUI that uses event handlers and listeners while expanding on the project 1 Shape theme.Displays shapes in a frame of your Swing-based GUI. For 3-D shapes consider loading an image from a file and displaying that as a representative.Uses various Swing AWT components including Layout Managers, Event Handlers, Listener Interfaces, Adapter Classes, Inner Classes, Buttons and other widgets.Test Data 20 points Tests the application using multiple and varied test cases.Documentation and submission 20 pointsSubmission includes Java source code files, Data files used to test your program, Configuration files used.Documentation includes a UML class diagram showing the type of the class relationships.Documentation includes a user’s Guide describing of how to set up and run your application.Documentation includes a test plan with sample input and expected results, test data and results and screen snapshots of some of your test cases.Documentation includes Lessons learned.Documentation is in an acceptable format. Document is well-organized. The font size should be 12 point. The page margins should be one inch. The paragraphs should be double spaced. All figures, tables, equations, and references should be properly labeled and formatted using APA style. The document should contain minimal spelling and grammatical errors.
