Datalogi för matematiker - VT18

Weekly outline

• General
  

  General

  Teachers

  • Lars Arvestad <arve@math.su.se>, course responsible
  • Magnus Brogie <magnus.brogie@math.su.se>, teaching assistant
  • Albin Printz <albin.printz@math.su.se>, teaching assistant

  Course litterature

  The main course book is Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein. You will however need to read online about, for example, Python, git, and GitHub.

  Examination

  You will have to pass three hurdles to finish this course:

  LABO

  There are eight practicals in the course.

  PROJ

  The course project is worth 3 credits. It involves applying what you have learned in the course on a real dataset. Thre project will be described separately. The project is graded A-F. Deadline: TBA

  THEO

  The theoretical material will be assessed in an exam. Scheduled exam dates for 2018 are June 8 and August 16. The exam is graded A-F. See exams. 

  The final grade is a rounded weighted average of the PROJ and THEO grades. 

  
  

  
  
  

  • Nyhetsforum
  • Schema URL
  • Projekt 1: an assembly graph Page
  • Extentor Folder
• 19 March - 25 March
  

  19 March - 25 March

  F1

  • Introduction to the course.
  • Unix and shell scripting

  F2

  • More on Unix

  Homework

  • Unix and shells
  • Study and try the shell commands we discuss. 
  • Make sure you can run shell commands on your computer. 
  • Work on Lab 1.

  • Lab 1: UNIX commands, pipes, processes, and redirection Page
  • pairs1 File
  • pairs2 File
  • f1 — Notes for lecture 1 and 2. File
• 26 March - 1 April
  

  26 March - 1 April

  F3

  • Git and GitHub

  
  

  Homework

  • Git and GitHub
  • Get an academic GitHub account.
  • Do the GitHub training: GitHub 101, GitHub 102, GitHub 103.
  • Create a private GitHub project for the labs in this course and call it 'dama18'. 
  • Invite GitHub user 'arvestad' as a collaborator to dama18.

  
  

  • Lab 2: Git and GitHub Page
  • f2 File
• 2 April - 8 April
  

  2 April - 8 April

  "Easter holiday", or something.

  
  
• 9 April - 15 April
  

  9 April - 15 April

  F4

  • Fundamental datastructures and abstract data types (Chapters 1 and 10)

  F5

  • Trees

  
  

  • f3 File
  • Lab 3: Abstraction: implement two stack classes Page
  • usingstack File
  • The principle of AVL-trees, according to IDEA URL
• 16 April - 22 April
  

  16 April - 22 April

  F6

  • Complexity analysis (chapter 3)
    

  F7

  • Queues, heaps, and more (chapter 6)
    

  • Lab 4: Binary search trees Page
• 23 April - 29 April
  

  23 April - 29 April

  F8

  • Graphs and graph algorithms (ch 22, 23)
    

  F9

  • More graph algorithms
    

  • Lab 5: Graphs Page
  • line.dot File
  • circular.dot File
  • Presentation: Graph terminology File
• 30 April - 6 May
  

  30 April - 6 May

  F10

  • Sorting (chapters 6 to 8)
• 7 May - 13 May
  

  7 May - 13 May

  F11 

  • Hashing (ch 11)
    
  • Project presentations

  • Lab 6: Unit testing Page
• 14 May - 20 May
  

  14 May - 20 May

  F12

  • Syntax analysis: formal grammars and recursive descent
    

  F13

  • Hashing (ch 11)

  • Lab 7: recursive descent Page
  • f12 File
  • f13 File
• 21 May - 27 May
  

  21 May - 27 May

  F14

  • Parallel programming: threads and processes (ch 27

  F15

  • Text searching (ch 32)
    

  • 
  • Lab 8: parallell beräkning av primtal Page
  • f14 File
• 28 May - 3 June
  

  28 May - 3 June
• 4 June - 10 June
  

  4 June - 10 June

  Exam  

  Friday June 8, 9:00—14:00
• 11 June - 17 June
  

  11 June - 17 June

  Project deadline: 2018-06-13 at 23.59.