.pf{position:relative;background-color:#fff;overflow:hidden;margin:0;border:0}.pc{position:absolute;border:0;padding:0;margin:0;top:0;left:0;width:100%;height:100%;overflow:hidden;display:block;transform-origin:0 0;-ms-transform-origin:0 0;-webkit-transform-origin:0 0}.bi{position:absolute;border:0;margin:0}.t{position:absolute;white-space:pre;font-size:1px;transform-origin:0 100%;-ms-transform-origin:0 100%;-webkit-transform-origin:0 100%;unicode-bidi:bidi-override;-moz-font-feature-settings:"liga" 0}.t:after{content:''}.t:before{content:'';display:inline-block}.t span{position:relative;unicode-bidi:bidi-override}.pi{display:none}@media screen{.pf{margin:13px auto;box-shadow:1px 1px 3px 1px #333;border-collapse:separate}}.ff1{font-family:ff1;line-height:.893555;font-style:normal;font-weight:400;visibility:visible}.ff2{font-family:ff2;line-height:.933594;font-style:normal;font-weight:400;visibility:visible}.ff3{font-family:ff3;line-height:.666504;font-style:normal;font-weight:400;visibility:visible}.m0{transform:matrix(.320260,0,0,.320260,0,0);-ms-transform:matrix(.320260,0,0,.320260,0,0);-webkit-transform:matrix(.320260,0,0,.320260,0,0)}.ls4{letter-spacing:0}.ls0{letter-spacing:42.7996px}.ls1{letter-spacing:42.8152px}.ls2{letter-spacing:930.52px}.ls3{letter-spacing:1017.88px}.sc0{text-shadow:-.015em 0 transparent,0 .015em transparent,.015em 0 transparent,0 -.015em transparent}@media screen and (-webkit-min-device-pixel-ratio:0){.sc0{-webkit-text-stroke:.015em transparent;text-shadow:none}}.ws0{word-spacing:-12px}.ws1{word-spacing:0}.fc0{color:#000}.fs0{font-size:48px}.y20{bottom:158.516211px}.y1f{bottom:178.808166px}.y0{bottom:195.358839px}.y1e{bottom:195.717915px}.y1d{bottom:285.839189px}.y1c{bottom:306.130631px}.y1b{bottom:323.193976px}.y1a{bottom:399.749277px}.y19{bottom:420.040719px}.y18{bottom:440.486398px}.y17{bottom:460.777841px}.y16{bottom:481.095416px}.y15{bottom:501.386858px}.y14{bottom:521.678813px}.y13{bottom:542.12398px}.y12{bottom:562.415935px}.y11{bottom:582.707377px}.y10{bottom:602.999331px}.yf{bottom:623.444499px}.ye{bottom:643.736453px}.yd{bottom:664.027895px}.yc{bottom:684.319338px}.yb{bottom:704.803448px}.ya{bottom:725.094891px}.y9{bottom:745.386845px}.y8{bottom:765.678287px}.y7{bottom:786.123967px}.y6{bottom:806.415409px}.y5{bottom:826.707364px}.y4{bottom:846.998806px}.y3{bottom:867.444485px}.y2{bottom:887.735928px}.y1{bottom:908.053503px}.h2{height:32.53125px}.h3{height:34.453125px}.h1{height:198.561443px}.h0{height:1014.58492px}.w1{width:312.574142px}.w0{width:783.997438px}.x1{left:92.265481px}.x2{left:115.32423px}.x0{left:138.352489px}.x3{left:161.436679px}.x4{left:184.494658px}

01:198:344 Study Guide - Midterm Guide: Optimal Substructure, Topological Sorting, Memoization

United States

Design and Analysis of Computer Algorithms

Computer Science

Ames

Rutgers University

Extinction

Honors Colloquium (11)

Introduction to Computer Science

Introduction to Discrete Structures I

Computer Architecture

Systems Programming

Principles of Information and Data Management

Internet Technology

Introduction to Microeconomics

Black Literature from 1930 to the Present

Introductory Linear Algebra

Software Methodology

01:198:344 Lecture Notes - Lecture 12: Dynamic Programming, Big O Notation, Minc

01:198:344 Lecture Notes - Lecture 13: Optimal Substructure, Dynamic Programming, Local Optimum

01:198:344 Lecture Notes - Lecture 21: Backtracking, Minimum Spanning Tree, Vertex Cover

01:198:344 Study Guide - Midterm Guide: Optimal Substructure, Topological Sorting, Memoization

Get access

Related Documents

01:198:344 Lecture Notes - Lecture 12: Dynamic Programming, Big O Notation, Minc

01:198:344 Lecture Notes - Lecture 13: Optimal Substructure, Dynamic Programming, Local Optimum

01:198:344 Lecture Notes - Lecture 21: Backtracking, Minimum Spanning Tree, Vertex Cover