CS112H. Object-Oriented Programming Techniques

Prerequisites: CS111H

Syllabus:

• Review of programming concepts
• Algorithms and problem-solving: Implementation strategies for algorithms; debugging strategies
• Object-oriented programming: Object-oriented design; encapsulation and information-hiding; separation of behavior and implementation; classes, subclasses, and inheritance; polymorphism; class hierarchies; collection classes and iteration protocols; fundamental design patterns
• Fundamental data structures: Static, stack, and heap allocation; runtime storage management; linked structures; implementation strategies for stacks, queues, and hash tables; implementation strategies for graphs and trees; strategies for choosing the right data structure
• Event-driven and concurrent programming: Event-handling methods; event propagation; managing concurrency in event handling; exception handling
• Using APIs: API programming; class browsers and related tools; programming by example; debugging in the API environment
• Basic algorithmic analysis: Asymptotic analysis of upper and average complexity bounds; identifying differences among best, average, and worst case behaviors; big "O," little "o," omega, and theta notation; standard complexity classes; empirical measurements of performance; time and space tradeoffs in algorithms; using recurrence relations to analyze recursive algorithms
• Algorithmic strategies: Brute-force algorithms; greedy algorithms; divide-and-conquer; backtracking; heuristics
• Fundamental computing algorithms: Simple numerical algorithms; sequential and binary search algorithms; sorting algorithms
• Overview of programming languages: History of programming languages; brief survey of programming paradigms; the role of language translation in the programming process
• Fundamental issues in language design: General principles of language design; design goals; typing regimes; data structure models; control structure models; abstraction mechanisms
• Virtual machines: The concept of a virtual machine; hierarchy of virtual machines; intermediate languages; security issues arising from running code on an alien machine
• Introduction to language translation: Comparison of interpreters and compilers; language translation phases; machine-dependent and machine-independent aspects of translation; language translation as a software engineering activity
• Basic computability theory: Tractable and intractable problems; the existence of noncomputable functions
• Fundamental techniques in graphics: Hierarchy of graphics software; using a graphics API
• Software design: Fundamental design concepts and principles; software architecture; structured design; object-oriented analysis and design; component-level design; design for reuse
• Software tools and environments: Programming environments; testing tools

Units covered:

PF1	Fundamental programming constructs	4	core hours (of 9)
PF2	Algorithms and problem-solving	1	core hour (of 6)
PF3	Fundamental data structures	6	core hours (of 14)
PF5	Event-driven programming	2	core hours (of 4)
AL1	Basic algorithmic analysis	2	core hours (of 4)
AL2	Algorithmic strategies	2	core hours (of 6)
AL3	Fundamental computing algorithms	4	core hours (of 12)
PL1	Overview of programming languages	1	core hour (of 2)
PL2	Virtual machines	1	core hour
PL4	Declarations and types	2	core hours (of 3)
PL5	Abstraction mechanisms	1	core hour (of 3)
PL6	Object-oriented programming	8	core hours (of 10)
SE1	Software design	2	core hours (of 8)
SE2	Using APIs	2	core hours (of 5)
SE3	Software tools and environments	1	core hour (of 3)
SE5	Software requirements and specifications	1	core hour (of 4)

Notes:
[to be supplied]

Online resources for CS112H