- Application 1: General Base Counting: Queue Implementation
- Application 2: Postfix Calculator: Stack Implementation
This is a project that I completed. It was recently assigned in September. The project includes counting any number in any base from 2 to 8, and printing each number in that base in Application 1. Application 1 required creating and uding a Queue class. Application 2 was about calculating a mathmetical expression by not utilizing the PEMDAS notation but getting the same result if it was used. Application 2 required using and creating a Stack class. For both applications test files were given to test out the different applications.
My project is for learning and making better changes to it. Please use it according to the GNU General Public License v2.0
Copyright (C) 2023 KB
This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.