Diferență între revizuiri ale paginii „Data Structures and Algorithms (lab)”
De la WikiLabs
Jump to navigationJump to search| Linia 3: | Linia 3: | ||
== Lab activity(assignment) == | == Lab activity(assignment) == | ||
| − | * | + | * Assignment 1: [[Fișier:DsaLab-1_411G_412G.pdf]] |
| − | * | + | * Assignment 2: [[Fișier:DsaLab-2_411G.pdf]] |
| − | * | + | * Assignment 2: [[Fișier:DsaLab-2_412G.pdf]] |
| − | * | + | * Assignment 3: [[Fișier:DsaLab-3_411G.pdf]] |
| − | * | + | * Assignment 3: [[Fișier:DsaLab-3_412G.pdf]] |
| − | * | + | * Assignment 4: [[Fișier:DsaLab-4_411G_412G.pdf]] |
| − | * | + | * Assignment 5: [[Fișier:DsaLab-5_411G_412G.pdf]] |
== Progress tracking == | == Progress tracking == | ||
Versiunea de la data 8 mai 2014 09:11
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)
- Assignment 1: Fișier:DsaLab-1 411G 412G.pdf
- Assignment 2: Fișier:DsaLab-2 411G.pdf
- Assignment 2: Fișier:DsaLab-2 412G.pdf
- Assignment 3: Fișier:DsaLab-3 411G.pdf
- Assignment 3: Fișier:DsaLab-3 412G.pdf
- Assignment 4: Fișier:DsaLab-4 411G 412G.pdf
- Assignment 5: Fișier:DsaLab-5 411G 412G.pdf
Progress tracking
- Will be available by EOD(23.04.2014).
Examples
- Quicksort: Quicksort.zip
- Mergesort: Mergesort.zip
- Singly Linked List: SinglyLinkedList.zip
- Doubly Linked List: DoublyLinkedList.zip
- Queue Using Singly Linked List: QueueUsingSinglyLinkedList.zip
- Stack Using Doubly Linked List: StackUsingDoublyLinkedList.zip
- Stack Using Dynamic Array: StackUsingDynamicArray.zip
ETTI Related Resources
- Circuits & Electronics: here
