Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/176966
Title: | Solving problems on recurrence relations and asymptotic notations | Authors: | Ng, Dasmond | Keywords: | Computer and Information Science | Issue Date: | 2024 | Publisher: | Nanyang Technological University | Source: | Ng, D. (2024). Solving problems on recurrence relations and asymptotic notations. Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/176966 | Project: | A3276-231 | Abstract: | This final-year project is about solving problems on recurrence relations and asymptotic notations. This report researched the practical application of recurrence relations. All applications will be created using Python and its module libraries. The purpose of these applications is to demonstrate visually the solutions found. In summary, this project will act as a guide for readers to learn about recurrence relations and asymptotic notations. Readers can learn through the multiple applications created with Python. This report provides explanations for both the theory and the practical applications. Overall, the aim is to research and educate readers on the concept of recurrence relations and asymptotic notations. | URI: | https://hdl.handle.net/10356/176966 | Schools: | School of Electrical and Electronic Engineering | Fulltext Permission: | restricted | Fulltext Availability: | With Fulltext |
Appears in Collections: | EEE Student Reports (FYP/IA/PA/PI) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FYP_Report_final.pdf Restricted Access | 2.93 MB | Adobe PDF | View/Open |
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.