nandercarmo/search-machine nandercarmo/search-machine

  • Stars
    star
    0
  • Language
Twitter logo Share LinkedIn logo Share Facebook logo Share
nandercarmo/search-machine
github

nandercarmo

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

More Repositories

1

My-STM32-IR-API

This project aims to consolidate the lessons of the UFMG "Embedded Systems Programming" course about the development of microcontrollers APIs, in this case for STM32 microcontrollers.
C++
3
star
2

My-TechFlix

My-TechFlix is a project developed during Alura's "React Immersion", with the objective of consolidating and improving knowledge about Javascript, React, HTML and CSS.
JavaScript
2
star
3

My-CardDeck

Card deck program developed during the Linkedin "C++ Essential Training" course.
C++
2
star
4

CSR

Teste do CSR.
C++
1
star
5

My-NLW5

Project using NodeJS developed along the Next Level Week 05 from Rocketseat. This project implements a live chat using websockets and NodeJS to build the backend of this service.
TypeScript
1
star
6

My-SearchMachine

This library was developed during the discipline of "Algorithms and Data Structures" at UFMG. It aims to implement some of the main concepts of search and hashing algorithms and to simulate a search engine that, given a database or articles is able to tell if a list of terms received are present in those articles and in what quantity .
C
1
star
7

engsoft2

Trabalho Prático da disciplina de de Engenharia de Software 2 da UFMG
HTML
1
star
8

My-STM32-ADC-AN

This project is a simple example demonstrating the behavior of the ADC peripheral of the STM32 NUCLEO-G474RE kit, as described in the Application Note available in the 'doc' directory of this repository. All the behavior of the project is described (in Portuguese) in the document AN_G474RE_ADC_Application_Note.pdf. However, in a simplified way, the ADC was configured to collect voltage values ​​from a potentiometer in continuous conversion operation mode, for a single channel and using DMA, and transmit these values ​​through the serial to a PC in order to visualize the values collected.
C++
1
star
9

My-Compiler

A simple compiler implemented in Shell Script in order to test the knowledge about this language and, mainly, to simplify the process of compiling and linking .c and .cpp files using the GCC and G++ compilers.
Shell
1
star
10

nandercarmo

Hi there! My name is Nander Carmo and I am a young Brazilian with a passion for programming and engineering! I am graduated as a Mechatronics technician from CEFET-MG and currently I am studying Electrical Engineering at UFMG, where I am part of two teams of science communication and innovation: EITA! and SDF. In my free time I like to play and watch football, I am also in love with Ultimate Frisbee and I am proudly part of an amateur team Óvnis de Prata, reading books and of course, all these things are better when done with music!
1
star
11

My-IlluminanceMeter

This project implemented an illuminance measurement system, based on the BPW34 photodiode and was developed as practical work in the discipline "Measurement Systems" in the Electrical Engineering course at UFMG. In addition to the data acquisition and processing system based on Arduino UNO, the project has a graphical data visualization interface developed in QT C ++.
Makefile
1
star
12

My-GoogleGlass

This repository contains my first project developed using web development technologies such as HTML, CSS and Javascript. Initially, this project was done following the youtube programming course of "Curso em Vídeo", however, eventually I took the opportunity to test my first project with Electron and transformed the site into a desktop application.
HTML
1
star
13

My-MinimumSpanningTree

This project developed along the discipline of "Algorithms and Data Structures" at UFMG uses an implementation of the Krushkal algorithm to calculate the Minimum Spanning Tree of a graph. The file "entrada.txt" must contain the nodes and edges of the graph as follows: - The first line must contain the number of nodes and the number of edges of the graph - Subsequent lines must contain the two nodes followed by the weight of the edge between them The "saida.txt" file receives the optimized graph in the same format.
C
1
star