Data Structures and Programming C++

For week 1, please choose an area of interest to you, choose a specific example of that area--such as the settings for your favorite game, your movie collection, the way folks are organized at your work, etc. Use the symbols on our data structures posters to create your own diagram of your chosen object/process.

Remember, we might have nested structures, such as a list of smaller lists, or a tree filled with lists of items within each node.

Take a photo/scan your diagram and upload it to the module 1 folder in our shared drive linked below, name your file your FIRST NAME only.

cloud_upload

Root of DS cloud MS OneDrive

Please have your team optimizer in a fully-baked form by Sunday at Morning light for instructor review and planing for our next phase of the course.

1. Fully-bake your team optimizer project if already done, and make an entry in the "ready for instructor review" column
2. Study sections 8.4 and 8.5. and 17.3 and 17.4, and 17.9: Try typing in and tinkering with examples from the book
3. Easy TODO: Bring a set of items "collectible" to the zoom meeting and prepare to search through them, and model in a C++ class. (e.g. a stack of books, kitchen itensils, food items, coins, pens & pencils)
4. For Monday: Please create a simple program that includes a object model of your chosen item and demonstrates creating one or more instances of your model and manipulating its member variables. See Chapter 9: Technicalities, Classes, etc.

STEP 1: Create a class representing your chosen collectible object that includes private members and public accessor methods and a constructor

STEP 2: Use your class in a simple program and create a vector of several of your objects for use in our sorting exercise next week.

STEP 3: Demonstrate as we did in class on Wednesay, that you in fact have multiples different objects with different member variables.

STEP 4: Begin the design process by tinkering with the bubble sort visualization linked at left, and relying only on pseudocode, not other folks' C++

IDEA: Investigate (try in documentation, not stack overflow) how to randomly create values for the various objects in your vector.

For Monday: please setup an account on GitHub.com

1. Fully bake your sorting project for Monday, 5 October
2. Make a good-faith effort at pushing your project to your git rep

For Monday, build three trees like Eric's Nuclea reactors, randomly choosing a root node and record how many visits in your tree are required to find a pre-selected random node.

Attempt to diagram out a in-order walk of one of your trees, using the recursive algorithm in the Corman text posted in Resources of our tree module

Take a photo of your work, and upload to one-drive.

cloud_upload

Root of DS cloud MS OneDrive

For wed, 14 Oct, Please have your custom tree encoded in at least 10 nodes--manually building each node and making the links from parent to child and child to parent

Conduct an in-order walk of your tree and demonstrate that it works

Try coding up a function which can take in a root of a tree and a node to insert, and it will carry out the locating and linking of the new node.

For Monday, 19-OCT: If you haven't gotten traversal to work, iron that out. Make a good-faith effort at insertion function, but if you get stuck, that's fine.

We'll plan on Wrapping up Tree traverse, insert, and delete for Wed 21-OCT, or Mon 26-OCT

Binary search tree code due Monday 26 October

Arrive at a fully-baked project, regardless of its level of complexity. Include well-commented code, output screen shots, and a profile written in a readme.md markdown file on git.

Create a set of state diagrams in a search tree representing the possible ways of solving the Interstellar problem using Vacuum world as a guide and your reading's description of problem definitions.

Make an attempt at coding the guts of our expand_node function which takes in a state and returns a set of child nodes containing information about which actions would lead to that node. Build other infrastructure as needed in our SearchTools class.

For Wednesday: Dedicate an hour or so to reviewing pointer fundamentals and consider their use in your project. See Stroustrup Section 17.3: Memory, Addresses, and pointers