Courses

The introduction to the Harvard CS50x course provides an overview of computer science and teaches students like us how to use computers to solve problems. It explains that computer science is about problem solving rather than just programming and introduces concepts such as algorithms, abstraction,binary, and computational thinking. We learned how to use a visual programe called Scratch to create our own games using  fundamental programming concepts including seuences,loops,conditionals,variables,functions,and events without worrying about complex syntax

This video is the first lecture of CS50, Harvard University's introduction to computer science. David J. Malan explores how computers process information using binary (0:16:06), explains the importance of algorithmic efficiency (0:55:23), and introduces programming logic through the visual language Scratch (1:14:09).

CS50 x 2026 Week 1 introduces us to the C progamming language. We learned how to write, compile,and run programs using the (main) function and (printf) for output. In that we also learned about variables, data types,user input, arithmetic and logical operators.

David J. Malan  introduces us to arrays, strings, command line arguments, and algorithms for searching and sorting. We also learnt about linear and binary search bubbles, selection and merge sort, while using Big O notation to compare algorithm efficiency and write more effective C programs.

David J. Malan introdces us to algorithms and data structures in greater depth. We learnt about recursion, sorting algorithms such as merge sort and uicksort, and searching techniues. The week emphasizes analyzing algorithm efficiency using Big O notation and choosing effcient solutions to solve peogramming problems

David J. Malan introduces fundamental concepts of computer memory, explaining how data is stored in binary and hexadecimal representations. Through examples like image pixels and character encoding, the lecture demonstrates how to access and manipulate specific memory addresses directly in C.

This lecture explores data structures and memory management in C. 

Key topics include:Stacks and Queues: LIFO and FIFO systems (0:03:35).

Linked Lists: Using pointers for dynamic data growth (0:33:03).

Trees: Introducing Binary Search Trees for efficient searching (1:22:04).

Hashing and Tries: Advanced methods for fast data lookups, balancing speed against memory usage (1:36:47 - 1:53:51) 

The focus is on trade-offs—balancing performance, space, and code complexity.

David J. Malan introduces us to Python and highlighs its simpler syntax compared to C. We learnt about variables, data types, conditionals, loops, functions, file handling, and dicitionaries while applying the progamming concepts that we have learned earlier. The week emphasizes writing concise, readable code and solving problems more efficiently with python.

This lecture introduces SQL as a tool for managing data. It covers:

Database Basics: Moving from simple CSV files (0:43) to relational databases (24:10).

Core Operations: Learning the CRUD principles: Create, Read, Update, and Delete (25:12).

Relationships: How to link tables using primary and foreign keys for organized data (1:06:05).

Querying: Extracting data efficiently with SELECT, JOIN, and GROUP BY (1:11:12).

Safety: Bridging Python and SQL while preventing security risks like SQL injection (1:57:46).

This lecture introduces the foundations of the web, covering:

Internet Basics: How data travels via TCP/IP, DNS, and HTTP (0:43 - 30:25).

HTML: The structure of websites, including tags like headings, lists, tables, and images (42:20 - 1:29:34).

CSS: How to style pages with cascading stylesheets and frameworks like Bootstrap (1:29:34 - 1:51:03).

JavaScript: Using code to make web pages interactive and dynamic (1:51:03 - 2:18:00).

This lecture introduces Flask, a Python-based framework for building full-stack web applications. Key highlights include:

Dynamic Web Pages: Using Jinja templates to render HTML dynamically (0:33:31).

User Input: Managing data with GET and POST request methods (0:48:10).

Data Persistence: Storing information in SQLite databases (1:31:10).

State Management: Using cookies and sessions (1:57:05).

Case Study: Iteratively building a Frosh IMs registration system (0:54:22).

This final CS50 lecture celebrates students' growth over the term (0:43). Highlights include:

Interactive Learning: Fun Pictionary exercises (0:10:32, 0:23:36) demonstrating the importance of precision and abstraction in coding.

Course Recap: A review of the journey from Scratch and C to modern Python, SQL, and web development (0:16:14).

Future Steps: Guidance on final projects, using GitHub, and leveraging AI tools for productivity (0:30:13).

Final Quiz: A collaborative, student-led trivia game covering core computer science concepts like memory, algorithms, and networking (0:39:48).

The lecture ends with a tradition of shared cake and celebration (0:51:24)