http://ocw.cs.pub.ro/courses/ 2026-05-19T15:12:24+03:00 http://ocw.cs.pub.ro/courses/ http://ocw.cs.pub.ro/courses/lib/tpl/arctic/images/favicon.ico text/html 2020-05-03T22:20:33+03:00 http://ocw.cs.pub.ro/courses/dss/2019?rev=1588533633&do=diff * BECERESCU Cristian * BALABAN Neculai * PLESU Gabriel * PUIU Anton * STANILA Andrei * SERBAN Mihnea * TOMULESCU Iulia * VASILACHE Andra * SERBAN Cosmin * MIHALACHE Ionut * VISAN Cosmin text/html 2020-05-03T22:42:50+03:00 http://ocw.cs.pub.ro/courses/dss/assignment?rev=1588534970&do=diff You are required to implement a hashtable between words and number of occurrences, using the D programming language. Your hashtable must provide the following interface: Method Description this(size_t initialLength); a constructor that takes the initial size of the hashtable size_t length(); returns the size of the hashtable void add(string word); add a new word to the hashtable, or increase the number of occurrences void remov… text/html 2019-06-20T19:06:30+03:00 http://ocw.cs.pub.ro/courses/dss/project?rev=1561046790&do=diff In order to keep your momentum going, we're proposing you the following project. For your project, you have to implement a simple Peer-To-Peer File Sharing service that provides a REST API. Your service will keep a list of the files that he shares and their corresponding MD5 hash. A peer can ask the service to provide a chunk from a given file, the rationale being that it can ask different chunks of the same file from different peers in order to rebuild the original, thus maximizing the through… text/html 2021-07-05T16:28:00+03:00 http://ocw.cs.pub.ro/courses/dss/res?rev=1625491680&do=diff Resurse * Le Project * Dlang wiki * Starting as a Contributor * Building under Posix * D's Bugzilla text/html 2019-08-14T11:11:37+03:00 http://ocw.cs.pub.ro/courses/dss/sidebar?rev=1565770297&do=diff cursuri index laboratoare index * Le Project * Dlang wiki * Starting as a Contributor * Building under Posix * D's Bugzilla * Introduction to D text/html 2021-03-10T23:46:42+03:00 http://ocw.cs.pub.ro/courses/dss/workshop-01?rev=1615412802&do=diff Slides [Slides] Exercises For these exercises you can use the D Online Editor. If you wish to install the D compiler and Standard Library, go to the download page. 1. Array Median Element Compute the median element of an unsorted integer array. For this, you will have to: text/html 2019-08-14T11:12:44+03:00 http://ocw.cs.pub.ro/courses/dss/workshop?rev=1565770364&do=diff Highschool workshop * Introduction to D