亚洲天堂免费在线,丰满人妻在公车被猛烈进入电影,国产又黄又潮娇喘视频在线观看 ,久久黄色大片,国产女人伦码一区二区三区不卡,校花娇荡吟喘上课,亚洲区中文字幕在线不卡电影,亚洲黄色网页

合肥生活安徽新聞合肥交通合肥房產生活服務合肥教育合肥招聘合肥旅游文化藝術合肥美食合肥地圖合肥社保合肥醫院企業服務合肥法律

代寫EEE312、代做c/c++編程語言

時間:2023-12-28  來源:合肥網hfw.cc  作者:hfw.cc 我要糾錯



Course Code EEE312
Course Name Programming Practices
Lecturer Raja Majid Mehmood
Academic Session 2023/09
Assessment Title Final Project
A. Introduction/ Situation/ Background Information
This project applies the concept of numerical methods using C programming language. The project 
is a combination of several well-known numerical methods learnt in this course and a new 
algorithm that can be widely found through the Internet and valid sources.
B. Course Learning Outcomes (CLO) covered
At the end of this assessment, students are able to:
CLO 1 Design program using advanced algorithms and techniques.
CLO 2 Apply modern programming techniques to solve scientific problems.
C. University Policy on Academic Misconduct
1. Academic misconduct is a serious offense in Xiamen University Malaysia. It can be defined 
as any of the following:
i. Plagiarism is submitting or presenting someone else’s work, words, ideas, data or
information as your own intentionally or unintentionally. This includes incorporating 
published and unpublished material, whether in manuscript, printed or electronic form into 
your work without acknowledging the source (the person and the work).
ii. Collusion is two or more people collaborating on a piece of work (in part or whole) 
which is intended to be wholly individual and passed it off as own individual work.
iii. Cheating is an act of dishonesty or fraud in order to gain an unfair advantage in an
assessment. This includes using or attempting to use, or assisting another to use materials
XMUM.OAA - 100/2/8-V2.0 Page | 2
that are prohibited or inappropriate, commissioning work from a third party, falsifying 
data, or breaching any examination rules.
2. All the assessment submitted must be the outcome of the student. Any form of academic 
misconduct is a serious offense which will be penalised by being given a zero mark for the 
entire assessment in question or part of the assessment in question. If there is more than one 
guilty party as in the case of collusion, both you and your collusion partner(s) will be subjected 
to the same penalty.
D. Instruction to Students
Prepare report document (softcopy) based on given guidelines in Section F (Tasks). Submit 
softcopy (pdf file only) of report in Moodle course page by 11:59 on December 29, 2023. Late 
submission will result in a penalty. Report PDF file should include the following sections in same 
sequence,
Main Sections of Report:
1. Cover page: student name and student id
? Assignment Cover Pages (must be filled in and signed by student) - attached.
2. C programs section: source code with comments
? Include ONLY C programs for each task from Section F
3. Results and discussion section: detailed description of results
? To answer all tasks in Section F, demonstrate functionalities of each task. Include 
all programs results/outputs (if available) with description in your own words.
4. Marking rubrics: Include at the end of report/document – attached.
Note: 1) font: Times New Roman, 12pts, 2) line spacing: single line.
E. Evaluation Breakdown
No. Component Title Percentage
(%)
1. Source Code C Program 25
2. Results and Discussion 25
TOTAL 50
XMUM.OAA - 100/2/8-V2.0 Page | 3
F. Task(s) 
In this project, you are required to develop the Brent’s method using C programming language that can
solve a general non-linear equation.
To test your program, you are required to find the root of ??(??) = 4??
3 + 3??
2 ? 2?? ? 2 with a given initial 
THREE (3) points ??1 = 3, ??2 = 2, a???? ??3 = 1. Your program should display the results at every iteration 
of the algorithm until the solution converges when |b ? a| < ??, where ?? = 10?7
.
Your program should display each iteration including the method’s type (either IQI or Secant), the updated
values and the error ratio.
A description of program flow, algorithm and computational aspects of the problem is also required to be 
included in the report.
*Note that all codes should be written in a function format.
You are free to search about the Brent’s method to find out the behavior of Brent and how the method is
implemented.
A good source can be found from googling and searching through numerical analysis method.
Hybrid method
A hybrid approach, that combines the reliability of bracketing (Basically two initial points are required 
e.g., Bisection and etc.) with the speed of open methods (based on formulas that require only a single 
starting value of x or two starting values that do not necessarily bracket the root e.g., Fix Point Iteration 
and etc.).
Brent’s method
Brent’s method is a hybrid method that benefit from the reliability of bracketing models as well as the
speed of open methods. Brent’s root-location method is a clever algorithm that does just that by 
applying a speedy open method wherever possible but reverting to a reliable bracketing method if 
necessary. The approach was developed by Richard Brent (19**) based on an earlier algorithm of 
Theodorus Dekker (1969).
The bracketing technique is the trusty bisection method whereas two different open methods are 
employed. The first is the secant method explained next, the second is inverse quadratic interpolation 
(IQI).
IQI is similar in spirit to the secant method. The secant method is based on computing a straight line 
that goes through two guesses. The intersection of this straight line with the x axis represents the new 
root estimate. For this reason, it is sometimes referred to as a linear interpolation method. Now suppose 
that we had three points. In that case, we could determine a quadratic function of x that goes through 
the three points. Just as with the linear secant method, the intersection of this parabola with the 
x axis would represent the new root estimate.
Although this would seem to represent a great improvement, the approach has a fundamental flaw: It is 
possible that the parabola might not intersect the x axis. Such would be the case when the resulting 
parabola had complex roots.
Brent’s Method Algorithm
The general idea behind Brent’s root finding method is whenever possible to use one of the quick open 
methods. In the event that these generate an unacceptable result (i.e., a root estimate that falls outside 
the bracket), the algorithm reverts to the more conservative bisection method. Although bisection may 
be slower, it generates an estimate guaranteed to fall within the bracket. This process is then repeated 
until the root is located to within an acceptable tolerance. As might be expected, bisection typically 
dominates at first but as the root is approached, the technique shifts to the faster open methods
請加QQ:99515681 或郵箱:99515681@qq.com   WX:codehelp

掃一掃在手機打開當前頁
  • 上一篇:莆田大鵝最高版本多少錢一件,莆田大鵝羽絨服價格明細
  • 下一篇:正宗莆田鞋在哪買,推薦十個購買平臺
  • 無相關信息
    合肥生活資訊

    合肥圖文信息
    仿真分析咨詢外包服務-結構 / 熱 / CFD流體 / 電磁 / 光學CAE代做
    仿真分析咨詢外包服務-結構 / 熱 / CFD流體
    流體仿真外包多少錢_專業CFD分析代做_友商科技CAE仿真
    流體仿真外包多少錢_專業CFD分析代做_友商科
    CAE仿真分析代做公司 CFD流體仿真服務 管路流場仿真外包
    CAE仿真分析代做公司 CFD流體仿真服務 管路
    流體CFD仿真分析_代做咨詢服務_Fluent 仿真技術服務
    流體CFD仿真分析_代做咨詢服務_Fluent 仿真
    結構仿真分析服務_CAE代做咨詢外包_剛強度疲勞振動
    結構仿真分析服務_CAE代做咨詢外包_剛強度疲
    流體cfd仿真分析服務 7類仿真分析代做服務40個行業
    流體cfd仿真分析服務 7類仿真分析代做服務4
    超全面的拼多多電商運營技巧,多多開團助手,多多出評軟件徽y1698861
    超全面的拼多多電商運營技巧,多多開團助手
    CAE有限元仿真分析團隊,2026仿真代做咨詢服務平臺
    CAE有限元仿真分析團隊,2026仿真代做咨詢服
  • 豆包網頁版入口 Trae 目錄網 排行網

    關于我們 | 打賞支持 | 廣告服務 | 聯系我們 | 網站地圖 | 免責聲明 | 幫助中心 | 友情鏈接 |

    Copyright © 2025 hfw.cc Inc. All Rights Reserved. 合肥網 版權所有
    ICP備06013414號-3 公安備 42010502001045