Daniel Gunna (@DanielGunna)
  • Stars
    star
    106
  • Global Rank 194,852 (Top 7 %)
  • Followers 28
  • Following 53
  • Registered almost 9 years ago
  • Most used languages
    Java
    69.0 %
    Python
    13.8 %
    TeX
    3.4 %
    Assembly
    3.4 %
    VHDL
    3.4 %
    Cuda
    3.4 %
    Kotlin
    3.4 %
  • Location 🇧🇷 Brazil
  • Country Total Rank 3,289
  • Country Ranking
    Cuda
    45
    VHDL
    59
    Assembly
    170
    Java
    280
    TeX
    771
    Kotlin
    1,618
    Python
    1,846

Top repositories

1

PagarMe-Android

Uma biblioteca simples para Android usada para gerar card hash de cartões de crédito para uso no gateway de pagamento Pagar.me
Java
14
star
2

Titanic-Machine-Learning

Applying Machine Learning Algorithms to the Kaggle "Titanic Survival Prediction Problem".
Python
10
star
3

Chat-Service-JavaRMI

Chat Application developed as coursework for Distributed Computing course @ PUC Minas.
Java
7
star
4

RxViaCep

A simple reactive android implementation to fetch information provided by ViaCep Api about brazilian postal code addresses.
Java
6
star
5

SimplePyCrawler

A simple web crawler developed as coursework for Algorithms on Graph Theory - PUC Minas
Python
4
star
6

CYK-Binary-Normal-Form

The Cocke-Younger-Kasami algorithm implementation proposed by Lange-Leiss that handles grammars on 2NF(Binary Normal Form) instead of CNF(Chomsky Normal Form).
Java
4
star
7

Huffman-Tree

A java implementation of Huffman's Tree used on Huffman lossless compression algorithm.
Java
3
star
8

UVA-Online-Judge-Problems

UVA problems solved.
Java
3
star
9

GunMar

Search-Engine developed as coursework for Information Retrieval course @ PUC Minas
Java
3
star
10

Odd-or-Even-Online

A simple game used to learn how to handle socket connections with java, developed as coursework for Networks and Operating Systems Laboratory - PUC Minas.
Java
3
star
11

Roucariol-Distributed-Mutual-Exclusion

Implementation of Roucariol and Carvalho Distributed Mutual Exclusion Algorithm
Java
3
star
12

VeitchKarnaugh-Verilog-Examples

Some examples of Veitch-Karnaugh maps solved using verilog language developed as coursework of Architecture and Computer Organization I- @Puc Minas
VHDL
3
star
13

Mips-Assembly-Examples

Some examples that solve basic problems using assembly for Mips developed as coursework for Architecture and Computer Organization II - @Puc Minas
Assembly
3
star
14

Perceptron

Perceptron Algorithm implementation in Java. Implementation of Perceptron Algorithm to solve a simple classification problem and show the algorithm limitations, using the logical operations AND, OR and XOR.
Java
2
star
15

Optimus-App

Simple App to consume a Simplex-based service.
Java
2
star
16

MocapGAN

Python
2
star
17

BaseMVVMRxProject

A base project with core and the basics of a reactive implementation of MVVM pattern for android platform and some extra utilities.
Java
2
star
18

PokeApp

A project for study purposes that uses some infos provided by PokéApi about Pokémon franchise.
Java
2
star
19

BigBurger

Java
1
star
20

RxPagarMe

1
star
21

Software-Enginering

Diverse assignments developed for coursework of Software Enginering I and Software Enginering II disciplines.
1
star
22

Hanoi-Tower-Java

An algorithm implemented in Java to solve Hanoi Tower problem.
Java
1
star
23

Parallel-Computing

A set of snippets, codes and exercises developed and solved for Parallel Computing (@PUC-Minas) discipline.
Cuda
1
star
24

Kotlin-Sample

Kotlin
1
star
25

AndroidSwipeGroupie

It's a simple library to make the libraries Groupie and AndroidSwipeLayout work together.
Java
1
star
26

JFLAP-NDFA-Converter

A simple tool to convert NDFA(Non-deterministic Finite Automaton)(without Lambda(or Epilson) Transitions) into DFA(Deterministic Finite Automaton), both using JFLAP's simulator file format.
Java
1
star
27

RxRetrofitBaseService

Java
1
star
28

bug-free-succotash

1
star
29

Calculus-II

Some integration exercises solved as coursework for Calculus II - @PUC-Minas
1
star
30

Bellman-Ford

A simple report created to perform a comparison between Bellman-Ford and Dijkstra graph algorithms. The objective is analise the approach that each algorithm use to handle graphs with edges with negative weights.
TeX
1
star
31

Computer-Architecture-Organization

Some assignments and exercises developed as coursework for Computer Architecture and Organization disciplines - @PUC-Minas
Java
1
star