-
About Me
-
Hey! My name is Rose.
I am learning to code at 37 years old. -
Find me on Youtube!
-
Get notified
-
-
Latest Posts
-
Archives
-
Important Notes
-
First Webinar - Oct 17- DM Notations
- Midterms - Jan. 8, 2024
- Finals - Mar. 5, 2024
-
Review Maths
-
Resources
-
2023 PBA April Term 2023 PBA October Term BSc Computer Science Business Analytics Nanodegree Udacity Challenge: Front End Developer CM1020 Codeacademy Code Foundations - Code Academy Coursera CS50 CSS CSS Grid Discrete Mathematics Google IT Support Professional Certificate HarvardX ITP1 Teamtreehouse Udacity University of London UoL RPL
Tag Archives: BSc Computer Science
Day 49 – The Language of Sets
The foundation of set theory was laid by the eminent German Mathematician Georg Cantor during the latter part of the 19th century. The following are some of the problems we shall pursue in this chapter: Set is a collection of … Continue reading
Day 48 – Set Operations
Union (A U B) Given two sets A and B, the union of A and B, AUB, contains all the elements in EITHER A or B. A union B is equals to x, where x is an element of A … Continue reading
Posted in Study Notes
Tagged 2023 PBA October Term, BSc Computer Science, CM1020, Discrete Mathematics
Leave a comment
Day 47 – Powerset of a Set
Notations Subset(recap) A set can have another set as its element. Quick Review: Difference between subset and proper subset: Subset: If every element of 1st set is contained in the 2nd set, then the 1st set is called the subset … Continue reading
Day 46 – Set Representation
Set Representation Listing Method Representing a set S using the listing method consists of listing all the elements of S. S1 = set of all vowels in the English alphabet S1 = {a, e, i, o, u} (listing method) S2 … Continue reading
Day 45 – Intro to Discrete Mathematics
Discrete mathematics is the study of discrete objects, which are different from connected objects. Discrete objects are those which are separated or distant from each other. Such as integers, rational numbers, houses, people, etc. Syllabus Sets Set E – set … Continue reading
Day 39 – ITP1 Constructor Function
constructor function – instead of as writing out our objects one by one, we create a blueprint that we can use to create as many objects as we need and keep our code modular.
Posted in Study Notes
Tagged 2023 PBA April Term, BSc Computer Science, ITP1, University of London
Leave a comment
Day 38 – ITP1 Extending Objects
this – allows us to access the properties of an object from within itself
Posted in Study Notes
Tagged 2023 PBA April Term, BSc Computer Science, ITP1, University of London
Leave a comment
Day 37 – ITP1 Methods
Methods – when we put functions in an objects. It can returns values. Objects are made up of properties, which are the attributes or the thing you are trying to model, and methods which are the things the objects can … Continue reading
Posted in Study Notes
Tagged 2023 PBA April Term, BSc Computer Science, ITP1, University of London
Leave a comment
Day 36 – ITP1 Search Patterns
In the example below, the for loop code returns all the placement index with the value 42 – 265, 272, and so on. And the final value returns the last index 993. But we’re looking for the first index, so … Continue reading
Posted in 6-Month Journey, Study Notes
Tagged 2023 PBA April Term, BSc Computer Science, ITP1, University of London
Leave a comment
Day 35 – ITP1 Arrays of Objects
Complex Objects Properties
Posted in 6-Month Journey, Study Notes
Tagged 2023 PBA April Term, BSc Computer Science, ITP1, University of London
Leave a comment