doc 1

3
CS 192 / CMPE 191: Problem Solving and Computer Programming Winter 2006 - 2007 1 PROBLEM SOLVING AND COMPUTER PROGRAMMING (CS 192/CMPE 191) Course Outline Instructor: Humaira Kamal Year: 2006 - 2007 Office: Room 412 Quarter: Winter Email: [email protected] Category: Freshman Extension: 4412 Course Website: http://suraj.lums.edu.pk/~cs192w06/ TAs for the Course: Refer to website Office Hours: Refer to website _____________________________________________________________________________ Course: ‘Problem Solving and Computer Programming’ (4 units) Description: This first level programming course shall cover the principles and practice of problem solving using C++. Students shall be introduced to the basic C++ techniques such as program control statements, pointers, functions, structures etc. The students shall gain hands-on experience through several programming assignments. Core/Elective: Core for CS Majors Pre-requisites: None Text: Primary ο Herbert Schildt, ‘C++ from the Ground Up’, 3rd Edition, 2003, Osborne McGraw-Hill. References ο Walter Savitch, Problem Solving with C++, The Object of Programming, 3 rd Edition, 2001, Addison Wesley Longman, Inc. ο Herbert Schildt, ‘C++: The Complete Reference’, 3rd Edition, 1998, Osborne McGraw-Hill. ο Deital & Deital, ‘C++ How to Program’, 3 rd Edition, 2001, Prentice Hall. Some handouts may be given to supplement the text.

description

this is a new book

Transcript of doc 1

Page 1: doc 1

CS 192 / CMPE 191: Problem Solving and Computer Programming Winter 2006 - 2007

1

PROBLEM SOLVING AND COMPUTER PROGRAMMING (CS 192/CMPE 191)

Course Outline Instructor: Humaira Kamal Year: 2006 - 2007 Office: Room 412 Quarter: Winter Email: [email protected] Category: Freshman Extension: 4412 Course Website: http://suraj.lums.edu.pk/~cs192w06/ TAs for the Course: Refer to website Office Hours: Refer to website _____________________________________________________________________________ Course: ‘Problem Solving and Computer Programming’ (4 units) Description: This first level programming course shall cover the principles and practice

of problem solving using C++. Students shall be introduced to the basic C++ techniques such as program control statements, pointers, functions, structures etc. The students shall gain hands-on experience through several programming assignments.

Core/Elective: Core for CS Majors Pre-requisites: None

Text: Primary

ο Herbert Schildt, ‘C++ from the Ground Up’, 3rd Edition, 2003, Osborne McGraw-Hill.

References ο Walter Savitch, Problem Solving with C++, The Object of

Programming, 3rd Edition, 2001, Addison Wesley Longman, Inc. ο Herbert Schildt, ‘C++: The Complete Reference’, 3rd Edition, 1998,

Osborne McGraw-Hill. ο Deital & Deital, ‘C++ How to Program’, 3rd Edition, 2001, Prentice

Hall. Some handouts may be given to supplement the text.

Page 2: doc 1

CS 192 / CMPE 191: Problem Solving and Computer Programming Winter 2006 - 2007

2

Lectures: There shall be 30 sessions o 20 of 75 minutes each o 10 of 50 minutes each

Grading:

o 20% Quizzes + Homework o 20% Programming Assignments. o 25% Midterm Exam o 35% Final Exam (25% Paper-based and 10% Lab-exam)

Topics Sessions Readings

Introduction (Introduction to computer programming and C++) 1 Chapter 1, 2

Overview of C++ and Basic Data Types (programming practices, variables, constants, operators, expressions etc.)

2 Chapter 2, 3

Program Control Statements (if statement, for loop, switch statement, while loop, do-while loop, continue, break, nested loops)

3 Chapter 4

Arrays and Strings (One dimensional arrays, strings, string library functions, two dimensional arrays, multidimensional arrays, array initialization, arrays of strings)

3.5 Chapter 5

Pointers (Pointer operators, pointer expressions, pointers and arrays, arrays of pointers, problems with pointers.)

4.5 Chapter 6

MIDTERM 1

Functions (Scope rules of functions, passing pointers and arrays, argc and argv, return statement, recursion) 4 Chapter 7

Page 3: doc 1

CS 192 / CMPE 191: Problem Solving and Computer Programming Winter 2006 - 2007

3

Topics Sessions Readings

References, Overloading and Default Arguments (Argument passing, function-overloading etc.) 3 Chapter 8

More Data types and Operators (Enumerations, bool, Bitwise Operators, ? operator, dynamic allocation using new and delete etc.)

2 Chapter 9

Structures and Unions 3 Chapter 10

More on pointers and dynamic memory allocation 3 Chapters 9, 10

FINAL EXAM

Scholastic Ethics: Students are expected to maintain high standards of academic honesty. The Values and Ethics Committee will deal with breaches in scholastic ethics such as cheating. • Plagiarism will be suspected if an assignment that calls for independent development and

implementation of a program results in two or more solutions so similar that one solution can be converted to the other(s) by a series of simple commands

• Cheating will be suspected if a student who completed an assignment independently cannot explain both the intricacies of the solution and the techniques used to generate that solution

Examples of Cheating:

• Turning in someone else's work, in whole or in part, as your own (with or without his/her knowledge)

• Turning in a completely duplicated assignment is a flagrant offense • Allowing another student to turn in your work as his/her own • Several people writing one assignment and turning in multiple copies, all represented

(implicitly or explicitly) as individual work Examples of Not Cheating:

• Turning in work done alone or with the help of the course's TAs. • Submitting one assignment for a group of students if group work is explicitly permitted

(or required) • Getting or giving help about using the computers • Getting or giving help about solving minor syntax errors

Penalties for cheating can be an 'F' in the course or worse.