If you have any questions about the IBC CITI courses, please view our CITI resource page for login/course instructions and additional FAQs. Note: If "[No NetID ...

The dynamic equivalence problem illustrates trade-offs that we often see when designing algorithms. There are two operations we’d like to perform, find and union, and we can optimize either to have ...

Before we begin with AVL trees, watch this short video on tree rotation. We’ll use tree rotation with AVL trees and later on with splay trees, so it’s important you understand what’s going on with ...

In this text we’ll talk about syntax and semantics, so it’s important that we understand what these terms mean, particularly in the context of computer programming. In a (natural) language course—say ...