DISCRETE STRUCTURES 1
- Module code: CS151
- Credits: 5
- Semester: 2
- Department: COMPUTER SCIENCE
First Order Logic and proof strategies for reasoning about programs. Basic set and bag definitions, operations, and properties. Using functions to solve problems: to include definitions of function domain, range, image, composition, identity, inverse, abstraction, application, total & partial functions, injections, bijections & surjections. Reasoning using First Order Logic: truth tables, use of conjunction, disjunction, implication, negations, equivalence rules, assertions, tautologies, contradictions, universal and existential quantifiers. Representing natural language in a formal logic and proving the validity of logical statements using proof by contradiction and natural deduction.
On successful completion of the module, students should be able to:
|Teaching & Learning methods|
Timetable under review
The Lectures timetable allows you to search by most courses that are offered by the University.
The Venues timetable allows you to search the timetable by venue.
The Departments timetable allows you to search the timetable by department.
The Students timetable is a personalised timetable. The student is required to login using their Student ID and Password.