SimoneRemoli

Simone Remoli's repositories

Electronic_Calculators

This repository contains the project tests of the electronic calculators course of the engineering faculty held by Prof. Eng. Alessandro Pellegrini at the University of Rome Tor Vergata.

Language:C2 10

Subnet, is a part of the subdivision of a single IP (Internet Protocol) network. This subdivision is really only visible from the logical part of the network, which means that the difference between a network and a subnet lies in the type of network configuration you give to your computer.

Language:CEPL-2.0200

Sync

**This repository contains the solution of all the exam tests of the degree course in computer engineering at the University of Rome Tor Vergata, of Operating Systems. Course held by Prof.F.Quaglia.**

Language:C1 10

ai

Build AI-powered applications with React, Svelte, Vue, and Solid

Language:TypeScriptNOASSERTION000

Assembler

This repository contains Z64 processor assembly codes. The Z64 processor is an educational processor developed by Prof.Ing. A.Pellegrini, who is the owner of the electronic calculators course at Computer Engineering at the Tor Vergata University of Rome.

Language:Assembly010

bibliography

Bibliography of Scheme research (readscheme.org and beyond)

Language:Scheme000

Binary-Search-Tree

010

CircularList

Implementation of a recursive circular list that allows node changes with a maximum of five elements.

Language:CEPL-2.0010

Congettura-di-Collatz

«la matematica non è ancora matura per problemi di questo tipo»

Language:C000

Congettura-di-Goldbach

Every even number greater than 2 can be written as the sum of two prime numbers

Language:C010

Dijkstra-s-algorithm

The algorithm we are going to use to determine the shortest path is called “Dijkstra’s algorithm.” Dijkstra’s algorithm is an iterative algorithm that provides us with the shortest path from one particular starting node to all other nodes in the graph.

Language:C010

Dijkstra-s-algorithm_New

Dijkstra’s algorithm is an iterative algorithm that provides us with the shortest path from one particular starting node to all other nodes in the graph.

Language:CGPL-3.0000

Environment

Print all var environment UNIX-Linux

Language:C000

Fermat-s_Last_Theorem

Fermat's last theorem, or more correctly Fermat's last conjecture, since it was not proven at the time, states that there are no positive integer solutions of the equation: A^n + B^n = C^n | n>2

Language:CGPL-3.0000

Kadane-s-Algorithm

Kadane's algorithm is a dynamic programming approach used to solve the maximum subarray problem, which involves finding the contiguous subarray with the maximum sum in an array of numbers. The algorithm was proposed by Jay Kadane in 1984 and has a time complexity of O(n).

Language:CGPL-3.0010

Convertitor_IEE754_32bit

The code shows the translation of a decimal point number into the correct 32-bit single-precision floating point representation. After that, the translation into decimal is performed.

Language:CMPL-2.0000