CS 302 Data Structures
Department of Computer Science & Engineering
UNR, Spring 2013
Course Information -
ABET Criteria -
| Class hours
|| Tuesday & Thursday, 2:30 - 3:45pm, OSN 203
|| Dr. Mehmet Gunes
|| mgunes (at) cse (dot) unr (dot) edu
|| (775) 784 - 4313
| Web page
|| SEM 238 (Scrugham Engineering-Mines)
| Office hours
|| Tuesday & Thursday 11:00 am - 12:30 pm or by appointment
|| Prabath X.J. Palathingal
Office SEM 255A
Tuesday & Thursday 4:00 - 5:00 pm
ppalathingal (at) cse (dot) unr (dot) edu
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 Fall 2012.
- Prerequisite : C or above in CS 202
This is a tentative list of topics, subject to modification and reorganization.
- Software Engineering Principles
- Data Design and Implementation
- Growth of Functions
- Unsorted and Sorted Lists
- Stack and Queue
- Binary Search Tree
- Red-Black Tree
- Heap and Priority Queue
- Interval search
- Hash Table
- Graph (Breadth-first search, Depth-first search, Bellman-Ford and Dijkstra shortest path)
- Sorting (Selection sort, Bubble sort, Insertion sort, Merge sort, Quick sort, Heap sort, Counting sort, Radix sort, Bucket sort)
- 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.
- Class participation in terms of asking questions is highly encouraged.
Please do not be afraid to ask questions no matter how simple you might think the answer could be. This type of interaction helps improve the effectiveness of the class and breaks the monotony.
- Students are encouraged to bring articles, demos, web pages, news events, etc. that are relevant to course topics to the attention of the instructor.
The success of the course depends on everyone in the class engaging the material and bringing energy, enthusiasm, and intellect to class activities.
- Regular attendance is highly recommended. If you miss a class, you are responsible for all material covered or assigned in class.
You should arrive on time and be prepared to discuss the session's topic.
The underlying notion of the class is interaction, not passivity.
- Unless instructed otherwise, use of electronic devices including laptops are not allowed during lectures.
- Extra credit will be offered to the students who attend the departmental colloquia (an extra point for two colloquium attendance). You will be reminded in class about upcoming talks but you should also check the colloquia page on a regular basis (http://www.cse.unr.edu/get-involved/colloquia/).
- There will be 5-7 homework assignments. Homeworks will be assigned but will not be collected for grading.
- There will be eight programming assignments. The lowest graded one will not affect your overall grade.
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.
Late assignments will be penalized by 20% per day, except holidays.
- 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.
- There will be six in-class quizzes approximately given every other week.
The lowest graded one will not affect your overall grade.
Quizzes will be open book/notes and extremely time-constrained, i.e., 5-10 mins.
Questions in these quizzes will be designed to give you an opportunity to test and affirm your knowledge.
- There will be one midterm exam and one final exam. You should plan on taking the exams on the scheduled times.
No late/early exams unless in case of an emergency situation such as health emergency or similar un-avoid-able situations and you need to provide convincing documentation for it.
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.
- 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.
Any form of cheating such as plagiarism or ghostwriting will incur a severe penalty, usually failure in the course.
Please refer to the UNR policy on Academic Standards.
- 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 maybe videotaped or audio recorded only with the written permission of the instructor.
In order to accommodate students with disabilities, some students may have been given permission to record class lectures and discussions.
Therefore, students should understand that their comments during class may be recorded.
- If you have a disability for which you will need to request accommodations, please contact the instructor or someone at the
Disability Resource Center (Thompson Student Services - 101) as soon as possible.
- Academic Success Services: Your student fees cover usage of the
Math Center (784-4433 or www.unr.edu/mathcenter),
Tutoring Center (784-6030 or www.unr.edu/tutoring), and
University Writing Center (784-6801 or http://www.unr.edu/writing_center).
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.
Both grading policy and scale are subject to change.
Failure in either the assignments or the tests will result in failure in the course.
10 - Quizzes (5 of 6)
42 - Programming Assignments (7 of 8)
48 - Exams (2)
Grading Scale (Tentative)
A : 87 - 100
B : 75 - 86
C : 63 - 74
D : 51 - 62
F : 0 - 50 (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.
|| Assignments & Notes
| Tue, Jan 22
|| Lecture #1: Introduction
|| Quiz 0 (not-graded)
| Thu, Jan 24
|| Lecture #2: Software Engineering Principles
|| Program 1
| Tue, Jan 29
|| Lecture #3: Data Design and Implementation
| Thu, Jan 31
|| Lecture #4: Growth of Functions
|| Quiz 1
| Tue, Feb 5
|| Lecture #5: Unsorted Lists
|| Program 1 due
| Thu, Feb 7
|| Lecture #6: Dynamic and Static Data Structures
|| Program 2
| Tue, Feb 12
|| Lecture #7: Sorted Lists
| Thu, Feb 14
|| Lecture #8: Stack and Queue
|| Quiz 2
| Tue, Feb 19
|| Lecture #9: Recursion
|| Program 2 due
| Thu, Feb 21
|| Lecture #10: Binary Search Tree
|| Ch.8, Ch12*
|| Program 3
| Tue, Feb 26
|| Lecture #11: Binary Search Tree
|| Ch.8, Ch12*
| Thu, Feb 28
|| Lecture #12: Red-Black Tree
|| Quiz 3
| Tue, Mar 5
|| Lecture #13: Red-Black Tree
|| Program 3 due
| Thu, Mar 7
|| Lecture #14: Heap
|| Program 4
| Tue, Mar 12
|| Lecture #15: Priority Queue and Sets
| Thu, Mar 14
|| Midterm Exam
| Tue, Mar 19
|| Spring Break
| Thu, Mar 21
|| Spring Break
| Tue, Mar 26
|| Lecture #16: Interval Tree
| Thu, Mar 28
|| Lecture #17: Interval Tree
|| Program 4 due
| Tue, Apr 2
|| Lecture #18: MDS Tree (Range Tree)
|| KD Tree
|| KD Tree Animations - Program 5
| Thu, Apr 4
|| Lecture #19: MDS Tree (KD Tree)
|| KD Tree
|| Quiz 4
| Tue, Apr 9
|| Lecture #20: MDS Tree (Nearest Neighbor)
|| KD Tree
| Thu, Apr 11
|| Lecture #21: Depth-first search
|| Program 5 due
| Tue, Apr 16
|| Lecture #22: Breadth-first search and shortest paths
|| Program 6
| Thu, Apr 18
|| Lecture #23: Bellman-Ford and Dijkstra's algorithms
|| Quiz 5
| Tue, Apr 23
|| Lecture #24: Sorting (Selection, Insertion, and Bubble)
| Thu, Apr 25
|| Lecture #25: Sorting (Merge and Quick)
|| Program 6 due
| Tue, Apr 30
|| Lecture #26: Sorting (Heap and Counting)
|| Program 7 due on May 11
| Thu, May 2
|| Lecture #27: Sorting (Radix and Bucket)
|| Quiz 6
| Tue, May 7
|| Lecture #28: Hashing
|| Program 8 due on May 16 (optional)
| Wed, May 8
|| Prep day (no class)
| Thu, May 9
|| Final Exam @ 12:30pm (Exam covers post-midterm material. However, you are expected to remember important pre-midterm concepts.)
* "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 Prof. Nell Dale.
Announcements regarding the course will be posted on this web page
and also sent by e-mail to your UNR e-mail account.
Please daily check your UNR e-mail.
- Programming assignment 4 deadline is extended to Thursday, March 28.
Course Information -
ABET Criteria -
Last updated on Apr 30, 2013.