This repository contains programming assignments for ECE264: Data Structures and Algorithms I, instructed by Professor Carl Sable during the Spring 2024 semester at The Cooper Union.
For course details, visit the course page.
An introduction to fundamental data structures and algorithms, with an emphasis on practical implementation issues and good programming methodology. Topics include lists, stacks, queues, trees, hash tables and sorting algorithms. Also an introduction to analysis of algorithms with big-O notation.
- Project 1: A program that calculates the strength of foobars based on their type and position in a line using object-oriented principles.
- Project 2: A program that manages stacks and queues of various data types using C++ templates, with commands for creating, pushing, and popping values.
- Project 3: A program that sorts a linked list of people based on last name, first name, and SSN using C++ list class and sorting algorithms.
Copyright (C) 2024 Taha Akhlaq <[email protected]>
Distributed under the MIT License. See LICENSE for details.
For more information on my projects and other academic work, please visit my GitHub profile.