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

11. A company has a network address of 192.168.1.64 with a subnet mask of 255.255.255.192. Thecompany wants to create two subnetworks that would contain 10 hosts and 18 hosts respectively.Which of the following networks would achieve that?(A) 192.168.1.16/28 (B) 192.168.1.64/27(C) 192.168.1.128/27 (D) 192.168.1.192/28(E) None of the above.

12. The DARPA technology includes a set of network standards that specify the details of how computers communicate, as well as a set of conventions for interconnecting networks and forwarding traffic. Officially named the TCP/IP Internet Protocol Suite and commonly referred to as TCP/IP (after the names of its two main standards), it can be used to communicate across any set of interconnected networks. Which of the following statements about TCP/IP is INCORRECT? (A) TCP/IP is a suite of protocols for communication over the internet. (B) TCP is a connection-oriented protocol that guarantees reliable delivery of data. (C) IP is a connectionless protocol that provides a best-effort delivery service. (D) TCP uses a three-way handshake to establish a connection between two hosts. (E) UDP is a more reliable protocol than TCP.

13. The pre-order traversal of a Binary Search Tree (BST) is 31, 27, 21, 12, 25, 30, 29, 38, 33, 41 and its in-order traversal is 12, 21, 25, 27, 29, 30, 31, 33, 38, 41. When the element to be deleted is in a non-leaf node that has two children, the element is replaced by the largest element in its left subtree. When a key value 36 is inserted into the binary search tree, which of the following statements is CORRECT (A) The key value 38 is the parent of key value 36. (B) The key value 30 has two children. (C) The key value 27 is the parent of key value 25. (D) The BST has three leaf nodes. (E) If we delete the key value 30, then key value 29 will inherit it.

14. What is the value of the node at index 2 (with the root at index 1) in a max-heap that is represented as an array, after inserting the following 6 numbers in this precise order: 8, 12, 12, 9, 10, 11?(A) 9 (B) 10(C) 11 (D) 12(E) None of the above.

15. Suppose we have two tables, as shown below named STUDENT_TABLE and AGE_TABLE, respectively. Consider the following SQL query: Regarding the result of executing this query, which of the following comments is CORRECT? (A) Peter’s age is 20 (B) The average age of Male is 21.75 (C) The Sex of T_ID 4 is Female (D) (John’s Age + Jack’s Age) mod (Emma’s Age + Jack’s Age) = 8 (E) None of the above.

16. Which one of the options below is NOT a sorting algorithm that performs in-place sorting in their typical implementations? (A) Bubble sort (B) Insertion sort (C) Merge sort (D) Heap sort (E) Quick sort

17. What is the difference between a fully connected layer and a convolutional layer in a neural network? (A) Fully connected layers are only used in supervised learning, while convolutional layers are used in unsupervised learning. (B) Fully connected layers require less computation than convolutional layers. (C) Fully connected layers connect every input neuron to every output neuron, while convolutional layers only connect a subset of input neurons to a subset of output neurons. (D) Convolutional layers are used for time-series data, while fully connected layers are used for image data. (E) Convolutional layers are used for classification tasks, while fully connected layers are used for regression tasks.

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

19. Given the head of a linked list, determine whether the linked list has a cycle. If it does have a cycle, return true; otherwise, return false. The example and algorithm are shown below. Which of the followings should be "Q1" and "Q2" in the algorithm? (A) Q1: a = a -＞ next; Q2: b = b -＞ next; (B) Q1: a = b; Q2: b = b -＞ next; (C) Q1: a = a -＞ next; Q2: b = b -＞ next; (D) Q1: a = a -＞ next -＞ next; Q2: b = b -＞ next; (E) Q1: a = a -＞ next; Q2: b = b -＞ next -＞ next;

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

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

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

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

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

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

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

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