4. Please explain “TCP three-way handshake process” with diagram.

1. Given integers m, n, and an integer array arr[m][n] filled with non-negative integers, use dynamic programming technique to implement a program to find a path from top-left to bottom-right which minimizes the sum of all numbers along the path. You can only move down or right at any point. Your program only needs to output the sum. A sample test case input is given below. Implement your program in C, C++, Java, or Python. Note: The sample solution walks from the top-left in the order： 4 → 1 → 1 → 0 → 0 → 4

(a) Determine the value of FN and FP in Table 1. (4pt)

(b) If a person receive a negative test result, what is the probability that he is healthy? (3pt)

(c) Determine the prevalence of lung cancer based on the result given in Table 1. (3pt)

(a) Please explain overfitting. (4pt)

(b) Which of the following images belongs to to overfitting? (2pt)

(c) How to avoid this phenomenon? (4pt)

4. Consider a weighted graph (the edges show the costs) as follows. Please use the Kruskal Algorithm to get the corresponding minimum (cost) spanning tree. Not only the result but also the whole procedure steps should be presented in your answer.

3. Consider the following processes. Please draw the schedules (Gantt Chart) and calculate the average waiting time for the Preemptive Shortest Job First, and Round Robin (time-quantum = 4 ms) scheduling policies, respectively.

2. Alice writes the following code and expects that the process prints “Hello Kitty” four times. However, the process prints “Hello Kitty” three times only! Please describe the reason why Alice’s code prints “Hello Kitty” three times instead of four.

114年 - 114 學士後醫學系招生考試試題：計算機概論與程式設計#137105

113年 - 113 學士後醫學系招生考試試題：計算機概論與程式設計#119574

112年 - 112 學士後醫學系招生考試試題：計算機概論與程式設計#137106

111年 - 111 學士後醫學系招生考試試題：計算機概論與程式設計#137107

111年 - 111 國立中山大學_學士後醫學系招生考試：計算機概論與程式設計#113521

111年 - 111 學士後醫學系招生考試：計算機概論與程式設計#107630

110年 - 110 學士後_醫學系︰計算機概論與程式設計#100246

109年 - 109 高雄醫學大學_學士後醫學系招生考試：計算機概論與程式設計#86938