FIT1058
Foundations of computing
基本信息
| 学分 | 6 credit points |
|---|---|
| 开课学期 | First semester / October intake teaching period, Malaysia campus / Second semester |
| 校区 | Malaysia |
| 考核构成 | Assessed Quizzes — 10% Assignment 1: Introduction to Computational Thinking — 10% Assignment 2: Formal Methods and Logical Reasoning — 25% Mid-semester test — 15% Scheduled final assessment (3 hours and 10 minutes): — 40% |
开课安排3 条
| 教学期 | 授课方式 | 状态 |
|---|---|---|
| First semester | Teaching activities are on-campus (ON-CAMPUS) | 开课 |
| Second semester | Teaching activities are on-campus (ON-CAMPUS) | 开课 |
| October intake teaching period, Malaysia campus | Teaching activities are on-campus (ON-CAMPUS) | 开课 |
以上为该校区在官方资料中登记的全部开课安排，不是汇总。同一门课可能在多个 教学期开课，也可能不同教学期的授课方式不同。
课程简介
Computation uses abstract formal models of real objects and systems. This unit lays the theoretical foundations for working with the most fundamental abstract models used in computer science, including relations, sequences, trees and graphs. It will develop skills in abstract modelling, logical reasoning, rigorous proof, formal analysis, enumeration and probability. These concepts and skills will be taught in a variety of contexts from across computer science.
以上为 Monash Handbook 的官方原文，版权属 Monash University，此处按本站要求转载并标注出处： 官方页面 ↗
学习成果6 条
官方原文（Learning outcomes），版权属 Monash University。
- ULO1 Define discrete structures and key concepts commonly found in set theory, logic and proof, number theory, probability, combinatorics, graph theory, and related fields underlying computer science;
- ULO2 Solve problems in computer science using a variety of objects and structures, including sets, functions, relations, graphs, matrices and random variables;
- ULO3 Analyse complex formal statements, formally define discrete structures, and prove properties about them using a wide range of techniques, including proof by construction, by cases, by contradiction and by induction;
- ULO4 Use the language of propositional and predicate logic to formally model and reason about problems in computer science and its applications;
- ULO5 Apply precise counting principles and the tools of probability, number theory, and combinatorics to problems in computer science;
- ULO6 Relate areas of computer science with appropriate discrete structures and methods.
教学方式与预期工作量
预期工作量
Minimum total expected workload to achieve the learning outcomes for this unit is 144 hours per semester typically comprising a mixture of scheduled online and face to face learning activities and independent study. Independent study may include associated reading and preparation for scheduled teaching activities.
官方原文，版权属 Monash University。
先修 / 同修要求
官方资料未列出该课程的先修要求。
同修要求（必须在同一学期一起修）
同修课和先修课不是一回事：先修是修过才能选，同修是必须同期一起选。原始记号：FIT1045 OR FIT1053 OR ENG1013 OR ENG1014
修完这门课可以衔接
先修链路
官方资料未列出该课程的先修要求，因此没有链路可画。
互斥课程1 门
这些课和本课内容重叠，不能同时算进同一个学位（官方目录的 Prohibition 字段）。选了其中一门，另一门通常只能算选修学分甚至完全不计—— 这跟先修不同，先修是"没修过就不能选"，互斥是"修了也不能两门都算"。
原始记号：MAT1830
属于这些学位2 个
这门课出现在下列学位的官方结构里。反过来说：如果你读的是这些学位之一，它大概率是要修的 （必修还是选修取决于它在 Part 里的位置，点进去看结构）。
数据来源
- 数据来源
- 官方网页
handbook.monash.edu ↗ - 抓取时间
- 2026-09-13
- 可信度
- 程序抓取，未人工核实
查看官方完整描述 ↗ — 事实性字段（代码、学分、教学期、授课方式、考核权重、先修/同修/互斥关系）与 课程简介、学习成果、教学方式、预期工作量均取自官方 Handbook； 正文版权属 Monash University，此处转载并逐处标注出处。
发现信息有误？告诉我们。请用自己的话描述问题，不要上传成绩单、截图或校内系统文件。