Algorithms and Data Structures - ecs.wgtn.ac.nz€¦ · Course Materials •No compulsory “text...

Algorithms and Data Structures

COMP261Course Overview

Yi Mei

yi.mei@ecs.vuw.ac.nz1

A few words before we start…• Health and Wellbeing

– Take note of the posters, social media, digital screens– Hygiene precautions, sanitisers– Student Health: 04-463 5308– Ministry of Health helpline: 0800 611 116– Register Student Healthcare– Flu vaccinations soon

• An inclusive community– Be respectful and caring of others – Any concern, contact University’s Student Interest and Conflict

Resolution team or VUWSA’s Advocacy Service.

2

The Team• Coordinator:

– Yi Mei: yi.mei@ecs.vuw.ac.nz• Lecturers:

– Yi Mei (First half): yi.mei@ecs.vuw.ac.nz, (Office hours: 3-4pm, Thurs)– Marcus Frean (Second half): Marcus.Frean@ecs.vuw.ac.nz

• Senior Tutor– Morgan Atkins: morgan.atkins@ecs.vuw.ac.nz

• Tutors:– Ahad Rahman– Calvin Lee– Ethan Munn– Willaim Fowler– Hugh Lockwood– Kian Foulkes– Nader Riad– Nicole Stallinger– Bri Carmine

3

Lectures, Tutorials, Helpdesks• Lectures: Tuesday 12:00-12:50, MCLT103• Lectures: Thursday 12:00-12:50, SUMT228• Lectures/Tutorials/No lecture: Friday 12:00-12:50, SUMT228

• Tutorials– Start from week 2– 10 slots, see timetable in the course homepage– Signup through MyAllocator

https://www.victoria.ac.nz/students/study/timetables/tutorial-sign-up– Small groups (30~40), go through (tough parts of) the lecture content– Lectures cannot cover every single detail– Tutorials can be very helpful

4

Lectures, Tutorials, Helpdesks• Helpdesks:

– From Week 2– CO 242b– 13:00-14:00 Monday to Friday– 13:00-15:00 (2 hours) for the weeks when the assignments are

due.• Helpdesks tutors are on the course homepage.• First week: no helpdesks, but will be a tutorial in lecture slot• No scheduled labs

5

Course Objectives• Select, adapt, and implement a wide range of standard

algorithms and data structures to construct software solutions to complex problems

• Understand algorithms described in pseudocode and to use analysis of an algorithm's time and space requirements to determine applicability to a problem

• Recognise the distinction between "easy" problems, 'hard' (NP) problems, and uncomputable problems and the consequences for constructing algorithms and programs for such problems

• Know and be able to implement important algorithms related to graphs, searching, parsing, basic graphics rendering, and B-Trees

6

Course Materials• No compulsory “text book”, but below will be useful

– Book: “Algorithms and Data Structures” – a selection of chapters from various textbooks compiled by Alex Potanin, Pearson(some copies may be around, especially second hand, borrow from library)

– Wikipedia pages: extremely good resource on algorithms.– Lecture notes on the course website:

https://ecs.victoria.ac.nz/Courses/COMP261_2020T1/

• Tutorials and helpdesks will be very helpful

7

Assessments• Tests (20%) and Final exam (50%)

– Mid-term test: 6-7pm (45 mins), 30 Apr (Thur)– Exam: exam period

• Assignments (30%)– 5 assignments, roughly every 2-3 weeks– 6% each– Deadlines:

• Due at 23:59 Sundays• 20 marks off for first 24 hours late, 40 marks off for next 24 hours,

0 marks more than 2 days late. • 3 "late days" for the whole course, so use wisely• Further extensions is only allowed under special circumstances (having

other assignments due at the same time is not special)• IN PERSON MARKING!!! 10%-100% PENTALTY IF YOU MISS IT!

8

Assignments• Assig 1: Graph basics• Assig 2: Pathfinding and articulation points• Assig 3: Fast Fourier Transform• Assig 4: Parsing • Assig 5: Indexing, B+ trees, low-level file structures

• Submissions– Code + report (Submit through the system)– Signup a 15-minute session for marking, demonstrate program and

explain key details to the marker (tutor)– Marked in the two weeks after the due date (e.g. week 5-6 for A1)

9

Workload• 10 hours per week

– Lectures and tutorials: 3 hours– Review and reading: 2 hour– Assignment: 5 hours

• Assumptions:– COMP103: collections, complexity (Big-O), searching and sorting– Math161/ENGR123– Ability to find things out by yourself (COMP261 is not spoon-feed)

• Start the assignment as early as possible!!!

10

Rules and Policies• Plagiarism is NOT tolerated

– Submit someone else’s work as your own, including• material from a published source such as a library book, a journal article,

etc.• material from an on-line software library, web pages, etc.• the work of another student, friend, relative, etc.

• Penalties: – zero marks for the work to which it relates– greater penalties in accordance with the University's Statute on

Student Conduct

• If you discussed with other students, state it clearly in the report to avoid plagiarism issue

• https://ecs.victoria.ac.nz/Main/ComputerSciencePlagiarism

11

APPOINT A CLASS REPBecome a Class Representative at Victoria University of Wellington!

Class Reps are the bridge between the course coordinator, lecturer, and the class

to support and improve students’ learning experiences in your course and at

Victoria.

REGISTER online: http://www.vuwsa.org.nz/class-representatives/

Representing your class has many benefits; VicPlus points, Class Rep certificates,

professional and personal growth, and links to other representation

opportunities.

13

D I G I T A L A G I L I T Y W I T H D A T A C O M

1414

Datacom Systems Scholarship in Computer Science M A R C H 2 0 2 0

M A R C H 2 0 2 0

Agenda

• A little bit about us• Scholarship Details • A word from our recent Vic grad, now

Datacom Software Developer – Leyton • Q&A

M A R C H 2 0 2 0

NEW YORK

UK

KUALA LUMPUR

SINGAPORE

MANILA

PERTH

ADELAIDE

MELBOURNE

SYDNEY

BRISBANE

CANBERRA

CHRISTCHURCH

WELLIN

GTON

AUCKLAND

$1.27BILLIONGroup revenue in 2018

$35MILLIONNet profit before tax in 2018

> 6,500EMPLOYEESOperating across Australia and New Zealand, Asia, Europe and the Americas

50+YEARSOf continuous growth

9.8%REVENUE GROWTHUp from $1.054 Billion the year before

Government

IT Outsourcing

Cloud Digital Transformatio

n

Software Customer Experience

Data Centres

Security Services

Services and Offerings

Our Brands

Datacom Systems

DatacomSolutions

Datacom Connect

With 54 years of experience and over 6,500 people globally, Datacom has been providing world class technology solutions spread across New Zealand, Australia, UK and USA

17

“While it might sound more like a generic evil corporation from The Terminator than a prized national asset, Datacom has rapidly grown to become one of our most important companies. It employs more than 3000 people in New Zealand alone.”

Stuff – Dec 2019

M A R C H 2 0 2 0

18

A little bit about us…

https://www.youtube.com/watch?v=N03cBnAAffI

M A R C H 2 0 2 0

Datacom Systems Scholarship DetailsM A R C H 2 0 2 0

Application Process

Key Dates Eligibility

• Full-time returning second year student majoring in Computer Science, CyberSecurity, or Software Engineering.

• Applications Open – 2nd March

• Applications Close – 31st

March 4.30pm.

• Recipient Announced – Early –mid April

$5,000 towards your final year of study + a Summer internship

• Apply via the Vic Uni website by 4.30pm 31st March.

• Shortlisted applicants may be requested to attend an interview.

• Selection panel will comprise of representatives from the School of Engineering and Computer Science where final candidates are shared and discussed with Datacom.

20

A word from recent Vic Uni grad, now Software Developer-Leyton…

21

Thank you for your time!

Graph• Many real-world applications

– places with connectionsairports & flights,intersections & roads,network switches and cables ….

– entities with relationshipssocial networks,biological modelsweb pages ….

– states and actionsgames, plans, …..

22

Graph• A collection of nodes• A collection of edges (directed and undirected)

– We only consider directed edges– Undirected edge can be seen as a pair of directed edges– (A, B) can be seen as (A -> B) and (B -> A)

• Relationship between nodes and edges– Nodes form edges– Edges connect nodes

• Other properties in graph– Multi-graph: multiple edges between the same pair of nodes– Loops

• Other complex properties– No turn right/left

23