BIL-267 Data Structures (Theory: 3, Lab:2, Credit: 4)

Definition and formal model of Abstract Data Types and their associated operations, with emphasis on separation of methodology from implementation. Object-oriented setting for presenting data structures in order to achieve information hiding. C++ programming language: data types, abstract data types and classes, collection classes, abstract operators and generic data types. Understanding and analyzing commonly used internal data structures (e.g., stacks, queues, linked lists, trees, graphs) and implementing them using C++. Introduction to computational complexity (time and space), and its use in the analysis of algorithms. Examination of tradeoffs among different implementation strategies (e.g., linked lists vs. arrays). Programming methods, sort and search algorithms. Recursion. Tree structures and tree search algorithms.

Prerequisite: 

BIL 102 - Introduction to Computer Programming II

It is assumed that every student has some experience in some high level language such as Pascal, C, C++, Java, or FORTRAN. It wil be further assumed that the student is capable of rapidly extending that understanding to the language of discourse of this course, which is C++.

Makeups:

Only one make-up test will be given. If a test is missed, you must take a cumulative
make-up test which will be scheduled for the end of the semester. No make-ups are to be given for the quizzes or homeworks.

Suggestions & Complaints:

If you have any suggestions or complaints about the labs, consultants or the course fill out a "suggestion/complaint form" at the departmental office or contact to instructor.

Attendance is mandatory. Students that fail to attend 30% of the classes will fail automatically.

Last revised on August 01, 2001 KD.