Round 0: Introduction and practical arrangements

Size: px

Start display at page:

Download "Round 0: Introduction and practical arrangements"

June Page
5 years ago
Views:

1 Round 0: Introduction and practical arrangements Tommi Junttila Aalto University School of Science Department of Computer Science CS-A1140 Data Structures and Algorithms Autumn 2017 Tommi Junttila (Aalto University) Round 0 CS-A1140 / Autumn / 11

2 Most important stuff Register to the course in Weboodi! Announcements etc made only in MyCourses To get them in , one has to register! Prerequisites: ICS-A1120 programming 2 Import recursion, linked lists, O-notation,... Ability to program in Scala The course CS-A1141 data structures and algorithms Y is in Python and with a bit less prerequisites (Programming Y1) Unsure which course version to take? Consult your study guide and/or study officers of CS/your study program! Start studying early, the course requires a substantial amount of work during the whole Autumn! Tommi Junttila (Aalto University) Round 0 CS-A1140 / Autumn / 11

3 Why study data structures and algorithms? Algorithms are everywhere nowadays! Recommending hotels Finding routes for us in navigation apps Searching for new medicines Analyzing our shopping data Driving our cars Beating humans in Jeopardy Playing against us in computer games Finding optimal delivery routes for trucks Compressing audio and video files... Tommi Junttila (Aalto University) Round 0 CS-A1140 / Autumn / 11

4 Not all algorithms are already implemented in standard libraries Need to know the basic terminology and concepts to understand algorithm descriptions found in the web and in research articles Even if an algorithm is already implemented in a library, understanding its workings and limits can help to use it properly and efficiently There are lots of incorrect/inefficient algorithms around in the web Designing a specialized variant of an algorithm requires knowledge of the (possibly not explicitly stated) underlying assumptions that the base algorithm makes Algorithms are (usually) fun! Tommi Junttila (Aalto University) Round 0 CS-A1140 / Autumn / 11

5 Organization of the course Lectures: On Thursdays at 10:15-12:00 in T2/CS-building By Univ. Lecturer, Doc., D.Sc. Tommi Junttila Schedule: see MyCourses Voluntary, no points awarded Exercises: Exam: Automatically graded online assignments, exercise sessions for getting help (more below) Obligatory to get a certain amount of points (see below) Obligatory, must pass an exam as well as the exercises At least one in December 2017 and one in February 2018 Details can be found in MyCourses at Tommi Junttila (Aalto University) Round 0 CS-A1140 / Autumn / 11

6 Exercises aka implementing algorithms This is not a programming course... but we will program quite a lot when implementing data structures and algorithms and using them to solve problems One does not really understand an algorithm unless one has implemented it Part of the grade from the exercises, the rest from the exam Exercises available in the A+ system: Ten main rounds of exercises, deadlines for each Full points: two weeks after the lectures Half points until final deadline: a bit later See the A+ system for the dates! Plus some voluntary extra assignments Exercise points are valid until August 2018 Exercise points from the previous years are not valid anymore Exercises are individual work Tommi Junttila (Aalto University) Round 0 CS-A1140 / Autumn / 11

7 Exercises sessions or laskutupa Need help? Visit these and ask the assistants! Time and place: Wednesdays from 10:15am to 6pm in Maari C Thursdays from 2:15pm to 6pm in T7/CS-building See the MyCourses pages for possible exceptions etc Assistants: Aleksi (även på svenska), Markus, Osama and Roosa Joint space and time with CS-A1141 DSA Y At least two assistants present, one or two mainly for this course and one mainly for CS-A1141 Tommi Junttila (Aalto University) Round 0 CS-A1140 / Autumn / 11

8 Grading Both the exercises and an exam must be passed Final grade from the following table: Exercise Exam grade points (Unlikely) changes: see MyCourses for the definite version Tommi Junttila (Aalto University) Round 0 CS-A1140 / Autumn / 11

9 Course material Lecture slides Selected parts of Introduction to Algorithms, 3rd ed. (online via Aalto lib) Exercises Exact chapters announced in the lecture slides Tommi Junttila (Aalto University) Round 0 CS-A1140 / Autumn / 11

10 Do you want to have even more fun and challenge? Consider the course CS-E4590 Competitive Programming Saturdays from 12:00 in Maari-C by Prof. Jukka Suomela Good place to train and form teams for the Nordic Collegiate Programming Contest Tommi Junttila (Aalto University) Round 0 CS-A1140 / Autumn / 11

11 Some algorithm courses after this CS-E4580 Programming parallel computers (Spring, period V) CS-E4110 Concurrent programming CS-E3190 Principles of algorithmic techniques CS-E4600 Algorithmic methods of data mining CS-E4500 Advanced Course in Algorithms CS-E3220 Declarative Programming And many others... Tommi Junttila (Aalto University) Round 0 CS-A1140 / Autumn / 11

INF 315E Introduction to Databases School of Information Fall 2015

INF 315E Introduction to Databases School of Information Fall 2015 Class Hours: Tuesday & Thursday10:30 am-12:00 pm Instructor: Eunyoung Moon Email: eymoon@utexas.edu Course Description Almost every website