Solve the blackout math puzzle using two stacks.
-
Updated
May 21, 2024 - Java
Solve the blackout math puzzle using two stacks.
Some Java programs I made for my Data Structures class at Asia Pacific College.
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…
Calculator in Java with convertion infix -> postfix
A smart calculator that uses regex, infix, postfix and prefix algorithms to perform big integer calculations.
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.
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,
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
This is one of the of programming assignment in the data structure course SLOVE Postfix and infix
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.
Data Structures and Algorithms using Java
A scientific calculator program that gets infix expressions from input, converts them to postfix and prefix notation, and shows the result by evaluating the postfix expression.
Add a description, image, and links to the infix topic page so that developers can more easily learn about it.
To associate your repository with the infix topic, visit your repo's landing page and select "manage topics."