3. Determine the tightest big-O complexity of the recurrence: 

T(n)=T(n-1)+1, T(0)=0
(A)O(1)
(B) O(n)
(C) O(nlogn)
(D)O(n²)
(E)O(n³)

1. Which of the following statements is NOT true? (A) 3D graphics deals with converting three-dimensional shapes into images. (B) OpenGL is a windows programming APIs for creating 3D graphics applications. (C) A frame buffer represents block a memory for the storage of processed image pixels. (D) Texture mapping is used to enhance the details of object's surface. (E) Reflection and refraction are two common types of light-surface interaction.

2. Suppose the points (1, 0, 0), (1, 1, 1), and (1, 0, 2) are the vertices of a planar patch. Which of the following line segments is normal to the surface of the patch? (A) The line segment from (1,0,0) to (1,1, 0) (B) The line segment from (1, 1, 1) to (2, 1, 1) (C) The line segment from (1,0, 0) to (1,1, 1) (D) The line segment from (1,2,3) to (2, 2, 2) (E) The line segment from (1,2,3) to (1, 2, 2)

4. Determine the tightest big-O complexity of the recurrence:(A) O(1) (B) O(n) (C) O(nlogn) (D)O(n2) (E) O(n3)

5. Which of the following connection does NOT belong to wide area networks? (A) WiFi (B) P2P (C) Dial-up (D) Cable (E) WiMax

6. Which of the following term is NOT the feature of object-oriented programming? (A) Encapsulation. (B) Abstraction. (C) Inheritance. (D) Polymorphism. (E) Modularity.

7. What is the output of the following program? (A) 101 102 34 (B) 101 21034 (C) 1 102 1034 (D) 1 1023 104 (E) 12103 104

8. Which of the following statements is NOT true? (A) The arithmetic logic unit (ALU) performs logic, shift, and arithmetic operations on data. (B) SRAM and DRAM are two main types of memory in computer system. (C) Cache memory is faster than main memory but slower than the CPU and its registers. (D) SCSI, FireWire, USB, HDMI are common controllers used in computer system. (E) Direct memory access (DMA) allows I/O devices to transfer data between each other without passing the data through CPU.

9. A computer has 32 MB of memory. How many bits are necded to address any single byte in memory? (A) 8 bits. (B) 16 bits. (C) 24 bits. (D) 25 bits. (E) 32 bits.

10. What is NOT the necessary condition for deadlock? (A) Resource holding. (B) Mutual exclusion. (C) Circular waiting. (D) Starvation. (E) No preemption.

11. Which of the following uses UDP as the transport protocol? (A) HTTP. (B) DNS. (C) SMTP. (D) Telnet. (E) None of the above.

110年 - 110 國立中央大學_碩士班招生考試_網路學習科技研究所：計算機概論#124075

110年 - 110 國立臺灣科技大學_碩士班招生試題_營建工程系(戊組)：計算機基本概念與程式設計#113110

110年 - 110 國立高雄科技大學_碩士班招生考試_電子工程系：計算機概論(丙組)#110504

110年 - 110 國立高雄科技大學_碩士班招生考試_資訊管理系：計算機概論#110413

110年 - 110 國立臺北教育大學_碩士班招生考試_資訊科學系：計算機概論#105558

110年 - 110 國立中山大學_碩士暨碩士專班招生考試_資管系/甲、乙組:計算機概論#105543

110年 - 110 國立政治大學_碩士班暨碩士在職專班招生考試_ 資訊科學系碩士在職專班一般組:計算機概論#105482

110年 - 110 國立清華大學碩士班考試入學試題_資訊系統與應用研究所:計算機概論#104988

110年 - 110台灣聯合大學系統_碩士班招生考試_電機類:計算機系統(計算機組織)#104945

110年 - 110 國立清華大學碩士班考試入學試題_生命科學院/丙組(計算生物與人工智慧組):計算機概論(演算法與計算機數學)#104514