Week 0
Course Rules:
Website:
- When you sign up, please use the same name you have in your AASTMT records, and include your AASTMT ID. This how I can migrate your grades to the AASTMT system.
- Login often to follow up with assignment deadlines and announcements. Its your responsibility to keep up with the course. Failure to receive emails or notifications is no excuse. Everything is announced in class and then published in moodle.
Academic Honesty:
- Please confirm with the AASTMT policies regarding plagiarism and cheating. A zero grade for the violating submission will be given the first time, then reported to the department for further action.
- Please ask questions in the online forum to allow everyone to join and benefit from the discussions, and avoid private emails to the lecturers and TAs. Contact the teachers privately only about your personal grades or circumstances, not about the course content.
How to score A+ in this course?
- Please do all practicals and assignments and study regularly. In case of problems, please ask questions. Accumulating problems will make things worse as the semester goes by.
The course tackles the difference between static data type and dynamic data types. The concept of pointers & dynamic memory allocation is discussed allowing students to experience practical programming using dynamic structures.
Learning Outcomes:
The student will be able to:
- Understand the data types and static data structures pointers, dynamic data structures: stack queues linked lists, trees and graphs.
- Define the difference between static data type and dynamic data types and introduce the concept of pointers & dynamic memory allocation.
- Acquire programming experiences using dynamic structures.
Course Topics:
- Introduction to static Vs dynamic data structures
- Stack data type
- Implementation of stack in different applications
- Queue data type
- Introduction to dynamic programming using pointers
- Linked lists
- Double & circular linked lists
- Introduction to tree structures
- Tree traversals
- Threaded tree
- Graphs representation and traversals
- Graphs minimum spanning tree & shortest path
TEXT BOOK
Mark Weiss and Benjamen Cummings, “Data structures and algorithm analysis”.
PREREQUISITE: CC 213
Grading Scheme:
| Week 7 | |
| Quizes | 5% |
| Lab Submissions | 2.5% |
| Assignments | 2.5% |
| Midterm 1 | 20% |
| Week 12 | |
| Quizes | 5% |
| Lab Submissions | 2.5% |
| Assignments | 2.5% |
| Midterm 2 | 10% |
| Project | 10% |
| Final Exam |
40% |
Course Description File 153.3KB PDF document
