UIT2201: CS & the IT Revolution
Review Topics for Quiz 2 (Spring 2003)

(Read general remarks about Quizzes and Quiz questions at 2003-Quiz.html.)

Here are some general information on Quiz 2 (for your reference).

Topics Covered:

  1. Lecture Topics: Database, Network/Internet/WWW, Artificial Intelligence, Theory
  2. Tutorial 8 onwards (all problems except A-problems),
  3. Textbook [SG]:
  4. Notes: Lecture Notes, and Handout on AI [Brookshear]

Some Review Questions (RQ):

Some sample question for your reference. Of course, there is no guarantee that all the Quiz questions are like that. This is for reference only!

RQ-0 Review all the tutorial problems given to you.

RQ-1. [True/False] For each of the following, answer TRUE or FALSE.

  1. A tuple consists of a row of attributes.     _________

  2. There should not be more than one table (relation) in a database.     _________

  3. Communication protocols are only needed for Wide Area Networks.     _________

  4. Expert systems are applications of neural networks.     _________

  5. From the rule "if X is high, then X is dry" and the assertion "Louis is not dry", one can conclude that "Louis is not high".     _________

  6. There exist problems for which we willl never find an Turing Machine (TM) program to solve.     _________

  7. No Java program can be written to decide whether any two Java programs are equivalent (will produce the same output for all inputs). (Read [SG] page 517)     _________

RQ-2. (Short Answers)

  1. How do we define a database?

  2. Name three different network services commonly provided by modern computer networks.

  3. Give two examples of typical uses for "client-server" computing.

  4. Would the well-known AI program, Eliza, pass the Turing Test? Explain.

  5. A rule-based system attempts (circle all that apply)
    1. mimic the human ability to reference pertinent facts and string them together in a logical fashion.
    2. sumulated the connectionist architecture of the human brain.
    3. carefully distinguish between objects and their attributes.
    4. contain both a set of facts about the subject matter and a mechanism for selecting relevant facts and reasoning about them in a logical way.

  6. List the four properties required of any computing agent. (Read Section 10.3.1 of [SG]).

  7. Describe one respect in which a Turing Machine has more capability than any real computer.

  8. Why is the Church-Turing Thesis not proved like any other theorem.

RQ-?. Consider the database schema given in T8-D1. Given the following sequence of SQL statements:

   T1 <-- SELECT from ENROLMENT where (COURSE-ID="NN")
   T2 <-- JOIN T1 and STUDENT-INFO 
             where (STUDENT-INFO.Student-ID = T1.Student-ID)
   T3 <-- SELECT from T2 where (Faculty="FASS")
   A  <-- PROJECT T3.Name from T3;
Suggest ways to modify the query to make it computationally more efficient.

RQ-?. Consider the rule-based system (cf: Father, Mother, Parent,...) defined in the lectures notes. Define the relationship GrandFather.

RQ-?. Practice Problem 1,2 (Ch 10, pg 494-495) of [SG]. (Answers given in book).

UIT2201: CS & IT Revolution; (Spring 2003); A/P Leong HW