Join Peggy Fisher for an in-depth discussion in this video Use SML to create lists, part of Programming Foundations: Discrete Mathematics.
- [Voiceover] Another reason to use…the SML programming language…or the Standard Machine Language is to create list.…List can be used to model sets.…To create a list, you simply list all the values…in brackets separated by commas.…For example, I can have a list of integers.…A list is similar to an array…and it even must contain all values of the same type.…Let's create another list.…This list I'm gonna give a name.…
I'm gonna say val rainbow equals…and I'm gonna give it all the colors of the rainbow.…So I use my square bracket.…And I have to put the names of the rainbow…in double quotes since they're strings.…So we'll start with Red…and list all the values.…Okay, now I have a list called rainbow.…Once we create a list, we can perform operations on the list…such as getting the first element.…So let's go ahead and get the first element…from our list called rainbow.…
We used the command hd.…So I'm gonna say val first equals hd…and in parentheses I'll give it the name…of my list rainbow.…Now the variable first has the word Red in it.…
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 Patterns (2013)with 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.