Note: This course description is only applicable for the Computer Science Post-Baccalaureate program ... in algorithm design and analysis including criteria for selecting data structures to fit their ...

A degree in Computer Science requires basic ... mathematics. If you intend to major in Computer Science, by the time you finish your sophomore year, you should complete Computer Science 141: ...

Basic concepts of data. Linear lists, strings, arrays, and orthogonal lists. Trees and graphs. Storage systems and structures. Storage allocation and collection. Multilinked structures. Symbol tables, ...

Mathematical Background: We expect that the student is comfortable with basic mathematics ... control structures in Python: conditional branches, for loops and recursion; functions: defining and ...

Topics include: data and procedural abstraction, amortized data structures, trees and search trees, hash tables, priority queues, graphs, shortest paths, searching, and sorting. Required for computer ...

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include ... trees and more general graphs.

Hash tables are among the most thoroughly studied data structures in all of computer science; the advance sounded too good to be true. But just to be sure, he asked a frequent collaborator (and a ...