JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

updating notes

Browse Source
This commit is contained in:
Jidong Xiao
2024-01-16 16:28:19 -05:00
parent 35559dd585
commit d2ef1598e5
1 changed files with 14 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files

28
lectures/04_classes_II/README.md
View File

@@ -1,8 +1,8 @@
# Test 1 Information <!--# Test 1 Information
<!-- – Students will be randomly assigned to a test room and seating zone – will be on Submitty Wednesday – Students will be randomly assigned to a test room and seating zone – will be on Submitty Wednesday
morning. morning.
– If you haven’t filled out the “Left or Right Handed” gradeable by Tuesday night, we will assume you are – If you haven’t filled out the “Left or Right Handed” gradeable by Tuesday night, we will assume you are
right handed. This is used for seating assignments.--> right handed. This is used for seating assignments.
- Test 1 will be held **Thursday, 09/21/2023 from 6-7:50pm**. - Test 1 will be held **Thursday, 09/21/2023 from 6-7:50pm**.
– No make-ups will be given except for pre-approved absence or illness, and a written excuse from the Dean – No make-ups will be given except for pre-approved absence or illness, and a written excuse from the Dean
of Students or the Student Experience office or the RPI Health Center will be required. of Students or the Student Experience office or the RPI Health Center will be required.
@@ -10,30 +10,30 @@ of Students or the Student Experience office or the RPI Health Center will be re
ds_instructors@cs.rpi.edu, please do so ASAP. Shianne Hulbert will be in contact with you about ds_instructors@cs.rpi.edu, please do so ASAP. Shianne Hulbert will be in contact with you about
your accommodations for the test. your accommodations for the test.
- Coverage: Lectures 1-6, Labs 1-3, and Homeworks 1-2. - Coverage: Lectures 1-6, Labs 1-3, and Homeworks 1-2.
<!-- – Practice problems from previous exams are available on the course website (Friday morning). Solutions – Practice problems from previous exams are available on the course website (Friday morning). Solutions
to the problems will be posted Monday morning. The best way to prepare is to completely work through to the problems will be posted Monday morning. The best way to prepare is to completely work through
and write out your solution to each problem, before looking at the answers.--> and write out your solution to each problem, before looking at the answers.
- OPTIONAL: you are allowed two physical pieces of 8.5x11” paper, that’s four “sides”. We will not collect these electronically and we will not pre-print them, you will have to bring these notes pages yourself if you want them. We will check at the start of the exam that you do not have more than two pieces of paper for your notes! - OPTIONAL: you are allowed two physical pieces of 8.5x11” paper, that’s four “sides”. We will not collect these electronically and we will not pre-print them, you will have to bring these notes pages yourself if you want them. We will check at the start of the exam that you do not have more than two pieces of paper for your notes!
<!-- - OPTIONAL: Prepare a 2 page, black & white, 8.5x11”, portrait orientation .pdf of notes you would like to - OPTIONAL: Prepare a 2 page, black & white, 8.5x11”, portrait orientation .pdf of notes you would like to
have during the exam. This may be digitally prepared or handwritten and scanned or photographed. The file have during the exam. This may be digitally prepared or handwritten and scanned or photographed. The file
may be no bigger than 2MB. You will upload this file to Submitty (“Test 1 Notes Upload”) before Wednesday may be no bigger than 2MB. You will upload this file to Submitty (“Test 1 Notes Upload”) before Wednesday
night @11:59pm. We will print this and attach it to your exam. Make sure you get credit for test case 2 and night @11:59pm. We will print this and attach it to your exam. Make sure you get credit for test case 2 and
that you view the details to verify your sheet looks correct. You cannot bring your own cribsheet, you must that you view the details to verify your sheet looks correct. You cannot bring your own cribsheet, you must
submit one electronically. submit one electronically.
IMPORTANT: Using third party websites to make a PDF may generate an invalid PDFs that prints weird. Your IMPORTANT: Using third party websites to make a PDF may generate an invalid PDFs that prints weird. Your
word processor’s -> save as/export to PDF, or Google Docs -> Download -> PDF should be safe.--> word processor’s -> save as/export to PDF, or Google Docs -> Download -> PDF should be safe.
- Bring to the exam room: - Bring to the exam room:
– Your Rensselaer photo ID card. – Your Rensselaer photo ID card.
– Pencil(s) & eraser (pens are ok, but not recommended). The exam will involve handwriting code on paper (and other short answer problem solving). Neat legible handwriting is appreciated. We will be somewhat forgiving to minor syntax errors – it will be graded by humans not computers. – Pencil(s) & eraser (pens are ok, but not recommended). The exam will involve handwriting code on paper (and other short answer problem solving). Neat legible handwriting is appreciated. We will be somewhat forgiving to minor syntax errors – it will be graded by humans not computers.
– Computers, cell-phones, smart watches, calculators, music players, etc. are not permitted. Please do not bring your laptop, books, backpack, etc. to the exam room – leave everything in your dorm room. Unless you are coming directly from another class or sports/club meeting. – Computers, cell-phones, smart watches, calculators, music players, etc. are not permitted. Please do not bring your laptop, books, backpack, etc. to the exam room – leave everything in your dorm room. Unless you are coming directly from another class or sports/club meeting.
<!-- – Do not bring your own scratch paper. We will provide scratch paper. --> – Do not bring your own scratch paper. We will provide scratch paper. -->
# Lecture 5 --- Classes II: Sort, Non-member Operators # Lecture 4 --- Classes II: Sort, Non-member Operators
- Classes in C++; - Classes in C++;
- Non-member operators - Non-member operators
## 5.1 C++ Classes ## 4.1 C++ Classes
- Nuances to remember - Nuances to remember
@@ -42,7 +42,7 @@ that class may be accessed without providing the name of the class object.
- Within a member function, when an object of the same class type has been passed as an argument, direct - Within a member function, when an object of the same class type has been passed as an argument, direct
access to the private member variables of that object is allowed (using the ’.’ notation). access to the private member variables of that object is allowed (using the ’.’ notation).
## 5.2 Operator Overloading ## 4.2 Operator Overloading
- When sorting objects of a custom class, we can provide a third argument to the sort function, and this third argument is a comparison function. - When sorting objects of a custom class, we can provide a third argument to the sort function, and this third argument is a comparison function.
- What if we do not want to provide this third argument? The answer is: define a function that creates a < operator for objects of that class! At first, this seems a bit weird, but it is extremely useful. - What if we do not want to provide this third argument? The answer is: define a function that creates a < operator for objects of that class! At first, this seems a bit weird, but it is extremely useful.
@@ -67,13 +67,13 @@ will sort Date objects into chronological order.
- Really, the only weird thing about operators is their syntax. - Really, the only weird thing about operators is their syntax.
- We will have many opportunities to write operators throughout this course. Sometimes these will be made class member functions, but more on this in a later lecture. - We will have many opportunities to write operators throughout this course. Sometimes these will be made class member functions, but more on this in a later lecture.
## 5.3 Questions ## 4.3 Questions
- Can you solve leetcode problem 905 with an overloaded operator &lt;, and make this overloaded operator &lt; a non-member function? - Can you solve leetcode problem 905 with an overloaded operator &lt;, and make this overloaded operator &lt; a non-member function?
- Can you solve leetcode problem 905 with an overloaded operator &lt;, and make this overloaded operator &lt; a member function? - Can you solve leetcode problem 905 with an overloaded operator &lt;, and make this overloaded operator &lt; a member function?
- Can you solve leetcode problem 905 with an overloaded operator &lt;, and make this overloaded operator &lt; a member function, plus make the definition of this member function outside of the class definition? - Can you solve leetcode problem 905 with an overloaded operator &lt;, and make this overloaded operator &lt; a member function, plus make the definition of this member function outside of the class definition?
## 5.4 Copy Constructor ## 4.4 Copy Constructor
- A copy constructor is a constructor which is used to create a new object as a copy of an existing object of the same class. - A copy constructor is a constructor which is used to create a new object as a copy of an existing object of the same class.
- Copy constructors are automatically generated by the compiler if you do not provide one explicitly. However, if your class uses dynamic memory (which will be covered in next lecture), and you want a copy constructor, then you must write your own copy constructor. - Copy constructors are automatically generated by the compiler if you do not provide one explicitly. However, if your class uses dynamic memory (which will be covered in next lecture), and you want a copy constructor, then you must write your own copy constructor.
@@ -93,7 +93,7 @@ Date b = a;
The first statement will call the default constructor, while the second statement will call the copy constructor. The first statement will call the default constructor, while the second statement will call the copy constructor.
## 5.5 Exercises ## 4.5 Exercises
- [Leetcode problem 56: Merge Intervals](https://leetcode.com/problems/merge-intervals/). Solution: [p56_mergeintervals.cpp](../../leetcode/p56_mergeintervals.cpp) - [Leetcode problem 56: Merge Intervals](https://leetcode.com/problems/merge-intervals/). Solution: [p56_mergeintervals.cpp](../../leetcode/p56_mergeintervals.cpp)
- [Leetcode problem 905: Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity/). Solution: [p905_sortarraybyparity.cpp](../../leetcode/p905_sortarraybyparity.cpp) - [Leetcode problem 905: Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity/). Solution: [p905_sortarraybyparity.cpp](../../leetcode/p905_sortarraybyparity.cpp)