Scribd
Upload
37 views12 pages

CSCE 2211 Part 0 Outline

Uploaded by

aae121
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
37 views12 pages

CSCE 2211 Part 0 Outline

Uploaded by

aae121
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

CSCE 2211

Applied Data Structures

Prof. Amr Goneid, AUC

Part 0. Course Outline


2 Applied Data Structures

Prof. Amr Goneid, AUC


3 Course Goals
 Demonstrate knowledge and understanding of Data Models, Data
Abstraction and ADTs and their role in problem solving and S/W
development.
 Choose the appropriate data structure for modeling a given problem.
 Design and implement various ADTs in a high level language (C++)
using Object Oriented Concepts.
 Compare alternative implementations of data structures with respect to
performance.

Prof. Amr Goneid, AUC


4 Course Goals
 Demonstrate experience in the design of algorithms for solving problem
that use the above data structures.
 Practice basic algorithm analysis using complexity bounds (Big-Oh,
Big-Theta and Big-Omega).
 Demonstrate knowledge of common applications for each data structure
in the topic list.

Prof. Amr Goneid, AUC


5 Course Logistics
Instructor: Prof. Amr Goneid
E-mail: [email protected]
Office: Rm 2152 SSE
Office Hours: MR 1:00pm – 2:00pm, or by appointment

Lecture Times and Location:


MR 10:00 am – 11:15 am (section 1)
MR 11:30 am – 12:45 pm (section 2)
Course Web Site:
http://www1.aucegypt.edu/faculty/cse/goneid/csce2211

Prerequisites: CSCE 1101 – Programming Fundamentals II

Prof. Amr Goneid, AUC


6 Course Logistics
 Textbook:
"Data Structures and Algorithm Analysis in C++" by Mark A. Weiss, Int. Ed of
4th revised Edition, 2014, Pearson, ISBN: 9780273769385

 Reference:
"ADTs, Data Structures and Problem Solving with C++" by Larry Nyhoff, 2nd
Edition, Pearson Prentice Hall, 2005

 Programming Language: C++

 Tutorial Sessions: weekly by course TA. To be announced by e-mail


Prof. Amr Goneid, AUC
7
Course Logistics
 Exercises: Home exercises are posted on Bb and on the course web site
under “Exercises”.

 Assignments: 6 - 7 written and programming assignments. Assignments are


posted on web site under “Assignments” and will also be announced on Bb.
Generally, assignments are individual efforts and will be graded as such.
Assignments designed for teams will be specifically announced. Late
submission policy is provided under “Instructions” in the course web site.

Prof. Amr Goneid, AUC


8 Course Logistics
Term Project: A team work including design, implementation and analysis for a
given problem. A group of 1 – 4 members is to complete the project by the
deadline and report the work in a project report. To be announced later.

Term Paper: Short paper (3 - 7 pages) by groups (each not exceeding 4


members) on a related subject of their own choice. To be announced later.

Midterm Exam: To be arranged

Final Exam: To be arranged

Prof. Amr Goneid, AUC


9 Self Study (CSCE 1101 Material)
(See Revision Slides R1-R4)
 Stacks & Queues

 Linked Lists

 Standard Template Library (STL) & Vectors

 Hash Tables

Prof. Amr Goneid, AUC


10 Brief list of topics to be covered
 Data Modeling and ADTs
 Revision of Linear Structures (Linked Lists, Stacks, Queues, Vectors)
 Introduction to the Analysis of Algorithms
 Trees (General)
 Dictionaries and Binary Search Trees
 Self-Balancing Trees
 B- Trees
 Red-Black Trees
 Heaps and Priority Queues
 The Set Data Structure: Disjoint Sets
 Graphs
Prof. Amr Goneid, AUC
11 Grading

A 93 -
 30 % Assignments A- 89 -92
B+ 85 -88
 20 % Midterm Exam B 80 -84
B- 77 -79
 20 % Term Project C+ 74 -76
C 70 -73
 10 % Term Paper C- 67 -69
D+ 64-66
 20 % Final Exam D 60-63

Prof. Amr Goneid, AUC


12
Tentative Schedule of Lectures (Fall 2023)
2211 Tentative Lecture Schedule F23
Week Mon Part Thu Part
1 Sep-04 0 Outline Sep-07 1 ADTs
2 Sep-11 2 Linear DS Sep-14 2 Linear DS
3 Sep-18 3a Bounds Sep-21 3b Complexity
4 Sep-25 3b Complexity Sep-28 H
5 Oct-02 4 Trees Oct-05 4 Trees
6 Oct-09 5a BST Oct-12 5a BST
7 Oct-16 5b Tries Oct-19 6 Self-Trees
8 Oct-23 Midterm Exam Oct-26 6 Self-Trees
9 Oct-30 6 Self-Trees Nov-02 7 B-Trees
10 Nov-06 7 B-Trees Nov-09 8 Heaps & PQ
11 Nov-13 8 Heaps & PQ Nov-16 8 Heaps & PQ
12 Nov-20 9 Sets Nov-23 H
13 Nov-27 10 Graphs Nov-30 10 Graphs
14 Dec-04 10 Graphs Dec-07 10 Graphs
15 Dec-11 10 Graphs Dec-14

Prof. Amr Goneid, AUC

You might also like