Çağan Alp Turhan

Home Projects Reflections Codes Videos To-do Review

Projects

Swift XOX Project

Swift XOX Screenshot

Clock Projects

Clock Project V1

Clock V1 Preview

Clock Project V2

Ice Cream Overflow Code Project

Ice Cream Overflow Screenshot 1 Ice Cream Overflow Screenshot 2

Clock Game V2

Clock Game V2 Clock Game Screenshot

2nd Semester

Transposition Cipher

Activity

CMEOPTUR

Solution and Questions

Solution: COMPUTER Questions: 1.What is a Transposition Cipher? 2.In this cipher, are the letters changed or just rearranged? 3.How could you make the message more secure?

My Array Map V1

image

World Clock V1

Ekran Resmi 2025-11-19 23 25 42

List Project Iceream

Ekran Resmi 2025-11-19 23 39 36

Swift Design Challenge v1

Ekran Resmi 2025-11-23 22 43 40
Ekran Resmi 2025-11-23 23 08 02
<h2>Pixel Painter</h2>
<img width="314" height="336" alt="Ekran Resmi 2025-11-24 06 59 51" src="https://github.com/user-attachments/assets/5387e179-f787-4318-9b79-e73a69ee2f56" />

</section>

SpinnerSimulationNested ConditionalsVersion

<img width="316" height="319" alt="Ekran Resmi 2025-12-11 08 53 42" src="https://github.com/user-attachments/assets/6fc67c73-1c3c-4b44-b75e-412114ec8eab" />

</section>

Robot Movement Simulation

<img width="400" height="486" alt="Ekran Resmi 2025-12-14 21 28 29" src="https://github.com/user-attachments/assets/3d3dbd30-225d-45f5-a8e2-26f06bd98ae7" />

</section>

Robot Movement Simulation

<img width="383" height="394" alt="Ekran Resmi 2026-03-11 22 45 50" src="https://github.com/user-attachments/assets/128ee0b2-76a7-4875-b1d7-7fca24a88370" />

</section>

Binary Search

<img width="371" height="312" alt="Ekran Resmi 2026-03-11 22 54 28" src="https://github.com/user-attachments/assets/4e564729-ac17-4cb3-9b63-33baca3fd439" />
DATABASE ← [2, 5, 8, 12, 16, 23, 38, 56, 72, 91] TARGET ← 23 LOW ← 0 HIGH ← LENGTH(DATABASE) - 1 STEPS ← 0 FOUND ← FALSE OUTPUT ← empty list

APPEND(“> SYSTEM: Starting Binary Search Protocol…”) TO OUTPUT APPEND(“> Target ID: “ + TARGET) TO OUTPUT APPEND(“> ———————————————”) TO OUTPUT

REPEAT UNTIL FOUND = TRUE OR LOW > HIGH STEPS ← STEPS + 1 MID ← (LOW + HIGH) DIV 2

APPEND("> Step " + STEPS + ": Checking Index [" + MID + "] -> Value: " + DATABASE[MID]) TO OUTPUT

IF DATABASE[MID] = TARGET THEN
    FOUND ← TRUE
    APPEND("> ") TO OUTPUT
    APPEND(">  SUCCESS: User ID found at Index " + MID) TO OUTPUT
    APPEND(">  EFFICIENCY: Operation completed in " + STEPS + " steps.") TO OUTPUT
ELSE IF DATABASE[MID] < TARGET THEN
    LOW ← MID + 1
ELSE
    HIGH ← MID - 1
END IF END REPEAT

</section>

Presentation Link

https://docs.google.com/presentation/d/1oMBq4ParZ9T4cGEd3wvJCMjEvCFtMBe-Bx9O6BEqrsg/edit?slide=id.p#slide=id.p

</section>