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

        PX390編程代做、C/C++程序語言代寫

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



        PX3** 202**4, Assignment 3
        1 Intro
        The purpose of this exercise is to further expand your knowledge of C and your
        ability to understand and test numerical code. You are given a code which
        should solve two coupled partial differential equations. The code is, however,
        broken and needs to be fixed. Your task is to read the specification, understand
        the program, and ‘debug’ it. At the end of this task the program should do
        what these specifications say it is meant to do. Some of these problems with
        the code are basic C programming errors, other are more subtle mismatches
        between the required and actual code behaviour.
        You should submit a single C source file with a list of corrected bugs, at the
        top of the C source file (in comments), where I have added a placeholder (this
        description will not be marked but helps both of us keep track of what you have
        changed). You may submit your code via the link in the assignment section of
        the moodle page.
        The code must compile and generate no warnings when compiled with
        gcc -Wall -Werror -std=c99 -o assign3 assign3.c -lm
        There are a finite number of bugs, but we will not tell you how many: make
        sure that your code actually works by testing it rather than just looking for
        obvious errors. Some errors may be repeated in multiple statements, or may
        effect multiple lines of code.
        1.1 How is it marked
        Marks are given for the absence of each bug (in an otherwise correctly working
        code) and for the code compiling correctly. You may lose marks in more than one
        category for sufficiently severe problems. A correctly working code will contain
        a stable and consistent finite difference method for solving the equations below.
        1.2 Tips
        1. The compiler is your friend. Start with the first warning/error messages
        and work through them until there are none left.
        2. Some bugs are hard to catch just by inspecting the code. Adding printf
        statements is usually the easiest way to check that the code is doing what
        you think it is: check the maths at the first timestep, for example.
        3. You can often catch bugs in numerical code by looking at the output
        graphically: does it do something strange at the boundaries? A variety of
        tools (Matlab/matplotlib/Origin) exist which can take numerical output
        and plot it for you. This is one of the things you should learn while doing
        this assignment as it will be essential later on.
        1
        4. Learn how to use debuggers (gdb). Memory checking tools like valgrind
        can help catch issues to do with reading/writing into an incorrect memory
        location.
        5. It is expected that you will allocate arrays on the heap and that the
        allocated memory is released (freed) after use.
        2 Specification
        The code must use a simple, convergent, finite difference scheme to solve the
        coupled differential equation for real-valued functions u and v with
        ∂u
        ∂t − K

        2u
        ∂x2
        − v(u + 1) = 0 (1)
        ∂v
        ∂t − K

        2v
        ∂x2
        + u(v + 1) = 0 (2)
        The equation is to be solved on a 1D x domain with x ∈ [0, length], as an
        initial value problem. The domain length, number of grid points, length of time
        over which to solve and the coefficients are defined at the start of the main.
        The initial condition is u(x, 0) = 1.0 + sin(2πx/[length]), v(x, 0) = 0.0. The
        first grid point is at x = 0, and the final point at x =[length]= (nx−1)×δx. The
        function and its derivatives are periodic, so periodic boundary conditions should
        be enforced, that is, u(x = 0) = u(x =[length]) and v(x = 0) = v(x =[length]).
        The provided code may take a slightly different approach to periodic boundaries
        than your used to so examine closely. Please note that at no point should the
        values of u or v blow up to infinity.
        2.1 Output
        The code outputs simulation data at a fixed interval in time equal to the chosen
        time step dt: it should output the initial values (at t=0), and at dt, 2dt, 3dt . . .
        (but not necessarily the final value).
        The time t, x coordinate, and u and v are written in that order in a single
        output line for each gridpoint. Do not add extra comments/blank lines to
        the output, which should contain only numbers! Remember that I will need
        to read the numbers, so if it is output in an unreadable format then you’ll lose
        marks.
        請加QQ:99515681 或郵箱:99515681@qq.com   WX:codehelp

        掃一掃在手機打開當前頁
      1. 上一篇:代做EF5070、代寫c/c++編程設計
      2. 下一篇:代做指標 通達信回踩確認主圖指標代寫
      3. 無相關信息
        合肥生活資訊

        合肥圖文信息
        出評 開團工具
        出評 開團工具
        挖掘機濾芯提升發動機性能
        挖掘機濾芯提升發動機性能
        戴納斯帝壁掛爐全國售后服務電話24小時官網400(全國服務熱線)
        戴納斯帝壁掛爐全國售后服務電話24小時官網
        菲斯曼壁掛爐全國統一400售后維修服務電話24小時服務熱線
        菲斯曼壁掛爐全國統一400售后維修服務電話2
        美的熱水器售后服務技術咨詢電話全國24小時客服熱線
        美的熱水器售后服務技術咨詢電話全國24小時
        海信羅馬假日洗衣機亮相AWE  復古美學與現代科技完美結合
        海信羅馬假日洗衣機亮相AWE 復古美學與現代
        合肥機場巴士4號線
        合肥機場巴士4號線
        合肥機場巴士3號線
        合肥機場巴士3號線
      4. 上海廠房出租 短信驗證碼 酒店vi設計

        主站蜘蛛池模板: 久久婷婷久久一区二区三区| 久久久久人妻精品一区 | 国产成人久久一区二区不卡三区| 久久99久久无码毛片一区二区 | 成人日韩熟女高清视频一区| 免费一区二区无码东京热| 成人在线视频一区| 亚洲色婷婷一区二区三区| 3d动漫精品啪啪一区二区免费| 91视频一区二区三区| 夜精品a一区二区三区| 国产色精品vr一区区三区| 射精专区一区二区朝鲜| 精品国产AV无码一区二区三区| 精品视频在线观看一区二区| 国产在线观看一区精品 | 亚洲日韩国产欧美一区二区三区 | 国产丝袜美女一区二区三区| 精品欧洲av无码一区二区| 制服美女视频一区| 一区二区三区在线|欧| 激情久久av一区av二区av三区| 国偷自产Av一区二区三区吞精| 97精品一区二区视频在线观看 | 久久国产一区二区| 亚洲日韩精品国产一区二区三区| 国产精品xxxx国产喷水亚洲国产精品无码久久一区 | 中文字幕精品亚洲无线码一区| 精品无码一区二区三区在线| 一区二区3区免费视频| 国产日本一区二区三区| 国产一区三区三区| 国产在线精品一区在线观看| 熟妇人妻AV无码一区二区三区| 色一情一乱一伦一区二区三区日本 | 国产精品自拍一区| 亚洲日韩精品无码一区二区三区| 久久精品无码一区二区三区免费| 国产精品无码一区二区三级 | 国产成人精品一区二区秒拍| 国产精品伦子一区二区三区|