Dhofar
University
School of Engineering
Electrical and Computer Engineering Department
Computers and Programming II
Course Guide
EECE 230
1. Course Details:
|
Course Title: |
Computers and Programming II |
|
Prerequisite |
EECE 130 Computers and Programming I |
|
Level |
Juniors |
|
Course Reference |
EECE 230 |
|
|
|
|
Lectures |
SMW 9:00 - 9:50 a.m. |
|
Room |
A 202 |
|
Office Hours |
TBA |
|
Student Study Hours Per Week |
9 |
|
Contact Hours Per Week |
3 |
|
Private Study Hours Per Week |
6 |
|
Year and Semester |
2006 - 2007 Spring |
|
Lecturer |
Dr. I. Damaj |
|
Contact Details |
i_damaj[@]du.edu.om - Remove the brackets [ ] |
|
|
|
|
Summary of Assessment Method |
Quizzes, pop quizzes, assignments, project and presentation, and a final exam
|
|
Textbook |
Data Abstraction and Problem Solving with C++: Walls and Mirrors Frank M. Carrano and Janet J. Prichard (International Edition) 4th Edition ISBN - 0-321-26980-2
|
|
Reference |
C++ How to Program, 5th edition, Deitel & Deitel, Prentice Hall, 2005
|
|
Manual |
Lab Manual to Accompany C++ How to Program, 4/e ISBN: 013038478X©2004
|
|
Software Packages |
Visual C++ IDE |
|
Links |
2. Aims of the Course:
This course presents an introduction to data abstraction and object oriented design of data structures. This course aims to increase the proficiency of students in using the basic data structures of computer science, and to increase their knowledge in object-oriented design. The topics of this course include how to specify, design, implement, test, and use structured data types. These data types include collections, lists, stacks, queues, and trees. Several very important algorithms are also included that use these data types, including searching and sorting techniques. This course presents a general knowledge of how to design, implement, and reuse code using object-oriented programming techniques.
3. Catalog Description
Internal representation of data; object-oriented programming, recursion; polymorphism, inheritance and overloading; abstract data structures via pointer; stacks, queues, lists, trees, and graphs with applications.
4. Schedule:
|
Details: |
Topic |
Chapter No. |
Books Sections |
Assessment |
|
Weeks 1 – 3 |
1 |
Deitel: Ch3: Till section 3.9 |
Pop Quiz |
|
|
Weeks 4 – 6 |
2 |
Ch9: Till section 9.10 |
|
|
|
Weeks 7 – 9 |
3 |
Ch10: Till 10.4 |
|
|
|
Weeks 9 – 12 |
Advanced C++ Topics |
4 |
Carrano: Ch8 Deitel: Ch11, Ch12, Ch13 |
Quiz I (W7) Project Proposals |
| Weeks 12 – 15 |
5 |
Carrano: Ch 4, 6, 7, 10, and 13 |
Quiz II (W12) Projects Due |
5. Assessment of the Course:
|
Attendance |
%5 |
|
Pop quizzes and assignments |
%5 |
|
Quiz I |
%20 |
|
Quiz II |
%20 |
|
Project |
%20 |
|
Final |
%30 |
6. Notes
Announcements
[May 24, 2007] Chapter 5 is posted.
[May 1, 2007] Chapter 4 Part 3 is posted.
[April 30, 2007] Chapter 4 Part 2 is posted.
[April 8, 2007] Chapter 4 Part 1 is posted.
[March 22, 2007] Chapter 3 is posted.
[March 4, 2007] Required reading from the book: " Data Abstraction and Problem Solving with C++: Walls and Mirrors Frank M. Carrano and Janet J. Prichard".
Chapter 1: 1.1 and 1.2 only.
[Feb 28, 2007] Chapter 2 is posted.
[Feb 18, 2007] Chapter 1 is posted.
[Feb 17, 2007] Welcome to course website.