CSCI 3220: Data Structures
Spring 2020
| Meeting time: | TR 3:00-4:15pm |
| Classroom: | PKI 263 |
| Instructor: | Dr. Harvey Siy |
| Office: | PKI 281B |
| Phone: | (402)554-2834 |
| Email: | hsiy at unomaha dot edu |
| Office Hours: | MW 4:30-5:30pm, or email ahead to arrange an appointment |
Textbook:
(required) | Data Structures and Algorithm Analysis in Java (3rd ed) by Mark Weiss, Pearson, 2012.
Companion Website, Author Website |
Overview
This course discusses data structures, methods of organizing large amounts of data, algorithm analysis, and the estimation of the running time of algorithms. At the end of the course, the students will be able to understand the purposes and methods of the most commonly occurring data structures, analyze the data structure needs of particular problems, compare the efficiency of various implementations and algorithms, and write applications using data structures discussed in the course. The major data structures covered in this course include trees, hash tables, heaps, and graphs.
Prerequisite
- CSCI 1620 (Introduction to CS II)
- CSCI 2030 (Mathematical Foundations of CS) or MATH 2030 (Discrete Mathematics)
Learning Objectives
Students who complete this course will:
- Be familiar with different data structures such as lists, stacks, queues, trees, heaps, hash-tables and file structures which are used to store runtime data of a computer program.
- Be able to compare and discuss different data manipulation strategies including different algorithms for sorting and searching items within various data structures.
- Be able to develop algorithms and solutions to different data structures related problems.
- Understand the importance of efficiency in terms of time and storage space for the computer programs developed by the students.
- Learn about different algorithm design techniques including greedy programming, dynamic programming, and backtracking.
Major Topics
- Algorithm Analysis
- Lists, Stacks and Queue
- Trees
- Hashing
- Heaps
- Sorting
- Graphs
- Algorithm Design
Evaluation
| Exams |
50% |
| Assignments |
45% |
| Attendance |
5% |
Exams
- (15%) Midterm Exam 1 - Feburary 20 (tentative)
- (15%) Midterm Exam 2 - April 7 (tentative)
- (20%) Final Exam - May 7, 3:00pm-5:00pm
Assignments
- (20%) Written Assignments
- (25%) Programming Assignments
Policy on Late Assignments
Late assignments will get a 20% deduction per day, for each day past the due date. For online submissions, we will follow the time stamp as reported by Canvas. Paper submissions must be handed directly to me on the day it is due.
Academic Integrity
Any assignments handed in that have nearly identical parts may be taken as evidence of cheating and may thus have serious consequences.
For formal policies about cheating and plagiarism, consult the UNO Student Policies and Department of Computer Science Policies and Procedures.
Back to homepage.