JAVA MAC OSX英文编程作业代写代做

CMSC 221: Data Structures
Section: 02
Spring 2017

Programming Assignment 4
________________________________________
Due: Apr. 24 by 5pm
________________________________________
Description
Assignment 3 focuses on implementation and analysis of graphs and graph algorithms. You are to implement an adjacency list graph and a breadth first search at a minimum. You will make a report of your findings.
This program may be a pair assignment. Please let the instructor know of the pairs as early as possible. There may only be more than two in extreme circumstances. Pairs will be required to do a little more, but will turn in a single report and single zip file of the code.
Program Requirements
? Starting code is found here.
? Put your name at the top of any file you edit with a comment block.
? You can make all of the code at once with the command make, all of the documentation again with the command make docs.
? Rudamentary (not true unit testing) is provided to aid you in determining if your implementation is correct, however, note the tests are not exhaustive! If all tests are reported to pass, this is only part of the process. If you are not convinced your code is correct, please add more tests.
? Some items to consider:
o Code documentation. Nice output will be found in Docs. Open index.html in your web browser of choice to see an interactive documentation system. Please note all comments, some tell how the functions should be implemented, what variable names mean, etc.
o Textbook implementation of a graph (note these likely will not match 100%).
? You need to implement an adjacency list graph (interface found in Graph.java) inside of AdjacencyGraph.java.
? You need to implement reading a graph from a file, writing a graph to file, and breadth-first-search at a minimum in GraphAlgorithms.java.
o Use the following as file specifications:
Example file:
5 4
D
E
N
N
Y
0 1 40
3 4 23
1 0 40
4 3 23

Specification
num_vertices num_edges
vertex_0
vertex_1
...
vertex_n
edge_0
edge_1
...
edge_m

Note edges are formed as v_i v_j weight. A large example is found in football.g in the starting files.
? In addition, you will create your own Timing.java to analyze your solutions on the following types of input:
o Complete graphs
o Planar graphs
o Random graphs
Code to produce these can be found in Competition.java
? If you decide to work with a partner you must also implement one of the MST or SSSP algorithms for your graph in GraphAlgorithms.java.
Report Requirements
Your report will include the objective of the assignment, brief description of your implementation, and a discussion of your results (theoretical and experimental). At a minimum your report should include the following organized into sections. Use a technical writing style and typeset your report in LaTeX. In this report, you are to design your own experiment to analyze big-oh complexity of your breadth-first-search algorithm.
? Introduction. In this section, state or describe the objective of the assignment, a statement about what you learned in the assignment, and a statement summarizing your results.
? Implementation details. Give a brief description of how you implemented the assignment, including what you learned.
? Theoretical analysis. In this section, you should provide a theoretical analysis (i.e., Big-Oh) for the breadth-first-search algorithm in regard to your experiments. You do not need to reason about memory complexity.
? Experimental Setup. In this section, you should provide a description of your experiment setup, which includes but is not limited to Machine specification, i.e., processor type, amount of ram, OS, etc.
? Results & Discussion. In this section, you will deeply analyze the performance of breadth-first-search. Include and discuss plots connecting data back to theoretical discussions per designed experiment. For each input type and each array plot:
1. Plot input size vs. time.
2. Plot input size vs. time/expected time to determine the Big-Oh constants.
You may combine related plots as you deem fit to your presentation style. Be sure to think deeply about the input sizes, breadth-first-search is much more costly than in the prior assignments. Choose a range of data that is appropriate and can still give a nice trend (hopefully at least 10 data points, if not more).
? Conclusion. Summarize your findings.
?
? If you decide to work with a partner you must also report on your additional algorithm.
Bonus
Each extra graph algorithm you implement and compare with in your report will earn you bonus points. 2 points per extra algorithm implementation and 3 points for each extra analysis. So in total you can earn 25 more points -- depth-first-search, two different MST algorithms, two different SSSP algorithms.
Competition
I am curious which person/team can create the best implementation of a graph. Those wishing to participate in a competition can submit their code to me (night before the due date via email). I will keep current bests here for others to see. The winners will receive a special prize!
? The graph must conform to the specifications given and must compile with Competition.java in order to be able to participate in the competition.
? I will be performing random graph operations and algorithms (including edge/vertex deletion).
? Failure to complete the test/segfault will result in a disqualification.
? Top times (sorted order)
1. Jory second implementation. Sizes: 300, 1600, 800
2. Jory first implementation. Sizes: 300, 1600, 800
3. Paul Torre's first implementation. Sizes: 300, 1600, 800
________________________________________
General Instructions, Turning in assignments, and Grading
General Instructions
? Name each file and program as listed in the instructions (if there are new files to create).
? The top of each file you modify should have a comment of your name.
? Use proper coding style (described more in Grading below)
? Follow turn-in instructions precisely.
? Failure to complete any of these steps will result in a significant loss of points.
Turn in Instructions
Each assignment will be turned in to both Blackboard (soft copy) and in class (hard copy). Assignments are due BEFORE, let me repeat, before class starts. This does not mean five minutes after class starts.
? Soft copy (Online submission)
o Create a compressed .zip file of all Java programs needed to compile your program and all input files (if needed) to run your program.
? If you do not know how to create a compressed .zip file, there is this cool new website you can use to search for instructions by entering "How to create .zip Windows 10" or "How to create .zip MAC OSX" for example.
o Submit .zip file on Blackboard by the stated due date and time.
o Submit a .pdf file on Blackboard of your report by the stated due date and time. This will be a separate turnin from the code.
? Hard copy (In-class submission)
o The first page of your hard copy must be a signed coverpage.
o Next put the programs (only the ones you wrote code in) in order as described in the description.
? If you do not know how to print a java file, there is this cool new website you can use to search for instructions by entering "How to open and print .java file Windows 10" or "How to open and print .java file MAC OSX" for example. In combination with this, you may have to consult University of Richmond webpages to learn how to use campus printers. I recommend printing directly from sublime text editor on University computers (has printing feature enabled) and will print with syntax-highlighting (colors).
o Staple all pages together.
o Turn in packet before class begins.
o With a separate signed coverpage print out and turn in your report.
? I reserve the right to assign a 0 to any assignment failing to comply with these instructions. Even for something as small as a missing staple.
Points
? Each assignment is graded out of 100 points (not including bonus). 50 points for the report and 50 points for the code.
? Criteria and point distribution
o If the code is not named precisely or does not compile, -75% of the code.
o If the code does not generate the correct output, -50% of the code.
o Following instructions and algorithm used to solve, 25% of the code. Following instructions is extremely important in computer science, train yourself to think like a computer. There are many ways to solve a problem, some may be better or worse than others.
o Stylistic elements of written code, 25% of the code. Style includes (but is not limited to):
? Descriptive comments on intent and purpose of code
? Descriptive and consistant naming conventions
? Indenting properly (after an opening brace, tab right by 1 indent; after a closing brace, tab left by 1 indent)
? Consistent spacing
? Consistent bracket placement (same line or on new line)
? Avoiding code duplication
Programming style is important to be able to communicate your solutions to another programmer (e.g., Jory).
o Content of written report, 80% of the report.
o Clarity and style of written report, 20% of the report.
Note - a compiling, correct program ≠ 100%, just like a composed paper with the minimum requirements discussed ≠ 100% for an English Writing class.
? If there are any discrepencies in grades please see the instructor during his office hours or by appointment (do not discuss with the lab assistants or graders).
http://www.6daixie.com/contents/9/1304.htm

本团队核心人员组成主要包括硅谷工程师、BAT一线工程师，国内Top5硕士、博士生，精通德英语！我们主要业务范围是代做编程大作业、课程设计等等。

我们的方向领域：window编程数值算法 AI人工智能金融统计计量分析大数据网络编程 WEB编程通讯编程游戏编程多媒体linux 外挂编程程序API图像处理嵌入式/单片机数据库编程控制台进程与线程网络安全汇编语言硬件编程软件设计工程标准规等。其中代写代做编程语言或工具包括但不限于以下范围:
C/C++/C#代写
Java代写
IT代写
Python代写
辅导编程作业
Matlab代写
Haskell代写
Processing代写
Linux环境搭建
Rust代写
Data Structure Assginment 数据结构代写
MIPS代写
Machine Learning 作业代写
Oracle/SQL/PostgreSQL/Pig 数据库代写/代做/辅导
Web开发、网站开发、网站作业
ASP.NET网站开发
Finance Insurace Statistics统计、回归、迭代
Prolog代写
Computer Computational method代做

因为专业，所以值得信赖。如有需要，请加QQ：99515681 或邮箱：<a href="mailto:[email protected]">[email protected]</a>
微信：codinghelp

JAVA MAC OSX英文编程作业代写代做

猜你喜欢