Welcome to CMSC 202. This course builds on the foundation provided by the CMSC
201 course (in which topics such as file I/O, use of arrays and functions, and use of C++
classes for OOP have been learned). In CMSC 202 you will learn about and use
"data structures" including linked lists, stacks, queues, and binary trees.
You will use C++ classes (user-defined data types that combine data and operations
on the data) to implement these data structures. The use of pointer variables will
be emphasized. Various sorting and searching techniques will be compared.
Below is an explanation of the icons that you will discover as you navigate the world of
CMSC202. The information for this course was provided by Sylvia Sorkin and Sheldon
Rudie.
Introductory Information contains course policies
and information about some of the instructors for this course.
Practice exams links you to exams
which Sylvia Sorkin gave in previous semesters. Your instructor will not give the same
exams, but at least you can get a basic idea of the types of concepts that you need to
know.
Lecture Notes
provides you links to a PowerPoint presentation created by Sylvia Sorkin.
Web sites of Interest links to various web sites that
may be of interest to you.