Antonio Edwards

My Resume

Projects

Fullstack Search Engine utilizing Flask Framework

->GitHub Repository<-

Built a Fullstack search engine using Python for the backend and HTML/CSS for the frontend interface. It utilizes the Flask framework to establish communication between the backend and frontend, ensuring a seamless user experience. The backend functionality involves indexing documents stored in a zip file, extracting text content, and calculating TF-IDF (Term Frequency-Inverse Document Frequency) scores for each term. The engine merges partial indexes to accelerate search speed, achieving results in under 300 milliseconds. The ranking algorithm considers factors like page hits, TF-IDF scores, and the importance of text tags such as headers and bold tags to determine the relevance of documents. The frontend interface follows a minimalist design approach, prioritizing performance and result presentation. Overall, the project aims to deliver a robust and efficient search tool for users.

Airport Statistics Database

The Python Airport Statistics Database is a user-friendly application designed to provide comprehensive airport statistics for any registered country. Leveraging a SQLite database backend, the program offers a vast repository of airport data. With a sleek and intuitive Tkinter graphical user interface (GUI), users can effortlessly navigate through the database and access a wide array of airport statistics. From the total number of airports to specifics such as the busiest airport in terms of passenger traffic or cargo handling capacity, the application caters to diverse informational needs. Users can select their desired country from a dropdown menu and instantly retrieve relevant airport statistics. Whether for travel planning, research, or curiosity, the Python Airport Statistics Database offers a convenient and efficient means to explore airport data with just a few clicks.

Explicit Dynamic Memory Allocator

->GitHub Repository<-

This dynamic memory allocator implements a custom memory allocation library with functions adjacent to malloc and free. The allocation function allocates uninitialized memory from the heap by inrementing the brk pointer. It ensures that the allocated memory is 16-byte aligned and returns a pointer to the allocated memory region. If the requested size is 0, it returns NULL and sets errno to ENOMEM. The memory deallocation function marks a dynamically allocated block as no longer in use, coalesces adjacent free blocks if necessary, and adds the block to the appropriate bucket according to the block placement policy. It checks the validity of the pointer being freed and sets errno accordingly in case of errors such as invalid pointers or mismatched block sizes. Additionally, it ensures that the allocated bit is properly set in the header and footer of the block. The code also includes helper functions for managing buckets, inserting and removing blocks, and handling memory coalescing.

Battleships in MIPS

->GitHub Repository<-

Designed and implemented a Battleships game using the MIPS assembly language, featuring an intricate GUI. This project showcases my proficiency in low-level programming and assembly language, demonstrating the ability to create a visually compelling gaming experience in a challenging environment.

Shell Interpreter in C

->GitHub Repository<-

The provided code is a C program that serves as a shell interpreter, allowing users to execute commands. It utilizes various signal handlers to handle events such as child process termination (`sigchld_handler`) and user-defined signals (`sigusr2_handler`). The program begins by initializing variables and setting up handlers for signals. It then enters a loop where it continuously prompts the user for input using the `readline` function. Within this loop, the program checks for various conditions such as background process termination (`sigchldFlag`), history commands, built-in commands like `cd` and `exit`, and multiple processes execution. For each command entered by the user, the program parses it, executes it, and waits for completion if it's a foreground job. Additionally, it maintains a history of commands entered by the user and handles input/output redirection and pipingfor processes. The program provides error handling for various scenarios and ensures proper memory management throughout its execution.

About

I'm a junior-level Computer Science major at UCI with a deep passion for coding and building technology. My journey as a student has ignited a drive for innovation in the ever-evolving world of technology. I'm eager to contribute and learn more in the field of software engineering.
My goal is to secure an internship where I can immerse myself in real-world software development, expand my skill set, and work with industry professionals. I believe that hands-on experience is the best teacher, and I'm committed to harnessing the power of technology to solve real-world problems.

Contact

Phone Number: (650)-484-9100

Email: antonile@uci.edu

• My Github
• GitHub

Elements

i = 0;

while (!deck.isInOrder()) {
    print 'Iteration ' + i;
    deck.shuffle();
    i++;
}

print 'It took ' + i + ' iterations to sort the deck.';