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

科目：研究所、轉學考(插大)、學士後-計算機概論 | 年份：110年 | 選擇題數：42 | 申論題數：0

試卷資訊

所屬科目：研究所、轉學考(插大)、學士後-計算機概論

選擇題 (42)

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)
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(n2) (E)O(n3)

4. Determine the tightest big-O complexity of the recurrence:
61c032ba69a88.jpg(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?
61c032e8d9451.jpg (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.
12. What is the child process known as when it completes execution but the parent keeps executing? (A) Orphan. (B) Zombie. (C) Body. (D) Dead. (E) None of the above.
13. Which search method takes less memory? (A) Depth-First search. (B) Breadth-First search. (C) Linear search. (D) Optimal search. (E) Random scarch.
14. Which of the following processors has a fixed length of instructions? (A) CISC. (B) RISC. (C) EPIC. (D) Multi-core. (E) None of the above.
15. What is the octal equivalent of 1100101.001010 ? (A) 624.12 (B) 624.21 (C) 154.12 (D) 154.21 (E) 145.12
16. A particular system that contains intelligent agents is called_______. (A) AI system. (B) AI Ecosystem. (C) Agency. (D) Autonomous system. (E) None of the above.
17. What is the minimum number of states required to recognize an octal number divisible by 3?(A)1 (B) 2 (C) 3 (D) 5 (E) 7

18. Please sort the following functions in descending order of their growth rate.
  61c033382a935.jpg (A)y＞z＞x＞w (B) z＞y＞w＞x (C) z＞y＞x＞w (D)y＞z＞w＞x (E) x＞y＞z＞w
19. Let A, B, C, and D be numbers. Given a postfix expression:
AB+CA-*D+ABC+-/
 What is the corresponding infix expression? (A) ((A+B)*(C-A)+D)/(A-(B+C)) (B) ((A+B*C)-A+D)/(A-(B+C)) (C) ((A+B)*(C-A))((D+A)-(B+C)) (D) (A*(B+C)-A)+(D+A-B)/C (E) A*(B-(C+A))+D+A-B/C
複選題
20. The ANSI/SPARC has established a three-level architecture for a DBMS: conceptual, external, and internal. Which of the following is true? (A) The conceptual level defines the low-level access methods and how bytes are transferred. (B) The conceptual level interacts directly with the users. (C) The internal level determines where data is actually stored on the storage devices. (D) The external level interacts directly with the hardware. The data model is defined on this level, and the main functions of the DBMS are also on this level. (E) The external level is an intermediary and frees users from dealing with the internal level.
21. For security attacks, which of the following is NOT true. (A) Replaying attack includes several strategies to slow down or totally interrupt the service of the system. (B) Snooping attack refers to unauthorized access to or interception of data. An unauthorized entity may intercept the transmission and use the contents for their own benefit. (C) Masquerading (spoofing) attack happens when the attacker impersonates somebody else. (D) Modification attack modifies the information to make it beneficial to the attackers. (E) Repudiation attack is performed by one of the sender or the receiver to deny that the message has been sent or received.

22. For the following function foo, which statement is true?
61c0338f42d49.jpg (A) If n＞1, the returned value of function foo must be even. (B) The time complexity of function foo is O(n?). (C) For any integer n＞=1, function foo calculates the value of 2-1 i. (D) The value returned by foo(2.8) is 3. (E) All the above statements are true.
23. We sequentially insert the following numbers: 19, 4, 26, 2, 13, 25 into an initially empty binary search tree. What is the preorder traversal sequence of the resulting tree? (A) 2,4,13,19,25,26 (B) 19,4,2,13,26,25 (C) 19,4,2,26,13,25 (D) 2,13,4,25,26,19 (E) 19,4,26,2,3,2
24. For sorting n integers, which of the following statements is true? (A) Both quick sort and merge sort have O(nlogn) worst-case time complexity. (B) Both quick sort and merge sort are stable sorting algorithms. (C) Both quick sort and merge sort do not need extra space. (D) Heap sort achieves O(nlogn) average-case time complexity. (E) Heap sort needs extra space during sorting.
25. Which of the following statements is NOT true? (A) If a problem is NP-complete, then there exists no polynomial-time algorithm (B) If a problem is NP-complete, then it is also NP-hard. (C) The halting problem is not solvable by a computer. (D) For random access, an array is more efficient than a linked list. (E) A heap is always a complete tree.
26. Consider the AVL tree resulting from sequentially inserting the following numbers into an empty AVL tree: 40, 60, 55, 15, 20, 2, 25, 30. What is the sum of the numbers in the leaf nodes in the AVL tree? (A) 90 (D) 160 for it. (B) 130 (C) 155 (E)170
複選題
27. Which are fundamental steps for producing an image using 3D graphics? (A) Modeling. (B) Animating. (C) Rendering. (D) Displaying. (E) Supersampling.
複選題
28. Which of the following light types belong(s) to reflected light? (A) Ambient light.(B) Spot light. (C) Diffuse light. (D) Refraction light. (E) Specular light.
複選題
29. Which of the following terms belong(s) to TCP/IP protocol layers? (A) Physical. (B) Data link. (C) Network. (D) Transport. (E) Application.
複選題
30. Which of the following programming languages is/are object-oriented paradigm? (A) Smalltalk (B) C++ (C) C# (D) Java (E) Pascal
複選題
31. What kinds of buses are used to connect CPU and memory? (A) Data bus (B) Address bus (C) Control bus (D) Video bus (E) Instruction bus
32. In which of the following situations do an overflow never occur? (A) Adding two positive integers. (B) Adding one positive integer to a negative integer. (C) Subtracting one positive integer from a negative integer. (D) Subtracting two negative integers. (E) All of the above situations.
複選題
33. Which of the following methods are used in black-box testing? (A) Exhaustive testing. (B) Condition testing. (C) Random testing. (D) Loop testing. (E) Boundary-value testing.
複選題
34. Which of the character encoding results are NOT true based on Hufiman coding with the given frequency: T(12), U(8), V(9), W(20), X(31), Y(14), Z(8)? (A) T:000. (B) U:11 (C) V:1110 (D) X: 011 (E) Y:01.
複選題
35. Which of the following compression methods are lossy? (A) Huffiman coding. (B) Lempel Ziv encoding. (C) JPEG. (D) Run-length encoding. (E) MP3.
複選題
36. Which of the following statements are true? (A) Depth-first search is identical to the closed list in Graph search. (B) Alpha-beta pruning is used to calculate the feasibility of whole game tree. (C) Alpha-beta pruning can be applied to trees of any depth and it is possible to prune entire subtree rather than leaves. (D) The minimax search is depth-first search, and therefore at one time we just have to consider the nodes along a single path in the tree. (E) The minimax decision is dependent on the pruned values.
37. Which of the following statements are true? (A) State-space search is the most straightforward approach for planning algorithm. (B) Forward state-space search is also called as regression planning. (C) The complexity of minimax algorithm is the same as BFS. (D) Hill climbing search is also called optimal local search because it grabs a good neighbor state without thinking ahead about where to go next. (E) Average of path cost from start node to current node is utilized as the evaluation function in A* approach.
複選題
38. Trees and graphs are fundamental data structures. Which of the following statements are true? (A) A weighted graph may bave multiple minimum spanning trees of the same cost. (B) For two nodes in a graph, there may exist multiple shortest paths of the same length linking the two nodes. (C) For two nodes in a tree, there may exist multiple shortest paths of the same length linking the two nodes. (D) For a graph with n nodes and m edges, its minimum spanning tree has at least (n-1) edges. (E) For a tree with n nodes and m edges, ntm＜2n must hold.
複選題

39. Binary search tree (BST) stores keys in its nodes. Which of the following statements are true? (A) For a binary search tree with n nodes, searching a key in BST takes O(log n) time in worst case. (B) A binary search tree of height h has at most 61c0341121b78.jpg nodes. (C) Performing an inorder traversal on a binary search tree results in a sorted list of keys in ascending order. ' (D) AVL trees are also binary search trees. (E) Given the preorder and inorder traversal sequences of a BST, we can re- construct a unique BST.

40. Which of the following statements is NOT true? (A) Dijkstra algorithm cannot correctly calculate the shortest paths if there exist negative edge weights in the graph. (B) Bellman-Ford algorithm can detect negative cycles in a graph. (C) Given an unweighted graph with a node v, employing Breadth-First Search (BFS) starting on v obtains the single-source shortest paths with source node v. (D) Floyd-Warshall algorithm for finding all-pair shortest paths works for graph with negative edge weights (but with no negative cycles). (E) The worst-case time and space complexities of the Floyd-Warshall algorithm are both θ(n3).
複選題
41. Which of the following statements are true? (A) A heap is always a complete binary tree. (B) Doubly linked list is suitable for random access. (C) A sparse matrix has many zero elements. (D) Given a max heap with n nodes. A Push operation takes O(logn) time, and a Pop operation takes O(1) time. (E). A binary tree's postorder and inorder traversal sequences are different.
複選題
42. Which of the following statements are true? (A) SQL (Structured Query Language) is used to perform operations such as search, insert, and delete on advanced data structures for setting up Turing tests. (B) A genetic algorithm discovers a solution through an evolutionary process involving many generations of trial solutions. (C) In data mining, cluster analysis tries to find properties of data items with the computation power provided by cluster computing. (D) Hashing can be used as authenticating messages transferred over the Internet, such as MDS. (E) The Standard Template Library (STL) in the C+t programming environment contains a collection of predefined classes for machine learning tasks, such as Support Vector Machines.

申論題 (0)