Software engineers are highly involved in the design and development of completx software systems that require efficiency and optimized operations. This course introduces the students to the fundamental concepts of data structures, algorithms design, and performance analysis from an engineering problem solving perspective. Topics include data type and abstract data types; fundamental data structures including stacks, queues, linked lists, hash tables and trees; recursion and backtracking; pointers; the basics of algorithmic analysis such as complexity analysis and asymptotic analysis; fundamental computing algorithms such as sorting and searching algorithms, and basic algorithmic strategies like brute-force, greedy, divide-and-conquer, branch-and-bound algorithms and dynamic programming. Emphasis will be made on the practical components that support problem solving and efficient software design practices. This course is required for all software engineering majors. This can be taken as an elective for other engineering, math and science majors.

Prerequisites: MATH2070, INFS2151 or INFS2184