Sina Soltani's repositories
32-bit-pipelined-MIPS-processor-implemented-using-Verilog-with-booth-multiplication-algorithm
32-bit pipelined MIPS CPU using Verilog with booth multiplication algorithm (faster multiplication in hardware). Xilinx Sesign Suite
AI-project--logistic-regression-from-scratch
I implemented logistic regression model from scratch with python and numpy. I used it to train a model for predicting diabetes. The dataset of diabetes is a csv file. I created a GUI as well(with tkinter) as well.
Disk-Scheduling-algorithms-using-CSV-files
Look, C-Scan, Scan , C-Look disk scheduling algorithms for OS implemented using python
DNN-from-scratch-coursera-and-image-classification
deep neural networks implementation from scratch in coursera.com
graph-theory-project-optimization-find-a-short-walk-that-traverses-all-nodes-in-a-graph-
find a short walk that traverses all nodes in a graph
image-classification-with-Tensorflow-and-CNN
Tensorflow and convolutional neural networks
Master-Slave-Atmega32-microcontrollers-using-SPI-protocol-and-fast-PWA-tempreture-controlling-system
I used two Atmega32 AVR microcontrollers with SPI protocol and Master/Slave connection. Other elements: LM35 temperature sensor and a LCD and cooler Motors and heater and blinking warning LED. Using analog to digital converter and analog comparator. Using C programming to program the microcontrollers and Proteus. Compares the temperatures and shows it on a 16*2 alphanumeric LCD and depending on the temperatures either the cooler or the heater or the Red warning light.
Refined-D-ary-minheap-for-Dijkstra-s-algorithm-in-a-weighted-directed-graph
Refined D-ary minheap in which the children of each node are stored in a built in binary heap so that finding the minimum a node's children is faster. The binary min heap uses the array of D-ary minheap and its within it and does not use separate array. .Implemented for Dijkstra's algorithm for shortest paths in a weighted directed graph.
sinasoltani123
Config files for my GitHub profile.