Final examination on Introduction to the Internet - Christian Rinderknecht
What are the five layers in the Internet protocol stack? What are the principal responsibilities of each of these layers? 2. What information is used by a process ...
Final examination on Introduction to the Internet Christian Rinderknecht June 2006
1
Review questions 1. What are the five layers in the Internet protocol stack? What are the principal responsibilities of each of these layers? 2. What information is used by a process running on one host to identify a process running on another host? 3. What is the difference between persistent http with pipelining and persistent http without pipelining? 4. Describe briefly cookies in web browsers. Why are they useful? 5. What is the conditional GET http request useful for? 6. How an organisation’s web server and mail server can have exactly the same alias for a hostname? 7. Describe shortly how a Domain Name Server performs load balancing.
2
True or false? 1. Suppose a user requests a Web page that consists of some text and two images. For this page the client will send one request and receive three response messages. 2. Two distinct Web pages can be sent over the same persistent connection. 3. With non-persistent connections between browser and origin server, it is possible for a single TCP segment to carry two distinct http request messages. 4. The Date: header in the http response message indicates when the object in the response was last modified.
Answers to the final examination of Erlang. Christian Rinderknecht. 14 June 2007. 1 Merging sorted lists. Question. Write a function merge/2 which takes two lists ...
... does not contain X. Since the heads of rules 2 and 4 match a non empty S, X must only match [] in the new rule 5, which can then be further simplified as ...
Answers to the final examination of Introduction to Networking. Christian Rinderknecht. 19 June 2007. 1. Questions. Suppose two hosts A and B, separated by ...
What are the advantages of message segmentation in packet-switched ... are variable? ... Five generic tasks are error control, flow control, segmentation and.
Answers to the mid-term exam on Prolog. Christian Rinderknecht. 19 October 2006. 1 Matching. Question. Show the results (Yes/No) and resulting variable ...
Oct 25, 2005 - Write an integer postfix calculator in Lex. For example, expressions such as 1 2 + and 1 2 3 4 /*- should be evalu- ated respectively to 3, i.e. 1+2 ...
Answers to the Final Exam on. Prolog Programming. Christian Rinderknecht. 3 December 2008. 1 Sorting leaves in a binary tree. Question. Design a simple ...
Answers to quiz #1 on Algebraic Specification. Christian Rinderknecht. 17 May 2005. 1 Arrays. We want an algebraic specification of arrays. An array is a list ...
Answers to the final exam on Algebraic. Specification. Christian Rinderknecht. 17 June 2005. 1 Binary tree specification. Let us recall an algebraic specification ...
This extended version contains an extra Appendix with the proof of the claimed properties. ..... P ARx, specific to each algorithm, that may add or not some meta-.
Oct 19, 2008 - arguments of function Or, whose type, as given by the signature, is tÃt â t. It is very ... In mathematics, the integer sequence we give page 11.
Oct 31, 2008 - Property x · ǫ = ǫ · x = x holds for all strings x. ...... the same pair of nodes and listing the labels, separated by commas: q0 q1 q2. 0. 1. 0. 1. 0,1.
Compiler Engineer and Expert in Formal Methods ... Compiler Construction and Related Toolchains ... Technical Documentation and Scholarly Publications.
Apr 18, 2008 - Answer the following questions, briefly jus- tifying your answer. (a) Would a packet-switched network or a circuit-switched network be more ...
Oct 24, 2008 - Suppose a client uses a non-persistent connection to query a page made of a base html file and ten jpeg images, all objects being stored on ...
characters having a collective meaning; sets of lexemes with a common interpretation ... Rule 1 and 2 are non-recursive base rules, while the others define expres- sions in terms of ... An abstract syntax tree (or just syntax tree) is a compressed ve
Oct 31, 2008 - The fractional part of a decimal number is of the shape: F = d-1 Ã 10-1 + d-2 Ã 10-2 .... 64 + 32 + 16 + 4 + 1 = 117. 2-complement binary ..... Consider a boolean function F(A, B), defined by the truth table. A B AB AB AB AB F(A, ...
Oct 31, 2008 - wise #IMPLIED,. 6. a closing tag > ..... saxonhe9-3-0-4j.zip/download. Its name is ..... Otherwise it will be output without namespace, instead of ...
Quiz #1 of Erlang. Christian Rinderknecht. 3 April 2007. This time it is about shuffling ... Questions. Define shuffle3/3. 1. without tail recursion;. 2. with tail recursion.
You also learn C, as a part of C++ or by itself (for system programming), so you are ... which is mainly an introduction to the Prolog programming language, al-.
Expert systems are more similar to a database of domain-specific infor- mations and logic rules (simpler than within proof assistants) which allow queries to be ...
LBM theory, discuss essential advantages and limitations of the method, and focus on ... All theoretical and exercise lectures will be given in room CC2.21.
