Semester Summary 20111208 Lecture 28 CMSC 104 Section
- Slides: 7
Semester Summary 2011/12/08: Lecture 28 CMSC 104, Section 4 Richard Chang 1
What we covered l structured programming (if, while, for, . . . ) l overview of C programming language l basic coding skills l enough exposure to decide if you are “good at” and/or interested in more CS courses
What we didn’t cover l some terminology (a. k. a. jargon) e. g. , declarations vs definition, lexical scoping, function signature, binary search, side effects, . . . l stuff that would require more memorization e. g. , operator precedence, . . . l recursion l memory allocation l multi-dimensional arrays
What we didn’t cover (cont’d) l short-circuit evaluation if ( n != 0 && k / n > 5 ) l more data types unsigned int, long int, enumeration types, const, bool, struct, type definition l type casting x = (double) n ; l file input/output fopen, fclose, fprintf, fscanf
Looking ahead l object-oriented programming l design l data structures l efficiency concerns l domain knowledge
Domain knowledge from www. usabilityfirst. com knowledge about a specific field of interest; knowledge about the content area for which a piece of software is being designed, as opposed to programming knowledge.
Some Areas of CS l l l l Computer Graphics Games Databases Computer Networks Algorithms Scientific Computing Parallel Computing l l l l Artificial Intelligence Natural Lang. Proc. Computer Security Theory of Computation Architecture Operating Systems. . .
