18. Ackermann's function is an example of a recursive function which is not primitive recursive. It is interesting from the point of view of benchmarking because it "grows faster than any primitive recursive function." Ackermann's function is defined as follows: A(0,n)=n+1
A(m,0)=A(m-1,1)
A(m,n)=A(m-1,A(m,n-1))
What is the A(1,3) return value of the following program?

(A) 2
(B) 3
(C) 4
(D) 5
(E) 6

1. “Hash Table” is an effective data structure for implementing dictionaries. What is a hash table and how does it work? (A) A hash table is a data structure that uses a hash function to map keys to values, allowing for fast retrieval of data. (B) A hash table is a data structure that stores data in a sorted manner for fast searching. (C) A hash table is a data structure that allows for efficient sorting of data. (D) A hash table is a data structure that stores data in a hierarchical manner for fast searching. (E) None of the above.

2. Overfitting is an undesirable machine learning behavior that occurs when the machine learning model gives accurate predictions for training data but not for new data. There are some techniques that could ease or even solve this problem. Which of the following techniques can NOT avoid overfitting problem? (A) Increasing layers / number of units per layer. (B) Using Lasso / Ridge regularization. (C) Early stopping while training model. (D) Adding dropout between layers. (E) Cross-validation.

3. What is the result of -22 in the two’s complement representation with an 8-bit allocation?(A) 0001 0101 (B) 0001 0110 (C) 1110 1010 (D) 1110 1001(E) None of the above.

4. Given the boolean function F = AB'C' + BCD' + CD + B'C'D', what is the maximum number of terms that it can be simplified to? (A) 1 (B) 2 (C) 3 (D) 4 (E) 5

5. Consider the page reference string of size 12: 1, 2, 3, 4, 5, 1, 3, 1, 6, 3, 2, 3 with a frame size of 4, which means that a maximum of 4 pages can be in a frame. Use the First In First Out (FIFO), Least Recently Used (LRU), and Optimal Page Replacement (OPT) algorithms to calculate page faults. What are the page faults for each algorithm? (A) FIFO: 9, LRU: 8, OPT: 6 (B) FIFO: 8, LRU: 8, OPT: 7 (C) FIFO: 9, LRU: 9, OPT: 6 (D) FIFO: 10, LRU: 8, OPT: 7 (E) FIFO: 7, LRU: 9, OPT: 6

6. Assuming a memory access time of 250 nanoseconds and an average page fault handling time of70 microseconds, what is the expected page fault rate if you want to ensure that the effective access time is less than 270 nanoseconds?(A) 0.002% (B) 0.02% (C) 0.2% (D) 2% (E) 20%

7. Which of the following activation functions is commonly used in the output layer of neural networks and performs well in multi-class classification problems? (A) Softmax (B) Leaky ReLU (C) Tanh (D) ReLU (E) Sigmoid

8. Which of the followings is an example of a race condition in a multi-threaded program?(A) A thread waiting indefinitely for a resource.(B) A deadlock caused by two threads trying to acquire each other's locks.(C) Two threads executing concurrently and attempting to access shared data without synchronization.(D) A thread executing multiple times when it should only execute once.(E) None of the above.

9. In operating system, which scheduling algorithm can obtain the shortest waiting time for all processes in average?(A) First-Come-First-Served(B) Priority scheduling(C) Shortest-Job-First(D) Round-Robin(E) Multilevel Queue scheduling

10. Which term specifically refers to the entity created by encapsulating data within data-link layer headers and trailers? (A) Data (B) Chunk (C) Segment (D) Packet (E) Frame

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

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

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

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

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

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

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

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