CS 473

spring 2013

All Classes

Fundamental Algorithms

Credit: 0 TO 4 hours.

Fundamental techniques for algorithm design and analysis, including recursion, dynamic programming, randomization, dynamic data structures, fundamental graph algorithms, and NP-completeness. Intended for undergraduates in Computer Science and graduate students in other departments. Same as CSE 414 and MATH 473. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 373.

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 103
- CS 105
- CS 125
- CS 173
- CS 196
- CS 199
- CS 210
- CS 225
- CS 241
- CS 242
- CS 296
- CS 357
- CS 373
- CS 397
- CS 398
- CS 410
- CS 411
- CS 413
- CS 418
- CS 419
- CS 421
- CS 423
- CS 425
- CS 428
- CS 429
- CS 431
- CS 433
- CS 438
- CS 440
- CS 450
- CS 460
- CS 461
- CS 463
- CS 465
- CS 466
- CS 467
- CS 473
- CS 477
- CS 482
- CS 491
- CS 493
- CS 494
- CS 498
- CS 499
- CS 512
- CS 522
- CS 524
- CS 525
- CS 526
- CS 528
- CS 533
- CS 543
- CS 546
- CS 549
- CS 555
- CS 565
- CS 572
- CS 575
- CS 576
- CS 591
- CS 597
- CS 598
- CS 599

Detail	Status		CRN	Type	Section	Time	Day	Location	Instructor