syllabus121_w12

syllabus121_w12 - GENE 121(ME Digital Computation Winter...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
GENE 121 (ME) Digital Computation Winter 2012 Instructor Sanjeev Bedi, P.Eng. Office Phone (519) 885-1211 x31412 Office E5 3109 Email [email protected] Course Homepage http://learn.uwaterloo.ca Note: some sections of the syllabus, including the detailed outline, and assignment/project specifics may be altered as the term progresses. Changes will be announced in lectures and through Learn. Day Time Room Lectures Monday 3:30 pm – 4:20 pm MC-1085 Tuesday, Thursday 9:30 am – 10:20 am RCH 301 Make-up Lectures Thursday 2:30 pm – 4:30 pm RCH 301 Tutorials/Labs Tuesday 2:30 pm – 4:30 pm CPH 1346 OR Wednesday 2:30 pm – 4:30 pm CPH 1346 June Lowe E2-1318A x33888 [email protected] Fiona Yiu E2-1318B x33802 [email protected] Chris Rennick E2-1309E X32957 [email protected] By the end of the course you should be able to: Solve programming problems at an introductory level, by considering the engineering tradeoffs and constraints, as they apply to programming Demonstrate that you can implement procedural programs Use an integrated development environment for program design, implementation and debugging The course will be taught using C, C++, and RobotC.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Starting Out with C++: From Control Structures through Objects , Tony Gaddis, 7 th edition. In GENE 121 the textbook is used to provide more detail and examples, as a C++ reference, and to provide extra practice problems. Lectures Topic Subtopics Textbook Sections 1.5 Introduction to Computers and Programming Course introduction A simple C++ program using input and output Program compilation and execution Programs and programming languages 1.1 – 1.7 4.5 C++ Fundamentals Parts of a C++ program Variables and constants Data types and type conversion Mathematical operators Mathematical library functions Operator precedence and associativity Input and output Intro to problem solving, testing, and debugging 2.1 – 2.10, 2.12 – 2.17, 3.1 – 3.7, 3.9 – 3.10 2.5 Decisions Decisions: if, if-else Relational and logical operators Nested if-else statements 4.1 – 4.9, 4.11 2.5 Loops Increment and decrement operators Loops: while, do-while, for loops Nested loops Using loops with file streams 5.1 – 5.11, 12.1 – 12.2 1 1D Arrays Using arrays Initialization Limitations 7.1 – 7.5 2 Program Design Flowcharts State Diagrams N/A 5 Lego Mindstorm Programming RobotC common elements with C/C++ Input from sensors and buttons Timing Motor output and motor encoders Display output N/A 1 Review Midterm discussion and examples N/A The midterm will cover the above material.
Background image of page 2
Lectures Topic Subtopics Textbook Sections 7 Functions Declaring functions Parameter passing: pass by value, pass by reference Scope, local variables, global variables Void functions Arrays and I/O streams as parameters Introduction to sorting 6.1 – 6.10, 6.13 – 6.14 4 Arrays
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/01/2012 for the course GENE 121 taught by Professor Smucker during the Winter '11 term at Waterloo.

Page1 / 9

syllabus121_w12 - GENE 121(ME Digital Computation Winter...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online