REST API server for Postfix

Data Structures and Algorithms using Java

Array-based implementation of Calculator of very large integers with the length of the numbers as large as 2,147,483,647 (2^31 - 1), with Postfix and Infix evaluation of Arithmetic Expressions.

Android Plugin Fast Code Completion

Postfix to Infix converter built on binary Expression Tree. To convert the tree to Infix expression the inorder tree traversal is applied. Implemented in Java with GUI

📟 PostFix PreFix Calculator for Android - This application made for educational purposes under MIT license to calculate post-fix and pre-fix expressions with same user interface as the default calculator on android.

Write a program that, given an arithmetic expression, first transforms it to a postfix form, and then computes its value (by using the stack-based algorithms that we recalled in class).

This is one of the of programming assignment in the data structure course SLOVE Postfix and infix

This package hosts an array of frequently used regex validations and regex expression evaluation functionalities. In general, String check encompasses last word check, middle word check, first word check, sentence validation, phone number validation, name validation with or without honorific, password with both default parameter settings and cus…

Java Simple Projects

Data Structures And Algorithms (JAVA Language) Algorithms, Complexity Analysis, Data Structures, Linked List, Stack, Postfix, Infix, Iterator, Array List, Priority Queue, Threads, Synchronized, Hash Map, Tree, Heap, Graph,

The ++ operator increments its single operand by one. When used in prefix mode, it increments the operand and evaluates to the incremented value of that operand. When used in postfix mode, it increments its operand, but evaluates to the value of that operand before it was incremented.

Implementation of shunting yard algorithm using stack and queue with a Crude GUI.

Калькулятор на java

Algorithms code in java.

Spring Boot REST API that parses algebraic equations into a postfix (expression) tree, stores them in memory, and evaluates them by substituting variable values.

This is made for practice to learn the design patterns like Interpreter and Strategy using which conditional statements like switch and if-else can be removed. This project gives more insight into OO world.

A smart calculator that uses regex, infix, postfix and prefix algorithms to perform big integer calculations.

Some Java programs I made for my Data Structures class at Asia Pacific College.