Data Structures and Algorithms

E672019

Data Structures and Algorithms is a foundational computer science textbook that systematically introduces core data organization techniques and algorithmic strategies for efficient problem solving.

Try in SPARQL Jump to: Surface forms Statements Referenced by

All labels observed (1)

Label Occurrences
Data Structures and Algorithms canonical 1

Statements (48)

Predicate Object
instanceOf computer science textbook
non-fiction book
coversConcept Big-O notation NERFINISHED
Big-Omega notation NERFINISHED
Big-Theta notation NERFINISHED
NP-completeness NERFINISHED
algorithm design techniques
array data structures
asymptotic analysis
backtracking
balanced search trees
divide and conquer
dynamic programming
graph algorithms
graph data structures
greedy algorithms
hash tables
hashing
heaps
linked lists
pattern matching
queues
recurrence relations
search algorithms
sorting algorithms
space complexity
stacks
string algorithms
time complexity
tree data structures
educationalLevel undergraduate
field computer science
focusesOn algorithmic strategies
data organization techniques
efficient problem solving
goal build strong algorithmic thinking skills
teach efficient problem solving
intendedAudience computer science students
practicing programmers
software engineering students
medium digital
print
pedagogicalApproach problem-solving oriented
systematic introduction of core concepts
topic algorithms
data structures
usedFor technical interview preparation
university courses

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Alfred V. Aho coAuthorOf Data Structures and Algorithms