Scribd
Upload
2 views2 pages

Y) ::Lxv'Y (Xy::Lx::Ly ( (X (2X (X: (D) Vxv'Y::Lz (Z

The document outlines the examination details for CSIS 1118 at The University of Hong Kong, including calculator usage guidelines and a series of questions covering various topics in computer science. It includes questions on logical statements, argument validity, combinatorics, relations, graph theory, propositional logic, and automata theory. The exam is structured to assess students' understanding of foundational concepts in computer science.

Uploaded by

peak
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views2 pages

Y) ::Lxv'Y (Xy::Lx::Ly ( (X (2X (X: (D) Vxv'Y::Lz (Z

The document outlines the examination details for CSIS 1118 at The University of Hong Kong, including calculator usage guidelines and a series of questions covering various topics in computer science. It includes questions on logical statements, argument validity, combinatorics, relations, graph theory, propositional logic, and automata theory. The exam is structured to assess students' understanding of foundational concepts in computer science.

Uploaded by

peak
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

THE UNIVERSITY OF HONG KONG

FACULTY OF ENGINEERING
DEPARTMENT OF COMPUTER SCIENCE AND INFORMATION SYSTEMS

CSIS 1118 Foundations of Computer Science

Date: December 28, 2002 Time: 9:30am - 12:30pm


Candidates may use any calculator which fulfils the following criteria: (a) it should be self-contained,
silent, battery-operated and pocket-sized; (b) it should have numeral-display facilities only and should
be used only for the purpose of calculation; (c) it should not have any printing device, alphanumeric
keyboard, or graphic display; and (d) it should not contain any recorded data or program. It is the
candidate's responsibility to ensure that the calculator operates satisfactorily and the candidate must
record the name and type of the calculator on the front page of the examination scripts. Lists of
permitted/prohibited calculators will not be made available to candidates for reference, and the onus
will be on the candidate to ensure that the calculator used will not be in violation of the criteria
listed above.

Answer ALL questions

1. (8 marks] Determine the truth value of each of the following statements if the universe of
discourse of each variable is the set of real numbers:
(a) Vx:3y(x 2 = y); (b) ::lxV'y(xy = 0); (c) ::lx::ly[(x + 2y = 2) 1\ (2x + 4y = 5));
(d) VxV'y::lz(z = (x + y)/2).

2. [12 marks]: Determine whether each of the following arguments is valid. If an argument is
valid, what rule of inference is being used? If it is not, what fallacy occurs?

(a) [3 marks] If n is a real number with n > 2, then n 2 > 4. Suppose that n 2 > 4. Then n > 2.
(b) [3 marks] If n is a real number with n > 2, then n 2 > 4. Suppose that n 2 :::; 4. Then n :::; 2.

(c) [3 marks] If n is a real number with n > 2, then n 2 > 4. Suppose that n:::; 2. Then n 2 :::; 4.

(d) [3 marks] If n is a real number with n > 2, then n 2 > 4. Suppose that n > 2. Then n 2 > 4.

3. [10 marks] How many ways are there to distribute 5 different toys to 4 different children such
that each child gets at least one toy?

4. [12 marks]: Answer the following questions:

(a) [5 marks] Find a recurrence relation for the number of bit strings of length n that contain
three consecutive Os.

(b) [3 marks] What are the initial conditions?

(c) [4 marks] How many bit strings of length 6 contain three consecutive Os?

5. [13 marks]: Let R be the relation on the set {1, 2, 3, 4} containing the ordered pairs (1, 2),
(1, 4), (3, 3), (4, 1).

1
(a) [2 marks] Form a matrix Mn to represent the relation R.
(b) [8 marks] Find the transitive closure of the relation R.
(c) [3 marks] Find the smallest relation containing the relation R that is both reflexive and
transitive.

6. [18 marks]: Consider the complete bipartite graph Km,n· Answer the following questions.

(a) [2 marks] For which values of m and n does the Km,n have an Euler circuit?
{b) [4 marks] For which values of m and n does the Km,n have an Euler path but not an Euler
circuit?
(c) [2 marks] Is the K2,6 planar?
(d) [2 marks] Is the K3,6 planar?
(e) [2 marks] What is the chromatic number of Km,n?
(f) [6 marks] Find the number of paths of length 4 between any two nonadjacent vertices in K 4 ,4 •

7. [15 marks]: Answer the following questions.

(a) (5 marks] Draw the ordered rooted tree corresponding to the compound proposition
+-+...,V pq !\ •p•q written in prefix notation.
(b) [5 marks] What is the postfix expression of this compound proposition?
(c) [5 marks) Draw a truth table for this compound proposition.

8. [6 marks]: Find a regular grammar that generates the regular set recognized by the finite-state
automaton shown in the following figure:

start

Figure 1: A Finite-State Automaton.

9. [6 marks]: Construct a nondeterministic finite-state automaton that recognizes the language


generated by the regular grammar G = (V,T,S,P), where V= {O,l,S,A}, T = {0,1}, S is the
start symbol, and the set of productions is P = {S -+ lA, S -+ 0, S -+ ..\, A -+ OA, A -+ lA, A -+ 1}.

END OF PAPER

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy