Join Peggy Fisher for an in-depth discussion in this video Solution: Create new data types, part of Programming Foundations: Discrete Mathematics.
- [Voiceover] How did you make out…with your first program in challenge?…I hope you had some fun with it.…As you can see, I have SML opened.…And I'd like to show you how to create your own data types.…So the first data type we wanted to make was…the data type called candy.…We use the keyword datatype, space.…We give it a variable name candy…is equal to.…And then we list out all the values…that are considered candy.…So of course, we have to have Chocolate.…We separate the values with a straight line.…
How about some Taffy?…Maybe some Gum.…Maybe a Caramel.…And finally, I'm gonna end it with a Toffee.…It's very easy to create your own data types.…The second part of the challenge was…to use some new functions that are available within SML.…One is called the explode function…which takes a string and creates a list of characters.…Let's try it.…I type in the word explode.…And in parenthesis, I give it the value…inside double quotes of a string…so I give it my first name.…
I end the double quotes,…put a close parenthesis and a semicolon.…
This course relies on an open-source SML (standard machine language) library to demo the concepts behind discrete math. Peggy Fisher shows you how to manipulate sets of data, write proofs and truth tables, analyze data sequences, and visualize data using graph theory. Challenges at the end of every chapter allow you to test your knowledge. By the end of the course, you should be able to make the leap from theory to using discrete math in practice: saving time and resulting in code that's cleaner and easier to maintain in the long run.
- Real-world discrete math
- Objects as sets
- Set notation and operations
- Standard machine language (SML) setup
- Working with data types, strings, and functions in SML
- Analyzing data sequences
- Writing truth tables
- Identifying and evaluating predicates
- Validating arguments
- Writing proofs: subset, conditional, and biconditional proofs
- Visualizing data with graphs
- Advanced discrete math techniques
Skill Level Intermediate
Programming Foundations: Design Patternswith Elisabeth Robson2h 19m Intermediate
1. Discrete Math Uses
3. Setting Up SML
4. Analyzing Data Sequences
5. Effective Arguments and Defensible Decisions
6. Proofs Made Easy
7. Advanced Discrete Math Topics
- Mark as unwatched
- Mark all as unwatched
Are you sure you want to mark all the videos in this course as unwatched?
This will not affect your course history, your reports, or your certificates of completion for this course.Cancel
Take notes with your new membership!
Type in the entry box, then click Enter to save your note.
1:30Press on any video thumbnail to jump immediately to the timecode shown.
Notes are saved with you account but can also be exported as plain text, MS Word, PDF, Google Doc, or Evernote.