Transcript CL28_Semester_Summary.ppt

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