代写Java编程、Java实验代做、代写留学生Java课程设计、Java课程设计代写

Homework 5 (70 points)Assigned: Thursday, 8 February 2018Due: Wednesday, 14 February 2018, 6pmThis homework is to be submitted electronically following instructions that willsoon appear on the course assignments page.The Java code you write for this homework assignment is not allowed tocontain any import or package declarations.0. [5 points] Create a directory named src5, which will contain all of the filesyou submit for this assignment, including at least:READMEQ1.pdfQ2.javaSet.javaSets.javaCreate a README file in the format described below. Your README file mustbe a plain text file in UTF-8 that contains no lines longer than 80 characters.The name of that file must be README, with no suffix; submitting a file namedREADME.txt, or any name other than README, will interfere with our automatedgrading and lower your grade on the assignment. Your README file must bestructured as follows:1. Its first line must consist of your name.2. Its second line must consist of your CCIS ID.3. Its third line must consist of the email address you would like us to usewhen communicating with you, as when we report your grade for thishomework assignment.4. You may write any comments you like in the fourth and following lines,but those comments are optional.1. [5 points] Consider the following problem:Given a Java arraycontaining n int values, return the smallest valuein the array.Prove that every algorithm for this problem has a worst-case running time inΩ(n).Typeset your proof using LATEX or some similar system suitable for typeset-ting mathematics, and convert your typeset proof into a PDF file named Q1.pdf.Place that Q1.pdffile inside the src2 directory you created for question 0 above.12. [15 points] Inside your src5 directory from question 0, create a file namedQ2.java that defines a Java class named Q2 that defines a public static methodnamed smallest that satisfies the specification given in the following skeletoncode:class Q2 {// Given a array of n integers// and a non-negative integer k 0, then that left curly brace is followed by the char-acters in the string ((Integer) s1.min()).toString()– if s1.size() > 1, then for each of the larger int values in the set acomma is followed by the characters that express that value– a right curly brace }in that order.Examples for questions 3 and 4:Set s0 = Sets.empty();Set s00 = Sets.empty();Set s2 = s00.adjoin(2);Set s28 = s2.adjoin(8);Set s285 = s28.adjoin(5);Set s2853 = s285.adjoin(3);Set s5 = s0.adjoin(5);Set s58 = s5.adjoin(8);Set s582 = s58.adjoin(2);Set s583 = s58.adjoin(3);Set s5832 = s583.adjoin(2);Set s585 = s58.adjoin(5);assert s0.size() == 0;assert s00.size() == 0;assert s58.size() == 2;assert s585.size() == 2;assert s0.contains(0) == false;assert s00.contains(5) == false;assert s58.contains(2) == false;assert s583.contains(2) == false;assert s585.contains(5) == true;assert s585.contains(8) == true;assert s5.min() == 5;assert s5832.min() == 2;assert s2853.min() == 2;assert s5.max() == 5;assert s5832.max() == 8;assert s2853.max() == 8;assert ! s0.equals(null);assert ! s582.equals(null);assert ! s582.equals(&"some random object&");assert s0.equals(s00);assert ! s0.equals(s5);assert s2853.equals(s5832);assert ! s2853.equals(s285);assert s0.hashCode() == s00.hashCode();assert s2853.hashCode() == s5832.hashCode();assert s5832.toString().equals (&"{2,3,5,8}&");本团队核心人员组成主要包括BAT一线工程师，精通德英语！我们主要业务范围是代做编程大作业、课程设计等等。我们的方向领域：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 或邮箱：[email protected] 微信：codehelp QQ：99515681 或邮箱：[email protected] 微信：codehelp