Roland Marion Manalo

Headshot

175 International Dr, Athens, GA, 30605 | (912) 484-9479 | marionmanalo682@gmail.com

I am a third-year Computer Science student at the University of Georgia and I am eager to make a positive impact on the world by sharing my talents/skills. Currently, I am looking for an internship, hoping to learn from the best and be a part of something great.

Education

University of Georgia, Athens, GA, Bachelor of Science in Computer Science, May 2026 (Expected), GPA: 3.11/4.00, Courses: Introduction to Computing and Programming, Software Development, Discrete Mathematics, Data Structures, Systems Programming, Theory of Computation, Algorithms, Differential Equations

Honors and Awards

Dean's List
Fall 2023
HOPE Scholarship Recipient
Fall 2023
Zell Miller Scholarship Recipient
Fall 2022

Skills

Leadership and Experience

Team Member - Front of House, Chick-fil-A, Pooler, GA
July 2021 - July 2022

Projects

Picture of a Unix terminal.

Unix Shell

  • Low-level Unix shell program written in C.
  • Supports standard I/O redirection and process management, implementing systems calls such as fork, exec, pipe, etc..
  • Created in a remote Unix environment.
Picture of an open dictionary.

Dictionary Rhymer

  • Created an API app that defines user-inputted words and provides the user with their definition(s) and rhyming words.
  • Written in Java, applying knowledge of RESTful APIs, JSON parsing, HTTP, Maven, and JavaFX for the user GUI.
  • Used Git and GitHub for version control, incorporating two branches and seven total commits on the main branch throughout the SDLC.
Picture of a binary tree.

Binary Search Tree

  • Completed as a class project to demonstrate understanding in the binary search tree data structure.
  • Java program that stores non-negative integers, implementing methods such as insert, delete, and traversals preorder, postorder, and inorder.
  • Prompts the user asking how many numbers to randomly generate within the range 0 - 200,000,000 and outputs the height of the tree and the number of non-duplicate elements inserted.