This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
with open("LINKS", "r") as linksfile: | |
with open("LINKS2", "r") as duplicatefile: | |
with open("LINKS3", "w") as dedpulicatedfile: | |
links = frozenset(linksfile) | |
for line in duplicatefile.readlines(): | |
if line not in links: | |
dedpulicatedfile.write(line) | |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# GRAMMAR: | |
# _Start -> "*" "GOALS" "\n" _Goals | |
# _Goals -> _Goal | |
# | _Goal _Goals | |
# _Goal -> "**" <active> <text> "\n" _Projects | |
# _Projects -> _Project | |
# | _Project Projects |
Miscellaneous
- 1001 Discos de Musica Clasica que hay que escuchar antes de morir ES
- 1001 Libros que hay que leer antes de morir ES
- 1001 Peliculas que hay que ver antes de morir ES
- 50 Cosas Que Hay Que Saber Sobre - Martin Redfern - La Tierra ES
- 50 Cosas Que Hay Que Saber Sobre - Philip Wilkinson - Arquitectura ES
- 50 Cosas Que Hay Que Saber Sobre - Tony Crilly - Matematica ES
- Canciones Celtas ES
- No Longer at Ease EN
- The Vicar of Wakefield EN
- Doesn’t know the difference between Array and LinkedList
- Able to explain and use Arrays, LinkedLists, Dictionaries etc in practical programming tasks
- Knows space and time tradeoffs of the basic data structures, Arrays vs LinkedLists, Able to explain how hashtables can be implemented and can handle collisions, Priority queues and ways to implement them etc.
- Knowledge of advanced data structures like B-trees, binomial and fibonacci heaps, AVL/Red Black trees, Splay Trees, Skip Lists, tries etc
- Unable to find the average of numbers in an array
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class FiniteStateMachine: | |
def __init__(self, cs=None, tt={}, tf={}, sf={}, oe={}, ox={}): | |
self.ps = None # previous state | |
self.cs = cs # current state | |
self.tt = tt # transition table | |
self.tf = tf # transition functions | |
self.sf = sf # state functions | |
self.oe = oe # on entry functions | |
self.ox = ox # on exit functions |