Skip to content

😇 Touched for the very first time. Like a virgin. When your heart beats. Next to mine.

License

Notifications You must be signed in to change notification settings

has256/algorithms-data-structures-notes

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Algorithms and Data Structures Notes

XKCD Cartoon about Travelling Salesman Problem


Resources


Schedule/Notes

Be careful: this schedule is oriented to my professors (Prof. Dr. Fabrício Olivetti and Prof. Dr. Paulo H. Pisani).

Week 01
12/02 | (Practice): Introduction + Programming Environment
14/02 | (Theory): Introduction

Week 02
19/02 | (Practice): C Language revision, pointers, memory allocatione
21/02 | (Theory): Costs of Algorithms

Week 03
24/02 | (Practice): Array, struct, union
28/02 | (Theory): Linear Structures - sequential allocation - Stack, Queue, Deque

Week 04
05/03 | Holiday 🎉
07/03 | (Theory): Linear Structures - Allocation linked (Stack, Queue, Deque)

Week 05
12/03 | (Practice): Linear Structures:Stack, Queue, Deque
14/03 | (Theory): Binary Search Trees

Week 06
19/03 | (Practice): Binary Search Trees
21/03 | (Theory): Partial Exam

Week 07
26/03 | (Practice): ?-?
28/03 | (Theory): Balanced Tree - AVL

Week 08
02/04 | (Practice): Balanced Tree - AVL
04/04 | (Theory): Sorting: Bubble, Insert, Select

Week 09
09/04 | (Practice): Simple Sorting
11/04 | (Theory): Sorting: Quick, Merge

Week 10
16/04 | (Practice): Efficient Sorting
18/04 | (Theory): Ordering: Heapsort, Bucket

Week 11
23/04 | (Practice): Efficient Sorting II
25/04 | (Theory): Final Exam

Week 12
30/04 | (Practice): SUB
02/05 | (Theory): REC


Grading

grade :: Double -> Char
grade rating
  | rating >= 9 = 'A'
  | rating >= 8 = 'B'
  | rating >= 6 = 'C'
  | rating >= 5 = 'D'
  | otherwise = 'F'

Scheduled Lectures + Office Hours (2018.3)

Scheduled Lectures

Course Number Meeting Time Classroom Location
A1D Tue (08:00 - 10:00)
Thu (10:00 - 12:00)
S-301-1
L407-2
A2D Tue (08:00 - 10:00)
Thu (10:00 - 12:00)
S-301-1
L409-2
A3D Tue (08:00 - 10:00)
Thu (10:00 - 12:00)
S-311-2
L402-2
A4D Tue (08:00 - 10:00)
Thu (10:00 - 12:00)
S-311-2
L403-2
B1D Tue (16:00 - 18:00)
Thu (16:00 - 18:00)
S-311-2
L407-2
B2D Tue (16:00 - 18:00)
Thu (16:00 - 18:00)
S-311-2
L402-2
A1N Tue (19:00 - 21:00)
Thu (21:00 - 23:00)
S-301-1
L402-2
A2N Tue (19:00 - 21:00)
Thu (21:00 - 23:00)
S-301-1
L404-2
A3N Tue (21:00 - 23:00)
Thu (19:00 - 21:00)
S-311-2
L407-2
A4N Tue (21:00 - 23:00)
Thu (19:00 - 21:00)
S-311-2
L408-2

Office Hours

Who? Meeting Time Classroom Location
Prof. Dr. Fabrício Olivetti de França Tue (07:30 - 10:00; 12:00 - 12:30)
Thu (07:30 - 08:00)
S-522-2/L110
Prof. Paulo H. Pisani Wed (16:00 - 18:00) S-507-2
Prof. Dra. Mirtha Lina Fernandez Venero Thu (13:00 - 15:00) S-529-2

...and by Piazza!


Contributing

For bug fixes, documentation improvements, typos, translations (new/updates) and simple changes, just make a PR! 🎉
For more complex changes, pls, make an issue first so we can discuss the design.

Roadmap for contributing:

  1. Fork it.
  2. Create your feature branch (git checkout -b my-new-feature).
  3. Commit your changes (git commit -am 'Add some feature').
  4. Push to the branch (git push origin my-new-feature).
  5. Create new Pull Request.

License and Distribuition

This project is licensed under the Affero GNU General Public License v3.0 - see the LICENSE.md for details. Have fun!

I follow most of the guidelines of UFABC Honor's Code. So, if you use any exercise solutions of this repository - total or partial -, in any evaluation process of UFABC, you have to cite this on the terms of Honor's Code.

About

😇 Touched for the very first time. Like a virgin. When your heart beats. Next to mine.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published