IS 224 Data Structures

This course covers the fundamentals of data structures and software modeling. Topics include: modern IDE for software development and code version management systems, design and development of reusable software, software modeling (class diagram, use case, CRC card), introduction to analysis of algorithms (order notation), abstract properties, implementation and use of stacks, queues, linked lists, and binary trees, binary search trees, recursion and efficiency of recursive solutions, range of search (sequential, binary), select (min, max, median), and sort algorithms (quicksort, merge sort, heap sort) and their time and space efficiencies, software quality assurance (pre and post conditions, program testing), team development of software applications, and professional responsibilities and liabilities associated with software development. Prerequisite: IS 125. NOTE: Offered fall semesters only. Contact Hours: (2,2)




IS 125