{"id":33401,"date":"2026-08-18T15:07:01","date_gmt":"2026-08-18T15:07:01","guid":{"rendered":"https:\/\/academicwritersbay.com\/solutions\/dam101-programming-and-algorithms-dam101-closing-analysis-the-closing-evaluate-for-this-module-contains-5-questions-please-learn-each-and-each-of-the-questions-quite-and-that-you-can-cling-to-strive\/"},"modified":"2026-08-18T15:07:01","modified_gmt":"2026-08-18T15:07:01","slug":"dam101-programming-and-algorithms-dam101-closing-analysis-the-closing-evaluate-for-this-module-contains-5-questions-please-learn-each-and-each-of-the-questions-quite-and-that-you-can-cling-to-strive","status":"publish","type":"post","link":"https:\/\/academicwritersbay.com\/solutions\/dam101-programming-and-algorithms-dam101-closing-analysis-the-closing-evaluate-for-this-module-contains-5-questions-please-learn-each-and-each-of-the-questions-quite-and-that-you-can-cling-to-strive\/","title":{"rendered":"DAM101 Programming and Algorithms DAM101 Closing Analysis The closing evaluate for this module contains 5 Questions. Please learn each and each of the questions quite and that you can cling to strive ALL of the questions."},"content":{"rendered":"<p>DAM101 Programming and Algorithms DAM101 Closing Analysis The closing evaluate for this module contains 5 Questions. Please learn each and each of the questions quite and that you can cling to strive ALL of the questions. The marking rubric will likely be viewed on the evaluate web roar on Canvas.<\/p>\n<p>Submission Necessities Code desires to be submitted within the .ipynb structure. Submit one code file per inquire (4 code recordsdata total, 1 for each and each of the questions 2-5). Document desires to be submitted within the .pdf structure. Documentation Necessities Feedback and docstrings desires to be concise. Feedback and docstrings will must cling a fixed structure at some stage within the solutions. Feedback can cling to level the feature of the code written. Every feature must embody a docstring that explains the goal of the feature, parameters and the return payment. Variable and cling names desires to be descriptive and follow a fixed naming vogue, nonetheless most 25 characters. Tasks<\/p>\n<ol>\n<li>As you total Questions 2 to 5 under, put notes in your salvage decisions, challenges, and solutions. Refine and submit these as a single reflective legend (most 1000 words).<\/li>\n<\/ol>\n<p>For every and each of Questions 2 to 5, your legend must clearly tackle the following:<\/p>\n<p>i) Existing the reasoning within the encourage of the coding decisions you made. This also can embody the collection of algorithms and data structures, recount of the code or diversified salvage decisions.<\/p>\n<p>ii) Hold on any difficulties confronted while finishing the inquire. Existing how these had been identified and resolved.<\/p>\n<p>iii) Your legend desires to be supported with proof, including code snippets and screenshots. As an instance, these can also level to the errors encountered or sudden outcomes.<\/p>\n<p>iv) It&#8217;s compulsory to reference relevant video lectures and the textbook to justify or contextualise your coding decisions. For video lectures, embody the week number, lecture number and approximate timestamp. As an instance:<\/p>\n<p>\u201cI made up our minds to exhaust the len() feature to search out the collection of parts within the record (block 4, lecture 3, 1:35-2:35).\u201d<\/p>\n<p>Command a suitable academic referencing vogue for textbook citations. As an instance:<\/p>\n<p>\u201cI made up our minds to exhaust f-strings capacity for string formatting (Speight, 2020, p. 59).\u201d<\/p>\n<p>Which you can cling to embody references each and each within the text and furthermore in a reference record on the stop.<\/p>\n<p>[16 marks]<\/p>\n<ol start=\"2\">\n<li>i) Write a feature that takes a sequence of integers from person enter the exhaust of the feature in appendix A and retail outlets them in a tuple.<\/li>\n<\/ol>\n<p>ii) Write a feature that takes a tuple of integers \u2018my_tuple\u2019 and an integer \u2018k\u2019, and returns the ingredient whose distinction from k is the smallest. If two values are equally conclude, return each and each.<\/p>\n<p>iii) Write the code to envision the code in parts i) and ii). Command 5 as the payment of \u2018k\u2019.<\/p>\n<p>iv) File the code in parts i), ii) and iii) as detailed within the Documentation Necessities.<\/p>\n<p>[8 marks]<\/p>\n<ol start=\"3\">\n<li>In this process you are going to must exhaust the insertion form algorithm code from Block 8 Lecture 4.<\/li>\n<\/ol>\n<p>i) Adjust the insertion form algorithm to form strings in descending record and print the explain of the record after every swap is conducted.<\/p>\n<p>ii) Write the total output produced in fragment i) into a text file named \u2018sorting_strings.txt\u2019.<\/p>\n<p>iii) Test the code with the following record of numbers:<\/p>\n<p>[\u2018by\u2019, \u2018the\u2019, \u2018just\u2019, \u2018this\u2019, \u2018work\u2019, \u2018sad\u2019, \u2018ant\u2019, \u2018ten\u2019, \u2018trick\u2019, \u2018bus\u2019]<\/p>\n<p>iv) File the code in parts i), ii) and iii) as detailed within the Documentation Necessities.<\/p>\n<p>[8 marks]<\/p>\n<ol start=\"4\">\n<li>In this process it&#8217;ll be foremost to place conclude enter from a text file and route of it.<\/li>\n<\/ol>\n<p>i) Develop a feature that reads the contents of the file called \u2018text.txt\u2019 the exhaust of the feature in Appendix B.<\/p>\n<p>ii) This feature can cling to then overview if any of the strings within the text file indulge in replica characters. The feature can cling to return a tuple of strings that indulge in the replica characters.<\/p>\n<p>iii) Write code to envision the feature and you also can exhaust the following text for the \u2018text.txt\u2019:<\/p>\n<p>Donec vitae magna rutrum ipsum mattis auctor. Pellentesque ultrices elit malesuada massa tincidunt venenatis. Mauris neque diam, fringilla vel nulla in, euismod posuere mauris. Ut molestie odio eget lorem luctus, quis consequat sem maximus. Praesent at molestie nibh. Proin sed hendrerit orci.<\/p>\n<p>Vestibulum venenatis ipsum sit amet pretium maximus. Etiam nisi ipsum, vehicula a placerat ac, viverra sit amet mi. Donec tristique justo pharetra, placerat sapien ac, sollicitudin lectus. In ut porta sem.<\/p>\n<p>iv) File the code in parts i), ii) and iii) as detailed within the Documentation Necessities.<\/p>\n<p>[8 marks]<\/p>\n<ol start=\"5\">\n<li>You are given the following dictionary:<\/li>\n<\/ol>\n<p>Cookware Appliances Utensils Frying Pan 24.ninety nine<\/p>\n<p>Microwave 89.ninety nine<\/p>\n<p>Spoons Field 5.50<\/p>\n<p>Saucepan 19.ninety nine<\/p>\n<p>Toaster 29.ninety nine<\/p>\n<p>Fork Field 6.50<\/p>\n<p>Wok 29.ninety nine<\/p>\n<p>Blender 49.ninety nine<\/p>\n<p>Knife Field 12.ninety nine<\/p>\n<p>i) Write a program that retail outlets the info above the exhaust of three dictionaries. Print the categories and gadgets within them in an easy to learn structure. After printing, indicate a message confirming that all meals categories had been successfully created.<\/p>\n<p>ii) Write a feature called \u2018find_average\u2019, which takes the class title as an argument and returns the sleek (mean) set up of gadgets on this class.<\/p>\n<p>iii) Write a feature called \u2018add_product\u2019, which takes \u2018class\u2019, \u2018title\u2019 and \u2018set up\u2019 as arguments and adds the correct entry within the dictionary.<\/p>\n<p>IV) Write the code to envision the feature in fragment ii) the exhaust of the following two names: \u2018Utensils\u2019, \u2018Containers\u2019 (unfriendly class).\u00a0 Write code to envision the feature in fragment iii) selecting appropriate values.<\/p>\n<p>v) File the code in fragment i) as detailed within the Documentation Necessities.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>DAM101 Programming and Algorithms DAM101 Closing Analysis The closing evaluate for this module contains 5 Questions. Please learn each and each of the questions quite and that you can cling to strive ALL of the questions. The marking rubric will likely be viewed on the evaluate web roar on Canvas. Submission Necessities Code desires to [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-33401","post","type-post","status-publish","format-standard","hentry","category-solutions"],"_links":{"self":[{"href":"https:\/\/academicwritersbay.com\/solutions\/wp-json\/wp\/v2\/posts\/33401","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/academicwritersbay.com\/solutions\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/academicwritersbay.com\/solutions\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/academicwritersbay.com\/solutions\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/academicwritersbay.com\/solutions\/wp-json\/wp\/v2\/comments?post=33401"}],"version-history":[{"count":0,"href":"https:\/\/academicwritersbay.com\/solutions\/wp-json\/wp\/v2\/posts\/33401\/revisions"}],"wp:attachment":[{"href":"https:\/\/academicwritersbay.com\/solutions\/wp-json\/wp\/v2\/media?parent=33401"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/academicwritersbay.com\/solutions\/wp-json\/wp\/v2\/categories?post=33401"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/academicwritersbay.com\/solutions\/wp-json\/wp\/v2\/tags?post=33401"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}