Fundamentals of Computer Science - Week 1 (Essential reading) Exercises p. 22, p. 24

TODO

Comments

Post a Comment

Popular posts from this blog

Introduction to Programming - Week 1 and 2 Summary

Image
What is programming? Commands are the smallest building blocks of your program. A single intruction to the computer to perform an action. A program is a collection of these individual ccommands put together in the right order to solve a problem, complete a task, or maybe interact with the user. The collection of commands you write for your program is called source code. 2D coordinate system * Computer screens are made up of tiny dots * Each one of these dots is called pixels * In p5.js we create an area of pixels on a webpage we can draw to: this is called the canvas * A canvas needs a width and height in pixels How you will be assessed?  * New topic every two weeks * This is your first topic (development environment) * Each topic will be divided into a series of lessons * In a lesson you will learn by watching videos * The game keeps a running total of your score which increases as you progress but fixed grades are taken at two points in the term. Each of...
Read more

syllabus: Fundamentals of Computer Science [CM1025]

Course Description Target Audience - Those looking to explore the concepts that underpin modern computer science principles. Learners will begin to appreciate some of the core concepts that form the basis of modern computer systems, how they are designed and built and some of the challenges that they will face in developing their own systems. Content Differentiation - This course covers a variety of concepts, presenting them in a clear, accessible and reasoned way. Concepts are explained through examples and learning is reinforced through a variety of interactive activities. Course Goals and Objectives Upon successful completion of this module, you will be able to: Understand the core concepts that underpin modern computer science. Explain, describe and employ different techniques in both a theoretical and practical way. Appreciate how more complex techniques employ the fundamentals that are covered in this course. Textbook and Readings Specific essential readi...
Read more

Fundamentals of Computer Science - Week 2 (Essential reading) - Part 1 out of 2

Image
Propositional Equivalences An important type of step used in a mathematical argument is the replacement of a statement with another statement with the same truth value. Note that we will use the term “compound proposi- tion” to refer to an expression formed from propositional variables using logical operators, such as p ∧ q. Tautology: compound proposition that is always true Contradiction: compound proposition that is always false Contingency: compound proposition that is neither tautology nor a contradiction Logical Equivalences Compound propositions that have the same truth values in all possible cases are called logically equivalent. We can also define this notion as follows: > The compound propositions p and q are called logically equivalent if p ↔ q is a tautology. The notation p ≡ q denotes that p and q are logically equivalent. Propositional Satisfiability An unsatisfiable compound proposition happens when the negation is a tautology. A satisfiable...
Read more