程序调用自身的编程技巧称为递归，递归的英文是（）。 A: return B: recursion C: restart D: reverse

A<br/>grammar G, if (), is called LL (1) grammar. A: G<br/>contains no left recursion B: G<br/>has no ambiguity C: The LL (1) analysis table of G does not contain multiple definitions D: There is no left common factor in the production of G

With a regular computer, computing fib(100) naively using recursion would cost (no need to consider overflow). 以现在普通计算机的速度，直接用定义以递归的方式计算fib(100)需要多少时间（不考虑溢出）:</p></p>

You have a DNS server that runs Windows Server 2003 Service Pack 2 （SP2）. You need to prevent the DNS server from resolving host names on the Internet.  What should you do？（） A: Disable recursion. B: Create a stub zone. C: Disable round robin. D: Clear the DNS cache.

You have a DNS server named Server1 that runs Windows Server 2003 Service Pack 2 （SP2）. You create a primary zone on Server1 for contoso.com.You run the DNS simple query test and recursive query test. The simple query test completes successfully， but the recursive query test fails.You need to ensure that the recursive query test can complete successfully.  What should you do on Server1？（） A: Clear the cache. B: Disable recursion. C: Enable access to the Internet. D: Configure a reverse lookup zone.