代做留学生CE4703语言、R编程作业帮做、代做R实验作业、R程序代做、代做R实验作业、R语言代做留学生

CE4703: Computer Software 3 Marked ExerciseCE4703 Marked Exercise1 OverviewThe task is to implement a user-defined data type plus related functions.This programming project is to be undertaken in groups of three to five students- please add your groups to the “Wiki” section of the module’s SULIS page.Make sure to distribute your code over suitable files. Source code must be prop-erly formatted and commented. Projects must compile (using gcc) and run onUbunut Linux. Solutions are to be submitted via SULIS as a single tar archive(please make sure before submission that all required files are inside the tararchive - if you archive is incomplete, you will loose significant marks).Deadline for submission of your project solution is Friday of week 12 (24.11.2017).Provide an data type for a polynomial of arbitrary order, i.e. your ADT should beable to store the coefficients of a polynomial of the form. anxn+...+a2x2+a1x+a0,where the order/degree n of the polynomial is determined at run-time (and canbe modified at run-time). To facilitate arbitrary order of the polynomial, storeall the coefficients in a dynamic data structure such as a dynamic arrayor a linked list. Solution based on static arrays or variable length arrays (VLA)will incur a heavy penalty (obtained marks will be downgraded by factor 0.33).Hint: In order to simplify the operations on polynomials, you should store allcoefficients from a0 to an, i.e. the stored coefficients of the polynomial x4 + 3.1x2are a4 = 1, a3 = 0, a2 = 3.1, a1 = 0, a0 = 0.Provide at least the following operations:• create/delete a polynomial• add/subtract two polynomials• multiplication/division by a double• normalise polynomial (coefficient of highest order term = 1)• return order of polynomial (the highest power with coefficient negationslash= 0)• print polynomialPlease follow the instructions in the Design section closely.Page 1 of 3CE4703: Computer Software 3 Marked Exercise2 Design• Design a data type for your polynomial - i.e. decide on how you plan tostore polynomials.• For each operations, write down a specifications as discussed in the SevenSteps of Systematic Program Construction.• Then decide how the user will see your operations and write down functionprototypes (function declarations) for all operations.• For each operation, develop an algorithm in pseudo-code, test it (desktoptesting) and repeat this until you are happy that your algorithm is workingcorrectly.• Implement each operation in the C programming language.• Once your data type and all functions are implemented, design a test main-function (in a separate file) to verify that your implementation complieswith your specification. Keep in mind, that testing is a destructive process,i.e. the tester does his best to break the program. If the tester cannot causeyour program to crash on purpose, you can be confident, that a user willnot crash your program by accident. Pay particular attention to bordercases and illegal values for parameter.• You must provide your own Makefile (this must be written by yourself -no IDE generated Makefile will be accepted). Your Makefile must have thefollowing features:– Use separate targets for compilation and linking.– Use at least one make file variable.– Provide a “clean” target that removes temporary files, object files andexecutables created by this Makefile.– Does not use any implicit rules.– Running make without a target should compile link your applicationand also automatically execute your application.3 Deadline MarkingThis project is worth 20% of the module.The Deadline for the project is Fridayof week 12 (24.11.2017). In general, all group members will receive same marks - ifany member is not contributing, please contact me asap (marks may be reduced).Page 2 of 3CE4703: Computer Software 3 Marked ExercisePlease submit your solution as a single tar archive via the SULIS page (only onesubmission per group is needed). To create a tar archive, use the command tarcvf projectArchive.tar projectFolder, where projectArchive is the nameyou want to give to your archive and projectFolder is the directory that containsall your deliverables (you can enter “man tar” to read information about tar -press ’q’ to quit). Please make sure:• not to compress you archive, as this sometimes causes problem when ex-tracting (do not use the ’z’ option or similar).• you are using tar and no other archieve tool.• you are using a “.tar” extension.• your archieve contains all deliverables - I cannot accept any modificationsto your submission after the deadline.A complete solution includes the following:1. A text document containing an explanation of your designed data type,your specification and your pseudo-code for all operations.2. Well formatted and documented source code - distributed over suitable files- that implements the project.3. A test main function that tests all the operations on your data type.4. A Makefile used to compile the application (as outlined in the design sec-tion)The marking scheme for this project is as follows:Data Type explanation: 3Pseudo-Code for all operations. 4Well formatted source code for your data type and all operations(distributed over suitable files)Test Main Function 4Makefile 2Penalties:Insufficient comments: Up to -30%Poor code format: Up to -30%Poor file structure Up to -15%Not using dynamic dynamic data structure -67%Bad coding style. (e.g. using goto or global variables) Up to -50%Total 20本团队核心人员组成主要包括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