UNC COMP 110: Introduction to Programming and Data Science
COMP 110 is UNC's Python-based introduction to programming, framed around data science ideas, and the first course toward the CS major and minor. It assumes no prior experience and covers control flow, functions, lists and dictionaries, object basics, and working with data.
Fennie is independent and not affiliated with UNC Chapel Hill. This is an unofficial study guide.
Build my COMP 110 study planWhat makes it hard
The course enrolls enormous sections with wildly mixed experience levels, so the pace feels gentle to repeat programmers and relentless to true beginners. Difficulty jumps at functions and memory diagrams, and the exams — which require reading and writing code by hand — are where students who leaned on autograder iteration get separated from students who built real fluency.
What you'll cover
- • Python fundamentals
- • Conditionals and loops
- • Functions and scope
- • Lists and dictionaries
- • Memory diagrams and program tracing
- • Object-oriented basics
The COMP 110 study guide
How to study for UNC COMP 110, step by step.
- 1
Code daily from week one, especially if it feels easy
COMP 110's gentle opening is the trap — the functions-and-scope unit is where unprepared students stall. Twenty minutes of real coding daily builds the base before the course assumes it.
- 2
Master memory diagrams early
COMP 110 teaches tracing through memory diagrams, and exams test them directly. Practice drawing them for every nontrivial example — they're also the debugging tool that makes the rest of the course cheaper.
- 3
Rebuild exercises from a blank file
Passing the autograder by iteration is not the same as being able to produce code. After finishing each exercise, rewrite its core from scratch — if you can't, the exam will discover it first.
- 4
Trace code on paper weekly
Exams ask what code prints with no interpreter to lean on. Hand-trace loops over lists and dictionaries until predicting output is mechanical, not hopeful.
- 5
Use office hours like the resource they are
COMP 110 runs a large TA operation precisely because beginners need unsticking. Go early in the week with specific broken code — the students who never go are overrepresented at the exam's low end.
- 6
Anchor the habit with Fennie
Upload your COMP 110 syllabus and Fennie's Daily Plan schedules short daily coding practice paced to exercises and exams, with quizzes generated from your actual course materials to rehearse on-paper code reading. Free to start.
Start my COMP 110 plan free
How Fennie helps with COMP 110
Fennie's Daily Plans build the daily coding rhythm COMP 110 quietly requires, paced to exercise deadlines and exams rather than panic. Chat explains why your code behaves the way it does — memory diagram by memory diagram — so the tracing skill the exams test becomes genuinely yours, with generated quizzes standing in for the interpreter.
FAQ
Is COMP 110 at UNC hard?
For true beginners it's a real course with a real jump at functions and memory diagrams; for students with prior programming it's gentle. The exams separate autograder-iterators from students with actual fluency — daily practice and paper tracing close that gap.
Do I need COMP 110 to apply to the CS major?
It's the start of the path: the major application requires COMP 210 plus a discrete math course (COMP 283 or equivalent), and COMP 110 is the standard prerequisite into 210. Grades in these early courses matter for admission, so build fundamentals properly rather than just passing.
What language does COMP 110 use?
Python, with a data-science flavor in the examples. It leads into COMP 210 (Data Structures and Analysis), which assumes your Python — especially functions, lists, dictionaries, and object basics — is fluent rather than survivable.
Pass COMP 110 with a plan, not a cram
Upload your COMP 110 materials and Fennie generates a Daily Plan paced to your deadline — plus chat, flashcards, and quizzes built from the actual course content.
Get started freeMore UNC courses
COMP 210 — Data Structures and Analysis
COMP 210 teaches how data structures are actually built — lists, stacks, queues, trees, hash tables — along with recursion and runtime analysis. It's the centerpiece of the CS major application at UNC, so the grade carries admission stakes on top of the content.
COMP 211 — Systems Fundamentals
COMP 211 takes UNC CS students below Python — data representation, C programming, pointers and memory management, processes, and the Unix command line — building a working model of how programs actually execute. With COMP 210, it forms the core that upper-level courses assume.
COMP 283 — Discrete Structures
COMP 283 is the CS department's discrete math course — logic, proof techniques, induction, sets, relations, counting, and graph basics — and one of the courses (alongside COMP 210) required to apply to the CS major. It's most students' first proof-based course.
COMP 301 — Foundations of Programming
COMP 301 teaches UNC CS students to structure and organize larger programs — object-oriented design in Java, interfaces, inheritance, design patterns, and testing — the bridge from writing code that works to writing code that's built well. It follows COMP 210 in the core sequence.