CS 302 Data Structures

Department of Computer Science & Engineering

UNR, fall 2012

Course Information - Description - Objective - Prerequisites - Textbooks - Syllabus Organization - Grading - ABET Criteria - Schedule - Announcements

Course Information

Class hours Monday & Wednesday, 1:00 - 2:15pm, SEM 261 Computer Networking: A Top-Down Approach Featuring the Internet
Instructor Dr. Mehmet Gunes
E-mail mgunes (at) cse (dot) unr (dot) edu
Phone (775) 784 - 4313
Web page http://www.cse.unr.edu/~mgunes
Office SEM 238 (Scrugham Engineering-Mines)
Office hours Monday & Wednesday 2:30 - 4:00 pm or by appointment
Assistant Esra Erdin - eerdin (at) cse (dot) unr (dot) edu
Office: SEM 211A - Wednesdays 12-1:00 pm

Catalog Description

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.

Objective

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++.

Prerequisites


Textbooks

Required Reference

Syllabus (Tentative)

This is a tentative list of topics, subject to modification and reorganization.

Organization


Grading (Tentative)

Both grading policy and scale are subject to change. Failure in either the assignments or the tests will result in failure in the course.

Grading Policy

Grading Scale (Tentative)

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.



ABET Criteria

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:



Schedule (Tentative), Notes & Assignments

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.

Date Lectures Assignments & Notes
Mon, Aug 27 Lecture #1: Course outline  
Wed, Aug 29 Lecture #2: Software Engineering Principles (1) Ch.1  
Mon, Sep 3 Labor day (no class)  
Wed, Sep 5 Lecture #3: Software Engineering Principles (2) Ch.1  
Mon, Sep 10 Lecture #4: Data Design and Implementation (1) Ch.2 - Quiz 1 - Program 1  
Wed, Sep 12 Lecture #5: Data Design and Implementation (2) Ch.2  
Mon, Sep 17 Lecture #6: Data Design and Implementation (3) Ch.2  
Wed, Sep 19 Lecture #7: Unsorted List (1) Ch.3 - Quiz 2 - Program 1 due - Program 2  
Mon, Sep 24 Lecture #8: Unsorted List (2) Ch.3  
Wed, Sep 26 Lecture #9: Sorted List (1) Ch.4 - Quiz 3  
Mon, Oct 1 Lecture #10: Sorted List (2) Ch.4 - Program 2 due - Program 3  
Wed, Oct 3 Lecture #11: Stack and Queue Ch.5 - Quiz 4  
Mon, Oct 8 Lecture #12: Templates, Polymorphism, Recursion Ch.6-7  
Wed, Oct 10 Lecture #13: Binary Search Trees (1) Ch.8 - Quiz 5 - Program 3 due Friday 1pm - Program 4
Mon, Oct 15 Lecture #14: Binary Search Trees (2) Ch.8 - Review Session at 2:30pm in SEM 257
Wed, Oct 17 Midterm Exam  
Mon, Oct 22 Lecture #15: Midterm Review  
Wed, Oct 24 Lecture #16: Red-Black Trees (1) Supplement 
Mon, Oct 29 Lecture #17: Red-Black Trees (2) Program 4 due - Program 5  
Wed, Oct 31 Lecture #18: Heaps and Priority Queues Ch.9 - Quiz 6  
Mon, Nov 5 Lecture #19: Graphs (1) Ch.9  
Wed, Nov 7 Lecture #20: Graphs (2) - DFS, BFS Ch.9 - Program 5 due - Program 6
Mon, Nov 12 Veterans day (no class)  
Wed, Nov 14 Lecture #21: Graphs (3) - Shortest Path Ch.9 - Quiz 7  
Mon, Nov 19 Lecture #22: Sets - Sorting (1) - Selection Sort Ch.9, 10  
Wed, Nov 21 Lecture #23: Sorting (2) - Bubble and Insertion Sorts Ch.10  
Mon, Nov 26 Lecture #24: Sorting (3) - Merge and Quick Sorts Ch.10 - Program 6 due - Program 7  
Wed, Nov 28 Lecture #25: Sorting (4) - Heap Sort Ch.10 - Quiz 8  
Mon, Dec 3 Lecture #26: Hashing Ch.10 - Program 8 (optional)  
Wed, Dec 5 Lecture #27: Linear Sorting Ch.10  
Mon, Dec 10 Lecture #28: Binary Decision Diagrams and Review Session Quiz 9 - Program 7 due  
Wed, Dec 12 Prep day (no class)  
Mon, Dec 17 Final Exam @ 10:15am (Exam covers post-midterm material. However, you are expected to remember important pre-midterm concepts.)  
Wed, Dec 19   Program 8 due  

Acknowledgements: Slides are modified from the original slides of the textbook by Prof. Nell Dale.



Announcements

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.



Course Information - Description - Objective - Prerequisites - Textbooks - Syllabus Organization - Grading - ABET Criteria - Schedule - Announcements


Last updated on Dec 10, 2012.