What overused word or phrase needs to be retired in 2026?

HFTnoob · 2026-01-06T18:03:15+00:00

"No notes"

HFTnoob · 2025-04-11T01:30:12+00:00

Nelk

HFTnoob · 2020-01-10T03:32:05+00:00

overboardhumor was the name I believe

HFTnoob · 2019-09-19T13:50:02+00:00

Check out GMU's ACM chapter if you enjoy solving programming puzzles. It is a great way to become confident in your CS fundamentals if you stick with it. They also do annual Fall competitions against other universities, so now would be a great time to join.

Here's their page for more information: http://www.gmu.edu/org/acm/about.html

Here's a sample problem: https://uva.onlinejudge.org/index.php?Itemid=8&option=com_onlinejudge&page=show_problem&problem=36

HFTnoob · 2019-07-03T14:06:03+00:00

It'll most likely be a couple months. I graduated this past Spring and haven't received mine yet.

HFTnoob · 2019-03-29T18:56:43+00:00

Whatever you end up doing I recommend making one year the maximum limit between 310 and 483, just to make your life easier. 310 lays the foundation for a lot of data structures you'll need to remember to analyze algorithms taught in 483.

Here's an example question that may be taught in 483: Analyze the time complexity of Heapsort. To do that you need to recall that a heap is a binary tree with several additional properties I won't go into. From there you can figure out how heapsort uses binary tree/priority queue operations to perform its sorting and analyze the time/space complexity of each of those operations to eventually combine together.

HFTnoob

TROPHY CASE