143
(C) 2012 Chun-Ying Huang and Chuan-Jie Lin @ Dept. of Computer Science and Engineering / National Taiwa n Ocean University 1 95~101 年年 年年年年年年年年年年年

95~101 年度 預官計算機概論考題講解

Embed Size (px)

DESCRIPTION

95~101 年度 預官計算機概論考題講解. 出題範圍. 計算機網路 計算機概論 資訊安全 資料結構與演 算法 程式設計 電子商務 資料庫. 計算機概論. 計算機概論 – 數量級名稱. [101-1] 一個 650GB 容量的硬碟,可存資料量約為: A 65×10 9 bytes B 65×10 10 bytes C 65×10 20 bytes D 65×10 30 bytes - PowerPoint PPT Presentation

Citation preview

  • 95~101

  • [101-1] 650GB A 65109bytesB 651010bytes C 651020bytesD 651030bytes[99-11] 9600bps6000Big-5 A 2 B 5 C 10 D 15[98-7] CPU1M Bytes A 20 B 22 C 24 D 26[95-22] CPU 24 (Address Lines)A 16M B 12M C 8M D 4M: 2^24=16M

  • [99-7] CPU1624byte A 1M bytes B 16M bytes C 32M bytes D 64M bytes[98-21] 640*48065536Print ScreenKbytes A 1000 B 800 C 600 D 400 : 640*480*16 bits = 640*480*2 bytes = 600K bytes

  • [97-6] TIF1024*768 pixels8(pixel) A 768K bytes B 8M bytes C 768K bits D 8M bits : 1024*768*8 bits = 1024*768 bytes = 768K bytes[95-5] 56Kbps A 3360K Bytes B 56K Bytes C 56K bits D 420K Bytes

  • [101-2] (A4F.D8)16 A (2639.8437)8B (101001001111.11011)8 C (5177.77)8D (5117.66)8[97-37] A (76)8 B (62)10 C (3E)16 D (111101)2[95-13] (44969.65625)10 A (AFA9.A8)16B (AFA9.8A)16 C (9AFA.A8)16D (9AFA.8A)16 : (N)10 = Dn-1*rn-1 + + D1*r1 + D0*r0 + F1*r-1 + F2*r-2 +

  • [101-3] A 1 B 12 C 1 D 2[99-29] 8 (0100 0000)2+(0100 0000)2 A (128)10 B C (-128)10 D (80)10[95-19]2s (01011010)2 (11011100)2 A (66)16 B (82)16 C (7E)16 D (7D)16

  • Bitwise [100-2] (229)10(182) 10XOR8 A (152)8 B (214)8 C (324)8 D (123)8[97-20] 16(1D)16(13)16XOR(exclusive-OR) A (B)16 B (C)16 C (D)16 D (E)16[95-15] (AE)16 (C3)16 bit-level XOR A (155)8 B (244)8 C (6D)8 D (331)8

  • [99-37] (Underflow) A B C D [98-26] S=0S=1 C=Exponent+16bit0 A -16~16 B -15~16 C -16~15 D -15~15

  • [99-8] 19 (bits) A 13 B 10 C 5 D 2[98-40] 55/82 A 101.101 B 101.1101 C 101.1001 D 101.1011[96-15] A 3 3/5 B 5/8 C 5 3/4 D 6 1/2

  • [96-3]IEEE (-1)s*2E-127*1.FS = 1E = 0F = 0 A B C D NaN (Not a Number)

  • [96-4](98.625)10IEEEb30b29b23(E) A 10000011 B 10000100 C 10000101 D 10000110 : 98.625 = 64*1.54101E-127=6E=133

  • [99-13] (123)44s A (199)4 B (210)4 C (211)4 D (212)4[95-21] (165.2)7 A (341.12)5 B (341.13)5 C (340.14)5 D (341.14)5 : 10

  • [99-25] 99100 A 1 bit B 7 bits C 8 bits D 16 bits[96-5] 2^12010 A 8 B 6 C 4 D 2 : 2^n 10 : 20=1, 21=2, 22=4, 23=8, 24=6, 25=2, 26 = 4, 27=8, 28=6, 29=2, 20 (2, 4, 8, 6) 120/4 0(4)2^120 6

  • [101-18] A B 780 C D 50GB[101-25] A B C D [100-1] a. b. c. d. A abcd B badc C bdac D cabd

  • [99-1] A (SRAM)B (ROM) C (Register) D (CD-ROM)[99-2] BIOS (Basic Input Output System)BIOS A B MBR (Master Boot Record) C CPU D ROM (Read Only Memory)[98-18] A B (ROM) C (RAM)D

  • [98-19] 50(50x)(1x) (CD-ROM; DVD-ROM 10.5 Mbit/sec) A 300 Kbit/sec B 300 Kbyte/sec C 150 Kbit/sec D 150 Kbyte/sec[96-8] CPUCentral Processing Unit A CPU2 B CPUHyper-ThreadingCPU C CPU D CPU32264CPU

  • [97-9] (Bar Code Reader) A B C D [96-12] A B C D [95-7] A Speaker B Mouse C Keyboard D Scanner[95-23] A B C D

  • [96-9]CPU A CPU2/ B CPU C CPU2CPU2 D CPUHyper-Threading 4CPU

  • [95-12] 140 112 A 4 B 8 C 16 D 32 : = 140-112 = 28 ; = 140/4 = 35 ; = 35-28 = 7 112/7=16 [95-20] CPU 4MIPS A 0.25 ns B 250 ns C 4 ns D 400 ns : 4MIPS 1/(4M) = 0.25*10-6 s 0.25*10-6 s = 0.25 s = 250ns

  • [101-32] A PASCAL B HTML C FORTRAN D COBOL[99-3] A PHPserver B Java ScriptPHP C Java ScriptPHP D PHP[99-40] [email protected] html A B C D

  • [98-15] A PHP B Hidden field C Session D Cookie [98-16] 500 A B C D

  • Common HTTP Response Codes1xx Informational2xx Successful200 (OK)3xx Redirection301 (Moved Permanently); 302 (Found)4xx Client error400 (Bad request); 401 (Unauthorized); 403 (Forbidden)404 (Not found); 405 (Method not accept); 408 (Request timeout)5xx Server Error500 (Internal server error); 501 (Not implemented);502 (Bad gateway); 503 (Service unavailable); 504 (Gateway timeout)

  • [97-40] A ThunderBirdB Internet Explorer C Netscape CommunicatorD FireFox [96-20] A JavaScript B CGICommon Gateway Interface C PHPPHPHypertext Preprocessor D ASPActive Server Pages

  • [97-39] MICROSOFT ACCESS A B C D [96-40] Microsoft Access A B C D [96-39] Microsoft Excel A B C D ASCII

  • [96-35] Microsoft Excel A B C D [96-37] Microsoft Word A B C D

  • [96-38]Microsoft Word A B C D

  • [99-6] 8BCD (0100 1001)2+(0100 0110)2 A (1000 1111)2 B (95)10 C (-113)10 D [96-10] A ASCIIAmerican Standard Code for Information Interchange B EBCDICExtended Binary Coded Decimal Interchange Code C BCDBinary Coded Decimal D Unicode

  • [95-18] AASCII (65)10ZEROASCII A (90)16 (69)16 (82)16 (79)16B (5B)16 (45)16 (52)16 (4F)16 C (5A)16 (45)16 (52)16 (4F)16D (5A)16 (45)16 (53)16 (4E)16 : 65+(26-1) = 90; 65+(5-1)=69; 65+(18-1)=82; 65+(15-1)=79[95-25]BCD(Binary Coded Decimal) 3697 A 0011 0110 1001 1101B 0011 0110 1010 0111 C 0110 0011 1001 0111D 0011 0110 1001 0111

  • [100-19] A RFIDB EDI C AID PKI[100-25] A MIPSCPU B DPI C RPM D BPS

  • [99-39] A (Freeware) B (Shareware) C (Public Domain Software) D (Proprietary Software)[98-23] 3C A CommunicationB Collaborative Commerce C Consumer ElectronicsD Computer Products[98-24] A XMl B JPEG C BMP D HTML

  • [97-15] P2P(Peer to Peer) A Foxy B eMule C BitTorrent D FireFox [97-38] A B C D [96-11] A B C D

  • [95-10] A WAV B JPG C PNG D TIF[95-32] A B C D

  • [100-33] A B C D [99-38] VoIP A B IP C D

  • [98-20] CSMA/CD (Medium Access Control) A Ethernet B HFC C DSL D TCP/IP[97-14] Ethernet A Half DuplexB CSMA/CD C Circuit SwitchingD Cell Relay [98-8] A B C D

  • [98-28] (flow control) A bit errors B Overflow of the sender buffer C Overflow of the receiver buffer D Collision between sender and receiver [95-1] A Simplex B Synchronous Transmission C Asynchronous Transmission D Full-duplex

  • [100-18] A 111001001 B 101011101 C 111000100 D 001001000[95-39] (Odd Parity) A 11100000 B 10011011 C 10000000 D 11100001[96-6] A Hamming Code B Parity Bit Check C Cyclic Redundancy Code D Checksum

  • [96-7] CRCCyclic Redundancy Code6101110P(X )X^31 A 101110011 B 101110010 C 101110101 D 101110000 : 101110 XOR-div 1001 101110001010 1001 1001 001010000011

  • OSI[100-16] OSI A 4 B 5 C 6 D 7[100-5] OSI A (Network Layer)B (Presentation Layer) C (Transport Layer)D (Application Layer)[99-18] OSI A B C D [98-9] OSI Model Layer 4 (Transport Layer) A physical addressingB flow control C error controlD congestion control

  • OSI VS TCP/IP Model

    Application

    Physical

    Data Link

    Network

    Transport

    Session

    Presentation

    Application

    Link

    Internet

    Transport

    OSI Model

    TCP/IP Model

    Protocols

    FTP, Telnet, SMTP, HTTP, POP3, IMAP, MSN, ...

    TCP, UDP, ...

    IP, IPv6, ICMP, ...

    ARP, RARP, Ethernet, ...

    Network Devices

    Hub, switch, bridge, ...

    Router

    IP sharing box

    IPS/IDS,web switch,proxy, ...

  • [101-20] A B C D [101-39] T3 A 1.54Mbps B 44.7Mbps C 2.048Mbps D 34.368Mbps[101-40] (Ethernet) A 100BaseFXB 1000BaseSX C 1000BaseLXD 100BaseTX[98-6] ADSLCable modem A DHCP B NAT C DNS D Switching

  • [99-31] ACPU(Process)CPUBCCPUD[95-24] T1 bps A 128K B 1.544M C 2.4M D 6.5536M

  • [99-19] (Router) A (Bridge) B EthernetToken-Ring C OSI D IntranetInternet[95-16] A (Multiplexer)B (Compiler) C (Interpreter)D (Modem)

  • [97-10] TCP/IP A (Router) B (Bridge) C L2(L2 Switch)D (Hub) [97-23] (NAT) A B C D [96-24] A B C D IP

  • [95-8] A B C D

  • [101-27] A SMTP B FTP C IMAP D DNS[101-29] (WWW) A HTTP B IMAP C POP3 D SMTP[100-6] TCPUDP A TCPUDP B UDP(Connection-oriented) C UDP D TCPUDP

  • [99-20] A DHCPIP B UDP(Connection-Oriented) C SET D ARPIP(MAC Address)[98-22] (Internet)(Server)(Client) A TCP B FTP C SMTP D SNMP[97-16] (E-Mail) A SMTP B POP3 C IMAP D FTP

  • [96-21] TCPTransmission Control ProtocolUDPUser Datagram Protocol A TCP (Routing) (Addressing) B TCPUDP C UDP D TCPUDP[96-23] A SMTPSimple Mail Transmission Protocol B SNMPSimple Network Management Protocol C ARPAddress Resolution Protocol D POP3Post Office Protocol 3

  • [96-26] SNMPSimple Network Management Protocol A TCP B UDP C ICMPInternet Control Message Protocol D IGMPInternet Group Management Protocol [95-40] Internet A NOS B RS-232C C OSI D TCP/IP

  • IP[101-26] IP A 258.127.32.21B 192.82.165.5 C 141.93.2.51D 120.83.40.21[97-18] IP A 123.160.30.1B 192.168.1.8 C 140.123.267.85D 127.0.0.1

  • IP[98-4] IP A 1.1.0.254 B 10.1.0.254 C 127.1.0.254 D 224.1.0.254[97-19] A 123.160.30.1B 123.160.30.3 C 123.160.30.15D 123.160.30.255 [97-32] 123.160.30.0/23 A 123.160.30.255B 123.160.31.255 C 123.160.255.255D 123.255.255.255

  • Reserved Internet AddressesAuto configuration: 169.254.0.0/16Private address:10.0.0.0~10.255.255.255/8172.16.0.0~172.31.255.255/16192.168.0.0~192.168.255.255/24Loopback: 127.0.0.0/8Multicast: 224.0.0.0/8~

  • IP[101-36] 128.211.200.0/21(Subnet Mask) A 255.255.224.0B 255.255.240.0 C 255.255.248.0D 255.255.252.0[100-35] 140.12.0.0(Netmask)255.255.24.192 A 140.12.23.71B 140.12.26.72 C 140.12.48.96D 140.12.80.80[96-19] 140.12.0.0(Netmask)255.255.24.192 A 140.12.26.72B 140.12.23.71 C 140.12.48.96D 140.12.80.80

  • IP[98-11] IP129.129.0.0/18subnets A 2 B 4 C 8 D 18

  • Class VS Classless IDRClass

    CIDR: Classless Internet Domain RoutingRegardless of Class A-C, it can be an arbitrary length of network mask

    ClassBit PrefixRangeNetwork IDHost IDNumber of NetworksNumber of HostsA00~127ab.c.d27=128224=16777216B10128~191a.bc.d214=16384216=65536C110192~223a.b.cd221=209715228=256

  • IPv4 vs. IPv6[101-13] (Internet)IPv4IP(Internet Protocol Address) A 4 B 8 C 32 D 64[101-14] IPv6 A 64 bits B IPv68 C IPv6(:) D IPv616[98-17] IPv6IPIPv4IP(Bytes) A 2 B 6 C 8 D 12

  • IPv4 vs. IPv6[100-12] A IPv432bits B IPv4410 C IPv6128bits D IPv6610[99-22] IPIPv4Class C A 10.10.10.10 B 130.130.130.130 C 190.190.190.190 D 220.220.220.220[97-22] IPv6Bytes A 32 Bytes B 16 Bytes C 8 Bytes D 4 Bytes

  • Internet[101-28] ICANN A .org B .net C .com D .mil[97-11] A x.y.gov.tw B x.y.com.tw C x.y.net.tw D x.y.edu.tw [100-7] A SMTP ServerB Domain Name Server C NTP ServerD IMAP Server

  • Internet[101-21] IPIP A DNS B IMAP C DHCP D Proxy[99-16] IP A DNS B SMTP C HTTP D FTP[95-6] ( www.ntou.edu.tw)IP Address A HTTP B Router C DNS D ARP

  • Internet[100-40] A ipconfig B telnet C ping D ftp[98-38] pingEcho Request A ICMP B ARP C RARP D UDP[97-8](Port) A spop3965/tcp B ssmtp465/tcp C snews563/tcp D https443/tcp

  • Internet[100-38] 404 A B C D [96-34] A FTPFile Transfer ProtocolB SMTP C HTTPHyperText Transfer ProtocolD Telnet

  • Internet[95-17] URL A United Region Location B Uniform Resource Locator C Usenet Resource Location D Uniform Resource Line[95-35] (Bridge)OSI A Application Layer B Transport Layer C Network Layer D Data-Link Layer

  • [101-17] GSM GPRS AMPS 3.5G A B C D [101-16] Wi-Fi A Wi-Fi B Wi-FiWireless Fidelity C Wi-Fi D Wi-Fi

  • [100-20] (Bluetooth)? A B C D [100-23] 540Mbps A 802.11a B 802.11g C 802.11n D 802.11p[99-15] (Wireless Lan) A GSM B IEEE 802.11 C IEEE 802 D IEEE 802.1[98-14] (WAP) A WML B HTML C XHTML D HTTP

  • [97-7] WiMAX(Worldwide Interoperability for Microwave Access) A WiMAXIEEE 802.16IEEE 802.11 B (NCC)WiMAX C 2GHz66GHz D WiMAXIEEE 802.16e [96-18] A 802.11a B 802.11g C 802.11b D WiMAX

  • [97-21] IEEE 802.11g A B IEEE 802.11b C 200Mbps D Intel Centrino Napa [97-24] A GSMFDM B WCDMA C WAP D

  • [95-34] A GSM B WAP C Bluetooth D FDDI[95-14] IEEE802.11b A 10M bps B 11M bps C 2M bps D 1M bps

  • Comparisons forWireless Standards

  • [101-30] A B C D [100-37] A B C D [101-34] A B C D

  • [101-38] A BS7799 B ISO9001 C ISO17799 D CNS17799[100-29] BS 7799 Part 2ISO A ISO 9001B ISO 17799 C ISO 27001D ISO 7799

  • [101-33] A B C D [101-35] A (Availability)B (Integrity) C (Independence)D (Confidentiality)[101-37] A B C D

  • [100-14] A S-HTTP (Secure HTTP) B SSL (Secure Sockets Layer) C SET (Secure Electronic Transaction) D FTP (File Transfer Protocol)[100-21] A HTTP B S/MIME C TCP/IP D LDAP[100-24] A B C D

  • [100-27] A B C D

  • [101-15] A (Sniffing)B (Phishing) C (Social Engineering)D (Backup)[100-8] A (Logic Bomb)B (Denial of Service) C (Macro Virus)D (Buffer Overflow)[100-39] A (Trojan Horse)B (Logic Bomb) C (Asynchronous Attack) D (Trap Door)

  • [100-9] (Zero-day Attack) A B C 12 D [100-32] A (Social Engineering) B (Cross-Site Scripting, XSS) C (Phishing) D (SQL Injection)

  • [97-27] (Availability) A (Back Door)B (Smurfing Attack) C (DDOS)D (Ping-to-Death) [96-29] TCP SYN A B C D Sniffing[96-30] A B C D

  • [96-27] Ping A B C D IP Spoofing

  • [98-37] A B C D [96-28] A B C D

  • [98-39] (intrusion detection system) A B C D [97-30] (Intrusion Detection System) A False NegativeB False Positive C True NegativeD True Positive [97-31] (Deception System) A (Facade)B (Instrumented System) C (Intrusion Protection System) D (Honeynet)

  • [97-34] (Web Server) A Reverse Proxy B Secure Socket Layer(SSL) C Code Review D Web Inspector(Vulnerability)

  • [101-24] A B C D [99-17] A Word B C D

  • [101-22] (ciphertext)YBIR(plaintext)(ABZ0125)=((+13) mod 26)mod A ABCD B LOVE C LIKE D LOST

  • [100-34] A (Symmetric Encryption) B (Digital Signature) C RSA(Asymmetric Encryption) D [98-33] A B C D

  • [99-14] ABAESC D

  • [99-21] ABBA A AB B BB C AA D AA[98-5] A B C D

  • [98-35] AES (NIST) A AES-64 B AES-128 C AES-192 D AES-256[97-26] AES(Advance Encryption Standard) A AESRijndael B AES(Finite Field) C AES D AES128192256

  • [98-34] Fiestel DES A Electronic Code BookB Cipher Block Chaining C Cipher FeedbackD Input Feedback[97-33] (Cryptanalysis) A B C D [96-22]PGPPretty Good Privacy A B C D

  • [96-31] A B C D [96-32] A AESAdvanced Encryption Standard B RSARivest Shamir Adleman C RC4Ronald Rivest 4 D DESData Encryption Standard [95-2] A DES B AES C RSA D IDEA

  • [96-14] Diffie-Hellmanng473810 A 3 B 4 C 11 D 17 : A : n, g; : a; A ga B B : n, g: : b; B gb A : (ga)b = (gb)a = gab (mod n) 380 (mod 47) 30=1;31=3;32=9;33=27;34=34;35=8;36=24; 37=25;38=28;39=37;310=17;311=4;312=12;313=36; 314=14;315=42;316=32;317=2;318=6;319=18;320=7; 321=21;322=16;323=1 23 80/23 11 380 4 (mod 47)

  • List of CommonCryptographic Algorithms

    AsymmetricSymmetricHashRSADES/3DESMD5Diffie-HellmanBlowfishSHA-1DSSIDEASHA-256ElGamalRC4AES

  • Block Cipher Modes of OperationElectronic code book (ECB)Cipher block chaining (CBC)Cipher feedback (CFB)Output feedback (OFB)Counter (CTR)

  • [99-9] F = ABXORA=11011001B=01100001F A 01110001 B 10111000 C 11001010 D 01011011[99-12] A B C D[99-33] T D1D0 A 0011100100 B 0001101100 C 0010011100 D 0010110100

  • [99-30] D=1D=0 W=1W=0 L=1L=0L A DW B D+W C DW D DW

  • [98-31] AB C1 D0 123 A B 1 C 2D 3[95-37] (Universal Gates)A XOR B OR C NAND D AND : Universal Gates NAND and NOR

  • [97-1] (Karnaugh Map) (Minimal Boolean Expression) A B C D[95-28] A B C D

  • Boolean Algebra Mathematics A Quick Reference(Communicative)(Associative)(Distributive)(DeMorgans)(Minimization)(Absorption)(Simplification)(Consensus)

  • [95-27] A B C D

  • [98-13] big-O A O(n log n) B O(n log log n) C O(log n2.5) D O(n2 log n)[96-13] A log2n < n < nlog2nB nlog2n < n3 C n2 < n3 < 2nD 2n < nlog2n < n2

  • [100-4] A (Heap Sort)B (Insertion Sort) C (Bubble Sort)D (Selection Sort)[97-5] A Bubble SortO(n2)O(n)B Two-way Merge SortO(nlog2n)O(n)C Binary Tree SortO(nlog2n)O(nlog2n)D Heap SortO(nlog2n)O(nlog2n)

  • Comparison for Sort Algorithms

  • [96-1] O(n2)O(nlog2n) A Heap sortB Insertion sort C Merge sortD Quick sort [95-30] NO(NlogN) A (Quick Sort)B (Merge Sort) C (Bubble Sort)D (Selection Sort)

  • [101-9] (Stack)10push 10push 1 A 1popB 10pop C 10D push[101-10] popX A push X, pop, push Y, pop, push Z, pop B push X, push Y, push Z, pop, pop, pop C push X, pop, push Z, push Y, pop, pop D push X, push Y, pop, pop, push Z, pop

  • [100-3] abcd(stack)efgh A habfe B hfeba C hbaef D hefab

  • (Tree)[99-28] M(Leaf Node) (Full Binary Tree) A 2M-1 B M2 C 2M-1 D log2M[98-30] (binary tree) A 3 B 4 C 5 D 6[95-29] 3 2256 A 7 B 8 C 9 D 10

  • [100-36] (Postorder)dbefca(Inorder)dbaecf(Preorder) A adbecf B adbcef C abdcef D bcdefa[99-35] postfixab*c+de+fg*+/ infix A a*b+c+(d+e)/(f*g) B (a*b+c)/d+e+f*g C (a*b+c+d+e)/(f*g) D (a*b+c)/(d+e+f*g)[98-12] a/(b+c)*d postfix A ab+c/d* B ab/c+d* C abcd+/* D abc+/d*

  • Binary Tree TraversalPre-order: Print the root value before sub-treeIn-order: Print the root value between left sub-tree and right sub-treePost-order: Print the root value after sub-treeAn example:Pre-order:ABDECFIn-order:DBEACFPost-order:DEBFCA

    B

    D

    E

    C

    F

    A

  • [96-2]AIBHCGDFEABICHDGEF A FEGDHCIBAB FGHIABCDE C FGEHDICABD EFDGCHBIA [95-11] (Pre-order Traversal)ICBADFEGH (In-order Traversal)ABCDIEGFH(Post-order Traversal) A ABCDGEFHIB ABDCEGHFI C ABCDGEHFID ABDCGEHFI

  • [99-32] (Binary Tree) A (6+(2+7))*(3-1) B (6-2+7)*(3-1) C ((2+7)-6)*(3+1) D (3-1)+((2+7)*6)

  • [99-34] (DFS) A ABDECF B ABDEFC C ACFEDB D ABCDEF[98-3] (binary search tree): 368, 115, 121, 88, 741, 762, 801, 34, 41, 511, 3034368 A 2 B 3 C 4 D 5

  • [101-4] CC++ int c[10] = {3,2,0,1,5,9,7,8,6,4}; c[c[c[2]]]+c[c[c[c[c[9]]]]] A 6 B 7 C 8 D 9[101-31] Java A B C D [100-26] (Loader) A B C D

  • [101-5] CC++dowhileA 0B 1C 100D 101

    s=0;i=1;do{s=s+i;i=i+1;} while ( i

  • [99-23] A N=2 B N=3 C N=4 D N=5

    N=1 FOR J=1 TO 50 IF J MOD 15=0 THEN N=N+1 END IF NEXT J PRINT N=; N

  • [99-27] A J< >K B J=KC J=4-K D J=5-K

    FOR J=1 To 4 FOR K=1 To 4 IF ____ THEN PRINT 1; ELSE PRINT 0; NEXT K PRINT NEXT J0001001001001000

  • [99-24] A B C f(n)=n! D [95-31] (Fibonacci Number)F(0) = 0; F(1) = 1; F(i) = F(i-1)+F(i-2) for i 2 F(7)A 8 B 13 C 21 D 34

    F(0)F(1)F(2)F(3)F(4)F(5)F(6)F(7)F(8)01123581321

  • [98-1] CA=syntax analyzer; B=code optimizer; C=code generator; D=lexical analyzer; E=intermediate code generator; F=semantic analyzer; A ADFEBC B ADFECB C DAFECB D DAFEBC [97-17] A (Compiler)B (Editor) C (Assembler)D (Loader)

  • [100-28] UML A (Class Diagram) B (Network Diagram) C (Deployment Diagram) D (Activity Diagram)[98] A C# B Visual Basic C HTML D Java [96-17] A VB.NET B C# C Java D Pascal [96-34] A B C D

  • [97-4]Java A Java (Garbage Collection) B Java(Java Virtual Machine) C (Pointer)Java D Java [97-2] (Object-Oriented Programming) A (Recursion)B (Encapsulation) C (Inheritance)D (Polymorphism)

  • [98-36] (hash function) A IDEA B MD5 C SHA-1 D MD4[95-36] i = 0; while i
  • [95-38] A[m][n]A (Row Major)A[3][3]121A[6][4]161A[1][1]A 93 B 95 C 97 D 103 : = base + m*(col-size) + n, : 121 = base + 3*(col-size) + 3 161 = base + 6*(col-size) + 4 base=79 ; col-size=13 A[1][1] = 79 + 1*13 + 1 = 93

  • [101-11] (Relational Database) A B C D [99-36] A 1NF B 2NF C 3NF D 4NF[98-32] A (update lock)B (intent lock) C (shared lock)D (exclusive lock)[97-36] A VB B JAVA C SQL D ASP

  • (Normalizaton)1st, 2nd, 3rd, BC (Boyce-Codd) Normal Forms4th, 5th, DK (Domain/Key), 6th Normal Forms

    1st Normal Form2nd Normal Form (Partial Dependency)3rd Normal Form (Transitive Dependency)

  • [98-10] A B (Table) C (Index) D (Relation)(Table)[97-3](Normalization) A B C D

  • [95-26] A B C D [95-33] SQL SELECT A B C D [96-36] A B SQLStructured Query Language C SQL(Pointer) D

  • [101-12] B2E A B C D [101-8] A ERP:B SCM: C KM:D CRM:[100-30] A (Work flow)B (Logistic flow) C (Cash flow)D (Information flow)

  • [100-17] (Cloud Computing) A (Platform as a Service, PaaS) B (Software as a Service, SaaS) C (Data as a Service, DaaS) D (Infrastructure as a Service, IaaS)[96-25] SETSecure Electronic TransactionSSLSecure Socket Layer A SETSSL B SETSSL C SETVisaMasterCardSSLNetscape D SETSSL

  • [95-3] A B2B B B2C C C2B D C2C : Business VS Customer[95-4] SSL3.0 A 32 B 64 C 128 D 256[95-9] A B C UnicodeD (Data Mining)

  • [97-12] (Disk Scheduling) A (STF)B (FCFS) C (SSTF)D (C-SCAN) [97-13] FreeBSD A LinuxUnix-likeB C GPL(GNU General Public Licenses) D

  • [98-27] P1, P2, P3, P4,P5()(CPU)() A 3.4 B 4.5 C 5.6 D 6.7

    Sheet1

    P135

    P211

    P342

    P455

    P524

  • [97-25] USB 2.0 A 480M bit/secB 480M byte/sec C 48M bit/secD 48M byte/sec [97-28] (RAID) A RAID level 0 B RAID level 1 C RAID level 3 D RAID level 5 [96-16] CPU10ns5ns10ns10ns5ns(pipelining)100(ns) A 4000 B 2500 C 1040 D 520

  • Pipeline ExecutionT = 40 + (n-1)*10

  • [97-29] CISC(Complex Instruction Set Computers)RISC(Reduced Instruction Set Computers) A CISC RISC B CISCRISC C CISC RISC D CISCRISC(Pipeline)(Super Scalar) [97-35] (CPU) A (ALU)B (Register) C (Control Unit)D (Output Unit)

  • [98-29] (page) A size of the page taleB Internal fragmentation C Input/Output timeD CPU speed[98-25] A B C D [99-26] A (Priority) B (FCFS) C (RR) D (SJF)

  • [99-4] (Virtual Memory) A (RAM) B (Secondary Storage) C D [99-5] NTFS A B C D [99-10] (Process) A Page Map Table B Process Control Block C Routing Table D Table of Content

  • Q & A