台大 計算機安全 - Pwn 簡報、影片、作業題目與解法 - Computer Security Fall 2019 @ CSIE NTU Taiwan
As a divide-and-conquer algorithm, Mergesort breaks the input array into subarrays and recursively sort them. When the sizes of sub-arrays are small, the overhead of many recursive calls makes the algorithm inefficient. This problem can be remedied by choosing a small value of S as a threshold for the size of sub-arrays. When the size of a sub-a…
Programming Lab Test (Toal time = 1 hr 15 minutes) Instructions 1. This is a closed book test. 2. Lab test will be held on week 8 (3-7 October) of Semester 1 in your lab tutorial session. 3. The question paper contains 5 sections, A, B, C, D and E. Each section contains 6 questions. 4. You are required to answer a total of 5 questions with one q…
Program templates for questions 1-4 are given in the Appendix. You must use them to implement your functions. The program contains a main() function, which includes a switch statement to execute different functions that you should implement. Each function can be called multiple times depending on the user’s choice.
Year-1 Module taken in NTU that focuses on C programming and various types of data structures and their implementations
List of NTNU, NTU, NTUST courses that I learned.
This project is for nucleic acid sequence searching, with the implementation of the Brute Force Algorithm, KMP Algorithm, and improved Rabin-Karp Algorithm using nt-Hash
NTU SC1003 Introduction to Computational Thinking and Programming Assignment - NTU Name Card Holder
Add a description, image, and links to the ntu topic page so that developers can more easily learn about it.
To associate your repository with the ntu topic, visit your repo's landing page and select "manage topics."