Diferență între revizuiri ale paginii „Data Structures and Algorithms”
| Linia 47: | Linia 47: | ||
* Linux Command Line tutorial for beginners: http://linuxcommand.org/learning_the_shell.php | * Linux Command Line tutorial for beginners: http://linuxcommand.org/learning_the_shell.php | ||
* PDF algorithm reference book: [https://drive.google.com/file/d/0B0KC3c5boTpYLXY4UE9qUWJaTHM/edit?usp=sharing Cormen] | * PDF algorithm reference book: [https://drive.google.com/file/d/0B0KC3c5boTpYLXY4UE9qUWJaTHM/edit?usp=sharing Cormen] | ||
| + | |||
| + | == Online free resources == | ||
| + | |||
| + | * Algorithms: Design and Analysis, Part 1: [https://www.coursera.org/course/algo here] | ||
| + | * Algorithms: Design and Analysis, Part 2: [https://www.coursera.org/course/algo2 here] | ||
| + | * Analysis of Algorithms: [https://www.coursera.org/course/aofa here] | ||
| + | * Algorithms, Part I: [https://www.coursera.org/course/algs4partI here] | ||
| + | * Algorithms, Part II: [https://www.coursera.org/course/algs4partII here] | ||
== Recommended readings == | == Recommended readings == | ||
Versiunea de la data 16 martie 2014 21:50
The Data Structures and Algorithms course is based on knowledge gained from the Computer Programming course in the first semester, and its role is to provide the base for algorithmic thinking, problem solving and advanced computer programming skills.
Lecture Slides
- Lecture 1: Fișier:Lecture1.pdf
- Lecture 2: Fișier:Lecture2.pdf
- Lecture 3: Fișier:Lecture3.pdf
- Lecture 4: Fișier:Lecture4.pdf
- Lecture 5: Fișier:Lecture5.pdf
- Lecture 6: Fișier:Lecture6.pdf
- Lecture 7: Fișier:Lecture7.pdf
- Lecture 8: Fișier:Lecture8.pdf
- Lecture 9: Fișier:Lecture9.pdf
- Lecture 10: Fișier:Lecture10.pdf
- Lecture 11: Fișier:Lecture11.pdf
- Lecture 12: Fișier:Lecture12.pdf
- Lecture 13: Fișier:Lecture13.pdf
- Lecture 14: Fișier:Lecture14.pdf
Homework - 2014
- DSA Homework 1 - soft deadline: 13.03.2014, 23:59, hard deadline: 27.03.2014, 23:59
- DSA Homework 2 - soft deadline: 27.03.2014, 23:59, hard deadline: 10.04.2014, 23:59
Homework submitted after the soft deadline will only receive half the credit. Homework submitted after the hard deadline will receive no credit.
Deliverables
Submissions must include one or more C source files, compilable with GCC version 4.8.0 or greater, and a .txt document (NOT a doc/ docx or pdf file) including the algorithm description and a short analysis of the complexity.
Submission
Homework will be submitted via e-mail at address homework@dcae.pub.ro.
The e-mail subject MUST follow the following template: [DSA]<your_name> - <your_group> - <homework #>. E.g.: [DSA]Radu Hobincu - 421G - 1
The e-mail body should contain any comments you wish to make on the homework.
The e-mail attachments should consist of two files: the C source file, having a .c extension, and a text file, having a .txt extension, containing the algorithm description and analysis.
NOTE: The arrival time of the e-mail is considered as the submission time, so make sure you submit some time before the deadline.
Useful Links
- Coding conventions: C Coding Conventions
- Virtual machine: LinuxDev
- Linux Command Line tutorial for beginners: http://linuxcommand.org/learning_the_shell.php
- PDF algorithm reference book: Cormen
Online free resources
- Algorithms: Design and Analysis, Part 1: here
- Algorithms: Design and Analysis, Part 2: here
- Analysis of Algorithms: here
- Algorithms, Part I: here
- Algorithms, Part II: here
Recommended readings
- The Algorithm Design Manual: Skiena
- Algorithms (4th Edition): Sedgewick & Wayne
- An Introduction to the Analysis of Algorithms: Sedgewick
- The Art of Computer Programming: Knuth
- Concrete Mathematics: A Foundation for Computer Science: Knuth
