Data Structures and Algorithms (lab): Diferență între versiuni
De la WikiLabs
Jump to navigationJump to search
| Linia 7: | Linia 7: | ||
* Lab 2: [[Fișier:DsaLab-2_412G.pdf]] | * Lab 2: [[Fișier:DsaLab-2_412G.pdf]] | ||
* Lab 3: 411G -> Coming soon(Quicksort, Stack, Que) | * Lab 3: 411G -> Coming soon(Quicksort, Stack, Que) | ||
* Lab 3: 412G -> Coming soon(Mergesort, Single Linked List, | * Lab 3: 412G -> Coming soon(Mergesort, Single Linked List, Doubly Linked List) | ||
== 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 16 martie 2014 22:01
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, Que)
- Lab 3: 412G -> Coming soon(Mergesort, Single Linked List, Doubly Linked List)
ETTI Related Resources
- Circuits & Electronics: here
