QMCS 130: Todays Class

1
QMCS 130 Todays Class

• Grading
• The exam
• Sorting arrays
• Pointers, structs, linked lists

2
Grading and the Exam

• Labs in C
• Pig Latin is the last one
• Some interesting results when including
  punctuation at end
• Exam
• Some missed a few, some missed a lot
• 140 Points Counted a total of 120
• Essentially, a 20-point programming question for
  free
• Nobody is flunking the class
• Lowest grade is C minus at this point
• A few just barely B minuses
• Class Median is currently a B

3
The Exam

• 1 no cast needed
• 2 changing the loop type isnt enough
• 3 Everyone got this
• 4 definition vs use
• Array index NOT
• 5 Everyone got this
• 6 No affect on the return type
• 7 Most got nailed
• 4 chars in a 3 char string
• 8 Most got this

• 9 Most got this
• 10 Most got this
• 11 Lots of trouble
• Examples in the book
• Example in date program
• 12 Most got this
• 13-15 Most got this
• Some confused 13, 14, 15
• 16 Else if tricks
• 17 Most got this
• 18 Some had big trouble
• It was the biggest programming question

4
Sorting

• Like Pig Latin (oh, boy!)
• You have to index into an array and do things
• How do we sort a pile of cards?
• Radix sort sort by number values
• Minimum sort sort lowest values to the
  bottom, then next lowest, etc.
• Using a computer to sort
• Unlike cards, computers easily swap values

5
Break the problem into loops

• Inner Loop
• Sort the lowest value you can find to the start
  of the array
• Outer Loop
• Do the inner loop repeatedly
• Repeat each time you have the lowest value in the
  first spot
• For each repeat, look at all the array MINUS the
  first spot

6
Pointers

• Pointers and Structs
• Linked Lists

7
Creative Commons License

• This work is licensed under the Creative Commons
  Attribution-Share Alike 3.0 United States
  License. To view a copy of this license, visit
  http//creativecommons.org/licenses/by-sa/3.0/us/
  or send a letter to Creative Commons, 171 Second
  Street, Suite 300, San Francisco, California,
  94105, USA.