CS 302 Data Structures
Department of Computer Science & Engineering
UNR, Fall 2016
Course Information -
ABET Criteria -
| Class hours
|| Tuesday & Thursday, 4:00 - 5:15pm, EJCN 103
|| Dr. Mehmet H. Gunes
|| mgunes (at) unr (dot) edu
|| (775) 784 - 4313
| Web page
|| SEM 238 (Scrugham Engineering-Mines)
| Office hours
|| Tuesday & Thursday 9:30 am - 11:00 am or by appointment
Shehryar Masaud, shehryar(at)nevada(dot)unr(dot)edu, Thu 12:45-3:45pm, ARF 116 |
Iman Vakili ivakilinia(at)unr(dot)edu, Fri 2-5pm, ARF 205
Data structures and algorithms fundamental to computer science; abstract data-type concepts;
measures of program running time and time complexity; algorithm analysis and design techniques.
The purpose of this course is to introduce you to data structures, an issue central to the art of computer programming.
At the end of the course you will be equipped with the tools of data organization to enable you to write simple, clear, and efficient programs.
The course will be structured around a comprehensive set of computer assignments to enable you to get hands on experience.
Our programming language of choice will be C++.
You may look at earlier courses from
Spring 2013 and
- Prerequisite : C or above in CS 202
- A good working knowledge of C++ programming up through recursion, dynamic memory and basic data structures such as stacks, queues, and linked lists.
- Gayle L McDowell Cracking the Code Interview, CareerCup, 6th edition
- Setfan Brandle, Jonathan Geisler, James Roberge, David Whittington"C++ Data Structures: A Laboratory Course", Jones and Bartlett, 3rd edition
- Clifford A. Shaffer Data Structures and Algorithm Analysis, Dover Publications, 3rd edition.
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, "Introduction To Algorithms", The MIT Press; 3rd edition.
- Mark Allen Weiss, "Data Structures and Algorithm Analysis in C++ ", Prentice Hall, 3rd edition
- W. Ford and W. Topp, "Data Structures with C++", Prentice Hall, 2nd edition
- R. Kruse and A. Ryba "Data Structures and Program Design in C++ ", Prentice Hall
- M. Main and W. Savitch "Data Structures and Other Objects Using C++.", Prentice Hall, 4th edition
- Nell Dale, "C++ Plus Data Structures", Jones & Bartlett Learning; 5th edition.
This is a tentative list of topics, subject to modification and reorganization.
- Data Abstraction
- Array- and Link-Based Implementations
- Recursion as a Problem-Solving Technique
- Algorithm Efficiency
- Sorting (Selection sort, Bubble sort, Insertion sort, Merge sort, Quick sort, Radix sort, Counting sort, Bucket sort)
- Queues and Priority Queues
- Trees (Binary Search Tree, Interval Tree, MDS Tree)
- Heaps (Heap ADT and Heap Sort)
- Dictionaries (Dictionary ADT, Hashing)
- Balanced Search Trees (2-3 Trees, 2-3-4 Trees, Red-Black Trees, AVL Trees)
- Graph (Breadth-first search, Depth-first search, Minimum Spanning Tree, Bellman-Ford shortest path, Dijkstra shortest path, Circuits)
- Processing Data in External Storage
- Except this web page, all course materials will be posted at the WebCampus.
- Presentation slides will be available on the class web page. I will try to put them up before each class meeting but no guarantees on that.
- Students are expected to attend, and be on time, for every class. This demonstrates professionalism and consideration for your fellow students and your Instructor. While the course does not have an attendance policy, students who miss class and/or are late for class may experience an impact on their grade by missing classroom activities and/or quizzes.
- Students are expected to turn in all assigned materials in a timely manner.
- Students are expected to demonstrate professionalism and courtesy by either silencing or turning off all cell phones and/or other alarm or audible indicator devices.
- The Instructors reserve the right to add to, and/or modify any of the above policies as needed to maintain an appropriate and effective educational atmosphere in the classroom and the laboratory. In the case that this occurs, all students will be notified in advance of implementation of the new and/or modified policy.
- UNR Athletics:
If you are involved with any university-sponsored athletic activities that will have an impact on your attendance, please provide your Instructor with a letter from your coach and/or the UNR Athletic Department as soon as possible, but no later than the end of the second week of classes. This should include the official schedule of your activities which will impact your attendance throughout the semester.
- Assignments, Examinations and Grading:
All formal homework assignments (including exercises and projects) and all exams (quizzes, exams, and the final) are to be treated as individual and not collective efforts, unless specified otherwise. A severe penalty will be given to any assignment which indicates collusion or cheating. The usual penalty for cheating on project or an exam is failure in the course.
- Assignments and exams must be prepared strictly individually. You are welcome to discuss the problems or solution strategies with your class mates but the resulting work should be your own. Copying from each other or from other sources is considered as cheating.
- Homework Assignments:
Homework assignments will be distributed at the instructor or TAs discretion. These consist of practice questions which are intended to assist the student in mastering the course content. Some of these assignments will be collected and graded (Canvas) and count towards extra credit.
There will be several announced and unannounced quizzes in lecture and online (Canvas).
- There will be 12 online quizzes given almost every week. The lowest graded one will not affect your overall grade. Questions in these quizzes will be designed to give you an opportunity to test and affirm your knowledge for the week's material.
There will be one mid-term examination and one final examination. All exams will be closed books, closed notes. Permissions to take exams on other dates than scheduled will not be given, except for extreme medical or family emergencies with respective documentation. Please ensure that the instructor and TAs are notified at the earliest possible convenience. All exams will take place in the regular classroom.
- The material covered in the exams will be drawn from the lectures, quizzes, and homework. The exams will be closed books and closed notes but a single page cheat sheet (double side letter size) is allowed. No calculators (unless otherwise stated) and no other computing devices should be used during the exam.
- Programming Assignments/Labs:
The Programming Assignments/Labs require the solutions to problems using the computer. We will be using the workstations in the College of Engineering Computing Center (SEM 231). You will be instructed how to submit your projects for grading. Typically, you will be asked to submit an electronic version of your code, and test runs, along with a folder with an appropriate write-up for your program.
- There will be 7 (+1 optional) programming assignments. In the lectures, you will be introduced to data structures at an abstract level. In the assignments, you will write code to implement and use these data structures. Assignments will require turning in C/C++ code that compiles and runs properly, and a report documenting the code. Some of the programming assignments will be done in groups of two. When working with a partner, both team members are expected to fully understand the structure of the code and the implemented algorithms. Discussion of the programming assignments is allowed and encouraged. However, students are expected to do their own work. Assignments which are too similar or replicated from the Internet will receive a zero.
- Every assignment must be completed, working, and turned in. There will be 3 points penalty for each missing programming assignment or submissions with grades less than 5 points (without late penalty). Late assignments will be penalized by
20% 10% per day, except holidays.
- Programming assignment/lab completion is essential for learning in this course. It is suggested that you take advantage of TA office hours as substantive effort is being allocated to be successful with respect to the programming assignments. Each programming assignment will be graded by a TA who will also be responsible for answering questions regarding that assignment.
- Don't get behind in the programming assignments. Probably the main reason for students doing poorly in this course is getting behind in the assignments and never recovering. Design and implement in a top-down, modular fashion. Get something working that has the skeleton structure of what you need and then add features to it. Each time you add a feature, test it and make sure everything is still working. It can be tough to debug big programs if all you know is that the output is wrong and you are not sure any individual module is working.
- Online forums are set up in WebCampus to exchange ideas and provide tips. Active users will be given bonus points at the end of the semester.
- Academic Success Services:
Your student fees cover usage of the University Math Center (775) 784-4433, University Tutoring Center (775) 784-6801, and University University Writing Center (775) 784-6030. These centers support your classroom learning; it is your responsibility to take advantage of their services. Keep in mind that seeking help outside of class is the sign of a responsible and successful student.
- Disability Statement:
Any student with a disability needing academic adjustments or accommodations is requested to speak with the Disability Resource Center (Pennington Student Achievement Center, Suite 230) as soon as possible to arrange for appropriate accommodations.
- Class Recording:
Surreptitious or covert video-taping of class or unauthorized audio recording of class is prohibited by law and by Board of Regents policy. This class may be videotaped or audio recorded only with the written permission of the instructor. In order to accommodate students with disabilities, some students may be given permission to record class lectures and discussions. Therefore, students should understand that their comments during class may be recorded.
- Academic Dishonesty:
Cheating, plagiarism or otherwise obtaining grades under false pretenses constitute academic dishonesty according to the code of this university. Academic dishonesty will not be tolerated and penalties can include canceling a student's enrollment without a grade, giving an F for the course or for the assignment. For more details, see the University of Nevada, Reno General Catalog.
Both grading policy and scale are subject to change. Failure in either the assignments or the tests will result in failure in the course.
42 - Programming Assignments (7 of 8)
10 - Quizzes (10 of 12)
22 - Midterm Exam
26 - Final Exam
Grading Scale (Tentative)
A : [92 - 100]
A- : [88 - 92)
B+ : [84 - 88)
B : [80 - 84)
B- : [76 - 80)
C+ : [72 - 76)
C : [68 - 72)
C- : [64 - 68)
D+ : [60 - 64)
D : [56 - 60)
D- : [52 - 56)
F : [0 - 52) or caught cheating
Important Note: You will have one week to appeal for your grades after the graded assignments/tests are returned. So, please keep this in mind if you think that there is a problem/issue with the grading of your work.
The course outcomes are skills and abilities students should have acquired by the end of the course. These outcomes are defined in terms of the ABET Accreditation Criterion 3 Program Outcomes which are relevant to this course.
Our graduates will have achieved:
- (3) an ability to design, implement, and evaluate a computer-based system, process, component, or program to meet desired needs, within realistic constraints specific to the field.
- (4) an ability to function effectively on multi-disciplinary teams.
- (7) an ability to communicate effectively with a range of audiences.
- (9) a recognition of the need for, and an ability to engage in continuing professional development and life-long learning.
- (10) a knowledge of contemporary issues.
This is a tentative schedule including the exam dates. It is subject to readjustment depending on the time we actually spend in class covering the topics.
Permanent reading assignment: it is assumed that you are familiar with the contents of the slides of all past meetings.
| Tue, Aug 30
|| Lecture #1: Introduction
|| Quiz 1
| Thu, Sep 1
|| Lecture #2: C++ classes
| Tue, Sep 6
|| Lecture #3: Doxygen Documentation
| Thu, Sep 8
|| Lecture #4: Data Abstraction
| Tue, Sep 13
|| Lecture #5: Data Abstraction
| Thu, Sep 15
|| Lecture #6: GitHub
|| Program 1
| Tue, Sep 20
|| Lecture #7: Version control
|| Quiz 2
| Thu, Sep 22
|| Lecture #8: Recursion
| Tue, Sep 27
|| Lecture #9: Array-Based Implementation
|| C++ Programming
| Thu, Sep 29
|| Lecture #10: Link-Based Implementation
|| Quiz 3
|| Sep 30: Data Abstraction - C++ Classes
| Tue, Oct 4
|| Lecture #11: Stacks
|| Program 2
| Thu, Oct 6
|| Lecture #12: Lists
|| Quiz 4
|| Oct 7: Recursion (cont) - Stack ADT
| Tue, Oct 11
|| Lecture #13: Algorithm Efficiency
| Thu, Oct 13
|| Lecture #14: Sorting Algorithms (Selection sort, Insertion sort, Bubble sort)
|| Quiz 5
| Tue, Oct 18
|| Lecture #15: Sorting Algorithms (Merge sort, Quick sort)
|| Program 3
| Thu, Oct 20
|| Lecture #16: Sorting Algorithms (Counting sort, Bucket sort, Radix sort)
|| Ch.11, 8*
|| Quiz 6
| Tue, Oct 25
|| Lecture #17: Sorted Lists - Midterm review
| Thu, Oct 27
|| Midterm Exam
|| Quiz 7
| Tue, Nov 1
|| Lecture #18: Queue and Priority Queue - ADT
|| Program 4
| Thu, Nov 3
|| Lecture #19: Trees
|| Quiz 8
| Tue, Nov 8
|| Lecture #20: Tree Implementations - Midterm review
| Thu, Nov 10
|| Lecture #21: Tree Implementations - Heaps (Heap ADT)
|| Quiz 9
| Tue, Nov 15
|| Lecture #22: Heaps (Heap Sort) - Dictionaries (ADT, Direct addressing)
|| Program 5
| Thu, Nov 17
|| Lecture #23: Dictionaries (Hashing)
|| Quiz 10
| Tue, Nov 22
|| Lecture #24: Balanced Search Trees (AVL Trees, 2-3 Trees)
| Thu, Nov 24
|| Thanksgiving (no class)
| Tue, Nov 29
|| Lecture #25: Balanced Search Trees (2-3-4 Trees, Red-Black Trees)
|| Program 6
| Thu, Dec 1
|| Lecture #26: Balanced Search Trees (Red-Black Trees) - Graphs
|| Quiz 11
| Tue, Dec 6
|| Lecture #27: Graphs (DFS, BFS, MST)
| Thu, Dec 8
|| Lecture #28: Graphs (Bellman-Ford and Dijkstra shortest path)
| Tue, Dec 13
|| Lecture #29: Processing Data in External Storage
|| Quiz 12 - Program 7
| Thu, Dec 15
|| Final Exam @ 5pm
|| Optional Program 8 on Dec 20
* "Introduction To Algorithms" textbook by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.
Acknowledgements: Slides are modified from the original slides of the textbook by Carrano and Henry.
Announcements regarding the course will be posted on this web page
and sent by e-mail to your UNR e-mail account.
Please daily check your UNR e-mail.
- Dec 8 : Office hours on Monday, Dec 12 between 12-1:30pm instead of Dec 13th.
Course Information -
ABET Criteria -
Last updated on Dec 8, 2016.