Algorithms, Data Structures- CS50 for Lawyers 2019

From the creator

00:00:00 - Introduction 00:00:15 - Algorithms, Data Structures 00:01:26 - Algorithms Demo 00:12:00 - Algorithm Running Times 00:13:14 - Big O Notation (Upper Bound) 00:14:23 - Omega Notation (Lower Bound) 00:15:09 - Theta Notation 00:15:54 - Sorting Demo 00:21:45 - Bubble Sort 00:24:31 - Selection Sort 00:26:19 - Algorithm Running Times (continued) 00:30:51 - Comparison of Sorting Algorithms Visualizations 00:39:09 - Memory 00:40:58 - Data Structures 00:43:07 - Memory Representation 00:53:53 - Linked Lists 01:00:59 - Trees 01:04:53 - Binary Trees 01:08:11 - Hash Tables 01:15:35 - Python This course is a variant of Harvard University's introduction to computer science, CS50, designed especially for lawyers (and law students). Whereas CS50 itself takes a bottom-up approach, emphasizing mastery of low-level concepts and implementation details thereof, this course takes a top-down approach, emphasizing mastery of high-level concepts and design decisions related thereto. Ultimately, it equips students with a deeper understanding of the legal implications of technological decisions made by clients. Through a mix of technical instruction and discussion of case studies, this course empowers students to be informed contributors to technology-driven conversations. In addition, it prepares students to formulate technology-informed legal arguments and opinions. Along the way, it equips students with hands-on experience with Python and SQL, languages via which they can mine data for an

Published 2019-09-01 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.