Skip to main content

CS201: Elementary Data Structures

Page path
  • Home /
  • Courses /
  • Course Catalog /
  • Computer Science /
  • CS201: Elementary Data Structures /
  • Study Guides and Review Exercises
Back to course 'CS201: Elementary Data Structures'
  • Study Guides and Review Exercises

    These study guides are intended to help reinforce key concepts in each unit in preparation for the final exam. Each unit study guide aligns with course outcomes and provides a summary of the core competencies and a list of vocabulary terms. The study guides are not meant to replace the readings and videos that make up the course.

    The vocabulary lists include some terms that might help you answer some of the review items, and some terms you should be familiar with to be successful in completing the final exam for the course.

    • Unit 1 Study Guide and Review: Abstract Data Types and Arrays in C++ Page
    • Unit 2 Study Guide and Review: Introduction to Stacks and Queues Page
    • Unit 3 Study Guide and Review: Pointers and References in C++ Page
    • Unit 4 Study Guide and Review: Dynamic Memory Allocation Page
    • Unit 5 Study Guide and Review: Linked Stacks, Queues, and Lists Page
    • Unit 6 Study Guide and Review: Algorithm Efficiency Page
    • Unit 7 Study Guide and Review: Searching and Sorting Algorithms Page
    • Unit 8 Study Guide and Review: Searching and Sorting Algorithms Page

Navigation

Art History
Biology
Business Administration
Chemistry
Communication
Economics
English
History
Mathematics

Creative Commons License
© Saylor Academy 2010-2018 except as otherwise noted. Excluding course final exams, content authored by Saylor Academy is available under a Creative Commons Attribution 3.0 Unported license. Third-party materials are the copyright of their respective owners and shared under various licenses. See www.saylor.org/open/licensinginformation for detailed licensing information.

Saylor Academy and Saylor.org® are trade names of the Constitution Foundation, a 501(c)(3) organization through which our educational activities are conducted.

Terms of Use | Privacy Policy