CS3230 - Lecture 9: NP Hardness

Posted on October 20, 2020

A game you can’t win Imagine an adversay present you with a black steel box with n binary switches on the front and light bulb on top Sales man tell you that the state of the light bulb is controlled by a complex boolean circuit and a collection of AND,... [Read More]

LAJ2201 - Lecture 19

Posted on October 16, 2020

Summary Vocab ta form になります いadj - い + く なります なadj/ｎoun + になります verb （ナーform）なります たり～たりします のぼる New words: 一度だけ : only once 何度も: many times 何度か: A few times 一度も: never, not even once [Read More]

CS3103 - Lecture 8: OSPF

Posted on October 6, 2020

Link state routing Each router in the network knows the link state so that they can plan the appropriate path Distance vector: Router knows only cost to each destination Link state: Router knows the entire network topologu Computes shortest path by itself Independent computation of routes [Read More]