CSIS 310 Data Structures

---

Course Description

An introduction to the concepts of information organization and manipulation. The course covers basic sequential structures such as lists, linked lists, stacks, and queues and moves on to more complex data structures such as trees, graphs, priority queues, and dictionaries. Programming projects are completed in one or more high-level languages.

Instructor

Brian R. Snider
Office hours: Klages 202 (see schedule)

Texts

required

• M.A. Weiss, Data Structures and Algorithm Analysis in Java, 3rd Ed. Pearson, 2011.
  ISBN: 978-0132576277
• D.A. Bailey, Java Structures, √7 Edition, 2007.
  (full text online)

recommended

• A.V. Aho and J.D. Ullman, Foundations of Computer Science, C Edition. W.H. Freeman and Company, 1994.
  ISBN: 978-0716782841 (full text online)

Resources

• Mailing list
• Oracle Java 10 API Reference
• Oracle Java SE 10 Development Kit (JDK)
• Apache Netbeans 9
• JetBrains IntelliJ IDEA
• Java coding style guidelines

---

Objectives

Students will:

• Understand how to build and use basic data structures, including lists, stacks, queues, trees, graphs, priority queues, and maps
• Be introduced to basic computational complexity and algorithm analysis as applied to data structures
• Be able to choose, implement, and use data structures appropriate to a given problem
• Be capable of using these basic data structures to build more complex data structures and complete programs to solve specific problems

---

Course Organization

This course will be programming intensive. Though many data structures are now provided by libraries or programming languages themselves, we will implement many of these structures in this course to gain programming experience and an understanding of basic programming principles. The data structures studied here form the fundamental building blocks used in developing complex programs.

I will, in fact, claim that the difference between a bad programmer and a good one is whether he considers his code or his data structures more important. Bad programmers worry about the code. Good programmers worry about data structures and their relationships.

Programming assignments will be carried out in a prescribed high-level language. Instruction in the use of this language will be provided, but the focus of this course will not be on a particular programming language, but on language-independent data structures. You are assumed to have previous experience with one or more high-level languages and will be expected to independently acquire the language skills necessary for this course with a minimum level of instruction.

The course will include regular homework and/or programming assignments. Unless otherwise specified, assignments are due before the beginning of class on the due date. There will be no credit given for late assignments (without an excused absence)—turn in as much as you can.

Reading assignments should be completed before the lecture covering the material. Not all reading material will be covered in the lectures, but you will be responsible for the material on homework and exams. Quizzes over the assigned reading may be given at any time.

Collaboration

See the GFU CS/IS/Cyber policies for collaboration and discussion of collaboration and academic integrity. Most students would be surprised at how easy it is to detect collaboration in programming—please do not test us! Remember: you always have willing and legal collaborators in the faculty.

Almost all of life is filled with collaboration (i.e., people working together). Yet in our academic system, we artificially limit collaboration. These limits are designed to force you to learn fundamental principles and build specific skills. It is very artificial, and you'll find that collaboration is a valuable skill in the working world. While some of you may be tempted to collaborate too much, others will collaborate too little. When appropriate, it's a good idea to make use of others—the purpose here is to learn. Be sure to make the most of this opportunity but do it earnestly and with integrity.

Engineering Your Soul

The mission and vision statement of the Computer Science & Information Systems (CSIS) program states that our students are distinctive by "bringing a Christ-centered worldview to our increasingly technological world."

As one step towards the fulfillment of this objective, each semester, the engineering faculty will collectively identify an influential Christian writing to be read and reflected upon by all engineering faculty and students throughout the term. As part of the College of Engineering, CSIS students participate in this effort, known as Engineering Your Soul (EYS). This exercise will be treated as an official component of every engineering course (including CSIS courses) and will be uniquely integrated and assessed at my discretion, typically as a component of the quiz grade.

Students should read the assigned reading each week. Regular meetings will be scheduled throughout the semester that can be attended for chapel elective credit. Students should attend these meetings prepared to discuss the assigned reading, or email a reflection on the assigned reading on or before each meeting date.

It is our hope that students will not view this as one more task to complete, but as a catalyst for continued discussion ultimately leading to a deeper experience of Jesus Christ.

Online Portfolio

All students in the College of Engineering are required to create and maintain an online portfolio on Portfolium to showcase their best work. Portfolium is a "cloud-based platform that empowers students with lifelong opportunities to capture, curate, and convert skills into job offers, while giving learning institutions and employers the tools they need to assess competencies and recruit talent."

Students will post portions of their coursework to Portfolium as directed by their instructor. For example, a portfolio entry might be PDF of poster or presentation content, screenshots or a video demonstration of a software or hardware project, or even an entire source code repository. In addition to required portfolio entries, students are encouraged to post selected work to their portfolios throughout the year.

Students will work with their faculty advisor to curate and refine their portfolios as they progress through the program. Students shall ensure that all portfolio entries are appropriate for public disclosure (i.e., they do not reveal key components of assignment solutions to current or future students).

University Resources

If you have specific physical, psychiatric, or learning disabilities and require accommodations, please contact the Disability Services Office as early as possible so that your learning needs can be appropriately met. For more information, go to ds.georgefox.edu or contact Rick Muthiah, Director of Learning Support Services (503-554-2314 or rmuthiah@georgefox.edu).

The Academic Resource Center (ARC) on the Newberg campus provides all students with free writing consultation, academic coaching, and learning strategies (e.g., techniques to improve reading, note-taking, study, time management). The ARC, located in the Murdock Learning Resource Center (library), is open from 1:00–10:00 p.m., Monday through Thursday, and 12:00–4:00 p.m. on Friday. To schedule an appointment, go to the online schedule at arcschedule.georgefox.edu, call 503-554-2327, email the_arc@georgefox.edu, or stop by the ARC. Visit arc.georgefox.edu for information about ARC Consultants' areas of study, instructions for scheduling an appointment, learning tips, and a list of other tutoring options on campus.

---

Grading

Grading Scale

Current Grades

The final course grade will be based on:

• 50% Homework & programming assignments
• 45% Exams
• 5% Quizzes & participation

---

Tentative Schedule

Week 1 · 8/27 Introduction

Week 1 · 8/29 Expectations Misc: Examples

Week 1 · 8/31 Abstraction & Encapsulation Bailey: Ch. 1

Week 2 · 9/3 Art of Programming FoCS: Ch. 1.1–1.3, 1.5

Week 2 · 9/5 Java Programming Bailey: Appx. B

Week 2 · 9/7 Java Review: Classes & Instances Bailey: Ch. 1

Week 3 · 9/10 Java Review: Inheritance Bailey: Ch. 4

Week 3 · 9/12 Serve Day — no class

Week 3 · 9/14 Java Review: Javadoc & Miscellany Misc: Javadoc

Week 4 · 9/17 Robust Programming: Assertions & Exceptions Bailey: Ch. 2 FoCS: Ch. 2 Misc: Exceptions

Week 4 · 9/19 Robust Programming: Unit Testing Misc: jUnit

Week 4 · 9/21 Arrays FoCS: Ch. 6.1–6.5

Week 5 · 9/24 ArrayList & Vector Weiss: Ch. 1.5–1.6 Bailey: Ch. 3.1–3.5

Week 5 · 9/26 Introduction to Algorithm Analysis Weiss: Ch. 1.1–1.3, 2.1–2.3 Bailey: Ch. 5.1–5.2

Week 5 · 9/28 Amortized Analysis Weiss: Ch. 2.4 FoCS: Ch. 3.1–3.3

Week 6 · 10/1 Complexity Categories & Big-Oh Notation Bailey: Ch. 5.3 FoCS: Ch. 3.4–3.6

Week 6 · 10/3 Midterm exam Weiss: Ch. 1–2 Bailey: Ch. 1–5 FoCS: Ch. 1–3 Misc: *

Week 6 · 10/5 Abstraction & Interfaces Bailey: Ch. 7

Week 7 · 10/8 Iteration Weiss: Ch. 3.1–3.3 FoCS: Ch. 2.2

Week 7 · 10/10 Iteration: Implementation Bailey: Ch. 8.1–8.2

Week 7 · 10/12 Mid-semester break — no class

Week 8 · 10/15 Abstract List Weiss: Ch. 3.1–3.2 Bailey: Ch. 9.1–9.3 FoCS: Ch. 6.1–6.3

Week 8 · 10/17 List: Implementations Weiss: Ch. 3.3–3.5 Bailey: Ch. 9.4–9.7 FoCS: Ch. 6.4

Week 8 · 10/19 List: Analysis Bailey: Ch. 9.8–9.9

Week 9 · 10/22 Searching Weiss: Ch. 2.4.4 Bailey: Ch. 11.1–11.2 FoCS: Ch. 6.5

Week 9 · 10/24 Sorting Weiss: Ch. 7.1–7.3, 7.6–7.7 Bailey: Ch. 6 FoCS: Ch. 2.8

Week 9 · 10/26 Stack Weiss: Ch. 3.6.1–3.6.2 Bailey: Ch. 10.1 FoCS: Ch. 6.6

Week 10 · 10/29 Stack: Applications Weiss: Ch. 3.6.3 FoCS: Ch. 6.7

Week 10 · 10/31 Queue Weiss: Ch. 3.7 Bailey: Ch. 10.2 FoCS: Ch. 6.8

Week 10 · 11/2 Deque Bailey: Ch. 10.4 FoCS: Ch. 6.11

Week 11 · 11/5 Abstract Tree Weiss: Ch. 4.1 FoCS: Ch. 5.1–5.5, 9.6–9.7

Week 11 · 11/7 Midterm exam Weiss: Ch. 1–3, 7 Bailey: Ch. 1–10 FoCS: Ch. 1–3, 6 Misc: *

Week 11 · 11/9 Binary Tree Weiss: Ch. 4.1.2 Bailey: Ch. 11.1–11.6 FoCS: Ch. 5.1–5.6

Week 12 · 11/12 Binary Search Tree Weiss: Ch. 4.3 Bailey: Ch. 14.1 FoCS: Ch. 5.1–5.7–5.8

Week 12 · 11/14 Priority Queue Weiss: Ch. 6.1–6.2, 6.4 Bailey: Ch. 13.1–13.3 FoCS: Ch. 5.9

Week 12 · 11/16 Heap Weiss: Ch. 6.3, 6.9 Bailey: Ch. 13.4–13.7 FoCS: Ch. 5.10

Week 13 · 11/19 Optimal Search Weiss: Ch. 5.1–5.3 Bailey: Ch. 15.1–15.3 FoCS: Ch. 7.1–7.5

Week 13 · 11/21 Hashing Weiss: Ch. 5.4–5.6, 5.9 Bailey: Ch. 15.4–15.7 FoCS: Ch. 7.1–7.6

Week 13 · 11/23 Thanksgiving — no class

Week 14 · 11/26 Abstract Graph Bailey: Ch. 16.1 FoCS: Ch. 9.1–9.2

Week 14 · 11/28 Graph: Implementations Weiss: Ch. 9.1 Bailey: Ch. 16.2–4 FoCS: Ch. 9.3–9.4

Week 14 · 11/30 Graph: Algorithms Weiss: Ch. 9.5 Bailey: Ch. 16.5–6 FoCS: Ch. 9.5–9.9

Week 15 · 12/3 Selected Topics

Week 15 · 12/5 Java Collections Misc: Java API

Week 15 · 12/7 Review

Week 16 · TBD Final exam Weiss: * Bailey: * FoCS: * Misc: *

Week	Date	Topic	Weiss	Bailey	FoCS	Misc
Week 1	8/27	Introduction	-	-	-	-
	8/29	Expectations	-	-	-	Examples
	8/31	Abstraction & Encapsulation	-	Ch. 1	-	-
Week 2	9/3	Art of Programming	-	-	Ch. 1.1–1.3, 1.5	-
	9/5	Java Programming	-	Appx. B	-	-
	9/7	Java Review: Classes & Instances	-	Ch. 1	-	-
Week 3	9/10	Java Review: Inheritance	-	Ch. 4	-	-
	9/12	Serve Day — no class
	9/14	Java Review: Javadoc & Miscellany	-	-	-	Javadoc
Week 4	9/17	Robust Programming: Assertions & Exceptions	-	Ch. 2	Ch. 2	Exceptions
	9/19	Robust Programming: Unit Testing	-	-	-	jUnit
	9/21	Arrays	-	-	Ch. 6.1–6.5	-
Week 5	9/24	ArrayList & Vector	Ch. 1.5–1.6	Ch. 3.1–3.5	-	-
	9/26	Introduction to Algorithm Analysis	Ch. 1.1–1.3, 2.1–2.3	Ch. 5.1–5.2	-	-
	9/28	Amortized Analysis	Ch. 2.4	-	Ch. 3.1–3.3	-
Week 6	10/1	Complexity Categories & Big-Oh Notation	-	Ch. 5.3	Ch. 3.4–3.6	-
	10/3	Midterm exam	Ch. 1–2	Ch. 1–5	Ch. 1–3	*
	10/5	Abstraction & Interfaces	-	Ch. 7	-	-
Week 7	10/8	Iteration	Ch. 3.1–3.3		Ch. 2.2
	10/10	Iteration: Implementation	-	Ch. 8.1–8.2	-	-
	10/12	Mid-semester break — no class
Week 8	10/15	Abstract List	Ch. 3.1–3.2	Ch. 9.1–9.3	Ch. 6.1–6.3	-
	10/17	List: Implementations	Ch. 3.3–3.5	Ch. 9.4–9.7	Ch. 6.4	-
	10/19	List: Analysis	-	Ch. 9.8–9.9	-	-
Week 9	10/22	Searching	Ch. 2.4.4	Ch. 11.1–11.2	Ch. 6.5	-
	10/24	Sorting	Ch. 7.1–7.3, 7.6–7.7	Ch. 6	Ch. 2.8	-
	10/26	Stack	Ch. 3.6.1–3.6.2	Ch. 10.1	Ch. 6.6	-
Week 10	10/29	Stack: Applications	Ch. 3.6.3	-	Ch. 6.7	-
	10/31	Queue	Ch. 3.7	Ch. 10.2	Ch. 6.8	-
	11/2	Deque	-	Ch. 10.4	Ch. 6.11	-
Week 11	11/5	Abstract Tree	Ch. 4.1	-	Ch. 5.1–5.5, 9.6–9.7	-
	11/7	Midterm exam	Ch. 1–3, 7	Ch. 1–10	Ch. 1–3, 6	*
	11/9	Binary Tree	Ch. 4.1.2	Ch. 11.1–11.6	Ch. 5.1–5.6	-
Week 12	11/12	Binary Search Tree	Ch. 4.3	Ch. 14.1	Ch. 5.1–5.7–5.8	-
	11/14	Priority Queue	Ch. 6.1–6.2, 6.4	Ch. 13.1–13.3	Ch. 5.9	-
	11/16	Heap	Ch. 6.3, 6.9	Ch. 13.4–13.7	Ch. 5.10	-
Week 13	11/19	Optimal Search	Ch. 5.1–5.3	Ch. 15.1–15.3	Ch. 7.1–7.5	-
	11/21	Hashing	Ch. 5.4–5.6, 5.9	Ch. 15.4–15.7	Ch. 7.1–7.6	-
	11/23	Thanksgiving — no class
Week 14	11/26	Abstract Graph	-	Ch. 16.1	Ch. 9.1–9.2	-
	11/28	Graph: Implementations	Ch. 9.1	Ch. 16.2–4	Ch. 9.3–9.4	-
	11/30	Graph: Algorithms	Ch. 9.5	Ch. 16.5–6	Ch. 9.5–9.9	-
Week 15	12/3	Selected Topics	-	-	-	-
	12/5	Java Collections	-	-	-	Java API
	12/7	Review	-	-	-	-
Week 16	TBD	Final exam	*	*	*	*

---

1. GFU
2. CSIS
3. Brian R. Snider
4. CSIS 310