Sage already knows this exact syllabus — ask it anything about Fundamental of Data Structures, generate practice questions in your exam's format, and get a cram sheet that works offline.
What you'll be able to do (official learning outcomes)
explain fundamental abstract data types which can include: Maps, Sets and Vectors
explain program data structures and use them in implementation of abstract data types
devise novel solutions to small scale programming challenges involving data structures and recursion
describe the basic algorithmic complexity
estimate the algorithmic complexity of simple, non-recursive programs
perform simple inductive proofs and proofs by contradiction and reason about program correctness and invariants; and
Course contents
Stacks, linked lists; trees, priority queues; search trees; sorting; hashing, garbage collection; storage management; maps and dictionaries; text processing; graphs. Introduction to algorithms and their importance, mathematical foundations: growth functions, complexity analysis of algorithms, summations, recurrences, sorting algorithms.
Source: the Nigerian Universities Commission (NUC) Core Curriculum and Minimum Academic Standards (CCMAS). StudyOps loads this syllabus automatically when you study COS 301.