Converting pseudocode into Python functions (greedy techniques)

In current studies of data structure algorithms, most of the classes are taught in terms of pseudocode with no real-world context. With such a structure, students would need more insight into understanding why data structure analysis (DSA) is important. With the lack of real-world context, students...

Full description

Saved in:
Bibliographic Details
Main Author: Liew, Evangeline
Other Authors: S Supraja
Format: Final Year Project
Language:English
Published: Nanyang Technological University 2024
Subjects:
Online Access:https://hdl.handle.net/10356/176997
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-176997
record_format dspace
spelling sg-ntu-dr.10356-1769972024-05-24T15:45:49Z Converting pseudocode into Python functions (greedy techniques) Liew, Evangeline S Supraja School of Electrical and Electronic Engineering supraja.s@ntu.edu.sg Computer and Information Science Greedy algorithm In current studies of data structure algorithms, most of the classes are taught in terms of pseudocode with no real-world context. With such a structure, students would need more insight into understanding why data structure analysis (DSA) is important. With the lack of real-world context, students may not be able to utilize what they have picked in the course. With this, a study of greedy algorithms with Python was proposed. The study aimed to ensure that the codes are clearly explained. The project should include analysis and comparison between different greedy algorithms, and step to step guides to implement the code, and most importantly real-world application of using the greedy algorithm. With these components, students should be able to take away a valuable understanding of greedy algorithms in Python language. Bachelor's degree 2024-05-24T06:22:46Z 2024-05-24T06:22:46Z 2024 Final Year Project (FYP) Liew, E. (2024). Converting pseudocode into Python functions (greedy techniques). Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/176997 https://hdl.handle.net/10356/176997 en A3271-231 application/pdf Nanyang Technological University
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Computer and Information Science
Greedy algorithm
spellingShingle Computer and Information Science
Greedy algorithm
Liew, Evangeline
Converting pseudocode into Python functions (greedy techniques)
description In current studies of data structure algorithms, most of the classes are taught in terms of pseudocode with no real-world context. With such a structure, students would need more insight into understanding why data structure analysis (DSA) is important. With the lack of real-world context, students may not be able to utilize what they have picked in the course. With this, a study of greedy algorithms with Python was proposed. The study aimed to ensure that the codes are clearly explained. The project should include analysis and comparison between different greedy algorithms, and step to step guides to implement the code, and most importantly real-world application of using the greedy algorithm. With these components, students should be able to take away a valuable understanding of greedy algorithms in Python language.
author2 S Supraja
author_facet S Supraja
Liew, Evangeline
format Final Year Project
author Liew, Evangeline
author_sort Liew, Evangeline
title Converting pseudocode into Python functions (greedy techniques)
title_short Converting pseudocode into Python functions (greedy techniques)
title_full Converting pseudocode into Python functions (greedy techniques)
title_fullStr Converting pseudocode into Python functions (greedy techniques)
title_full_unstemmed Converting pseudocode into Python functions (greedy techniques)
title_sort converting pseudocode into python functions (greedy techniques)
publisher Nanyang Technological University
publishDate 2024
url https://hdl.handle.net/10356/176997
_version_ 1814047096407326720