David Anica's Portfolio

This program not only highlights my ability to implement classic algorithms but also demonstrates my skills in managing user input, dynamic data structures, and recursive programming.

The clear visual representation of the towers enhances user understanding, showcasing my attention to detail in user interface design and my problem-solving abilities.

Key highlights Data Structures Employs vectors to represent the towers and the disks on them, showcasing the ability to use dynamic arrays.

Algorithm Implementation Implements the recursive Tower of Hanoi algorithm, demonstrating an understanding of recursion and algorithmic problem solving.

In this project, I developed a program that transforms numeric input into possible letter combinations, akin to the T9 text input method, and checks these combinations against a dictionary to find valid words.

This project highlights my skills in file I/O operations, efficient data structure usage, recursive algorithm design, and string manipulation.

Key highlights Data Structures Uses 'unordered_set' for efficient word lookup and 'vector' to store combinations and results.

String Manipulation Performs string transformations and filtering, highlighting proficiency in handling and manipulating strings in C++.

Recursion Implements a recursive backtracking algorithm to generate all potential letter combinations from numeric input.

Dictionary Lookup Loads a dictionary of valid words from a file (words.txt) and uses it to verify if the generated combinations are actual words.

The project involves filling a 10x10 grid with sequential numbers starting from a specified position, ensuring each number occupies a dedicated spot formatted to a consistent 4-character width.

This process utilizes the Depth-First Search (DFS) algorithm to systematically explore and fill the grid while adhering to boundary constraints and maintaining proper alignment.

Key highlights Data Structures Effective use of stacks for managing the depth-first search algorithm.

Depth-First Search (DFS) Used to recursively explore and fill the grid, ensuring each cell is visited and numbered sequentially.

Recursion Demonstrates ability to implement and manage a recursive algorithm with backtracking to achieve the desired filling pattern.

Formatted Output Utilizes 'iomanip' to ensure each number is displayed in a clear and aligned format within the grid cells.

Interactive User Interface Prompts users to enter the starting position and displays the filled grid in a structured manner.

This program reads student data, validates the input, sorts students by their grades, and displays them grouped by grade.

Key highlights Data Structures Uses 'std::vector' to store and manage student records dynamically.

Sorting Utilizes the 'std::sort' function to arrange students in ascending order based on grades.

Input Handling Accepts multiple lines of input until terminated by 'ctrl + d', capturing student details dynamically.

Output Formatting Presents students grouped by their grades ('A' to 'F'), excluding 'E', with each group displayed sequentially.

For my COMPSCI-1 Final project, I was required to build a game that implemented the concepts learned in the course.
(Functions, loops, I/O handling, static/constant members, error handling)

I developed a console-based TicTacToe game that allows two players to take turns placing their marks on a 3x3 grid. The game includes features such as move validation, winner detection, and draw checking.
This project was built using C++ and demonstrates my proficiency in object-oriented programming, control flow, and input/output handling.

For my COMPSCI-1 class, I was required to build a cash register program for my midterm project.

This program is what I submitted and it is the first C++ program that I ever created.