Sample Examination, Semester 1, 2013
105875,105873
Ofcial Reading Time:
Writing Time:
Total Duration:
Questions
Answer all 6 questions
Algorithm Design and Data
Structures
COMPSCI 1103, 1203
10 mins
60 mins
70 mins
Time
60 mins
Marks
60 marks
60 Total
Ins
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 25
1
1
Welcome!
In this lecture we will discuss:
Recursive complexity
2
2
Todays format
Todays lecture will be lecture + in-lecture quiz 3
3
3
Sorting and
Recursive
Complexity
4
2
1
?
8
3
6
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 17
1
1
Welcome!
In this lecture we will discuss:
Using ADTs to produce useful structures
Shortfalls in the approaches that we have used
so far.
2
2
Todays format
Todays lecture will be lectu
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 22
1
1
Welcome!
In this lecture we will discuss:
Searching and sorting algorithms
O(1) and O(log n)
2
2
Todays format
Todays lecture will be lecture + activity.
3
3
Searching
and Sorting
4
2
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 23
1
1
Welcome!
In this lecture we will discuss:
Sorting algorithms
2
2
Todays format
Todays lecture will be lecture + groupwork.
3
3
Sorting
Algorithms
4
2
1
?
8
3
6
5
9
7
10
4
4
Review
You
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 16
1
1
Welcome!
In this lecture we will discuss:
Polymorphism
Finally!
2
2
Todays format
Todays lecture will be lecture + activity.
3
3
Bird
declaration
public:
virtual double ap();
implemen
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 21
1
1
Welcome!
In this lecture we will discuss:
More complexity
Examples!
2
2
Todays format
Todays lecture will be lecture + demo.
3
3
Calculating
complexity
for a program
o(n)
2)
O(n
4
4
R
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 19
1
1
Welcome!
In this lecture we will discuss:
Upper and lower complexity bounds
Best-case complexity
Worst-case complexity
2
2
Todays format
Todays lecture will be lecture + activity.
3
3
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 18
1
1
Welcome!
In this lecture we will discuss:
Complexity in computation
How to analyse complexity
2
2
Todays format
Todays lecture will be lecture + groupwork.
3
3
Library
Introduction
to
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 24
1
1
Welcome!
In this lecture we will discuss:
Another sorting algorithm
An introduction to recursive complexity
2
2
Todays format
Todays lecture will be lecture + group activity.
3
3
Sort
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 27
1
1
Welcome!
In this lecture we will discuss:
Queues
2
2
Todays format
Todays lecture will be lecture + demonstration.
3
3
Queues
ADD
HERE
REMOVE
HERE
Savitch, Chapter 13
4
4
Review
Lets
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 28
1
1
Welcome!
In this lecture we will discuss:
Linked lists in far more detail
2
2
Todays format
Todays lecture will be lecture + group activity.
3
3
Book
Linked lists
Book
Book
?
Book
Sav
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 33
1
1
Welcome!
In this lecture we will discuss:
Problem Solving
Thinking about solutions
2
2
Todays format
Todays lecture will be lecture + activity.
3
3
Problem
Solving
4
4
Review
Weve dis
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 34
1
1
Welcome!
In this lecture we will discuss:
Programming Paradigms
2
2
Todays format
Todays lecture will be lecture + marked activity.
3
3
Programming
Paradigms
(Oh no, its Rodin again!
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 35
1
1
Welcome!
In this lecture we will discuss:
Introduction to type systems
2
2
Todays format
Todays lecture will be lecture + activity.
3
3
A
A
A
A
10101010101010101010101010101010
Type S
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 30
1
1
Welcome!
In this lecture we will discuss:
Trees
2
2
Todays format
Todays lecture will be lecture + demonstration.
3
3
Linked lists
and Trees
4
2
1
Savitch, Chapter 13
8
3
6
5
9
7
10
4
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 32
1
1
Welcome!
In this lecture we will discuss:
Algorithmic Strategies
Divide-and-Conquer
Transform-and-Conquer
Greedy Algorithms
2
2
Todays format
Todays lecture will be lecture + demonstr
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 31
1
1
Welcome!
In this lecture we will discuss:
Algorithmic Strategies
Brute Force
Exhaustive Search
2
2
Todays format
Todays lecture will be lecture + group activity.
3
3
Algorithmic
Techn
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 26
1
1
Welcome!
In this lecture we will discuss:
Linked lists and stacks
2
2
Todays format
Todays lecture will be lecture + demonstration.
3
3
Linked lists
and stacks
Book
Book
Book
?
Book
S
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 29
1
1
Welcome!
In this lecture we will discuss:
Stacks and queues in far more detail
2
2
Todays format
Todays lecture will be lecture + group activity.
3
3
Stacks and
Queues
Book
Book
Book
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 14
1
1
Welcome!
In this lecture we will discuss:
More details of recursion!
We will introduce the notion of tail recursion.
2
2
Todays format
Todays lecture will be lecture + groupwork.
3
3
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 20
1
1
Welcome!
In this lecture we will discuss:
More complexity
Big O, little o, Omega and Theta
2
2
Todays format
Todays lecture will be lecture + group activity.
3
3
o(n)
Big O and
little
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 5
1
1
Welcome!
In this lecture we will:
Extend our knowledge of classes by discussing
and learning to use class hierarchies.
2
2
Todays format
Todays lecture will be lecture + group work.
3
CS 1103/1103BR/1203
Algorithm design and
data structures
Lecture 3
1
1
Welcome!
In this lecture we will:
Look at memory in C+
Discuss segmentation faults and bus errors
Talk about core dumps
2
2
Todays format
There are four types of block: lectures, demos
Database Management Systems
Tutorial Week 4
Weight 1%
The tutorial assessment each week is generally based on your understanding of the weeks
course content, your written answers to each weeks tutorial questions, your group interaction
in discussing your
Faculty of Science
ITECH1006/5006
Database Management Systems
Database Management Systems
Tutorial Week 1
Weight 1%
The tutorial assessment each week is generally based on your understanding of the weeks course
content, your written answers to each weeks
Database Management Systems
Tutorial Week 5
Weight 1%
The tutorial assessment each week is generally based on your understanding of the weeks
course content, your written answers to each weeks tutorial questions, your group interaction
in discussing your
Database Management Systems
Tutorial Week 2
Weight 1%
The tutorial assessment each week is generally based on your understanding of the weeks course
content, your written answers to each weeks tutorial questions, your group interaction in
discussing your
Database Management Systems
Tutorial Week 7
Weight 1%
The tutorial assessment each week is generally based on your understanding of the weeks
course content, your written answers to each weeks tutorial questions, your group interaction
in discussing your
Database Management Systems
Tutorial Week 3
Weight 1%
The tutorial assessment each week is generally based on your understanding of the weeks
course content, your written answers to each weeks tutorial questions, your group interaction
in discussing your