Global Search Results

Survey basic abstract data types, their associated algorithms, and how they are implemented. Topics discussed include the structures of stacks, queues, lists, sorting and selection, searching, graphs, and hashing; performance tradeoffs of different implementations; and asymptotic analysis of running time and memory usage.

CS201 (2017.A.01)

WELCOME TO CS302: SOFTWARE ENGINEERING Specific information about this course and its requirements can be found below. For more general information about taking Saylor Academy courses, including information about Community and Academic Codes of Conduct, please read the Student Handbook. COURSE DESCRIPTION Learn how to apply an engineering approach to computer software development by focusing on software principles, lifecycle models, requirements and specifications, architecture and conceptual...

BACKGROUND A linked list is a concrete data structure which models a sequence. A linked list is a chain of _node_ objects. Each node object stores * A single value in the sequence; this is the _payload_ * A reference (pointer) to the node storing the next value in the sequence; this is the _successor_ reference. Optionally, a node may also have a reference to the node containing the previous value in the sequence. This is the _predecessor_ reference. Linked lists whose nodes contain only succ...

An ArrayList is a random-access data structure: we can efficiently (O(1)) access any element in the collection. However, arbitrary removals are not efficient. A LinkedList is a sequential-access data structure: we can efficiently access one element after another (starting at the beginning, or either end for a doubly-linked list). Arbitrary removals are efficient (O(1)) if we have an iterator positioned at the location of the removed element. Stacks and queues are abstract data types represent...

WELCOME TO CS201: ELEMENTARY DATA STRUCTURES Specific information about this course and its requirements can be found below. For more general information about taking Saylor Academy courses, including information about Community and Academic Codes of Conduct, please read the Student Handbook. COURSE DESCRIPTION Survey basic abstract data types, their associated algorithms, and how they are implemented. Topics discussed include the structures of stacks, queues, lists, sorting and selection, se...

WELCOME TO CS401: OPERATING SYSTEMS Specific information about this course and its requirements can be found below. For more general information about taking Saylor Academy courses, including information about Community and Academic Codes of Conduct, please read the Student Handbook. COURSE DESCRIPTION Examine how operating systems and design have evolved as changes in hardware and software led to contemporary operating systems. Topics include basic OS concepts, methods of OS design and const...

WELCOME TO CS403: INTRODUCTION TO MODERN DATABASE SYSTEMS Specific information about this course and its requirements can be found below. For more general information about taking Saylor Academy courses, including information about Community and Academic Codes of Conduct, please read the Student Handbook. COURSE DESCRIPTION Learn about database architecture and implementation by exploring Structured Query Language (SQL), including topics like file structures and access methods; database model...

THIS EXAM IS CLOSED. If you wish to take the most recent Certificate Final Exam, please go to the Certificate Final Exam section of this course.