Courses

Request to be an instructor

This module introduces the fundamental concepts of problem solving by computing and programming using an imperative programming language. It is the first and foremost introductory course to computing and is equivalent to CS1010 and CS1010E Programming Methodology. Topics covered include problem solving by computing, writing pseudo-codes, basic problem formulation and problem solving, program development, coding, testing and debugging, fundamental programming constructs (variables, types, expressions, assignments, functions, control structures, etc.), fundamental data structures: arrays, strings and structures, simple file processing, and basic recursion. 

Good, better, best. Never let it rest. 'Til your good is better and your better is best. - St. Jerome Challenge yourself to be the best you can be by solving these challenges.

CAPT Junior SeminarBadge Icons<div>Icons made by <a href="https://flat-icons.com/" title="Flat Icons">Flat Icons</a> from <a href="https://www.flaticon.com/"     title="Flaticon">www.flaticon.com</a> is licensed by <a href="http://creativecommons.org/licenses/by/3.0/"     title="Creative Commons BY 3.0" target="_blank">CC 3.0 BY</a></div><div>Icons made by <a href="https://smashicons.com/" title="Smashicons">Smashicons</a> from <a href="https://www.flaticon.com/"     title="Flaticon">www.flaticon.com</a> is licensed by <a href="http://creativecommons.org/licenses/by/3.0/"     title="Creative Commons BY 3.0" target="_blank">CC 3.0 BY</a></div>

This module introduces the fundamental concepts of problem solving by computing and programming using an imperative programming language. It is the first and foremost introductory course to computing and is equivalent to CS1010 and CS1010E Programming Methodology. Topics covered include problem solving by computing, writing pseudo-codes, basic problem formulation and problem solving, program development, coding, testing and debugging, fundamental programming constructs (variables, types, expressions, assignments, functions, control structures, etc.), fundamental data structures: arrays, strings and structures, simple file processing, and basic recursion. This module is appropriate for FoS students.

This module aims to introduce non-computing students to the principles and concepts of software development at an accelerated pace.  Students will be introduced to the basics of programming (control flow, code and data abstraction, recursion, types, OO), development methodology (ensuring correctness, testing, debugging), simple data structures and algorithms (lists, maps, sorting), and software engineering principles. Through hands on assignments and projects, students will learn good software development practices (documentation, style) and experience a typical software engineering cycle.

This module aims to introduce non-computing students to the principles and concepts of software development at an accelerated pace.  Students will be introduced to the basics of programming (control flow, code and data abstraction, recursion, types, OO), development methodology (ensuring correctness, testing, debugging), simple data structures and algorithms (lists, maps, sorting), and software engineering principles. Through hands on assignments and projects, students will learn good software development practices (documentation, style) and experience a typical software engineering cycle.

This particular offering will be totally online. This module introduces the fundamental concepts of problem solving by computing and programming using an imperative programming language. It is the first and foremost introductory course to computing and is equivalent to CS1010 Programming Methodology. Topics covered include problem solving by computing, writing pseudo-codes, basic problem formulation and problem solving, program development, coding, testing and debugging, fundamental programming constructs (variables, types, expressions, assignments, functions, control structures, etc.), fundamental data structures: arrays, strings and structures, simple file processing, and basic recursion. This module is appropriate for FoS students.

With COVID-19 rampaging the world, it is only a matter of time before the world descends into chaos. With only 5 months left behind the world is utterly destroyed, you are tasked to learn Python, produce a working program to combat this disease, and save the world from complete annihilation!This course is good for students or adults who have no prior programming experience and want to learn some coding.

SyllabusGEM2006/GET1028 Logic Semester 2, 2019-2020Department of Philosophy, National University of SingaporeInstructor: Dr. Lee Wang YenModular Credits: 4Prerequisite: nilCourse Description:This is an introduction to classical logic. The first half of the course introduces propositional logic, using the techniques of truth-tables and linear proof by contradiction. The second half of the course extends the use of linear proof by contradiction to predicate logic. Emphasis is placed on applying the techniques to philosophical arguments, and on philosophical questions raised by the study of logic.Learning Outcomes:At the end of the module students should be able todemonstrate the skills of translating natural-language arguments into formal-language arguments.show familiarity with basic terminology, concepts, and methods in elementary symbolic logic.demonstrate the skills of providing and refuting deductive arguments in the propositional and predicate/quantificational systemsCourse Outline:topic1Introduction (validity, soundness);2propositional logic (easier translations, simple truth tables, truth evaluations)3propositional logic (unknown evaluations, complex truth tables, the truth-table test, the truth-assignment test)4propositional logic (harder translations, idiomatic arguments)5Propositional logic (S-rules [AND, NIF, NOR⌋ I-rules [CS,DS,MP,MT], mixing S- and I-rules, extended inferences)6propositional proof (easier proofs)mid-semestral break7propositional proofs (easier refutations); test 18propositional proofs (harder proofs, harder refutations)9quantificational logic (easier translations)10quantificational logic (easier proofs)11quantificational logic (easier refutations); test 212quantificational logic (harder translations, harder proofs)13Computerised testUngraded Exercises:Students are assigned two types of math-like exercise. Some of the textbook exercises have to be completed during classes, while computer exercises (LogiCola) are assigned as homework.  Please download the free software from:http://www.harryhiker.com/lc/Doing a lot of exercises is the best way to master logic for most students, as it is a skill-based subject very similar to mathematics. Most of the exercises are quite easy, and completing them will help students do well at tests/exams.Graded Assessment:All tests and exam are OPEN BOOK. All printed or handwritten materials are allowed. No electronic devices are permitted.Test 1                                 ​          ​     – 15%Test 2​          ​          ​          ​          ​        – 15%Computerised test                        – 20%Final Exam                                      – 50%TestsA 30-minute open-book test will be conducted in lecture 7 and another in lecture 11. Each test consists of 10 MCQs. See the lesson plan document for the scope of this test.The test will start after a 45-minute lecture. Please shade your student number on the bubble form before the lecture or during the break. Question papers will be distributed 5 minutes before the test. You are not allowed to shade the bubble form when the time is up.Computerised testStudents will do a 15-minute open book computerised test consisting of 3 formal propositional or quantificational proof/refutation questions in a computer lab during lecture 13.Each student will be assigned to one of the three time-slots: first, second and third 30 minute-slots beginning from the lecture start time. No change of slot is permitted.Final ExaminationYou will sit a 2-hour open book examination consisting of 30 MCQs. The final exam covers all topics.Skipping Tests/ExamThe final exam and ALL tests are strictly compulsory. You cannot be enrolled in this module if your schedule does not allow you to arrive at the lecture theatre or computer lab in time for any of the tests. Your request to be enrolled is seen as an implicit agreement to take all the tests and exam at the prescribed times and venues.If you skip a test or final exam or your performance is adversely affected by some medical and non-medical circumstances, you are entitled to submit the completed Special Consideration Form to your home Faculty Dean’s Office. Whether you’re given a replacement test/exam is entirely up to the Faculty Board of Examiners (BOE).For medical and non-medical circumstances that warrant special consideration, please see the guidelines on special consideration.According to the guidelines, ailments such as a mild cold, headache, sore throat, or low grade fever etc will not constitute sufficient reasons for special consideration. Doctors will be asked to substantiate claims about medical circumstances.If you miss a test with a valid medical leave or leave for an approved activity, please email me. My head of department has the discretion to determine if a substitute assessment can be arranged.In medical cases, if you plan to apply for special consideration in relation to final exam or for a substitute test for CA, please ask the doctor to fill out Part 3A of the special consideration form, downloadable from LUMINUS>Files>CriticalModuleInformation.Textbooks:Main text (required):Gensler, Harry. 2010. Introduction to Logic. 2d ed. New York: Routledge.*available as e-book at NUS library.Supplementary text:Hurley, Patrick. 2012. A Concise Introduction to Logic. 11th Ed. Boston: Wadsworth.

1.1 million prisoners died in Auschwitz, one of the concentration-extermination camps set up by Nazi Germany during World War II. Will you be one of those who survive to the end of the war, and how will your belief in yourself and what the human race is capable of change irreversibly?

This module introduces basic concepts and algorithms in machine learning and neural networks. The main reason for studying computational learning is to make better use of powerful computers to learn knowledge (or regularities) from the raw data. The ultimate objective is to build self-learning systems to relieve human from some of already-too-many programming tasks. At the end of the course, students are expected to be familiar with the theories and paradigms of computational learning, and capable of implementing basic learning systems.Students will be enrolled into the course in batches.  Our Coursemology site will be active only closer to Week 1.  Thanks for your patience.

Complete Quests! Earn XP to become The Supreme Dragon.. in the land of Fantastical English! 

Complete Quests! Earn XP to become The Supreme Dragon.. in the land of Fantastical English! 

An English Course for 3express@Yuhua

Good, better, best. Never let it rest. 'Til your good is better and your better is best. - St. Jerome Challenge yourself to be the best you can be by solving these challenges.

Be an Elite among the Literates.  An English game site for selected Yuhuans.

This course engages students in the examination of world religions, particularly Judaism, Christianity, Islam and the First Nations, Métis and Inuit Spiritualities and a locally appropriate religious tradition. This is a survey course that will help students understand the basic similarities and differences between the religious traditions so they can interact with others with acceptance and familiarity. We live in a multi-faith global community. With the knowledge of this course, students ought to be able to understand more clearly the world’s religious affairs.

You have been accepted as a valiant young soldier to embark on this epic journey to save Euler from the horrible monsters of L!