CS 240.001

Introduction to Computing III

Spring 2011

TR 12:30-1:45 PM

EB 1012

Textbook: Data Abstraction & Problem Solving with C++: Walls and Mirrors (5th) by Frank M. Carrano

Instructor: Bill White

EB 3041

wwhite@siue.edu

(618)650-3483

MTWR 8:30-11:30 AM

Course Description: Basic software engineering concepts, elementary data structures and algorithms, fundamentals of object-oriented programming.

Prerequisite: CS 150, with a minimum grade of C.

Course Objectives:

* Introduce the concept of an abstract data type (ADT), using lists, stacks, queues, trees, and graphs as basic examples.

* Explore the use of recursion, particularly in the implementation of the ADTs.

* Develop the ability to evaluate the time complexity of relatively sophisticated algorithms.

TENTATIVE SCHEDULE

TUESDAYS

THURSDAYS

1/11

Ch. 4: Linked Lists

 

1/13

Ch. 4: List Operations

 

1/18

Ch. 4: List Variations

Word Count List Example

 

1/20

Ch. 5: Backtracking

 

1/25

Ch. 5: Grammars

Recursive Determinant Example

Program 1 Due

(Sample Data)

1/27

Ch. 6: Stacks

 

2/1

Ch.6: Stack Applications

Linked List Stack Example

 

2/3

Ch. 7: Queues

 

2/8

Ch.7: Queue Applications

Linked List Queue Example

Program 2 Due

(Sample Data)

2/10

EXAM 1 (Chapters 4-7)

2/15

Ch. 8: Inheritance

Inheritance Example: Accounts

Inheritance Example: Queues

 

2/17

Ch. 8: Friends/Class Templates

Friend Example: Matrices

Class Template Example: Labels

 

2/22

Ch. 8: Overload/Iterating

Overloading Example: Dates

 

2/24

Ch. 9: Alg. Efficiency

Program 3 Due

(Driver Program)

3/1

Ch. 9: Big O Notation

 

3/3

Ch. 9: Sorting Algorithms

 

3/8

SPRING BREAK

3/10

SPRING BREAK

3/15

Ch. 10: Binary Trees

 

3/17

Ch. 10: Bin. Search Trees

Program 4 Due

(Sample Data)

3/22

Ch. 10: Tree Traversal

 

3/24

EXAM 2 (Chapters 8-10)

3/29

Ch. 11: Tables

 

3/31

Ch. 11: Priority Queues

 

4/5

Ch. 11: Heapsort

Program 5 Due

(Sample Input File)

4/7

Ch. 13: Graphs

 

4/12

Ch. 13: Graph Traversals

 

4/13

Ch. 13: Spanning Trees

 

4/19

Ch. 13: Shortest Paths

 

4/21

Ch. 13: Graph Applications

Program 6 Due

(Sample Input File)

4/26

EXAM 3 (Chapters 11 & 13)

4/28

Conclusions

 

 

 

 

5/5

FINAL EXAM (12:00-1:40 PM)

 

 

 

 

 

 

GRADING (A:900-1000 points; B: 800-899 points; C: 700-799 points; D: 600-699 points; F: 0-599 points)

Programs

(6@75 points)

450 points

Exams

(3@100 points)

300 points

All programs will be uploaded to Moodle dropboxes at classes.cs.siue.edu by the designated deadline. Late assignments are not accepted.

Regular exams are not comprehensive, dealing only with material covered since the previous exam. Exams are closed-book and closed-notes.

Quizzes

(5@20 points)

100 points

Final Exam

(1@150 points)

150 points

Quizzes are unannounced and give an idea of the types of questions to be expected on exams.

The final exam is comprehensive, covering the entire course. It is also closed-book and closed-notes.

 

 

 

 

 

 

CLASSROOM DECORUM POLICIES

Description: Description: Description: Description: Description: Description: Description: Description: Description: Description: Description: Description: http://www.clker.com/cliparts/e/e/4/f/1206558994350927690taber_No_Cell_Phones_Allowed.svg.hi.png

Cell phone conversations, text messaging, and audible cell phone ringing are forbidden in the classroom at all times.

Consuming food or beverages is forbidden in the classroom at all times.

Use of laptop computers is forbidden during class without express permission of the instructor.

Description: Description: Description: Description: Description: Description: Description: Description: Description: Description: Description: Description: http://globalvillagebrisbane.files.wordpress.com/2008/08/no_talking1.jpg

Conversations with other students are forbidden during class without express permission of the instructor.

One violation of any of these rules results in the immediate ejection of the student from that day's class (even on exam days). A second violation results in the student's disenrollment from the course.