CS 473

spring 2018

All Classes

Algorithms

Credit: 4 hours.

Design and analysis techniques, approximation algorithms, randomized algorithms and amortized analysis, and advanced topics such as network flow, linear programming, and dynamic data structures, among others.

Same as CSE 414 and MATH 473. 4 undergraduate hours. 4 graduate hours. Prerequisite: CS 374, and one of CS 361, MATH 461, or STAT 400.

Status Icon Legend

: Section Status Closed
: Section Status Open
: Section Status Pending
: Section Status Open (Restricted)
: Section Status Unknown

Section Status updates every 10 minutes.

- CS 101
- CS 102
- CS 105
- CS 125
- CS 126
- CS 173
- CS 196
- CS 199
- CS 210
- CS 225
- CS 233
- CS 241
- CS 242
- CS 296
- CS 357
- CS 361
- CS 374
- CS 397
- CS 398
- CS 410
- CS 411
- CS 412
- CS 413
- CS 418
- CS 421
- CS 422
- CS 423
- CS 425
- CS 428
- CS 429
- CS 431
- CS 433
- CS 436
- CS 438
- CS 440
- CS 446
- CS 450
- CS 460
- CS 461
- CS 463
- CS 465
- CS 466
- CS 468
- CS 473
- CS 477
- CS 482
- CS 483
- CS 491
- CS 492
- CS 497
- CS 498
- CS 499
- CS 511
- CS 512
- CS 525
- CS 533
- CS 538
- CS 543
- CS 546
- CS 555
- CS 565
- CS 572
- CS 574
- CS 575
- CS 579
- CS 581
- CS 583
- CS 591
- CS 597
- CS 598
- CS 599

Detail	Status		CRN	Type	Section	Time	Day	Location	Instructor