ITEC2620 Data Structures: Intro and Syllabus

• ITEC2620 is an Introduction to Data Structures

Syllabus I

• The cover page can be found in-class, during office hours, or through an on-line forum.

Syllabus II

• An introductory course in algorithms and data structures is described
• Assumes knowledge of how to program
• JAVA communicates advanced/abstract ideas, separating good programmers from mere coders

Syllabus III

• The focus is on concepts, like what you can program
• Course is traditionally the second course in computer science
• Course probably separates the top programmers from those who are not

Syllabus IV

• Learn and use efficient programming patterns
• An efficient programmer can produce programs that run five times faster than an inefficient programmer

Syllabus V

• The required textbook is “Data Structures and Algorithm Analysis in Java – Third Edition" by Clifford A. Shaffer
• An on-line copy can be helpful

Syllabus VI

• Homework assignments are due at the beginning of class in week 6
• The midterm is in week 7

Syllabus VII

• The evaluation is by:
• Assignment: 10%
• Midterm: 30%
• Final: 60%

Syllabus VIII

• Late assignments are not accepted, with no makeup midterm
• Accommodation is provided to students

Syllabus VIIIa

• If the average on the midterm is better than the assignment grade, the midterm average replaces it
• If the average on the first half of the final exam is better than the midterm average, the final exam average replaces it
• It's possible for the final exam score to count for 100% of the course

Syllabus VII (revisited)

• Evaluation breakdown:
• Assignment: 10%
• Midterm: 30%
• Final: 60%

Syllabus IX

• Involves lecture topics, readings, and course organization
• Organized from concrete to concept
• searching → sorting → complexity analysis
• binary tree → recursion

Syllabus X

• Computer science knowledge helps interface between computer science and end users
• Acts as an important foundation for database courses

Introduction I

• A computer is a machine that processes data

Introduction II

• Keys to programming involve algorithm design, data organization, and modularization

Introduction III

• Algorithm design includes sequence, branching, looping, flowcharts, and pseudocode like in ITEC1620
• Efficiency and time-space tradeoffs link algorithms and data structures
  • Course covers this

Introduction IV

• In data organization:
• Usage of Objects and classes such as ITEC1620, ITEC2610
• Data structures
• Covered within the course

Course Insight

• Key concepts come first, including searching, sorting, complexity analysis, and linked structures
• Fun stuff like game trees and grammars are later
• Engineering and AI constitute a background

Readings and Assignments

• Suggested readings from Shaffer (third edition) include 1.1, 1.3-1.5