|
|
|
|
|
by cannabis_sam
2051 days ago
|
|
Why the fuck would CS graduates be afraid of DP problems, NP-completeness or approximation algos??? That’s literally the table stakes of our profession. The problem is rewarding rote memorization in a whiteboard interview, at the expense of actual understanding, and ability to research the problem. |
|
If the profession being discussed is "academic work in Computer Science", sure.
If it is "software development", those things absolutely are not really "table stakes".
If it is "software engineering", then I don't think there is broad consensus on what that profession even is, much less what table stakes in it are.