Everyone:
Next week, we will work on problems related to sequence containers such as arrays, lists, stacks, and queues. While these are rather basic data structures, it is important to understand their properties and behavior, which we will take advantage of in Challenge 01 and Challenge 02.
The readings for this week are:
Competitive Programmer's Handbook
Chapter 4 Data Structures
4.1 Dynamic arrays
4.4 Iterators and ranges
4.5 Other structures
4.6 Comparison to sorting
Data Structures & Algorithm Analysis
Chapter 4 Lists, Stacks, and Queues
Ignore the implementation details and just focus on the overall attributes and behavior of the data structures.
If you are interested in knowing a little more about C++ auto loops, then
check out the following:
Once you have done the readings, answer the following Reading 01 Quiz questions:
To submit you work, follow the same process outlined in Reading 00:
$ git checkout master # Make sure we are in master branch $ git pull --rebase # Make sure we are up-to-date with GitLab $ git checkout -b reading01 # Create reading01 branch and check it out $ cd reading01 # Go into reading01 folder $ $EDITOR answers.json # Edit your answers.json file $ ../.scripts/submit.py # Check reading01 quiz Submitting reading01 assignment ... Submitting reading01 quiz ... Q1 0.50 Q2 0.50 Q3 1.00 Score 2.00 $ git add answers.json # Add answers.json to staging area $ git commit -m "Reading 01: Done" # Commit work $ git push -u origin reading01 # Push branch to GitLab
Remember to create a merge request and assign the appropriate TA from the Reading 01 TA List.