Chamikacp/Star-Wars-API-Planet-App

Stars
1
Language
Kotlin
Created over 2 years ago
Updated over 2 years ago

Chamikacp/Star-Wars-API-Planet-App

Chamikacp

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

Simple kotlin Android application to view all the planets in Star Wars API.

Basic-Vehicle-Rental-System

A console sytem for the vehicle manager using Java and a GUI for the customer using Angular for the front end and Spring Boot for the back end

Magic-Squares

For any number of columns and rows you want.

Gallery-and-Sitemap-for-a-Website

Sitemap to navigate to the appropriate part of the group website and Gallery to view the images and descriptions.

DOG_FINDER

A simple Android quiz app based on dog breeds.

CcNotes

A Simple Note Taking Android Application.

Time-Series-Prediction-with-LSTM

A LSTM network to predict the mobile phone next month price prediction using previous month price.

PHP-GUI-for-a-firm-that-has-a-large-retail-chain-that-offers-optical-and-audiology-services

Php code for a GUI based on a MySQL database.

Dragoman

A simple Language Translator Android app with SQLite Database CRUD oprations.

A-Histrogram-for-Exam-Marks-and-Encoding-Decoding-a-message

My first Repository

Computer-Consultancy-Firm

Simple java application, using JavaFX for the front-end and MySQL for the database to keep track of a small computer consultancy firm

Weather-App

A simple SwiftUI weather application using API provided by openweather.org

Snakes-Ladders

B specification of a Snakes & Ladders board game, using the B tools Atelier B & ProB.

Spaceship-Asteroids

B specification of a very simple version of the old Spaceship & Asteroids arcade game, using the B tools Atelier B & ProB.

Pizza-App

A simple SwiftUI appllication that can add, delete, view and make favourite items.

Abacus

A financial calculator app for the iPhone

Max-Flow-Problem

Maximum flow problems find a feasible flow through a single-source (S), single-sink (T) flow network that is maximum. This problem is useful for solving complex network flow problems such as the circulation problem.