Dhofar University                                                                  

School of Engineering

Electrical and Computer Engineering Department

 

Data Structures and Algorithms

Course Guide                                                                                                              

EECE 231                                                                                                                                                           

 

Announcements

 

  
 
1. Course Details: 
 

Course Title:

Data Structures and Algorithms

Prerequisite

EECE 230 Computers and Programming II

Level

Juniors

Course Reference

CCEE 231

 

 

Lectures

SMW 11:00 - 11: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

http://academics.idamaj.net 

 
2. Aims of the Course:

This course introduces the student to advanced topics in programming. C++ is the adopted programming language for this course, although some assignments might include other languages. 

 

3. Catalog Description

 

Analysis of algorithms; internal and external sorting, hashing tables, and tree indexing. The course relies on advanced C++ concepts in the implementations of data structures and algorithms. Prerequisite: EECE 230. Every semester.

 
4. Schedule:

 

Details:

Topic

Chapter No.

Books Sections

Assessment

Weeks 1 –  3

Introduction to Classes and Objects

1

Deitel:

Ch3: Till section 3.9

 Pop Quiz

Weeks 4 – 12

Object Oriented Programming  

(Revision EECE 230)

2

Carrano: Ch8

Deitel:

Ch9: Till section 9.10

Ch10: Till 10.4

Ch11, Ch12, and Ch13

Quiz I (W8)

Project Proposals

Weeks 12 – 15

Data Structures (Revision EECE 230)

4

Carrano: Ch6, Ch7, Ch4, Ch10, and Ch 13;

Deitel:    Ch21

Quiz II (W12)

Projects Due (W16)

 
 

Advanced Trees, Graphs and hashing Algorithms

5

Deitel:    Ch2

Carrano: Ch10, Ch12, Ch13;

 
  Sorting and Searching Algorithms

6

Deitel: Ch20

Carrano: Ch9, Ch14

  
  Analysis of Algorithms

7

 Carrano: Ch9
  Design of Algorithms

  • Part I: Greedy Algorithms

  • Part II: Divide and Conquer Algorithms

  • Part III: Dynamic Programming

  • Part IV: Backtracking Algorithms

  • Part V: Branch and Bound Algorithms

8

 Carrano: Ch1, Ch5   
 
 
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.
 
[Mar 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 17, 2007] Welcome to course website.