• Current Week: 12

Weekly Notes	Topics	Reading	Assignments
Week 1	Syllabus H1N1 Information Survey A whirlwind tour of Ada History and goals, String and numeric output, types, literals, operations, attributes, ifs and loops More information: Information on Ada (ie documentation, tutorials, links) Compile and run Hello World Installing Gnat and an Ada Environment An FAQ for the course	1.1-1.3, 2.1 (History and goals); 5.5 (Comments); 4.2 (Text_io); 6.1, 6.5 (Numeric types)	P1 is ready
Week 2	A whirlwind tour of Ada numeric Input, procedures Let's write a program in groups: Read a low and a high value to define a range, and then read a sequence of numbers, until eof, and count the number of numbers below, in, and above the range. Calculate the percent in each group. Assume the endpoints of the range are in the range. Output, nicely formatted, the counts and percents. Here's a solution (and prettified) Some examples from last semester: sumto10.adb: sum the ints from 1 to 10 sumtoeof.adb: sum all the integers in a file of integers echochars.adb: print the characters in a file echocharsnl.adb: print the characters in a file, with newlines echocols.adb: print up to 5 columns of each line countvowels.adb: print the vowels in the input Exceptions - Let's do some exception handling Redirection: < for redirecting Standard Input, > for Standard Output Notes from last year: Execution Model Ada Fundamentals: Hello World and Table of Squares Ada Fundamentals - Structured Statements Debuggers and Capturing Error Messages	Same as last week	P1 is ready! P2 ready too!
Week 3	Some unix commands Using the submit command Examples from last week: g1.adb and (prettified) g1procs.adb and (prettified) g1procsv2.adb and (prettified) g1procsv3.adb and (prettified): main has 3 calls g1procsv4.adb and (prettified): main has 3 calls; demonstrates in out parameters A whirlwind tour of Ada More on procedures, parameters, scope, global, exceptions Notes from last year: Procedures (including numeric input) Exceptions Declaration Blocks Parameter modes: sum and difference procedure, sum powers Monday's program: procs2.adb and prettified version Functions (overloading, parameter modes) and side effects Group exercise: Finish the program to find the most common character in a string	As last week + Procs: Chap. 9 + Exceps: 2.6, Chap 14 + Arrays: 8.1-6, 2.4	P2 is here. Start NOW!
Week 4	Exceptions - an example program: quick.adb Types, Subtypes, and Type Checking Array Slices Enumerated Types Notes from last year: Procedures (Global variables, default and keyword params) Functions (overloading, parameter modes) and side effects Notes on look_ahead Enumerated Types Table of Powers with Enumerated Types Some language comparison: Ada Fundamentals - Structured Statements (avoiding common Java errors) Enumerated Types and other languages (enumerated types in other languages) Ada Fundamentals - Primitive Types (type checking, type conversion, operators)	Procs: Chap 9	P2 is here P3 will be available soon.
Week 5	Enumerated Types Exam NEXT week on Friday 10/09/09 Exam Topics (Updated for Fall 09) Aggregate values and arrays Notes on Strings Notes from last year: Let's finish Procedures and Functions : parameter passing modes (parameter passing modes, side effects, more on globals, overloading, and default and keyword params Ada Fundamentals - Primitive Types (type checking, type conversion, operators)	Procs: chapter 9	Exam Monday 2/23/09 P3 is here
Week 6	Exam Postponed: Exam Next week on Monday 10/12/2009 Exam THIS week on Friday 10/9/2009 Exam Topics (updated for Fall 09) Records - Introduction Class exercise: Write a program that creates a list of lines that are input. A list is an array with a maximum and current length. A line is defined by two points. A points is defined by 2 integers A partial solution: linelistpart.adb An almost complete solution: linelist.adb Notes from last year on arrays: Example 1: Get and print 10 ints in reverse: print10.adb and prettified Example 2: Print n ints in reverse: printn.adb and prettified Example 3: Print n ints in reverse, with procedures (ie get, put): printnprocs.adb and prettified Example 3: Print n strings in reverse, with procedures (type String is an Array of Characters): printnstrings.adb and prettified Example 4: Strings are arrays of characters somestrings.adb and prettified Example 5: Strings are UNCONSTRAINED arrays of characters mystrings.adb and prettified Let's do printnprocs with unconstrained Notes on Arrays Group project - create an array that is the sum of two parallel arrays: Finish This! Group project - print list of unique words: Group Project: Input: Sequence of lines of 80 or fewer characters each Output: Frequency of each letter Output: Frequency of each letter and of blanks and certain punctuation Punctuation to count: '.', ',', '!', Frequency count should be case insensitive Output format: Only output non-zero frequencies Ada Pair record and client vs Java Class Pair and client PairClient.java and pairclient.adb class Pair{ int dist(){...} String toString(){...} Pair reflect(){...} void reflectMe(){...} }	Procs: chapter 9	P3 is here (updated for Fall 09)
Week 7	Exam Notes on look_ahead More on records Review last week's group problem A partial solution: linelistpart.adb An almost complete solution: linelist.adb Class Project: Input: list of words, one word per line, each word is shorter than 80 characters Output: Print list of unique words and their frequecies Constraint: main is l: WhatTypeIsThis; begin getWords(l); putWordsAndFreqs(l); end words; Constraint: fixed length strings Use get_line(w, len) to input each string Example using getline: declare w: String(1..80); len: Natural; begin loop get_line(w, len); exit when len = 0; put_line(w(1..len)); end loop; end; First step: Design types (draw pictures) Second step: Read and write all words, ignoring test for uniqueness	Arrays: 8.1-6, 2.4;	P3 is here (Due 11:59 p.m., Tue 10/20/09)
Week 8	Friday at 5:00 p.m. is the deadline to withdraw from a class with a W Solution to last week's problem (prettified) (a version [prettified] without leftover code) Some notes on records: Records - Introduction Records - Nested Records vs Classes and records in other languages Let's finish strings in C: Notes on Strings Notes from last year: Arrays Let's print a list of unique words, one word per line, using this as a start: group3orig.adb (and prettified). And here is the solution (and prettified)	Records: 8.7, 2.4 Packages: 3.1 & Ch. 11	P4 is here
Week 9	One other word on C strings (printing ohno as a string): Notes on Strings Packages! Packages Example pairpkg pairpkg.adb pairpkg.ads pairclient.adb PairClient.java Word Package: Word package specification: prettified and the code Word package body: prettified and the code Client: simpleword.adb (prettified Integer Stack Package Child Packages: A child of package FooPkg has FULL ACCESS to foo.ads Child package FooPkg.extra is stored in files foopkg-extra.ads and foopkg-extra.adb A client must with/use parent and child packages independently. A child package that provides put and tostring routines for a stack intstackpkg-stk_io.ads and intstackpkg-stk_io.adb and client intstkpkgioclient.adb Class Example: Stack utilities: clear, size, reverse intstackpkgclient.adb (prettified) intstackpkg-utils.adb (prettified) intstackpkg-utils.ads (prettified) Package Bignum: Bignum specification: bignumpkg.ads Bignum client 1: bignumget.adb Bignum client 2: bignumtest.adb Bignum implementation: bignumpkg.adb [data structure, relops, +, *, get (with lookahead)] (and prettified)	Packages: 3.1 & Ch. 11	Program 4
Week 10	Exam coming soon (ie next week) An interesting link: the Rosetta Code Another example using Words: wordclient2.adb (prettified) Let's finish the notes on packages classes vs packages, implicit params, package bignum Implementing Parameter Modes Generic Packages A Generic Stack: stackpkg.ads (prettified) and stackpkg.adb (prettified) A Generic Queue: queuepkg.ads (prettified) (no implementation given) Notes on Generic Packages FYI: you can make generic procedures as well as packages Abstract Data Types Other topics: Limited Private Types Overloading operators	Packages: 3.1 & Ch. 11	Program 4 due Thurs 11/05/09
Week 11	Exam Friday 11/13/09 on these topics Finish Abstract Data Types There is now more on generic procedures in the Notes on Generic Packages	Packages: 3.1 & Ch. 11	Program 5
Week 12	Introduction to pointers Memory Organization	LookAhead; Variant Records; Limited Private; Generics: 3.4 & Ch. 17 Pointers:  Chapter 10  Section 2.5	Exam Mon. NEXT week Program 5 Program 6
Week 13	Thanksgiving Week!		Program 5 Program 6 (Suggestion: finish Program 5 and start Program 6 ASAP)
Week 14	Monday: Wednesday: Finding exceptions More on pointers: linked structures (eg stacks and queues) Introduction to pointers More on Pointers More complete discussion of pointers Hints on pointers Limited Private Types Stepwise Refinement, functional decomposition, and structure charts Friday: Group Projects: Child packages for generic packages Create a child package for stackpkg.ads contains these routines: -- how many elements function size(item: Stack) return Natural; -- output the stack procedure put(item: Stack); -- do 2 stacks have identical elements function equal(l, r: Stack) return Boolean; -- copy stack s to stack t procedure copy(t: out Stack; s: in Stack); Use pointer operations, not stack operations. equal will require passing in "="(l, r: ItemType) as a generic parameter) JEWL is extra credit. Here are some notes on it		Program 5 Program 6
Week 15	Final Exam Topics (from Spring 08) Monday: Notes on program: Solution to group problem copy copystack.adb An alternative to way to create a type hierarchy: variant records Functionality Oriented Programming: Notes by Franco Gasperoni Wednesday: Final Exam Topics (revised for Spring 09) Continue with Functionality Oriented Programming: Notes by Franco Gasperoni OO vs FO: last slide in this presentation Garbage and Dangling references: See other notes Friday: Questions: Final Exam Topics (revised for Spring 09) Limited Private Types Abstract Data Types Packages and ADTs More on pointers Garbage and Dangling references: See other notes on pointers Memory addresses and modular types: See other notes on pointers Some other Topics: Overloading operators OO in Ada: Presentation and Project Notes Abstract Objects: Week 16 Notes Literals Subtypes Subtypes Positive and Natural are defined in package Standard (along other types). Example program with end of file and get strings (and the prettified version) Opening files and command line arguments ( cmdline.adb , cline.adb and text.adb). (Prettified: cmdline.adb and cline.adb and text.adb) Some fun from previous semesters: Today's fun: The Road Coloring Problem has been solved! Today's fun (from last semester): The Challenge, and and the story and the second place winner and the Winner and his prog and some more details More fun: Ada, ATC, and modifying systems More ATC fun: ifacts		Program 5 Program 6
Week 16	Comprehensive Final Exam:   12:30 - 2:30 Monday 5/4/2009		Comprehensive Final Exam
Notes for entire semester

• An FAQ for the course


• Some reference material:
• Ada standard library documentation (an Ada 95 API)


• Ada Reference Manual (2005) [Information on the Ada Standard Library is in Appendix A]


• Language Standards for Ada 83, 95, 05 (LRM, ALRM, Rationale, Style Guide) [pages may require reloading]


• Ada Package Specifications, in HTML (and a search page for the packages is here)


• Documentation for Package Standard, which is automatically available for every program.

• Ada standard library packages source code (link broken)

• Information on compiling and learning Ada

• A list of Ada tools: http://deim.urv.cat/~sgomez/ada/
• Check my grades

• Style guidelines

• Syllabus
  

• How to find the source of an exception when using gnat (This is mostly obsolete since you can now find the source of an exception with an integrated environment.)

• Instructions for the submit command

• Objectives

• Syntax across languages
• Some info on editing ada programs with vim