The Official Course Outline now lives in ECOS.
ECOS is UNSW's Enterprise Course Outline Solution.
Course Code | COMP9020 |
Course Title
Textbook |
Foundations of computer science
Epp., Susanna S. (2020): Discrete Mathematics with Applications (Metric Version - Fifth Edition). |
Convenor | Sebastian Sequoiah-Grayson |
Admin |
cs9020@cse.unsw.edu.au
|
Classes |
Lectures
:
Mondays 12:00 - 14:00 - Mathews Theatre B (K-D23-203). Tuesdays 16:00 - 18:00 - Mathews Theatre B (K-D23-203) |
Consultations | Seb's office - Room 212 in Building K17. By appointment or just drop by anytime : ) |
Units of Credit | 6 |
Course Website | http://cse.unsw.edu.au/~cs9020/24T2/ |
Handbook Entry | https://www.handbook.unsw.edu.au/postgraduate/courses/2024/COMP9020?year=2024 |
Student Reps |
Please email the stureps if you have any concerns with this course that you think might require student representation. They will pass these concerns on anonymously to the relevant people in order to to get
the issues resolved - stureps@cse.unsw.edu.au.
NOTE - Please do not email the stureps for course-admin issues. For course-admin issues, email admins TBC |
In this course we will use the following textbook:
- Epp., Susanna S. (2020): Discrete Mathematics with Applications (Metric Version - Fifth Edition.
We cover everything from the basics of formal argumentation, propositional and predicate logics, number theory, mathematical induction and recursion, set theory, functions and relations, probability, graph theory and trees.
PLEASE COME TO THE IN-PERSON LECTURES...THERE WILL BE HILARITY : )
NOTE - TUTORIALS START IN WEEK 1
Please make sure you have a copy of the follwoing textbook:
Epp., Susanna S. (2020): Discrete Mathematics with Applications (Metric Version - Fifth Edition), Cengage Publishing.
After completing this course, students will be able to:
CLO1 : Understand the foundational structures used in discrete mathematics
CLO2 : Understand the fundamental Computer Science concepts of recursion and induction
CLO3 : Understand Boolean, propositional, and predicate logic
CLO4 : Understand simple combinatorics, probability and statistics
CLO5 : Understand and apply the fundamental properties of functions and relations
CLO6 : Apply mathematical tools to formulate and prove problems in Computer Science
Item | Topics | Due | Marks | |
Problem Sets |
Please see Course Schedule below.
|
Please see Course Schedule below. | 8 x Problem Sets at 5% each = 40% of final mark in total | |
Final Exam | Everything | Examination Period - timed and date TBC | 60% of final mark | |
|
||||
|
||||
Week | Lectures | Textbook Chapter | Problem set released | Problem set due | ||
W1 |
L1 - Introduction - Variables, Sets, Relations, Functions, and Graphs.
L2 - Logic (Propositional) |
L1 - Ch. 1, 1.1 - 1.4.
L2 - Ch. 2, 2.1-2.3. |
|
|||
W2 |
L1 - Logic (Propositional and Predicate)
L2 - Logic (Predicate - continued) |
L1 - Ch. 3, 3.1-3.4.
L2 - Ch. 3, 3.1-3.4 (cont.). |
Problem Set 1 released on webcms | |||
W3 |
L1 - Number Theory
L2 - Number Theory (continued) |
L1 - Ch. 4, 4.1-4.5, 4.7.
L2 - Ch. 4. .4, 4.1-4.5, 4.7 (cont.). |
Problem Set 2 released on webcms |
Problem Set 1 due on Moodle |
||
W4 |
L1 - Mathematical Induction
L2 - Recursion |
L1 - Ch. 5, 5.1, 5.2, 5.6, 5.7.
L2 - Ch. 5, 5.1, 5.2, 5.6, 5.7 (cont.). |
Problem Set 3 released on webcms | Problem Set 2 due on Moodle | ||
W5 |
L1 - Set Theory
L2 - Set Theory (continued) |
L1 - Ch. 6, 6.1.
L2 - Ch. 6.2 - 6.4. |
Problem Set 4 released on webcms | Problem Set 3 due on Moodle | ||
W6 | FLEX WEEK | FLEX WEEK | FLEX WEEK | FLEX WEEK | ||
W7 |
L1 - Functions and their Properties
L2 - Functions and their Properties (continued) |
L1 - Ch. 7, 7.1-7.3.
L2 - Ch. 7, 7.1-7.3 (cont.). |
Problem Set 5 released on webcms | Problem Set 4 due on Moodle | ||
W8 |
L1 - Relations and their Properties
L2 - Relations and their Properties (continued) |
L1 - Ch. 8, 8.1-8.3, 8.5.
L2 - Ch. 8, 8.1-8.3, 8.5 (cont.). |
Problem Set 6 released on webcms | Problem Set 5 due on Moodle | ||
W9 |
L1 - Probabilities
L2 - Probabilities (continued) |
L1 - Ch. 9, 9.1-9.4.
L2 - Ch. 9, 9.1-9.4 (cont.). |
Problem Set 7 released on webcms | Problem Set 6 due on Moodle | ||
W10 |
L1 - Graphs and Trees
L2 - Graphs and Trees (continued) |
L1 - Ch. 10, 10.1, 10.4.
L2 - Ch. 10, 10.1-10.4 cont.). |
Problem Set 8 released on webcms | Problem Set 7 due on Moodle | ||
11 | Problem Set 8 due on Moodle | |||||
12 | Good luck with your exams! |
|
Epp., Susanna S. (2020): Discrete Mathematics with Applications (Metric Version - Fifth Edition), Cengage Publishing.
This course is evaluated each session using the MyExperience system.
Everyone's feedback throughout and at the end of the term is very valuable.
Remember - we need you! Thanks for reading all of this - see you in the lectures :)
Be excellent to each other.
Be excellent to yourselves.
Also the following is wordy, but important - The Student Code of Conduct ( Information , Policy ) sets out what the University expects from students as members of the UNSW community. As well as the learning, teaching and research environment, the University aims to provide an environment that enables students to achieve their full potential and to provide an experience consistent with the University's values and guiding principles. A condition of enrolment is that students inform themselves of the University's rules and policies affecting them, and conduct themselves accordingly.
In particular, students have the responsibility to observe standards of equity and respect in dealing with every member of the University community. This applies to all activities on UNSW premises and all external activities related to study and research. This includes behaviour in person as well as behaviour on social media, for example Facebook groups set up for the purpose of discussing UNSW courses or course work. Behaviour that is considered in breach of the Student Code Policy as discriminatory, sexually inappropriate, bullying, harassing, invading another's privacy or causing any person to fear for their personal safety is serious misconduct and can lead to severe penalties, including suspension or exclusion from UNSW.
If you have any concerns, you may raise them with your lecturer, or approach the School Ethics Officer , Grievance Officer , or one of the student representatives.
Plagiarism is defined as using the words or ideas of others and presenting them as your own. UNSW and CSE treat plagiarism as academic misconduct, which means that it carries penalties as severe as being excluded from further study at UNSW. There are several on-line sources to help you understand what plagiarism is and how it is dealt with at UNSW:
Make sure that you read and understand these. Ignorance is not accepted as an excuse for plagiarism. In particular, you are also responsible that your assignment files are not accessible by anyone but you by setting the correct permissions in your CSE directory and code repository, if using. Note also that plagiarism includes paying or asking another person to do a piece of work for you and then submitting it as your own work.
UNSW has an ongoing commitment to fostering a culture of learning informed by academic integrity. All UNSW staff and students have a responsibility to adhere to this principle of academic integrity. Plagiarism undermines academic integrity and is not tolerated at UNSW. Plagiarism at UNSW is defined as using the words or ideas of others and passing them off as your own.
If you haven't done so yet, please take the time to read the full text of
The pages below describe the policies and procedures in more detail:
You should also read the following page which describes your rights and responsibilities in the CSE context:
Auf...okay that was pretty long. Are you still reading this? Good. The next bit is about assessments and the course schedule....
Resource created Thursday 16 May 2024, 04:31:33 PM, last modified Saturday 10 August 2024, 08:28:38 PM.