The following projects are a part of my coursework towards B.Sc. in Computer Science at University of Illinois Springfield.
-
Updated
Dec 4, 2021 - Java
The following projects are a part of my coursework towards B.Sc. in Computer Science at University of Illinois Springfield.
FSC-CSC-251: Discrete Structures Project Euler #8
I have no idea what I did but it works! ヾ(⌐■_■)ノ♪
Lab 4 implementation of Tree Traversal (iteratively and recursively), Dijkstra algorithm and Graph Coloring algorithm.
Add logic + set theory symbols to your keyboard
This Java program allows you to manipulate different types of trees and perform various operations on them. You can use this project to learn how to implement binary trees, binary insertion trees and B-Trees manually. Topics
Dynamic programming solution to the number of m-letter combinations where each letter is in alphabetical order.
The repository contains all the assignments completed as a course-work of the 3rd semester.
Things I'm learning about algorithms.
1st Discrete Structures lab as an application on Sets Theory and Bits Manipulation using Java programming language.
2nd Discrete Structures lab as an application on Sets and Rules of Inference using Java programming Lnaguage
Web app to create, visualize, and manipulate relations | JavaScript
3rd Discrete Structures lab as an application on prime numbers using Java programming language.
Classwork related to CSCI2511 Discrete Structures at University of Colorado Denver
Laboratory assignment for Discrete Structures
Discrete Mathematics Final Project
The network of highway of CPEC is to be discussed in it.
Tree Structure in Node.js. Every future pull request is already welcomed!
Add a description, image, and links to the discrete-structures topic page so that developers can more easily learn about it.
To associate your repository with the discrete-structures topic, visit your repo's landing page and select "manage topics."