CodeField

How it works

Draft wording, not yet reviewed.

What CodeField is

Coding practice in tracks. Each track is one language, for the courses it names.

It is practice for the paper exam and the lab. It is not a course, it does not mark you, and it does not replace lab hours.

Where the answers come from

Every answer CodeField holds was made by running the real language when the task was made, never typed by a person.

When you seal a prediction, the output you see is the one Python printed then, labelled with its version.

How your programs are checked

Tasks you do by tapping are checked against those answers, on this device or on CodeField's server. They work offline after your first visit.

A program you write is checked by running it on several tests and comparing what it prints, line by line. Spaces at the end of a line and blank lines at the end are ignored; capitals are not.

Where this device can run the language, your program runs here. Where it cannot, CodeField's own server can run it, once that server has passed its security review. Until then you compare your program with a model answer, and the task is marked not checked.

Each result says where it was checked: on this device, on CodeField's server, or not at all.

Why results are practice only

The tests and model answers are inside the app, so that tasks work offline. A determined learner could read them.

CodeField cannot tell who wrote a program. Passing a task shows practice, not learning, and nothing here should be used as a mark.

What is kept

When you are signed in, your programs, the code behind each check, your attempts and your progress are kept in your account, so you can carry on from any device.

The input you type for Run, and what Run prints, stay on this device.

You can download everything kept about you, or delete it, from Account. Privacy says who can see it and for how long.

Who has checked this

Not yet reviewed. No lecturer has checked these tasks yet, so treat them as practice, not as the course's own material.

Each track names the reviewer who checked it once one has.

Tracks

Python fundamentals

Claim
Python practice for COS 102 and GET 211.
State
Open.
Review
Not yet reviewed by a lecturer. Practice only, not for marks. (unreviewed)
  • For students of COS 102 and GET 211 whose course is taught in Python. It does not cover COS 201, or courses taught in C, C++ or Java.
  • Every answer in this track was made by CPython 3.14, the standard Python, when the tasks were made. No answer was typed by a person.
  • On a device that can, your programs run in Pyodide, which is CPython inside the browser. It is downloaded once, only when you agree, and stays on the device.
  • Before a task is published, its answers are checked to be the same in Pyodide as in CPython.
  • Programs here read input with input() and print with print(). Words you give to input() are shown, but never compared.
  • Money is in whole naira, so no decimal point can catch a program out. Marks are whole numbers, graded with the NUC table; the pass mark is a setting a lecturer confirms.
  • After these three topics you can predict and dry-run short programs, tell text from numbers and / from //, write if, elif and else with the right boundaries, and trace and write for and while loops. Whether that carries over to paper or a lab computer is not proven: try it there too.

Problem solving

Claim
Problem solving practice for COS 102 and GET 211.
State
Being built: some topics are not ready yet.
Review
Not yet reviewed by a lecturer. Practice only, not for marks. (unreviewed)
  • For students of COS 102 and GET 211, whatever language the course uses. It practises algorithms in steps, flowcharts and dry runs (trace tables), the parts of those courses that paper exams ask about.
  • Nothing here needs a programming language on your device. Every task is a choice, an order or a table you fill, so it works in any browser, including Opera Mini.
  • For now, an algorithm's steps are written as short Python lines, one step a line. A lecturer will choose the pseudocode these tasks are shown in; until then, read each line as one step.
  • Every answer in this track was made by running the steps in CPython 3.14, the standard Python, when the tasks were made. No answer was typed by a person.
  • Flowcharts use the shapes in your course notes: start and stop, input and output, process, and decision.
  • Money is in whole naira and marks are whole numbers; the pass mark is a setting a lecturer confirms.
  • After these three topics you can put an algorithm's steps in order, follow a flowchart with a decision or a loop, and fill a dry run (trace table) for an algorithm that sums, counts or finds the largest. Whether that carries over to a paper exam is not proven: practise on paper too.

Java fundamentals

Claim
Java practice for COS 201 and COS 202.
State
Coming soon.
Review
Not yet reviewed by a lecturer. Practice only, not for marks. (unreviewed)

SQL fundamentals

Claim
SQL practice for DTS 304 and DTS 404.
State
Coming soon.
Review
Not yet reviewed by a lecturer. Practice only, not for marks. (unreviewed)

C fundamentals

Claim
C practice for COS 102, CSC 301 and CSC 308.
State
Coming soon.
Review
Not yet reviewed by a lecturer. Practice only, not for marks. (unreviewed)

Web fundamentals

Claim
HTML practice for IFT 203 and IFT 302.
State
Coming soon.
Review
Not yet reviewed by a lecturer. Practice only, not for marks. (unreviewed)

Data analysis

Claim
Data analysis practice for GET 305 and GET 307.
State
Coming soon.
Review
Not yet reviewed by a lecturer. Practice only, not for marks. (unreviewed)

Engineering numerics

Claim
Engineering numerics practice for GET 210 and GET 211.
State
Coming soon.
Review
Not yet reviewed by a lecturer. Practice only, not for marks. (unreviewed)

Versions

Content: 0.3.0. Engine: codefield-py-0.1.0.

Privacy says what is kept, who can see it and for how long.