Course Description: This course will provide an introduction to ways in which data can be organized, represented and processed from low-level to high level. Topics include construction of memory based structures and algorithms using arrays (single, multidimensional), lists (single, double, circular), stacks, queues, binary trees, and hash tables, and basic file manipulation.

Prerequisite: INFO-C211 or INFO-I211.

Textbook: No textbook required. A set of class notes will be provided.

Grading system:

• About 12 homework assignments  :   20 points each
• Lab assignments  :   5 points of the week's homework assignment as appropriate.
• About 12 quizzes:     5 points each
• Midterm exam  :   50 points
• Final exam  :   50 points

Guidelines for assignments:

• The assignments will be posted on the course web page and on Canvas (iu.instructure.com).
• The assignments are due at midnight of the due date.
• The programming assignments are turned in on Canvas.
• No homework accepted after 1 week from the due date. A late homework loses 10% of the points per day, up to 50% of the points.
• All the assignments are individual. Consulting with colleagues is acceptable, but programs that are too similar can be penalized or rejected. No credit will be given for programs obtained from external sources unless explicitly allowed.

Programming environment:

• Platform: Your favorite operating system is fine, and any campus or personal computer.
• Language: Java SE Version 8 or higher.
• IDE: Eclipse or NetBeans, your preference.