|COURSE NUMBER:||CMPT 276|
|COURSE TITLE:||Data Structures|
|NAME OF INSTRUCTOR:||Instructor: Dr. Robert MacDonald
|CREDIT WEIGHT AND WEEKLY TIME DISTRIBUTION:||credits 3(hrs lect 3 - hrs sem 0 - hrs lab 3)|
|COURSE DESCRIPTION:||The objective of this course is to introduce the basic concepts of programming data structures, including how to select and design data structures that are appropriate for particular applications. Topics include stacks, queues, lists, trees, search trees, graphs, and sets. This course provides a mixture of theoretical knowledge and practical experience. The study of data structures and algorithms is carried out within an objectoriented framework and programming language.
Prerequisites: CMPT 275
|MARK DISTRIBUTION IN PERCENT:||
|COURSE OBJECTIVES:||The course is designed primarily to teach students how to use, design, and develop data structures using the C++ language. Secondarily the course teaches students how to use object oriented design (OOD) to solve a particular problem. Students will get hands-on experience designing and implementing data structures such as arrays, linked lists, stacks, queues, and binary trees. Students will also gain experience with the data structures provided by C++'s Standard Template Library (STL) to be familiar with professionally written code. However, the emphasis is on teaching students how to develop their own data structures and developing an appreciation for standardized data structure code such as that provided by STL.|
Final Exam date to be announced.
Note that the lectures on this schedule are very approximate.
Some topics may be finished slightly earlier or later than the dates shown.
Required texts, assignments, and grade distributions may vary from one offering of this course to the next. Please consult the course instructor for up to date details.
© The King's University
Maintained By Institutional Research