Sie sind auf Seite 1von 9

Monash College

Sample Mid Semester Test

Diploma of Information Technology

TEST CODE! ! ! MCD4710

TITLE OF PAPER! ! Introduction to Algorithms and Programming

TEST DURATION! ! 45 minutes

READING TIME!! ! 5 minutes

STUDENT ID _________________

During the test, you must not have in your possession, a book, notes, paper, electronic device/s,
calculator, pencil case, mobile phone or other material/item which have not been authorised for the
test or specifically permitted as noted below. Any material or item on your desk, chair or person will
be deemed to be in your possession. You are reminded that possession of unauthorised materials in
an exam is a discipline offense under Monash Statute 4.1

No test papers are to be removed from the room.



OPEN BOOK! ! ! ! ! NO


! !
Page 1
Answer the questions in the spaces provided on the question sheets.

1. (4 points)

(a) Draw a minimum spanning tree of the graph below.

(b) What is the weight of the minimum spanning tree?

(c) Is this graph Eulerian? Explain.

Page 2
2. (5 points)
Represent the following graph by an adjacency matrix.

1 0

2 1

Page 3
3. (3 points)
Circle the correct Python evaluation (True or False) for each of the following Boolean
(a) 2 ∗ ∗2 ∗ ∗3 == 4 ∗ ∗3
A. True
B. False
(b) True and not False
A. True
B. False
(c) 4 not in range(4)
A. True
B. False
(d) ”hello” == [’h’, ’e’, ’l’, ’l’, ’o’]
A. True
B. False
(e) 10/3 == 3
A. True
B. False
(f) len([1,2,3])==2
A. True
B. False

Page 4
4. (8 points)
For each of the following fragments of Python code, write what would be printed by the
(a) total=0
for i in range(3,7,2):

(b) s="hello world"


(c) for k in [1, 2, 3]:


(d) s = "1045"
t = "FIT"
for k in range(len(t)):
s += t[k]

Page 5
5. (8 points)

(a) Give a definition of an algorithm.

(b) Explain why the following pseudocode is, or is not, an algorithm.

input x
while True:

(c) Explain why the following words are, or are not, valid Python variable names.

Page 6
6. (4 points)
Write a Python program that given an unsorted list of integers and prints the number
in the list with the smallest absolute value.
For example, if the list is [3, −5, 2, −6, −1] the program should print -1,
and if the list is [4, −21, 2, −20] your program should print 2.
You can assume that the list is called numList and already contains at least one number:
you do not need to write code to read the numbers from a file or ask the user to input

Page 7
7. (5 points)

(a) Sort the list [3, 16, 25, 32, 1, 20] into increasing order using Insertion sort. You
should write the list in the table below after each iteration of the main loop in this

3 16 25 32 1 20

(b) Give a loop invariant for the main loop in the Insertion Sort Algorithm.

Page 8
8. (5 points)
Write Python code to find the maximum entry in a n×m table T. Your code should print
the value of the maximum entry and its location (row and column). You can assume
that all the entries are distinct.

Page 9