We were very happy to host a number of newcomers to the Wolfram Language at the very first session of the tutorial series. Here are some of the poll questions that the attendees were asked to answer during the session:

Which of the following will create a list of the first 100 cubes?

• Table[i^3,{i,1,100}]
• Table[i,{i^3,1,100}]
• Range[100]^3
• Both 1 and 3 ✓

What is the Head of the expression 10 + 20 I?

• Integer
• Number
• Complex ✓
• None of the above

Which of the following lists contains only atoms?

• {a+b, 23, "hope"}
• {23, 3 + 4 I, "tomorrow"} ✓
• {200.23, f[10], 5/6}
• {100.0, $MachineID, x = 10}

How can you convert an Association into a List of Rules?

• ToList[assoc]
• Normal[assoc] ✓
• {Keys[assoc],Values[assoc]}
• This is not possible

Your code produced a correct output, so it was not "wrong". It may not be as elegant as it could be.

Dear Viktor, Thank you for your comment. You are absolutely right, but this is a training for beginners. As I know (found) the correct answer, I am positive now that implementation of Euclid's algorithm is not expected in item 1.12. I realized that organizers provided a clue, but still believe that a more clear wording would be useful for the tutorial participants. Best regards. Alexey.

Thank you to everyone who participated in the Programming Tutorials and submitted quizzes and exercises. We were excited to see so many folks engaged in the discussions and also appreciate the valuable feedback we received.

We understand some of you faced some issues with the exercises and quizzes. We apologize for any inconvenience and will be working on addressing these issues.

We'll be reaching out to the participants with your certificates. Hope to see you at or next offering.

Feel free to check out our new daily offering of Wolfram Study Groups where right now we are going over the Elementary Introduction to the Wolfram Language course from Wolfram U.

ok -- it used to also be an option (Using WL since version 1.1). However, what I wrote gets the same job done. I should point out that several of the 'suggestions' in the questions specify illegal operations, so I can't rely on them for hints on how to write the code.

The real point is that there are multiple ways to achieve a goal when coding. This was true in c and assembler, and it is true in spades for WL. The questions that appear to use some form of Unit Test presented no problem for me, even though I am sure that in many cases, my code is different from what the designers expected. This is because it relies on matching expected output to actual output.

Framed is not 'legal' in this context in 12.1, which I am using. It shows red and gives an error.

Hi, How can I download the exercises as a notebook?

Thanks, Dan Chevion

Very much appreciated, George!

If you are finding issues with the auto grader marking your answer wrong, even though you have produced the exact output as shown in the expected output, please feel free to email your solution to Wolfram U (wolfram-u@wolfram.com).

I also got the right response, but was marked wrong. I suspect that there are a lot more ways to solve this problem than the (automatic) grader knows about. I sent an e-mail to wolfram-U showing what I did (for this and other problems) but have not received a response. If there are only 80 or so people working on the exercises, it shouldn't be too hard for a human to eyeball the responses.

For what it's worth, your code is substantially different from mine, but it also produces the correct output.

My observation is that the problems for which you could construct a Unit Test seem to be graded fine, but the others -- including this one -- are sometimes problematic.

@Robert McHugh: Each exercise question is graded individually when you hit th e"Check my solution" button/link. So you can space out your submissions over several sessions.

@Lluís Pastor: Try setting the attributes of myListable function first and then define it.

Regarding the exercises, should all answers be submitted at once, or can submitting answers be spaced out over several days and several sessions?

Yes! The eight recorded sessions and the lecture notebooks are available here: https://www.wolfram.com/broadcast/c?c=471

Click on an individual video to access the download link from the control bar.

There absolutely is a one-line solution using recursion and Euclid's algorithm.

I also would appreciate if organizers clarify item 1.12.

Here are a few more review questions from session 2:

How can the following be re-written using PatternTest?

x_/;EvenQ[x]==True

• x_/;?EvenQ
• x_?EvenQ==True
• x_?EvenQ ✓
• x_EvenQ?

Which pattern correctly captures the substrings starting with "a" and ending with "c" from the string "aaabcdeadc"?

• "a"~~"c"
• "a"~~~~"c"
• "a"~~_~~"c" ✓
• "a"_"c"

How would you set the option to select all possible substrings from "xyz"?

• No option is required
• Set Overlaps to All ✓
• Set Overlaps to True
• All of the above