Chapter One: ①MOORE today whether the law can achieve
if ②FORTRAN other languages has been replaced in today
Chapter II: ① Are there more advanced than positional notation counting method
, etc. ②8 and hexadecimal What is the meaning of existence
Chapter III: ① lossy data compression is how the loss of information
② overflow can cause damage to computer hardware do
Chapter IV: ① sense the presence of the NAND gate is what
②SR storage device to which now applies to
Chapter Five: ① if the computer does not exist today to von Neumann architecture is the underlying
② today's embedded systems primarily use those languages
Chapter VI: ① machine language and programming language is how to convert
② binary machine instructions how to understand and execute
Chapter VII: ① now the best algorithm who invented
② random search algorithm it
Chapter VIII: ① Is there a tree to retrieve the trigeminal
whether ② subroutine run the same language as their programming language
Chapter IX: ①python Why is not strongly typed language
②IF and WHILE language differences
① operating system is what language compiler: Chapter X
case after ② whether there is, first served
Chapter 11: ① whether the nature of the text file is a binary file
② change the file extension will lead to a file content changes
Chapter XII: ① most advanced database engine, which is a
② database can also be improved if the style
Chapter XIII: ① What does it mean the deletion of the search tree
② Why expert system is also called rule-based system
Chapter XIV: ① What game engine is written in
all models ② can use computer simulation it
Chapter XV: ① how the firewall is compromised
②IPV6 in today's mainstream yet
Chapter XVI: ① concept search now to what extent
the difference ②Java, php
Chapter XVII: ① verification code can be bypassed it
② whether fingerprinting really safe
Chapter XVIII: ① formal verification is what
② Why not finish bug has been resolved