COMP10001 Foundations of Computing
Week 1, Lecture 1 (29/2/2016)
COMP10001 Foundations of Computing
Welcome and Introduction
Semester 1, 2016
Tim Baldwin & Andrew Turpin
version: 707, date: February 28, 2016
COMP10001 Foundations of Computing
Week 1, Le
Part 1: Algorithmic Thinking
Question 1
[10 marks]
Evaluate each of the following expressions; what is the return value in each case?
(a) str(2) + "easy"
A:
"2easy"
(b) "tim" not in "optimist"
A:
False
(c) "yahtzee"[1:][:3]
A:
"aht"
(d) [(i,str(i) for i i
Part 1: Algorithmic Thinking
Question 1
[4 marks]
What is the output of the following code:
def fun(string):
counter = 0
for ch in string.lower():
if ch in "aeiuo":
counter += 1
return counter
print fun("Albatross")
A:
3
Question 2
[5 marks]
What is the o
Part 1: Algorithmic Thinking
Question 1
[10 marks]
Evaluate each of the following expressions; what is the return value in each case?
(a) "easy" + str(1)
A:
"easy1"
(b) bool(2 > 0 and len([])
A:
False
(c) (1,(2,3),4)[1][0]
A:
2
(d) [i%3 for i in range(0,1
Student Number
The University of Melbourne
Department of Computing and Information Systems
Mid-semester Test, Semester 1, 2015
COMP10001 Foundations of Computing
Writing Time: 45 minutes
This paper has 7 pages including this cover page.
There are 5 questi
Part 1: Algorithmic Thinking
Question 1
[10 marks]
Evaluate the following expressions, and provide the output in each case.
(a) ('comp', 10000 + 1)
A:
('comp', 10001)
(b) sorted(cfw_'dogs': ['andrew'], 'ducks': ['tim'])[-1]
A:
'ducks'
(c) "c" + str(0)*2 +
Student Number
The University of Melbourne
Department of Computing and Information Systems
Mid-semester Test, Semester 1, 2016
COMP10001 Foundations of Computing
RA
FT
Writing Time: 45 minutes
This paper has 7 pages including this cover page.
There are 5
R for Beginners
Chinese Edition
2.0
Emmanuel Paradis
Institut des Sciences de lEvolution
Universite Montpellier II
F-34095 Montpellier cedex 05
France
E-mail: [email protected]
Co-translated by: XF Wang, YH Xie, JT Li and GH Ding
R for beginners
COMP10001 Foundations of Computing
Week 1, Lecture 3 (3/3/2016)
COMP10001 Foundations of Computing
The Basics of Types
Semester 1, 2016
Tim Baldwin & Andrew Turpin
version: 722, date: March 3, 2016
COMP10001 Foundations of Computing
Week 1, Lecture 3 (3
Student Number
The University of Melbourne
Department of Computing and Information Systems
Final Examination, Semester 1, 2015
COMP10001 Foundations of Computing
Reading Time: 15 minutes. Writing Time: 2 hours.
This paper has 20 pages including this cover
Student Number
The University of Melbourne
Department of Computing and Information Systems
Final Examination, Semester 1, 2013
COMP10001 Foundations of Computing
Reading Time: 15 minutes. Writing Time: 2 hours.
This paper has 21 pages including this cover
Student Number
The University of Melbourne
Department of Computing and Information Systems
Final Examination, Semester 1, 2012
COMP10001 Foundations of Computing
Reading Time: 15 minutes. Writing Time: 2 hours.
This paper has 17 pages including this cover
lOMoARcPSD
Exam January 2, 2011, answers
Foundations Of Computing (University of Melbourne)
lOMoARcPSD
Part 1: Algorithmic Thinking
Question 1
[10 marks]
Evaluate each of the following expressions; what is the return value in each case?
(a) "easy" + str(1
COMP10001 Foundations of Computing
Week 4, Lecture 2 (2016)
COMP10001 Foundations of Computing
Deictionaries and Sets
Semester 2, 2016
Chris Leckie
July 31, 2016
COMP10001 Foundations of Computing
Announcements
Tomorrows lecture is on Project 1
Week 4, Le
COMP10001 Foundations of Computing
Week 5, Lecture 2 (2016)
COMP10001 Foundations of Computing
Modules and Files
Semester 2, 2016
Chris Leckie
August 22, 2016
COMP10001 Foundations of Computing
Week 5, Lecture 2 (2016)
Reminders
Workshops 7 and 8 due 23:5
COMP10001 Foundations of Computing
Week 3, Lecture 1 (2016)
COMP10001 Foundations of Computing
Functions, Methods and Iteration
Semester 2, 2016
Chris Leckie
July 31, 2016
COMP10001 Foundations of Computing
Announcements
DO NOT share assesable code
(eg wo
COMP10001 Foundations of Computing
Week 1, Lecture 2 (2016)
COMP10001 Foundations of Computing
Introduction to Computing
Semester 2, 2016
Chris Leckie
July 8, 2016
COMP10001 Foundations of Computing
Week 1, Lecture 2 (2016)
Lecture Agenda
What did last ye
COMP10001 Foundations of Computing
Week 1, Lecture 3 (2016)
COMP10001 Foundations of Computing
The Basics of Types
Semester 2, 2016
Chris Leckie
July 8, 2016
COMP10001 Foundations of Computing
Lecture Agenda
Last lecture:
Basics of Python
Grok
This lectur
Student Number
The University of Melbourne
Department of Computing and Information Systems
Final Examination, Semester 1, 2014
COMP10001 Foundations of Computing
Reading Time: 15 minutes. Writing Time: 2 hours.
This paper has 18 pages including this cover