Reflection About Discrete Structure
I study in SCSI1013 section 02 of Discrete Structure which are guided by Nor Haizan Binti Mohamed Radzi. As a student of computer science in UTM, this course is a compulsory subject to be taken in our first semester.
After I study in this semester about months, I able to apply basic algorithmic techniques such as greedy algorithms, binary search, sorting and dynamic programming to solve programming challenges.Besides that,I also able to apply graph and string algorithms to solve real-world challenges: finding shortest paths on huge maps and assembling genomes from millions of pieces and apply various data structures such as stack, queue, hash table, priority queue, binary search tree, graph and string to solve programming challenges.
In a conclusion, learn discrete structure let me know how to solve complex programming challenges using advanced techniques: maximum flow, linear programming, approximate algorithms, SAT-solvers, streaming.
