The field of computer science that deals with the automated storage and retrieval of documents is called information retrieval (IR). IR systems are in widespread use in university, corporate, and public libraries. IR techniques have also been used in areas such as office automation and software engineering. In fact, any field that relies on documents to do its work can benefit from IR techniques. IR is not to be confused with DBMS (Database Management Systems) which is a separate discipline.
The primary goal of this course is to formally analyze the basic data structures and algorithms of IR. Relevant empirical studies which compare algorithms and data structures will be covered. Implementations of such algorithms in C and Perl will be the focus of a 2-3 hour laboratory session.
Teaching Assistants will be available to help answer students' questions about assignments and other course-related material during these sessions.
CS112 - Data Structures and CS311 - Discrete Structures , or by permission of instructors.