haas:summer2017:discrete:projects
Differences
This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
| haas:summer2017:discrete:projects [2016/12/12 18:06] – external edit 127.0.0.1 | haas:summer2017:discrete:projects [2017/06/29 19:25] (current) – [Projects] wedge | ||
|---|---|---|---|
| Line 6: | Line 6: | ||
| ======Projects====== | ======Projects====== | ||
| - | * [[/haas/fall2016/ | + | * [[/haas/summer2017/ |
| - | * [[/haas/fall2016/ | + | * [[/haas/summer2017/ |
| - | * [[/haas/fall2016/ | + | * [[/haas/summer2017/ |
| - | * [[/haas/fall2016/ | + | * [[/haas/summer2017/ |
| - | * [[/haas/fall2016/ | + | * [[/haas/summer2017/ |
| - | * [[/haas/fall2016/ | + | * [[/haas/summer2017/ |
| - | * [[/haas/fall2016/ | + | * [[/haas/summer2017/ |
| - | * [[/haas/fall2016/ | + | * [[/haas/summer2017/ |
| - | * [[/haas/fall2016/ | + | * [[/haas/summer2017/ |
| - | * [[/haas/fall2016/ | + | * [[/haas/summer2017/ |
| - | * [[/haas/fall2016/ | + | * [[/haas/summer2017/ |
| - | * [[/haas/fall2016/ | + | * [[/haas/summer2017/ |
| - | * [[/haas/fall2016/ | + | * [[/haas/summer2017/ |
| - | * [[/haas/fall2016/ | + | * [[/haas/summer2017/ |
| - | * [[/ | + | * [[/haas/summer2017/ |
| - | * [[/ | + | * [[/haas/summer2017/ |
| - | * [[/haas/fall2016/ | + | * [[/haas/summer2017/ |
| - | * [[/haas/fall2016/ | + | |
| - | * [[/haas/fall2016/ | + | |
| - | * [[/ | + | |
| - | * [[/ | + | |
| - | * [[/ | + | |
| - | * [[/ | + | |
| - | * [[/ | + | |
| - | * EoCE (bottom of your journal) (due 20161216-105959) | + | |
| ======Class Stats====== | ======Class Stats====== | ||
| - | * [[/haas/fall2016/ | + | * [[/haas/summer2017/ |
| - | ======Week | + | ======Week |
| - | * Some early stats on the discrete IPKA: | + | * Endeavoring to stay ahead of the curve, I've released the next batch of projects |
| - | * longest time to completion: 2 hours, 30 minutes | + | * **nbm0** has us exploring numeric bases |
| - | * median time to completion: 1 hour, 40 minutes | + | * **yol0** has us intentionally using logic and exploring different approaches |
| - | | + | |
| - | * shortest time to completion: 1 hour | + | |
| - | * number of people who have taken it so far: 7 | + | |
| - | ======Week 13====== | ||
| - | * Second to last week of classes; some have made some good progress on the EoCE, a couple functioning egyptian ratscrew implementations. | ||
| - | |||
| - | ======Break 2====== | ||
| - | * Yay! Break. | ||
| - | |||
| - | ======Week 12====== | ||
| - | * End of Course Experience (EoCE) is ready. Jubilant celebration! | ||
| - | |||
| - | ======Week 11====== | ||
| - | * **smh0** is our long-promised sorting project (likely part 1 of a series); sorting is an important concept, and common example. This will probably NOT be the last time you encounter a sort in your Computer Science journeys. | ||
| - | * **wpfA** continues the weekly puzzle fun into hex! A difficult 6x6 (but no less fun!), word math, and another sudoku for your solving fancy. You're welcome. | ||
| - | |||
| - | ======Week 10====== | ||
| - | * Hey, week 10! | ||
| - | * **wpf9** continues the puzzle fun; this week's third puzzle, by popular request, is a sudoku. You're welcome. | ||
| - | * This was actually the first sudoku puzzle I've ever done; I found it quite delightful. | ||
| - | * Based on some of our tic-tac-toe exploits from last week, I felt we should linger delve a bit more into algorithm creation. I've spun up what should be a super-spiffy and fun project (**yol0**), which should satiate your hunger pangs for new and exciting discrete projects. | ||
| - | * I believe I've evaluated everything up to this point. So at least discrete is caught up. Really close in data, still a bit behind in unix. | ||
| - | ======Week 9====== | ||
| - | * **wpf8** starts us on the highest level of difficulty with our logic grid puzzles. Back to 4x4. New word math, AND a third puzzle! Yay! | ||
| - | * Because I deserve nice things, **nbm0** will be extended another week. You're welcome. | ||
| - | * I believe this is the last week to drop a class with a ' | ||
| - | * Registration for the Spring 2017 semester begins this week. | ||
| - | |||
| - | ======Week 8====== | ||
| - | * As promised, the next project deals with number base conversions. **nbm0** is ready for your implementation. | ||
| - | * we're onto 7x7 on medium difficulty logic puzzles! **wpf7** also awaits. | ||
| - | ======Break Week====== | ||
| - | * I had a couple questions related to dcf2- that made me happy. I wish I had gotten a few more, to know that we won't have yet another last minute struggle. | ||
| - | |||
| - | ======Week 7====== | ||
| - | * This week has more than a few notable events worthy of our attention: | ||
| - | * the effective halfway point of the semester is this week | ||
| - | * this is our first week of class in the month of October | ||
| - | * we have a knowledge assessment this week (looking at Wednesday) | ||
| - | * I'm giving you off from going to regularly scheduled classes next week | ||
| - | * **wpf6** provides a fresh batch of fun- 6x6 logic grid of medium difficulty. A lot more indirect clues in this puzzle. Be sure to cross-reference eliminated boxes with correlated clues. | ||
| - | * We'll look to continue our **tictactoe** in-class implementation; | ||
| - | ======Week 6====== | ||
| - | * Hey look, stuff pertaining to class projects as a current event: http:// | ||
| - | * seems they have found a way to improve upon the memory usage of the sieve of eratosthenes... although the article is light on details (pretty much void of them), it does give some clues on the potential optimization path, and what's neat is that most will probably be able to read the article and follow along with a good level of familiarity. | ||
| - | * I am thinking about having a **knowledge assessment** next week at some point (day yet to be determined, although probably monday 10/03 or friday 10/07), where I'll have you work with some concepts we've been regularly touching on in the class (probably some algorithm or action taken on an algorithm). | ||
| - | * Well, dcf0 had some interesting results. I'd say we had the following categories: | ||
| - | * people who got it / went over the top | ||
| - | * people who either didn't read the specification, | ||
| - | * people who just couldn' | ||
| - | * far too many of the latter category, and really impacted by basic programming/ | ||
| - | * **dcf2** is the new project, wrapping up our explorations in this space. If dcf0 was any indication, I think people need to draw a lot more pictures and seek out the tutors for a lot more basic C help. | ||
| - | * Remember, the dcfX projects are reading/ | ||
| - | ======Week 5====== | ||
| - | * We go down the RLE rabbit hole a little deeper with dcf1. | ||
| - | * Also, we restart the logic grid puzzles on medium difficulty, smaller board, slowly ramping ourselves up again. | ||
| - | * Looking to also introduce another form of logic puzzle this week (so we'll then have 2 a week to do, all for the purposes of helping to sharpen your mental reasoning and logic skills). Believe it or not, this stuff will help you... but it is an indirect capacity. You won't see any tangible payoff until it has developed enough. So keep at it! By the end of the semester you may discover some sharpened reasoning abilities (and therefore improved coding/ | ||
| ======Week 4====== | ======Week 4====== | ||
| - | * One of the aims of this class is to learn (and strive) to write cleaner code, more optimal algorithms, and improve ourselves. After wading through some pnc1 submissions, | + | * a follow-on project |
| - | | + | |
| - | | + | |
| - | | + | |
| - | | + | |
| - | | + | |
| - | | + | |
| ======Week 3====== | ======Week 3====== | ||
| - | * The first projects have come due; I'll get around to evaluating them and the results will show up in the output | + | * A new project has been introduced: **ewn0**, along with the next tier of weekly puzzle fun projects (**wpf4**). |
| - | * We've been progressively stepping up the logic grid puzzles... last week a 5x5, this week a 6x6. I've found that the larger they are, the easier they get (but also the more details that need to be monitored). | + | * In addition to the logic grid, there will now also be a WORD MATH problem to solve. |
| - | * Also the third prime number project- this week takes a turn into potentially new territory for many of you, as we explore algorithms that through the utilization of more space, can net us rather impressive gains in time. | + | |
| - | * Matrix operation explorations; | + | |
| ======Week 2====== | ======Week 2====== | ||
| - | * We continue our matrix explorations this week, plugging away at matrix addition. Already a considerable amount | + | * I've released the next two week's worth of projects... following the initial pnc2 project (of which I'm planning |
| - | * Our algorithmic analysis continues | + | * these projects deal with encoding and decoding data according to various constraints. |
| - | * The weekly puzzle | + | |
| + | * There are also corresponding "weekly puzzle | ||
| ======Week 1====== | ======Week 1====== | ||
| * Welcome to Discrete Structures! (aka Computer Science math! NOT to be confused with Math for Computer Scientists). | * Welcome to Discrete Structures! (aka Computer Science math! NOT to be confused with Math for Computer Scientists). | ||
| * This is a class that focuses on the patterns, mathematics (combinatorics), | * This is a class that focuses on the patterns, mathematics (combinatorics), | ||
| * We'll endeavor to do this by working on progressively more involved projects, so you'll get to appreciate the concepts we learn through their application in programs, hopefully in combinations with many others we've learned (not just one-shot isolated programs). | * We'll endeavor to do this by working on progressively more involved projects, so you'll get to appreciate the concepts we learn through their application in programs, hopefully in combinations with many others we've learned (not just one-shot isolated programs). | ||
| - | * This is a GREAT complement course to Data Structures. For those who are taking it this semester (many), or have taken it (some), you'll likely find some reinforcing cross-over... I hope to use some of the things we'll be building in Data Structures (ie linked lists, stacks) | ||
| - | * Your first programming project should be a fun one (for everyone), and a familiar one for many. | ||
| - | * Unlike in Data Structures, where we spend most of our time as library developers/ | ||
| - | * Data Structures tends to be abstract/ | ||
| - | |||
haas/summer2017/discrete/projects.1481565992.txt.gz · Last modified: 2016/12/12 18:06 by 127.0.0.1
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
