ISYS2120 Data and Information Management
ISYS2120 Overview
- The University of Sydney
- Semester 2 2026
- Level 2
- Closed book final exam
Data and Information Management develops the reasoning needed to represent organisational data and retrieve it reliably. The available University teaching material begins with the purpose of database management systems and the separation between user views, conceptual structure and physical storage.
- Assessed by SQL tasks, quizzes, modelling and a final exam
- Core method Model meaning before syntax
- How to prepare Predict, test and explain each result
How ISYS2120 is assessed
| Component | Weight | Format |
|---|---|---|
| Final Exam · hurdle | 50% | Two-hour in-person handwritten paper in the formal examination period |
| weekly quizzes | 21% | Secure online quizzes completed in tutorial classes |
| SQL tasks | 6% | Online tasks that produce SQL queries for given output |
| Early feedback quiz | 3% | Multiple-choice quiz completed in a tutorial class |
| Conceptual Model Assignment | 10% | Group production of a conceptual model for a domain |
| SQL Online Quiz | 10% | Fifty-minute task producing SQL queries for information needs |
The six weighted assessment rows total 100%. The Final Exam is a hurdle task: the unit materials state that students must achieve at least 40% in the final examination and an overall final mark of 50 or more. The official unit outline also lists a zero-weight Exam practice assignment, which is not included in the numeric total.
What ISYS2120 covers
The available teaching sequence moves from database systems and relational structure into conceptual modelling, SQL querying and definition, schema mapping, relational algebra and advanced query patterns. Each module pairs formal vocabulary with fresh domains, counterexamples and result checks.
Database Foundations and Relations
DBMS purpose, abstraction levels, relations, domains and keys02Entity Relationship Modelling
Entities, attributes, relationships, participation and subtypes03SQL Query Foundations
Selection, projection, joins, NULL, grouping and query testing04SQL Definition and Schema Design
DDL constraints, referential actions and ER mapping decisions05Relational Algebra and Advanced SQL
Relational operators, division, subqueries and universal conditionsIt then develops the relational model through relations, tuples, attributes, domains and keys. Conceptual modelling turns domain statements into entities, relationships, attributes, participation and cardinality constraints. SQL work connects information needs to selection, projection, joins, aggregation, nested queries and result testing.
Definition work uses types, primary keys, foreign keys and other constraints to reject invalid states. Relational algebra provides an independent way to expose query structure and reason about selection, projection, joins, set operators and division. The study method throughout this guide is consistent: model meaning before syntax, write assumptions, predict the smallest result, and test a counterexample.
Start every task by separating the domain fact from its representation. A customer, booking or workshop is not a table merely because it appears as a noun; identity and relationships determine the model. Likewise, an English request is not a query until its required inputs, predicates and output are explicit.
After drafting an answer, create a tiny dataset that includes an ordinary match, an unmatched row, a duplicate and a missing value where relevant. Predict the result by hand. This turns testing into evidence about meaning rather than a search for syntax that happens to run. For modelling questions, read cardinality and participation in both directions and state assumptions where the requirement is silent.
For definition questions, explain which invalid state each constraint rejects. For algebra and SQL, show intermediate relations so that an accidental product, misplaced filter or reversed universal condition becomes visible. The available material for this edition covers these foundations through conceptual modelling and advanced SQL.
Later areas named by the unit introduction are identified as a teaching-material gap and are not reconstructed from general database knowledge.
Diagnose a query before running it
- +1Start from every depot because all depots must remain visible.
- +1Use a left join to matching open loans so unmatched depots survive with NULL on the loan side.
- +1Group by the depot identifier and count a loan-side key, not every joined row.
- +1Test one empty depot: it must appear with a count of zero.
Key terms
- Database management system
- A database management system coordinates persistent data, metadata, queries, integrity, concurrency, recovery and controlled access.
- Relation
- A relation is a set of tuples described by a relation schema of named attributes and domains.
- Candidate key
- A candidate key is any attribute combination that can distinguish each tuple.
- Foreign key
- A foreign key is an attribute set whose values reference a candidate key in a target relation.
- Entity type
- An entity type groups distinguishable domain objects that share attributes and identity rules.
- Cardinality constraint
- A cardinality constraint limits how many relationship counterparts an entity may have.
- Selection
- Selection is the relational algebra operator that keeps tuples satisfying a predicate.
- Projection
- Projection is the relational algebra operator that retains named attributes.
ISYS2120 FAQ
How is the unit assessed?
Assessment combines SQL tasks, tutorial quizzes, an early feedback quiz, a conceptual model group assignment, an SQL online quiz and a paper-based final examination. The weighted rows total 100%, and the final examination carries a stated hurdle.
What is the best way to learn SQL?
Translate each request into required inputs, predicates and output columns before typing. Predict a small result by hand, include duplicates and NULLs in test data, then compare intermediate rows rather than judging only the final table.
How should I practise conceptual modelling?
Use short domain statements and justify each entity, relationship, attribute, cardinality and participation choice. Test the diagram with a valid story and a counterexample, and write down any assumption the requirements do not settle.
Why learn relational algebra alongside SQL?
Relational algebra makes query structure explicit. Selection, projection, joins, set operators and division provide a second representation that helps reveal accidental products, incompatible inputs and universal conditions hidden inside SQL syntax.
What should I revise before the final examination?
Prioritise precise vocabulary, ER constraint reading, SQL result prediction, key and foreign-key behaviour, mapping decisions, relational operators and nested universal queries. Practise explaining assumptions and boundary tests without relying on software.
How to study for the exam
Study by alternating construction and refutation. Build a model or query from a small requirement, then attack it with an empty input, an unmatched row, a duplicate, a NULL or an invalid reference as appropriate. Keep a notebook of minimal counterexamples and the rule each one tests. For SQL, write the expected intermediate relation before execution. For ER diagrams, verbalise cardinality and participation in both directions.
For relational algebra, check operator inputs and headings. This routine prepares you for secure tutorial tasks as well as the closed-book final examination because it makes the reasoning portable instead of tying it to one familiar example. End each session by explaining one correction aloud in domain language and formal database language.
If those explanations disagree, revisit the assumption before practising another problem.
Your AI Information Technology tutor for ISYS2120
Stuck on a hard ISYS2120 question? Sia is AskSia’s AI Information Technology tutor — ask any ISYS2120 Data and Information Management question and get a clear, step-by-step explanation grounded in how the course is actually taught and assessed. Read this whole study guide free, then take your hardest questions to Sia.