Advanced Algorithms (COMPSCI 224), Lecture 1 | Summary and Q&A

17.3M views
July 11, 2016
by
Harvard University
YouTube video player
Advanced Algorithms (COMPSCI 224), Lecture 1

TL;DR

This video introduces the CS224 course, covering advanced algorithms, logistical details, grading components, and course goals.

Install to Summarize YouTube Videos and Get Transcripts

Questions & Answers

Q: How is the CS224 course graded?

CS224 is graded based on three components: scribing (10%), problem sets (60%), and a final project (30%).

Q: What are the two data structures discussed in the video?

The two data structures discussed are the Van Emde Boas Trees and the Y Fast Trees.

Q: What is the purpose of the scribing component in the grading?

The scribing component requires students to take notes on lecture content and is worth 10% of the final grade.

Q: How are the problem sets submitted in CS224?

Problem sets are submitted via email and have page limits to ensure concise and thoughtful responses.

Summary & Key Takeaways

  • The video introduces CS224, an advanced algorithms course, taught by Professor Gelani Nelson, with teaching fellow Jeffrey.

  • The course has three grading components: scribing (10%), problem sets (60%), and a final project (30%).

  • There are two data structures discussed: the Van Emde Boas Trees and the Y Fast Trees, both of which have fast query times and various space complexities.

Share This Summary 📚

Summarize YouTube Videos and Get Video Transcripts with 1-Click

Download browser extensions on:

Explore More Summaries from Harvard University 📚

Summarize YouTube Videos and Get Video Transcripts with 1-Click

Download browser extensions on: