Data Structures and Algorithms (lab): Diferență între versiuni
De la WikiLabs
Jump to navigationJump to search
| Linia 11: | Linia 11: | ||
== Examples == | == Examples == | ||
* Quicksort: [https://drive.google.com/file/d/0B5SXG8Q_2rEbRERrN3RKcmM5a3c/edit?usp=sharing Quicksort.zip] | * Quicksort: [https://drive.google.com/file/d/0B5SXG8Q_2rEbRERrN3RKcmM5a3c/edit?usp=sharing Quicksort.zip] | ||
* Mergesort: [https://drive.google.com/file/d/0B5SXG8Q_2rEbZ3I3TmxaVXFSSXc/edit?usp=sharing Mergesort.zip] | |||
* Singly Linked List: [https://drive.google.com/file/d/0B5SXG8Q_2rEbRWhTNDZmaFJST1k/edit?usp=sharing SinglyLinkedList.zip] | * Singly Linked List: [https://drive.google.com/file/d/0B5SXG8Q_2rEbRWhTNDZmaFJST1k/edit?usp=sharing SinglyLinkedList.zip] | ||
* Doubly Linked List: [https://drive.google.com/file/d/0B5SXG8Q_2rEbWmM5MU9iZDhvRHc/edit?usp=sharing DoublyLinkedList.zip] | * Doubly Linked List: [https://drive.google.com/file/d/0B5SXG8Q_2rEbWmM5MU9iZDhvRHc/edit?usp=sharing DoublyLinkedList.zip] | ||
Versiunea de la data 6 aprilie 2014 17:48
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
- 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
