99爱在线视频这里只有精品_窝窝午夜看片成人精品_日韩精品久久久毛片一区二区_亚洲一区二区久久

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

代寫CS1010S: Advanced Recursion

時間:2024-02-24  來源:合肥網hfw.cc  作者:hfw.cc 我要糾錯


CS1010S: Programming Methodology

Semester II, 2023/2024

Mission 4

Advanced Recursion

Release date: 16th February 2024

Due: 22nd February 2024, 23:59

Required Files

• mission04-template.py

Background

After demonstrating your abilities to Pharaoh Tyro, you were honored with the presti-gious role of bishop within his esteemed team. The anticipation was palpable as you entered his chambers, where Tyro’s eyes sparkled with expectation. With a grand ges-ture, he handed you three scrolls (Your mission tasks), each bearing the royal seal.

"These," he declared, his voice resonating with authority, "are your inaugural assign-ments as bishop. Execute them diligently and report to me during the upcoming CS1010S class."

This mission consists of three tasks.

Task 1: Number of ways to sum to an Integer (3 marks)

A positive integer n ≥ 2 can be expressed as the sum of a number of positive integers smaller than n. For example:

2 = 1 + 1

3 = 1 + 2

   = 1 + 1 + 1

4 = 1 + 3

   = 2 + 2

   = 1 + 1 + 2

   = 1 + 1 + 1 + 1

5 = 1 + 4

   = 1 + 1 + 3

   = 2 + 3

   = 1 + 2 + 2

   = 1 + 1 + 1 + 2

   = 1 + 1 + 1 + 1 + 1

The function num_sum returns the number of ways that an integer can be expressed as the sum of a number of positive integers. From the above examples, it should be clear that:

>>> num_sum ( 2 )

1

>>> num_sum ( 3 )

2

>>> num_sum ( 4 )

4

>>> num_sum ( 5 )

6

Hint: If you grasp the essence of the count change problem, you’ll recognize that this problem is a variation of it. You may want to consider implementing a helper function that model the count change process of this problem. Solving the problem using closed-form formulas are not allowed.

Task 2: Generalized Pathfinding: Enumerate All Paths (3 marks)

In Lecture Training 5, you faced a problem where you were required to assist Jon in im-plementing a function, num_of_possible_path(board). This function determined the num-ber of possible paths to move from the starting point "S" to the ending point "E" by either walking (covering 1 step) or jumping (covering 2 steps).

Now, you encountered a similar challenge. The game no longer restricts the steps to just 1 or 2; instead, it can be any arbitrary number of steps (i.e. 1, 2, 3, ..., n). Your task is to implement an iterative recursive function, num_of_possible_path(board), which calculates the number of possible paths to move from the starting point "S" to the ending point "E" given that there are n possible ways to move at each step.

You may assume substring(string, start, end, step) function is given.

Hint: Observe that this problem resembles a count change problem. At each step, you have the choice to move 1 step forward, or 2 steps forward, or 3 steps forward, and so on, up to n steps forward.

>>> num_of_possible_path ("S##E", 1 )

1

>>> num_of_possible_path ("S##E", 2 )

3

>>> num_of_possible_path ("S##E", 3 )

4

Task 3: Check valid brackets (5 marks)

Consider a string containing only brackets "(" and ")". A string of brackets is considered valid if:

• Every opening parenthesis has a corresponding closing parenthesis.

• Opening and closing parentheses are in the correct order.

• Each closing parenthesis has a matching opening parenthesis.

Implement a function, check_valid_brackets(s), that returns True if the string s is valid brackets, and False otherwise.

Hint: If a string of brackets is valid, it can repeatedly remove the innermost non-nested "()" until it becomes an empty string.

Subtask 3a: Illustrate Your Problem-Solving Approach

In Lecture 1, you have learnt the Polya’s Problem Solving Process:

1. Understand the Problem

2. Make a Plan (Create a Flowchart, as outlined in Lecture 1 slides)

3. Do the Plan

4. Review & Generalize

Apply the Polya problem-solving methodology, and demonstrate your problem-solving process for Task 3. You are tasked to write out each step, providing insights into your approach and decision-making. This exercise aims to reinforce your understanding and application of the problem-solving methodology.

Please submit your illustration to coursemology. Note that you must include Step 1 and Step 2 in your illustration; Step 3 and Step 4 are optional. (For an example, please refer to Coursemology -> Workbin -> PolyasProblemSolvingExample.pdf)

By using the idea of divide and conquer, here are the steps to solve Task 2

1. Implement an iterative function remove_bracket_pair(s) that takes in a string of brackets. This function iterates through the string from left to right, removing the first occurrence of the brackets pair "()" within the string s, and returns the modified string. You may assume substring(string, start, end, step) function is given.

>>> remove_bracket_pair (" ()()() ")

" ()() "

>>> remove_bracket_pair (" (()()) ")

" (()) "

>>> remove_bracket_pair (" ((())) ")

" (()) "

>>> remove_bracket_pair (")()")

")"

>>> remove_bracket_pair ("()")

""

>>> remove_bracket_pair (" (())((())) ")

" ()((())) "

2. Using the above iterative remove_bracket_pair(s) function, implement a recursive check_valid_brackets(s) that takes in a string of brackets and returns True if the string s is valid brackets, and False otherwise.

>>> check_valid_brackets ("()")

True

>>> check_valid_brackets (" (()) ")

True

>>> check_valid_brackets (" ()() ")

True

>>> check_valid_brackets (" (()")

False

>>> check_valid_brackets (" ())")

False

>>> check_valid_brackets (" ())( ")

False

Subtask 3b: Execute Your Plan

1. Implement the iterative function remove_bracket_pair(s).

2. Implement the recursive function check_valid_brackets(s).

You may assume substring(string, start, end, step) function is given.

You are highly encouraged to test your functions with additional test cases.

Optional: Spiral Maze Iterative Recursively

Write an iterative recursive function num_of_steps that takes in 4 arguments, the x and y coordinates of ending point, x and y, width of the maze, W and height of the maze, H. The function returns the number of steps to navigate from the bottom-left corner (origin) of the maze to the specified ending point. Please follow the question requirements any closed form formula or pure iterative solution will not be accepted.

Hint: You will need to iterate until the boundary, then recursively call the function with the new boundary and updated x & y.



Figure 1: A spiral maze with height 3 and width 3. The number of steps from the origin to the ending point (1, 1) is 8.

num_of_steps (1 , 1 , 3 , 3 )

>>> 8

num_of_steps (0 , 0 , 3 , 3 )

>>> 0

num_of_steps (1 , 1 , 3 , 2 )

>>> 4

num_of_steps (1 , 3 , 5 , 7 )

>>>

Optional: Alternative approach of Task 2

There are many ways to solve the problem in Task 2. You are encouraged to explore alternative approaches to solve the problem.

You may assume substring(string, start, end, step) function is given in this task.

Implement a function, check_valid_brackets_alt(s), that returns True if the string s is valid brackets, and False otherwise.

Completely Iterative Approach (Easy)

You can implement the function purely iterative. Please confine your implementation to what you’ve learned from CS1010S thus far.

Completely Recursive Approach (Challenging)

You may also implement the function purely recursively.

Warning: This is a challenging task.

請加QQ:99515681  郵箱:99515681@qq.com   WX:codehelp 

掃一掃在手機打開當前頁
  • 上一篇:代寫ELEC-4840 編程
  • 下一篇:代寫 Financial Derivatives and Financial
  • 無相關信息
    合肥生活資訊

    合肥圖文信息
    急尋熱仿真分析?代做熱仿真服務+熱設計優化
    急尋熱仿真分析?代做熱仿真服務+熱設計優化
    出評 開團工具
    出評 開團工具
    挖掘機濾芯提升發動機性能
    挖掘機濾芯提升發動機性能
    海信羅馬假日洗衣機亮相AWE  復古美學與現代科技完美結合
    海信羅馬假日洗衣機亮相AWE 復古美學與現代
    合肥機場巴士4號線
    合肥機場巴士4號線
    合肥機場巴士3號線
    合肥機場巴士3號線
    合肥機場巴士2號線
    合肥機場巴士2號線
    合肥機場巴士1號線
    合肥機場巴士1號線
  • 短信驗證碼 豆包 幣安下載 AI生圖 目錄網

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

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

    99爱在线视频这里只有精品_窝窝午夜看片成人精品_日韩精品久久久毛片一区二区_亚洲一区二区久久

          国产三级欧美三级| 另类天堂视频在线观看| 亚洲高清资源| 国产精品激情偷乱一区二区∴| 久久国内精品自在自线400部| 亚洲国产天堂久久综合网| 国产精品高潮在线| 欧美日韩精品三区| 噜噜噜久久亚洲精品国产品小说| 在线亚洲精品福利网址导航| 黄色日韩网站| 国内精品久久久久久久影视蜜臀| 欧美视频四区| 欧美—级高清免费播放| 久久综合伊人| 久久青青草原一区二区| 亚洲欧美日韩一区| 亚洲图片欧美午夜| 一区二区三区免费观看| 日韩视频不卡| 日韩一二三区视频| 日韩视频免费在线观看| 亚洲国产视频直播| 亚洲黄一区二区| 亚洲国产精品一区二区第一页| 黑人中文字幕一区二区三区| 国产精品夜色7777狼人| 国产麻豆视频精品| 国产精品尤物福利片在线观看| 国产精品ⅴa在线观看h| 欧美日韩精品综合在线| 欧美视频久久| 国产九色精品成人porny| 欧美精品久久久久a| 久久精品国产96久久久香蕉 | 亚洲欧美日韩在线观看a三区| 亚洲免费观看在线视频| 一区二区三区视频在线播放| 中文欧美字幕免费| 亚洲欧美国产三级| 久久久国产精彩视频美女艺术照福利| 久久av在线| 麻豆国产精品va在线观看不卡| 久久综合成人精品亚洲另类欧美| 免费成人av资源网| 欧美日韩亚洲网| 国产日韩欧美在线播放不卡| 国内外成人免费激情在线视频| 亚洲高清在线观看一区| 中文国产成人精品久久一| 亚洲女性裸体视频| 久久久综合免费视频| 欧美精品一卡| 国产日韩欧美综合精品| 亚洲国产精品久久久久| 中日韩高清电影网| 久久午夜激情| 国产精品国码视频| 国产一区二区在线免费观看| 亚洲精品黄色| 欧美在线免费一级片| 欧美黄网免费在线观看| 国产亚洲精品综合一区91| 亚洲激情精品| 欧美自拍偷拍| 欧美日韩一区二区在线视频 | 亚洲专区一二三| 蜜臀av性久久久久蜜臀aⅴ| 国产精品福利网| 在线播放中文一区| 午夜国产精品视频| 欧美久久影院| 亚洲国产成人porn| 久久九九国产精品| 国产精品久久久久久亚洲调教| 亚洲国产专区校园欧美| 久久久亚洲成人| 国产精品劲爆视频| 一区二区三区国产精品| 美乳少妇欧美精品| 国产一区亚洲| 午夜伦欧美伦电影理论片| 欧美激情一区三区| 91久久中文| 麻豆精品在线播放| 狠狠综合久久| 久久久久国产精品一区三寸| 国产精品国产三级国产专播品爱网| 亚洲精品国产日韩| 欧美成人免费小视频| 在线成人av网站| 另类国产ts人妖高潮视频| 国语自产精品视频在线看| 欧美一区二区三区在线播放| 国产精品免费看片| 亚洲欧美国产另类| 国产精品伦子伦免费视频| 一区二区激情小说| 欧美三级在线| 亚洲免费视频一区二区| 国产农村妇女精品一二区| 亚洲综合日韩| 国产日韩久久| 久久成人综合网| 精品不卡一区| 欧美国产综合一区二区| 亚洲欧洲日本mm| 欧美日韩一区综合| 亚洲免费婷婷| 黑人巨大精品欧美一区二区 | 激情六月婷婷综合| 麻豆精品视频| 黄色av成人| 免费在线观看一区二区| 亚洲精品乱码久久久久久按摩观 | 亚洲国产午夜| 欧美视频一区二区三区在线观看| 亚洲一区二区三区四区五区黄| 国产精品视频一区二区三区| 亚洲欧美日产图| 精品成人在线观看| 欧美精品色综合| 亚洲欧美成人精品| 1769国产精品| 国产精品久久久久久久午夜| 久久成人免费日本黄色| 亚洲欧洲一区二区三区| 国产精品日韩欧美一区二区三区| 久久噜噜亚洲综合| 在线亚洲电影| 亚洲国产日韩欧美综合久久| 国产精品v欧美精品∨日韩| 久久青青草综合| 亚洲四色影视在线观看| 精品99一区二区| 国产精品久久久久久av下载红粉| 久久精品最新地址| 亚洲私人影院| 亚洲日本成人网| 国产午夜精品一区二区三区欧美| 欧美精品精品一区| 久久免费视频网| 小处雏高清一区二区三区 | 亚洲免费av片| 激情自拍一区| 国产噜噜噜噜噜久久久久久久久| 欧美日韩国产成人| 欧美成熟视频| 欧美**人妖| 久久久久青草大香线综合精品| 亚洲午夜国产一区99re久久 | 亚洲精品日韩久久| 黄色精品一区| 国内在线观看一区二区三区| 国产精品女同互慰在线看| 欧美精品一级| 欧美激情一区二区三区蜜桃视频 | 亚洲精品少妇30p| 在线观看欧美日韩国产| 国产视频久久久久久久| 国产精品色在线| 国产精品久久久久aaaa九色| 欧美欧美天天天天操| 欧美精彩视频一区二区三区| 美女成人午夜| 欧美成人亚洲成人| 欧美成人综合网站| 欧美激情视频一区二区三区在线播放 | 国产欧美日韩视频一区二区| 国产精品xxx在线观看www| 欧美性大战久久久久久久| 欧美日韩裸体免费视频| 欧美视频在线观看 亚洲欧| 欧美色图五月天| 国产精品国产三级国产aⅴ浪潮| 欧美精品一区在线播放| 欧美性做爰猛烈叫床潮| 国产精品资源在线观看| 激情成人亚洲| 亚洲精品欧美极品| 中文欧美在线视频| 亚洲一区视频在线| 久久久99国产精品免费| 榴莲视频成人在线观看| 欧美日韩不卡合集视频| 国产精品高潮粉嫩av| 国产亚洲精品久| 亚洲国产一区二区三区在线播 | 欧美手机在线| 国产精品永久免费在线| 黄色免费成人| 99热精品在线观看| 久久er99精品| 欧美伦理在线观看| 国产日韩一区二区三区| 亚洲国产综合91精品麻豆| 中文亚洲欧美| 久久婷婷亚洲| 国产精品av久久久久久麻豆网| 国产一区二区三区在线观看视频 |