'Optimal code' presentation slideshows

Approaches to Problem Solving

Approaches to Problem Solving. greedy algorithms dynamic programming backtracking divide-and-conquer. Problem: Huffman Coding. Def: binary character code = assignment of binary strings to characters. e.g. ASCII code A = 01000001 B = 01000010 C = 01000011

321 views • 29 slides

Compression For sending and storing information

Compression For sending and storing information. Text, audio, images, videos. Common Applications. Text compression loss-less, gzip uses Lempel-Ziv coding, 3:1 compression better than Huffman Audio compression lossy, mpeg 3:1 to 24:1 compression MPEG = motion picture expert group

287 views • 28 slides

8 Tips for Mastering Node.js

Node.js has become one of the main tools developers use to create backends for their web apps. Read on to get some tips on how to make the most of this framework.

232 views • 22 slides

237 views • 22 slides

CSC 2300 Data Structures & Algorithms

261 views • 17 slides

Greedy Algorithms

Greedy Algorithms. Greedy Algorithm Design. Comparison:. Dynamic Programming. Greedy Algorithms. At each step, the choice is determined based on solutions of subproblems. At each step, we quickly make a choice that currently looks best. --A local optimal (greedy) choice.

349 views • 8 slides