COM 1320 : Data Structures
MetadataShow full item record
Syllabus / YU Only
Description Data Structures are logical constructs that facilitate organizing and accessing data efficiently. They are also the “raw materials” on which algorithms run. Choosing the right data structures will make or break any non-trivial program because, together with the choice of algorithms, they dictate what a program can do in a reasonable amount of time. Software engineers must build complete, and efficient, programs that solve non-trivial problems. This requires making correct use of data structures. Course Outcomes Students will be able to explain the characteristics, strengths, and weaknesses, of the most common data structures, and when to use them Students will be able to choose the right data structure(s) to use in order to meet or exceed a program’s requirements Students will be able to implement programs that solve real-world problems making appropriate use of data structures Students will be able to independently learn about additional data structures Students will be able to articulate how data structures affect a program’s performance Students will be able to articulate the relationship between data structures and algorithms Major Topics Covered in Course Introduction to growth rates, a.k.a. asymptotic analysis, as it pertains to the performance implications of choice of data structures Core data structure building blocks: arrays, lists, and recursion Basic data structures: hash tables, stacks, queues, dictionaries, trees (binary, 2-3, red-black, BTree, Tries, Heaps) Using all the above in various applications Software engineering tools and methods
Diament, Judah M.
*This is contructed from limited avaiable data and may be imprecise.
The file is restricted. Please click here to access the YU-community-only item.
The following license files are associated with this item: