Introduction_Part_4

Introduction_Part_4 - • Example algorithm design...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
Last Updated: January 5, 2012 CSE 2011 Prof. J. Elder Data Structures We Will Study Linear Data Structures Arrays Linked Lists Stacks Queues Priority Queues Non-Linear Data Structures Trees Heaps Hash Tables Search Trees Graphs Directed Graphs Weighted Graphs
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Last Updated: January 5, 2012 CSE 2011 Prof. J. Elder Some Algorithms We Will Study Searching Sorting Graph Search Dynamic Programming Please see syllabus posted on website for detailed schedule (tentative).
Background image of page 2
Last Updated: January 5, 2012 CSE 2011 Prof. J. Elder Design Patterns A template for a software solution that can be applied to a variety of situations. Main elements of solution are described in the abstract. Can be specialized to meet specific circumstances.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: • Example algorithm design patterns: – Recursion – Divide and Conquer Last Updated: January 5, 2012 CSE 2011 Prof. J. Elder Object-Oriented Design Last Updated: January 5, 2012 CSE 2011 Prof. J. Elder Software Engineering • Software must be: – Readable and understandable • Allows correctness to be verified, and software to be easily updated. – Correct and complete • Works correctly for all expected inputs – Robust • Capable of handling unexpected inputs. – Adaptible • All programs evolve over time. Programs should be designed so that re-use, generalization and modification is easy. – Portable • Easily ported to new hardware or operating system platforms. – Efficient • Makes reasonable use of time and memory resources....
View Full Document

This note was uploaded on 02/14/2012 for the course CSE 2011Z taught by Professor Elder during the Fall '11 term at York University.

Page1 / 5

Introduction_Part_4 - • Example algorithm design...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online