Skip to content
Aly

Selected work

Each project states the problem, the constraints, the decisions and what each one cost, and where it ended up.

Each project has a full case file. Expand below, or press / and run cat bystander.

Systems and data structures coursework

  • BFS, DFS, and Dijkstra's shortest path over adjacency matrices and adjacency lists (C).
  • Expression trees, a max-heap, an RPN stack calculator, and a binary-file record manager (C).
  • Manual memory management with pointers. Segmentation faults and leaks debugged with gdb.
  • Investment portfolio manager with buy/sell logic, fee handling, and multi-field search (Java).
  • Discussion board with registration, posts, and polls persisted through file I/O (Java).
← Home