Dynamic programming Design technique, like divide-and-conquer Example: Longest Common Subsequence (LCs) Given two sequences x[l.. m] and yll.n], find a longest subsequence common to them both a' not the
Abstraction Elements of a Language(or Engineering Design) Primitives, means of combination means of abstraction What weve seen Procedural Abstraction. ambda-captures common patterns and Deep question
The divide-and-conquer design paradigm 1. Divide the problem(instance) into subproblems 2. Conquer the subproblems by solving them recursively 3. Combine subproblem solutions
The signal suffers an attenuation loss l Received power PR= PT/L Received snr=E,/No, Eb=Pr/Rb Antennas are used to compensate for attenuation loss Capture as much of the signal as possible
Objectives Review the format and expectations for the final exam Review material needed to succeed on the final exam Set the material from the course in the context of the product realization process Answer questions