https://github.com/mrnazu/cs50

cs50 harvard
https://github.com/mrnazu/cs50

c computer-science cs50 dsa harvard

Last synced: 9 days ago
JSON representation

cs50 harvard

• Host: GitHub
• URL: https://github.com/mrnazu/cs50
• Owner: mrnazu
• Created: 2024-05-23T05:29:48.000Z (8 months ago)
• Default Branch: main
• Last Pushed: 2024-07-20T09:23:26.000Z (6 months ago)
• Last Synced: 2024-11-17T11:55:18.927Z (2 months ago)
• Topics: c, computer-science, cs50, dsa, harvard
• Language: C
• Homepage:
• Size: 4.96 MB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# This is CS50

Welcome to the CS50 Fair! CS50 is a first course in Computer Science for concentrators and non-concentrators alike. More than just teach you how to program, this course teaches you how to think more carefully and how to solve problems more effectively. As such, its lessons are applicable well beyond the boundaries of computer science itself. That the course does teach you how to program, though, is perhaps its most empowering return.

Note: Nazu

## Week 0 (Done)

- Introduction (Done)

- Bits (Done)

- Binary (Done)

- ASCII (Done)

- Programming (Done)

- Algorithms (Done)

- Scratch (Done)

- Statements (Done)

- Boolean expressions (Done)

- Conditions (Done)

- Loops (Done)

- Variables (Done)

- Threads (Done)

- Events (Done)

## Week 1 (Done)

- C (Done)

- Source code (Done)

- Compilers (Done)

- Object code (Done)

- GCC (Done)

- Functions (Done)

- Comments (Done)

- Standard output (Done)

- Arithmetic operators (Done)

- Precedence (Done)

- Local variables (Done)

- Types (Done)

- Casting (Done)

- Standard input (Done)

- Libraries (Done)

- Boolean expressions, continued (Done)

- Conditions, continued (Done)

- Loops, continued (Done)

## Week 2 (Done)

- Functions, continued (Done)

- Global variables (Done)

- Parameters (Done)

- Return values (Done)

- Stack (Done)

- Frames (Done)

- Scope (Done)

- Arrays (Done)

- Strings (Done)

- Command-line arguments (Done)

- Cryptography (Done)

## Week 3 (Done)

- Big O (Done)

- Linear search (Done)

- Binary search (Done)

- Asymptotic notation (Done)

- Recursion (Done)

- Bubble sort (Done)

- Selection sort (Done)

## Week 4

- Merge sort

- Structures

- Dynamic memory allocation

- Pointers

- Debugging, continued

## Week 5

- CS50 Library

- Heap

- Pointers, continued. 

- Forensics

## Week 7

- File I/O

- Linked lists

- Stacks

- Queues

- Valgrind

- Hash tables

- Trees

- Binary search trees

- Tries