CS50 - Harvard Computer Science Labs

Academic programming projects completed as part of Harvard University's CS50 course, covering algorithms, data structures, and memory management in C.

Projects Included

Week 3: Algorithms - Tideman

• Description: Implementation of Condorcet voting method using graph theory
• Key Concepts: Ranked pairs, cycle detection, directed graphs
• Technologies: C, Recursion, Graph Algorithms
• View Code

Week 5: Data Structures - Speller

• Description: Spell checker using hash table implementation
• Key Concepts: Hash functions, memory management, performance optimization
• Technologies: C, Hash Tables, File I/O
• Performance: [Bellek kullanımı ve hız detayları]
• View Code

Week 4: Digital Forensic - Image Recovery

• Description: JPEG file recovery from raw disk images
• Key Concepts: File systems, binary data manipulation, forensics
• Technologies: C, File I/O, Memory Management
• View Code

Technologies

• Language: C
• Concepts: Algorithms, Data Structures, Memory Management, Graph Theory
• Tools: Make, Valgrind, GDB

About CS50

CS50 is Harvard University's introduction to computer science and programming.

Connect

LinkedIn: in/bediravsar