6.What is the result of the bitwise AND operation between the decimal numbers 13 and 22?
(A) 4
(B) 13
(C) 17
(D)30

7.Which option arranges the following memory types in order of decreasing access speed (fastest to slowest): I. RAMII. CPU Registers III. Cache MemoryIV. Hard Disk Drive (A) II, III, I, IV (B) III, II, I, IV (C) II, I, III, IV (D) IV, I, III, II

8.What is the average-case time complexity of the Bubble Sort algorithm for an input of size n? (A) O(n log n) (B) O(n) (C)O(n2) (D) O(log n)

9.Which of the following statements best describes a key characteristic of a Universal Turing Machine (UTM)? (A) A UTM can solve any mathematical problem, including those proven to be undecidable like the Halting Problem. (B) A UTM is designed with a specific set instructions to solve one particular complex computational problem with maximum efficiency. (C) A UTM can simulate any other Turing machine if provided with a description of that machine and its input. (D) A UTM operates using quantum bits (qubits) to achieve computational power beyond classical Turing machines.

10.In a multi-user database environment, complex interactions between simultaneous transactions can lead to undesirable outcomes such as "lost updates" (where one transaction's changes are overwitten by another), "dirty reads" (where a transaction reads uncommitted data from another transaction), and "inconsistent reads" (where a transaction reads different values for the same data item at different points in time). Which core aspect of database management, typically managed within the database architecture, is primarily responsible for addressing and preventing these types of anomalies? (A) Indexing, which optimizes data retrieval by creating sorted pointers to data records, thereby speeding up query execution and reducing the likelihood of data conflicts. (B) Relational Algebra, which provides a theoretical foundation for querying and manipulating data in relational databases, enabling structured data operations. (C) Concurrency Control, which employs various mechanisms to manage the interleaved execution of transactions, ensuring data integrity and transaction isolation. (D) B-trees, a tree data structure used for efficient storage and retrieval of data on disk, enabling fast lookup, insertion, and deletion operations within a database.

11. What is the output of the following code? int arr[] = {1,2,3,4, 4, 5};int *ptr = arr + 2; printf("%d", *(ptr++)); (A)1 (B) 2 (C)3 (D) 4

12. What will this code output? (A) abcdef (B) ab (C) abcd (D) abc

13. Given the following code, what is printed?(A) 10 (B) 20 (C) 30 (D) 40

14. Which of the following best describes the result of this code?(A) abc (B) bcd (C) acc (D) bcc

15. What does the function compute? (A) Fibonacci of n (B) n squared (C) n factorial (D) Sum from 1 to n

16. What is the output of this recursive function call: foo(3)； ? (A) 1233213 (B) 1213121 (C) 3211231 (D) 1122332

115年 - 115 中央警察大學_碩士班入學考試試題_資訊管理研究所：計算機概論#139860

114年 - [無官方正解]114 臺灣綜合大學系統_學士班轉學生考試試題:計算機概論#137952

114年 - [無官方正解]114 台灣聯合大學系統_學士班轉學生考試試題:計算機概論#137764

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

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

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

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

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

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

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