Content of this page

• Important notices
• Class hours, attendance, SuSy page
• Course program
• Review
• exercise lists
• Courseware
• Important dates
• References

Important notices

Notes for assignments, tests and exams are in this spreadsheet .

The dates of tests and exams are in the evaluation criteria file.

• 20/6: Test 2 scores available. The review of Test 2 will take place on Tuesday, 28/6 at 18:43 in room 01 of IC18. If no one appears by 15:XNUMX, the review is cancelled. If anyone wants to review the test but can't come on this day/time, send me an email so we can arrange a date. There will be no remote reviews.
• 8/6: Test 2 will focus on lessons 16 to 21, but it may take topics from other lessons.
• 25/5: P1 grades are available. Exam P1 will be reviewed on Tuesday, May 31 at 18:43 pm in room 01 of IC18. If no one appears by 15:XNUMX, the review is cancelled. If anyone wants to review the test but can't come on this day/time, send me an email so we can arrange a date. There will be no remote reviews.
• 17/5: P1 test subject goes to binary search trees (class 16).
• 17/5: I put a list of exercises (see the section on this page).

  Do you need to do them all for the test? Not.

  Will any of them fail the test? Perhaps.

• 2/5: Test 1 scores are available. Test 1 review will be Tuesday, May 10 at 18:43 in room 01 of IC18. If no one appears by 15:XNUMX, the review is cancelled. If anyone wants to review the test but can't come on this day/time, send me an email so we can arrange a date. There will be no remote reviews.
• 6 / 8: ATTENTION! see this page for notices regarding classes A, B and C.

Class hours, attendance, SuSy page

• Theoretical classes
• Tuesday, 10-11:40 am, room PB16.
• Friday, 10-11:40 am, room PB13.

• Laboratory classes
• Friday, 14pm-16pm, rooms SI03, SI05 and SI08.

• Project Manager
• Teacher: immediately after classes or at an agreed time.
• Monitor: during laboratory hours. Discord page for discussion and clarification of doubts.

• Monitors:
• Arthur Bridi Guazzelli (PED)
• Guilherme Vieira Leite (PED)
• Sandro Henrique Uliana Catabriga (PED)
• Andreas Cisi Ramos (PAD)

• MC202 page on SuSy. (to be announced)

Course program

See the file with the evaluation criteria.

Review

Evaluation criteria: pdf .

Exercise Lists

• List 1: pdf
• List 2: pdf

Courseware

I will use Prof's slides. Rafael Schouery (with the exception of a few). Throughout the course, I will place the slides (pdf) I used in this section. In one of the links below you can find all of Prof. Rafael.

• Class 1 (15/03): C language part 1 pdf
• Class 2 (18/03): continuation, C language part 2 pdf
• Class 3 (22/03): continuation, C language part 3 pdf
• Class 4 (25/03): continuation, C language part 4 pdf
• Class 5 (29/03): continuation, C language part 5 pdf
• Class 6 (1/04): continuation, C language part 6 pdf
• Class 7 (5/04): continuation
• Class 8 (8/4): recursion pdf
• Class 9 (12/4): complexity analysis pdf
• Lesson 10 (19/4): simple linked lists pdf , class-LL.c

  I wrote a slimmer version (than the one seen in class) of destroi_lista_iter in the file class-LL.c

• Class 11 (25/4): linked lists (variations) pdf
• Class 12: Test 1.
• Lesson 13 (2/5): continuation, stacks and queues pdf
• Lesson 14 (6/5): continuation, battery applications pdf
• Lecture 15 (10/5): continuation, binary trees pdf
• Lecture 16 (13/5): continuation, binary search trees pdf
• Lecture 17 (17/5): Balanced binary search trees pdf
• Class 18 (27/5): priority queues pdf
• Lecture 19 (31/5): Sort and heapsort algorithms pdf
• Lecture 20 (3/6): Sorting algorithms: mergesort and quicksort pdf
• Lesson 21 (7/6): Hash tables pdf
• Class 22 (10/6): B trees pdf (my slides). See too pdf (slides by Prof. Rafael)
• Class 23 (21/6): continuation of B trees pdf
• Class 24 (24/6): graphs, representation pdf
• Class 25 (28/6): course in graphs pdf
• Class 26 (1/7): algorithms in graphs pdf
• Class 27 (5/7): class to clarify doubts.

• Prof. MC202 Course Page Rafael Schoeury (2018): link . slides and videos .
• Updated slides (no videos) by Prof. Rafael Schoeury: link .
• Prof. MC202 Course Page Lehilton Pedrosa (2021): link . The slides are practically the same used in Prof. Rafael Schouery mentioned above.
• Going from Python to C made by Prof. Lehilton Pedrosa.
• Valgrind Tutorial made by Prof. Rafael Schouery.
• GDB Tutorial made by Prof. Rafael Schouery.
• visualgo - viewing algorithms.

Important dates

• The dates of tests and exams are on file with the evaluation criteria.

References

No textbook will be used. Some of the lessons were based on chapters from:

• R. Sedgewick, Algorithms in C, 3rd edition, Princeton University, 1998.
• T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms, 4th edition, McGraw-Hill. Observation: You can consult previous editions. Note that the Portuguese version has several translation issues.

Other references are indicated in the file with the evaluation criteria.