0% found this document useful (0 votes)
11 views1 page

c_3_jr_jan

The document is a problem set from the American Computer Science League contest for the Junior Division, covering topics such as graph theory and digital electronics. It includes tasks like drawing a directed graph, creating an adjacency matrix, simplifying a Boolean expression, and analyzing a program's output based on a given array. The problems require knowledge of graph structures, Boolean logic, and programming concepts.

Uploaded by

CK
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views1 page

c_3_jr_jan

The document is a problem set from the American Computer Science League contest for the Junior Division, covering topics such as graph theory and digital electronics. It includes tasks like drawing a directed graph, creating an adjacency matrix, simplifying a Boolean expression, and analyzing a program's output based on a given array. The problems require knowledge of graph structures, Boolean logic, and programming concepts.

Uploaded by

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

ACSL

2007 - 2008 American Computer Science League Contest #3


Junior Division

1. Graph Theory
Draw the directed graph containing the following vertices and edges.
Vertices: {A, B, C, D} Edges: {AB, BC, CA, AD, DA, CB}

2. Graph Theory

Write the adjacency matrix for the


directed graph.

3. Digital Electronics

Simplify the Boolean expression


that this circuit represents.

4. Digital Electronics

Which ordered pair(s) make


the following circuit TRUE?

5. What Does This Program Do?


Given array A below, what is the final value of S after the program is run?
S=0
for I = 1 to 4
for J = 1 to 3
if I J then A(I,J) = A(I,J)^2 else A(I,J)=int(A(I,J)/2)
S = S + A(I,J)
next J 1 2 3
next I 2 4 6
print S 3 6 9
end 4 8 12

xxxxxxxxxxxxxxxxxxxx
Note: A(1,1) = 1

You might also like