WikiLabs - Contribuții utilizator [ro]

Fișier:DsaLab-6 411G 412G.pdf

2014-05-24T09:06:45Z

Gneagoe:

Data Structures and Algorithms (lab)

2014-05-24T09:06:26Z

Gneagoe: /* Lab activity(assignment) */

Data Structures and Algorithms (lab)

2014-05-24T08:31:58Z

Gneagoe: /* Progress tracking */

Data Structures and Algorithms (lab)

2014-05-24T08:31:22Z

Gneagoe: /* Progress tracking */

Data Structures and Algorithms (lab)

2014-05-08T09:11:48Z

Gneagoe: /* Lab activity(assignment) */

Fișier:DsaLab-5 411G 412G.pdf

2014-05-08T09:10:25Z

Gneagoe:

Data Structures and Algorithms (lab)

2014-05-08T09:09:45Z

Gneagoe: /* Lab activity(assignment) */

Fișier:DsaLab-4 411G 412G.pdf

2014-05-08T08:55:50Z

Gneagoe:

Data Structures and Algorithms (lab)

2014-05-08T08:55:05Z

Gneagoe: /* Lab activity(assignment) */

Fișier:DsaLab-3 412G.pdf

2014-05-08T08:54:08Z

Gneagoe: încărcat o versiune nouă a fișierului "Fișier:DsaLab-3 412G.pdf"

Fișier:DsaLab-3 411G.pdf

2014-05-08T08:48:41Z

Gneagoe: încărcat o versiune nouă a fișierului "Fișier:DsaLab-3 411G.pdf"

Fișier:DsaLab-3 412G.pdf

2014-05-08T08:05:40Z

Gneagoe:

Data Structures and Algorithms (lab)

2014-05-08T08:05:26Z

Gneagoe: /* Lab activity(assignment) */

Fișier:DsaLab-3 411G.pdf

2014-05-08T07:49:47Z

Gneagoe:

Data Structures and Algorithms (lab)

2014-05-08T07:49:17Z

Gneagoe: /* Lab activity(assignment) */

Data Structures and Algorithms

2014-04-18T07:50:22Z

Gneagoe: /* DSA Lab Web Page */

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: Examples: [[list.h]] [[list.c]] [[test_list.c]]
* 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 - [https://docs.google.com/spreadsheets/d/17_iF5S8TjUS96Y_3fnfiJgX71Ly0joPqRG3pGKdAFKo/edit?usp=sharing Results]
# [[DSA Homework 2]] - soft deadline: 27.03.2014, 23:59, hard deadline: 10.04.2014, 23:59 - [https://docs.google.com/spreadsheets/d/17_iF5S8TjUS96Y_3fnfiJgX71Ly0joPqRG3pGKdAFKo/edit#gid=1273316209 Results]
# [[DSA Homework 3]] - soft deadline: 10.04.2014, 23:59, hard deadline: 24.04.2014, 23:59
# [[DSA Homework 4]] - soft deadline: 24.04.2014, 23:59, hard deadline: 08.05.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 [mailto:homework@dcae.pub.ro 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 at least two files: one or more C source files, 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.

== Code Examples ==

* Read & Write strings from/ to a file: [[file_test.c]]
* Stack: [[stack.h]] [[stack.c]]

== DSA Lab Web Page ==

On this web page you will find lab assignments, code examples, related resources and, as a bonus, you can evaluate your progress (how many points you have obtained so far).

* Where: http://dcae.pub.ro/wikilabs/index.php/Data_Structures_and_Algorithms_(lab)

== Useful Links ==

* Coding conventions: [[C Coding Conventions]]
* Virtual machine: [ftp://zeus.arh.pub.ro/pub/VirtualMachines/ LinuxDev]
* 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]

== Recommended readings ==

* The Algorithm Design Manual: [http://www.amazon.com/Algorithm-Design-Manual-Steve-Skiena/dp/0387948600 Skiena]
* Algorithms (4th Edition): [http://www.amazon.com/Algorithms-4th-Robert-Sedgewick/dp/032157351X/ref=sr_1_2?s=books&ie=UTF8&qid=1395000955&sr=1-2&keywords=algorithms+and+data+structures Sedgewick & Wayne]
* An Introduction to the Analysis of Algorithms: [http://www.amazon.com/Introduction-Analysis-Algorithms-2nd/dp/032190575X/ref=sr_1_1?s=books&ie=UTF8&qid=1395001114&sr=1-1&keywords=analysis+of+algorithms Sedgewick]
* The Art of Computer Programming: [http://www.amazon.com/Computer-Programming-Volumes-1-4A-Boxed/dp/0321751043/ref=sr_1_1?s=books&ie=UTF8&qid=1395001210&sr=1-1&keywords=knuth Knuth]
* Concrete Mathematics: A Foundation for Computer Science: [http://www.amazon.com/Concrete-Mathematics-Foundation-Computer-Science/dp/0201558025/ref=sr_1_1?s=books&ie=UTF8&qid=1395001255&sr=1-1&keywords=concrete+mathematics Knuth]

== Other 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]
* Stack Overflow: [http://stackoverflow.com/questions/tagged/c here]

Data Structures and Algorithms (lab)

2014-04-18T07:49:28Z

Gneagoe: /* Progress tracking */

Data Structures and Algorithms (lab)

2014-04-12T09:11:37Z

Gneagoe: /* Progress check */

Data Structures and Algorithms (lab)

2014-04-12T07:33:11Z

Gneagoe:

Data Structures and Algorithms

2014-04-12T07:30:23Z

Gneagoe:

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: Examples: [[list.h]] [[list.c]] [[test_list.c]]
* 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 - [https://docs.google.com/spreadsheets/d/17_iF5S8TjUS96Y_3fnfiJgX71Ly0joPqRG3pGKdAFKo/edit?usp=sharing Results]
# [[DSA Homework 2]] - soft deadline: 27.03.2014, 23:59, hard deadline: 10.04.2014, 23:59 - [https://docs.google.com/spreadsheets/d/17_iF5S8TjUS96Y_3fnfiJgX71Ly0joPqRG3pGKdAFKo/edit#gid=1273316209 Results]
# [[DSA Homework 3]] - soft deadline: 10.04.2014, 23:59, hard deadline: 24.04.2014, 23:59
# [[DSA Homework 4]] - soft deadline: 24.04.2014, 23:59, hard deadline: 08.05.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 [mailto:homework@dcae.pub.ro 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 at least two files: one or more C source files, 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.

== Code Examples ==

* Read & Write strings from/ to a file: [[file_test.c]]
* Stack: [[stack.h]] [[stack.c]]

== DSA Lab Web Page ==

On this web page you will find lab assignments, code examples, related resources and as a bonus, you can evaluate your progress (how many points you have obtained so far).

* Where: http://dcae.pub.ro/wikilabs/index.php/Data_Structures_and_Algorithms_(lab)

== Useful Links ==

* Coding conventions: [[C Coding Conventions]]
* Virtual machine: [ftp://zeus.arh.pub.ro/pub/VirtualMachines/ LinuxDev]
* 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]

== Recommended readings ==

* The Algorithm Design Manual: [http://www.amazon.com/Algorithm-Design-Manual-Steve-Skiena/dp/0387948600 Skiena]
* Algorithms (4th Edition): [http://www.amazon.com/Algorithms-4th-Robert-Sedgewick/dp/032157351X/ref=sr_1_2?s=books&ie=UTF8&qid=1395000955&sr=1-2&keywords=algorithms+and+data+structures Sedgewick & Wayne]
* An Introduction to the Analysis of Algorithms: [http://www.amazon.com/Introduction-Analysis-Algorithms-2nd/dp/032190575X/ref=sr_1_1?s=books&ie=UTF8&qid=1395001114&sr=1-1&keywords=analysis+of+algorithms Sedgewick]
* The Art of Computer Programming: [http://www.amazon.com/Computer-Programming-Volumes-1-4A-Boxed/dp/0321751043/ref=sr_1_1?s=books&ie=UTF8&qid=1395001210&sr=1-1&keywords=knuth Knuth]
* Concrete Mathematics: A Foundation for Computer Science: [http://www.amazon.com/Concrete-Mathematics-Foundation-Computer-Science/dp/0201558025/ref=sr_1_1?s=books&ie=UTF8&qid=1395001255&sr=1-1&keywords=concrete+mathematics Knuth]

== Other 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]
* Stack Overflow: [http://stackoverflow.com/questions/tagged/c here]

Data Structures and Algorithms

2014-04-12T07:12:56Z

Gneagoe:

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: Examples: [[list.h]] [[list.c]] [[test_list.c]]
* 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 - [https://docs.google.com/spreadsheets/d/17_iF5S8TjUS96Y_3fnfiJgX71Ly0joPqRG3pGKdAFKo/edit?usp=sharing Results]
# [[DSA Homework 2]] - soft deadline: 27.03.2014, 23:59, hard deadline: 10.04.2014, 23:59 - [https://docs.google.com/spreadsheets/d/17_iF5S8TjUS96Y_3fnfiJgX71Ly0joPqRG3pGKdAFKo/edit#gid=1273316209 Results]
# [[DSA Homework 3]] - soft deadline: 10.04.2014, 23:59, hard deadline: 24.04.2014, 23:59
# [[DSA Homework 4]] - soft deadline: 24.04.2014, 23:59, hard deadline: 08.05.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 [mailto:homework@dcae.pub.ro 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 at least two files: one or more C source files, 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.

== Code Examples ==

* Read & Write strings from/ to a file: [[file_test.c]]
* Stack: [[stack.h]] [[stack.c]]

== DSA Lab Web Page ==

* http://dcae.pub.ro/wikilabs/index.php/Data_Structures_and_Algorithms_(lab)

== Useful Links ==

* Coding conventions: [[C Coding Conventions]]
* Virtual machine: [ftp://zeus.arh.pub.ro/pub/VirtualMachines/ LinuxDev]
* 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]

== Recommended readings ==

* The Algorithm Design Manual: [http://www.amazon.com/Algorithm-Design-Manual-Steve-Skiena/dp/0387948600 Skiena]
* Algorithms (4th Edition): [http://www.amazon.com/Algorithms-4th-Robert-Sedgewick/dp/032157351X/ref=sr_1_2?s=books&ie=UTF8&qid=1395000955&sr=1-2&keywords=algorithms+and+data+structures Sedgewick & Wayne]
* An Introduction to the Analysis of Algorithms: [http://www.amazon.com/Introduction-Analysis-Algorithms-2nd/dp/032190575X/ref=sr_1_1?s=books&ie=UTF8&qid=1395001114&sr=1-1&keywords=analysis+of+algorithms Sedgewick]
* The Art of Computer Programming: [http://www.amazon.com/Computer-Programming-Volumes-1-4A-Boxed/dp/0321751043/ref=sr_1_1?s=books&ie=UTF8&qid=1395001210&sr=1-1&keywords=knuth Knuth]
* Concrete Mathematics: A Foundation for Computer Science: [http://www.amazon.com/Concrete-Mathematics-Foundation-Computer-Science/dp/0201558025/ref=sr_1_1?s=books&ie=UTF8&qid=1395001255&sr=1-1&keywords=concrete+mathematics Knuth]

== Other 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]
* Stack Overflow: [http://stackoverflow.com/questions/tagged/c here]

Data Structures and Algorithms (lab)

2014-04-06T17:48:29Z

Gneagoe: /* Examples */

Data Structures and Algorithms (lab)

2014-04-06T15:24:02Z

Gneagoe: /* Examples */

Data Structures and Algorithms (lab)

2014-04-06T14:53:12Z

Gneagoe: /* Examples */

Data Structures and Algorithms (lab)

2014-04-06T14:17:43Z

Gneagoe: /* Examples */

Data Structures and Algorithms (lab)

2014-04-06T13:36:17Z

Gneagoe: /* Examples */

Data Structures and Algorithms (lab)

2014-04-06T13:27:52Z

Gneagoe: /* Examples */

Data Structures and Algorithms (lab)

2014-04-06T12:56:29Z

Gneagoe: /* Examples */

Data Structures and Algorithms (lab)

2014-04-06T12:56:02Z

Gneagoe: /* Examples */

Data Structures and Algorithms (lab)

2014-04-06T12:55:28Z

Gneagoe: /* Examples */

Data Structures and Algorithms (lab)

2014-04-06T12:53:10Z

Gneagoe: /* Examples */

Data Structures and Algorithms (lab)

2014-04-06T12:40:44Z

Gneagoe: /* Examples */

Data Structures and Algorithms (lab)

2014-04-06T12:39:59Z

Gneagoe: /* Examples */

Data Structures and Algorithms (lab)

2014-04-06T11:17:38Z

Gneagoe: /* Examples */

Data Structures and Algorithms (lab)

2014-03-30T15:19:06Z

Gneagoe: /* Lab activity(assignment) */

Data Structures and Algorithms (lab)

2014-03-30T15:18:03Z

Gneagoe: /* Examples */

Data Structures and Algorithms (lab)

2014-03-30T10:18:38Z

Gneagoe: /* Examples */

Data Structures and Algorithms (lab)

2014-03-30T10:18:30Z

Gneagoe: /* Examples */

Data Structures and Algorithms (lab)

2014-03-30T10:15:22Z

Gneagoe:

Data Structures and Algorithms (lab)

2014-03-30T10:13:22Z

Gneagoe:

Data Structures and Algorithms (lab)

2014-03-30T10:13:02Z

Gneagoe:

Data Structures and Algorithms (lab)

2014-03-16T22:09:06Z

Gneagoe: /* Lab activity(assignment) */

Data Structures and Algorithms (lab)

2014-03-16T22:01:28Z

Gneagoe: /* Lab activity(assignment) */

Data Structures and Algorithms (lab)

2014-03-16T22:00:19Z

Gneagoe: /* Lab activity(assignment) */

Data Structures and Algorithms (lab)

2014-03-16T21:58:26Z

Gneagoe: /* Lab activity(assignment) */

Data Structures and Algorithms (lab)

2014-03-16T21:57:38Z

Gneagoe:

Data Structures and Algorithms

2014-03-16T21:55:12Z

Gneagoe: /* Other resources */

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 [mailto:homework@dcae.pub.ro 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: [ftp://zeus.arh.pub.ro/pub/VirtualMachines/ LinuxDev]
* 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]

== Recommended readings ==

* The Algorithm Design Manual: [http://www.amazon.com/Algorithm-Design-Manual-Steve-Skiena/dp/0387948600 Skiena]
* Algorithms (4th Edition): [http://www.amazon.com/Algorithms-4th-Robert-Sedgewick/dp/032157351X/ref=sr_1_2?s=books&ie=UTF8&qid=1395000955&sr=1-2&keywords=algorithms+and+data+structures Sedgewick & Wayne]
* An Introduction to the Analysis of Algorithms: [http://www.amazon.com/Introduction-Analysis-Algorithms-2nd/dp/032190575X/ref=sr_1_1?s=books&ie=UTF8&qid=1395001114&sr=1-1&keywords=analysis+of+algorithms Sedgewick]
* The Art of Computer Programming: [http://www.amazon.com/Computer-Programming-Volumes-1-4A-Boxed/dp/0321751043/ref=sr_1_1?s=books&ie=UTF8&qid=1395001210&sr=1-1&keywords=knuth Knuth]
* Concrete Mathematics: A Foundation for Computer Science: [http://www.amazon.com/Concrete-Mathematics-Foundation-Computer-Science/dp/0201558025/ref=sr_1_1?s=books&ie=UTF8&qid=1395001255&sr=1-1&keywords=concrete+mathematics Knuth]

== Other 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]
* Stack Overflow: [http://stackoverflow.com/questions/tagged/c here]

Data Structures and Algorithms

2014-03-16T21:54:28Z

Gneagoe: /* Other resources */

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 [mailto:homework@dcae.pub.ro 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: [ftp://zeus.arh.pub.ro/pub/VirtualMachines/ LinuxDev]
* 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]

== Recommended readings ==

* The Algorithm Design Manual: [http://www.amazon.com/Algorithm-Design-Manual-Steve-Skiena/dp/0387948600 Skiena]
* Algorithms (4th Edition): [http://www.amazon.com/Algorithms-4th-Robert-Sedgewick/dp/032157351X/ref=sr_1_2?s=books&ie=UTF8&qid=1395000955&sr=1-2&keywords=algorithms+and+data+structures Sedgewick & Wayne]
* An Introduction to the Analysis of Algorithms: [http://www.amazon.com/Introduction-Analysis-Algorithms-2nd/dp/032190575X/ref=sr_1_1?s=books&ie=UTF8&qid=1395001114&sr=1-1&keywords=analysis+of+algorithms Sedgewick]
* The Art of Computer Programming: [http://www.amazon.com/Computer-Programming-Volumes-1-4A-Boxed/dp/0321751043/ref=sr_1_1?s=books&ie=UTF8&qid=1395001210&sr=1-1&keywords=knuth Knuth]
* Concrete Mathematics: A Foundation for Computer Science: [http://www.amazon.com/Concrete-Mathematics-Foundation-Computer-Science/dp/0201558025/ref=sr_1_1?s=books&ie=UTF8&qid=1395001255&sr=1-1&keywords=concrete+mathematics Knuth]

== Other 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]
* Stack overflow: [http://stackoverflow.com/questions/tagged/c here]

Data Structures and Algorithms

2014-03-16T21:52:13Z

Gneagoe:

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 [mailto:homework@dcae.pub.ro 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: [ftp://zeus.arh.pub.ro/pub/VirtualMachines/ LinuxDev]
* 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]

== Recommended readings ==

* The Algorithm Design Manual: [http://www.amazon.com/Algorithm-Design-Manual-Steve-Skiena/dp/0387948600 Skiena]
* Algorithms (4th Edition): [http://www.amazon.com/Algorithms-4th-Robert-Sedgewick/dp/032157351X/ref=sr_1_2?s=books&ie=UTF8&qid=1395000955&sr=1-2&keywords=algorithms+and+data+structures Sedgewick & Wayne]
* An Introduction to the Analysis of Algorithms: [http://www.amazon.com/Introduction-Analysis-Algorithms-2nd/dp/032190575X/ref=sr_1_1?s=books&ie=UTF8&qid=1395001114&sr=1-1&keywords=analysis+of+algorithms Sedgewick]
* The Art of Computer Programming: [http://www.amazon.com/Computer-Programming-Volumes-1-4A-Boxed/dp/0321751043/ref=sr_1_1?s=books&ie=UTF8&qid=1395001210&sr=1-1&keywords=knuth Knuth]
* Concrete Mathematics: A Foundation for Computer Science: [http://www.amazon.com/Concrete-Mathematics-Foundation-Computer-Science/dp/0201558025/ref=sr_1_1?s=books&ie=UTF8&qid=1395001255&sr=1-1&keywords=concrete+mathematics Knuth]

== Other 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]

Data Structures and Algorithms

2014-03-16T21:51:41Z

Gneagoe: /* Online free resources */

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 [mailto:homework@dcae.pub.ro 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: [ftp://zeus.arh.pub.ro/pub/VirtualMachines/ LinuxDev]
* 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]

== Free online classes ==

* 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 ==

* The Algorithm Design Manual: [http://www.amazon.com/Algorithm-Design-Manual-Steve-Skiena/dp/0387948600 Skiena]
* Algorithms (4th Edition): [http://www.amazon.com/Algorithms-4th-Robert-Sedgewick/dp/032157351X/ref=sr_1_2?s=books&ie=UTF8&qid=1395000955&sr=1-2&keywords=algorithms+and+data+structures Sedgewick & Wayne]
* An Introduction to the Analysis of Algorithms: [http://www.amazon.com/Introduction-Analysis-Algorithms-2nd/dp/032190575X/ref=sr_1_1?s=books&ie=UTF8&qid=1395001114&sr=1-1&keywords=analysis+of+algorithms Sedgewick]
* The Art of Computer Programming: [http://www.amazon.com/Computer-Programming-Volumes-1-4A-Boxed/dp/0321751043/ref=sr_1_1?s=books&ie=UTF8&qid=1395001210&sr=1-1&keywords=knuth Knuth]
* Concrete Mathematics: A Foundation for Computer Science: [http://www.amazon.com/Concrete-Mathematics-Foundation-Computer-Science/dp/0201558025/ref=sr_1_1?s=books&ie=UTF8&qid=1395001255&sr=1-1&keywords=concrete+mathematics Knuth]