Nicola Pedretti's repositories
jwplayer-node
Node module to easily make calls to the jwplayer api.
Reliable-Data-Transfer-Protocol-Implementation
Implementation of a reliable data transfer protocol using Java
gain-calculator
calculating information gain
UDP-client-server-implementation
A simple UDP server and client implementation. The client has a list of commands:
binary-heap
min and max heap plus unit tests
Clinica-San-Martino
Nuovo Sito Clinica San Martino
data-structures
Basic data structure implementations for nodejs
dining-philosophers
Solutions to the dining philosophers using semaphores
ioffer
Web application to allow businesses to create and share offers independently
library-streaming-service
Application to automatize streaming process. Allows communication between wowza and jwplayer
rustlings
:crab: Small exercises to get you used to reading and writing Rust code!
set-of-stacks
php implementation of a set of stacks -- multiple stacks with a limit in size. Every stack can contain X elements, when max size is reached a new stack is created. Pushing and pulling from the stack behaves as if the stack was only one. Relative phpunit test
sets
Creating a class to handle sets using Scala
simple-binary-tree
Creating a binary tree in php and using phpunit to test it
TCP-client-server-implementation
The client program should take 1-2 arguments. The first argument is the name or IP address of the host that the server is running on and the second (if present) is the port number on which it’s listening. The second argument defaults to 31357.
uninformed-equation-searcher
subset of the given set of N numbers and the 4 basic arithmetic operation ( +, -, x, / ) to reach the target. E.g: Given the set of numbers 1,2,3,4,6 and target 53, one way to reach the target is: (2 + 3 + 4) ∗ 6 1 (a) Define a suitable search space representation for the problem, and briefly outline a strategy to solve the problem. (b) (programming portion) Write a program to solve the problem, according to the program specification given below. You should implement different search strategies (BFS, DFS, IDS, UCS) for finding the best node. For UCS, use the following costs for the different operators, which roughly relates to the number of CPU cycles for a typical modern processor: Addition: 4 units, Subtraction: 4 units, Multiplication: 6 units, Division: 32 units. The program should output one way of reaching the target in the usual arithmetic notation, using parentheses whenever necessary. Program Specification : Assume that all input numbers and the target are positive integers. Each number may be used at most once in the expression. However, the set of input numbers may themselves have repeated numbers. Your program should not do division that will not result in integers. The java program should run on any of the lab machines . It will be invoked as follows: java HW1 < debug > < Search Strategy > < target > < set of numbers > Where < debug > could be either 0 or 1. A value of 1 would mean that the program should output all states and the paths taken that it searches in the same order. (Whenever the program expands a node during search, it outputs the contents of the node and the label of the path it took to reach that node.) < Search Strategy > could be either BFS, DFS, IDS, UCS < target > is the goal number that we want to reach < set of numbers > is just the input set of N numbers separated by spaces . Example invocation: java HW1 1 BFS 6 1 2 3