CS102B. Algorithms and Programming Techniques

Prerequisites: CS101B

Syllabus:

• Discrete mathematics: Basic logic; proof techniques
• Algorithms and problem-solving: Implementation strategies for algorithms; debugging strategies
• Fundamental programming constructs: Declaration models; garbage collection; abstraction mechanisms; modules
• Fundamental data structures: Arrays; records; strings and string processing; data representation in memory; static, stack, and heap allocation; runtime storage management; pointers and references
• Object-oriented programming: Encapsulation and information-hiding; separation of behavior and implementation; classes and subclasses; inheritance; polymorphism; class hierarchies
• Fundamental computing algorithms: Simple numerical algorithms; hash tables
• Overview of programming languages: Brief survey of programming paradigms
• Virtual machines: The concept of a virtual machine; hierarchy of virtual machines; intermediate languages
• Machine level representation of data: Bits, bytes, and words; numeric data representation and number bases; fixed- and floating-point systems; signed and twos-complement representations; representation of nonnumeric data; representation of records and arrays
• Assembly level machine organization: Basic organization of the von Neumann machine; control unit; instruction fetch, decode, and execution
• Introduction to net-centric computing: Background and history of networking and the Internet; network architectures
• Building a simple graphical user interface: Principles of graphical user interfaces; GUI toolkits
• Software engineering: Software design; software tools and environments; requirements and specifications; software validation; testing and debugging strategies

Units covered:

DS2	Basic logic	5	core hours (of 10)
DS3	Proof techniques	2	core hours (of 12)
PF1	Fundamental programming constructs	5	core hours (of 9)
PF2	Algorithms and problem-solving	1	core hour (of 6)
PF3	Fundamental data structures	3	core hours (of 14)
PF5	Event-driven programming	1	core hour (of 4)
AL3	Fundamental computing algorithms	1	core hour (of 12)
AR1	Digital logic and digital systems	1	core hour (of 6)
AR2	Machine level representation of data	1	core hour (of 3)
AR3	Assembly level machine organization	1	core hour (of 9)
NC1	Introduction to net-centric computing	1	core hour (of 2)
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	2	core hours (of 3)
PL6	Object-oriented programming	4	core hours (of 10)
HC1	Foundations of human-computer interaction	1	core hour (of 6)
HC2	Building a simple graphical user interface	2	core hours
SE1	Software design	2	core hours (of 8)
SE3	Software tools and environments	1	core hour (of 3)
SE5	Software requirements and specifications	1	core hour (of 4)
SE6	Software validation	1	core hour (of 3)

Notes:
This course is the second of a three-semester sequence (CS101B-102B-103B) that seeks to offer a broad, integrated introduction to computer science. The rationale for the design of the sequence and suggestions for its implementation are given in the notes to CS101B.

Online resources for CS102B