Diferență între revizuiri ale paginii „Data Structures and Algorithms (lab)”
De la WikiLabs
Jump to navigationJump to search| Linia 11: | Linia 11: | ||
== Examples == | == Examples == | ||
* Quicksort: [https://drive.google.com/#folders/0B5SXG8Q_2rEbS0FxUUVWZ0tWaU0 Quicksort.zip] | * Quicksort: [https://drive.google.com/#folders/0B5SXG8Q_2rEbS0FxUUVWZ0tWaU0 Quicksort.zip] | ||
| + | * SinglyLinkedList: [https://drive.google.com/#folders/0B5SXG8Q_2rEbS0FxUUVWZ0tWaU0 SinglyLinkedList.zip] | ||
== ETTI Related Resources == | == ETTI Related Resources == | ||
* Circuits & Electronics: [https://6002x.mitx.mit.edu/ here] | * Circuits & Electronics: [https://6002x.mitx.mit.edu/ here] | ||
Versiunea de la data 6 aprilie 2014 11:17
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.
Lab activity(assignment)
- Lab 1: Fișier:DsaLab-1 411G 412G.pdf
- Lab 2: Fișier:DsaLab-2 411G.pdf
- Lab 2: Fișier:DsaLab-2 412G.pdf
- Lab 3: 411G -> Coming soon(Quicksort, Stack, Queue)
- Lab 3: 412G -> Coming soon(Mergesort, Singly Linked List, Doubly Linked List)
Examples
- Quicksort: Quicksort.zip
- SinglyLinkedList: SinglyLinkedList.zip
ETTI Related Resources
- Circuits & Electronics: here
