Syllabus

Credits

A significant part of this syllabus is copied verbatim from a previous incarnation of this course taught by Adrienne Decker in 2009.

Teaching staff

Role	Name	Office	Email
Instructor	Hung Q. Ngo	338L Davis	hungngo [at] buffalo
TA	Mr. Tamal Biswas	302 Davis	tamaltan [at] buffalo
TA	Ms. Zakieh S. Hashemifar	302 Davis	zakiehsa [at] buffalo

See our calendar for office hours.

Course description

This course covers the design, analysis, and implementation of basic data structures in C++. Algorithms operating on the data structures are also covered. It is fundamentally a course about data structures, not about C++. However, as we will implement some of the data structures in C++, basic aspects of C++ and (very little) object oriented programming in C++ are also covered. We will start with a brief discussion of the C++ programming language. Then, we survey fundamental data structures (array, vector, lists, queue, stack, hash map, trees, and possibly graphs) and how we can make use of them in C++. Then, we delve deeper into the design, analysis and implementation of such data structures. Asymptotic analysis of algorithms and data structures is discussed. Amortized analysis will also be discussed. Other C++ features needed for generic implmentations of the data structures are introduced along the way.

The importance of choosing appropriate data structures when solving a problem will be illustrated by programming assignments in C++. C++ is a high-level object-oriented language different from the language of CSE115-CSE116. There is no expectation that you have C++ programming background prior to this course, though I will assume that you are familiar with basic object-oriented concepts.

This course is a prerequisite for CSE 305 Introduction to Programming Languages, CSE 331 Introduction to Algorithm Analysis and Design, CSE 396 Introduction to the Theory of Computation, CSE 435 Information Retrieval, and CSE 429 Algorithms for Modern Computing Systems.

This course adheres to recommendations made in the ACM's CC2001 Computer Science Volume curriculum document for a third semester data structures course. It covers topics from the following knowledge units: DS5 Graphs and Trees, PF3 Fundamental data structures, AL3 Fundamental computing algorithms. It reviews and reiterates concepts from the following knowledge units (due to the change of languages) PF1 Fundamental programming constructs, AL1 Basic algorithm analysis, PL4 Declarations and types, PL5 Abstraction mechanisms, PL6 Object-oriented programming.

Course Objectives

• Have fun learning!
• Basic data structures such as lists, stack, queue, trees, maps, sets, hash tables, search trees, and graphs
  • design and analysis
  • various tradeoffs involved in designing, implementing, and using them
  • design and implement the data structures in C++
• A few basic algorithms such as searching and sorting, recursive algorithms, graph traversing algorithms
• Tentative schedule of topics:
  • 3 weeks - C++ (syntax review, OO review, templates, namespaces, pointers, make files, debuggers)
  • 2 weeks - Asymptotic notations, solving recurrences, sorting
  • 1 week - Recursion and iteration
  • 1 week - Lists, stacks, queues, deques (STL and analysis)
  • 1 week - Priority queues (e.g. binomial, skew, leftist)
  • 4 weeks - Trees (e.g. AVL, Red-black, Splay, 2-3, trie)
  • 2 weeks - Hash tables/hashing
  • 1 week - Graphs (representations, traversals)
• At the end of this course, each student should be able to:
  • Have a good overall understanding of basic data structures, their design and analysis
  • Know how to implement many of them in C++, and use them in other applications.

ABET Program Objectives

Computer Engineering

Our computer engineering (CEN) program is accredited by ABET. This course is required of all computer engineering students and has a significant relationship with the following program objectives for computer engineering:

• (a) An ability to apply knowledge of mathematics, probability and statistics, computer science and electrical engineering as it applies to the fields of computer software and hardware.
• (c) an ability to design and construct a complex hardware and software system, component, or process to meet desired needs using relevant software engineering principles, within realistic constraints such as economic, environmental, social, political, ethical, health & safety, manufacturability, and sustainability.

Computer Science

Our computer science (CS) program is accredited by ABET. This course is required of all computer science students and has a significant relationship with the following program objectives for computer science:

• (a) an ability to apply knowledge of computing and mathematics appropriate to the discipline.
• (c) an ability to design, implement, and evaluate a computer-based system, process, component, or program to meet desired needs.

This course has a strong relationship with the following program objectives for computer science:

• (i) an ability to use current techniques, skills, and tools necessary for computing practice.
• (j) an ability to apply mathematical foundations, algorithmic principles, and computer science theory in the modeling and design of computer-based systems in a way that demonstrates comprehension of the tradeoffs involved in design choices.
• (k) an ability to apply design and development principles in the construction of software systems of varying complexity.

Prerequisites:

CSE 115/116, 119. Basic Object-Oriented Design Concepts. Basic Discrete Mathematics Concepts. Elementrary Calculus.

References:

• Textbook:
  • Michael T. Goodrich, Roberto Tamassia, David M. Mount, Data Structures and Algorithms in C++, ISBN 978-0-470-38327-8, February 2011. Paperback, 736 pages.
• Plus significant and heavy reading materials provided on the class homepage.
• Other references:
  • The C++ Programming Language: Special Edition
  • Introduction to Algorithms
  • Effective C++: 55 Specific Ways to Improve Your Programs and Designs (3rd Edition)
  • More Effective C++: 35 New Ways to Improve Your Programs and Designs
  • C++ Primer (5th Edition)
  • Objects, Abstraction, Data Structures and Design: Using C++

Course's homepage:

 http://www.cse.buffalo.edu/~hungngo/classes/2014/Fall/250/

CSE 250 Q&A Site on piazza, where you ask questions, you and I answer

 https://piazza.com/buffalo/fall2014/cse250/home

Work load

• Heavy! So, start early!!
• Approx. 50 pages of reading per week
• 9-10 written and programming homework assignments
  • By default assignments are to be done individually
  • I will state explicitly which assignments are group assignments -- there will be very few group assignment if at all
• 2 midterm exams
• 1 final exam

Grading policy:

• Exam component (50% of the course grade)
  • 2 midterm exams (the lower of the two is worth 5%, the higher 15%)
  • 1 final exam (30%)

  There will be 2 in-class examinations and one final examination at the end of the term. The dates for the midterm exams will be posted on the course's Google calendar. The final examination will be given on a date to be specified by the University. Do not make travel plans for times during the examination period until the final examination schedule has been posted.

  If you miss an examination because of sickness or similar reasons, visit a physician and obtain a note detailing the period during which you were medically incapable of taking the exam. Notify your instructor immediately via e-mail or telephone (voice mail) if you are going to miss an exam, before the exam takes place unless medically impossible. See your instructor as soon as you return to class.

  If you miss an examination without a valid excuse, you will receive a zero grade for that examination. No make-up examinations will be available without a valid excuse. You must bring a valid form of picture ID with you to each examination (a UB Card will suffice).

• Written and programming assignments component (50%). There will be 9 to 10 assignments (both written and programming). The two lowest-scored assignments are worth 5%. The rest are worth 45%, evenly divided.

• Late submission policy (for projects and assignments)
  • 24 hours late: 20% reduction (percentage is calculated from the maximum possible grade).
  • 48 hours late: 50% reduction
  • Submissions more than 48 hours late will not be accepted

• Re-grading: If you have a question about the grading of any piece of work, first consult with the teaching assistant who graded your work. If you cannot resolve your questions with the teaching assistant, you should consult with the instructor of the course. Any questions about the grading of a piece of work must be raised within one week of the date that the work was returned by the teaching assistant or the instructor. In other words, if you do not pick up your work in a timely fashion, you may forfeit your right to question the grading of your work.

• Incomplete (I) grades. We will follow the UB Undergraduate Catalog Statement on Incomplete Grades, found in the Undergraduate Catalog.

  Generally, incomplete ("I") grades are not given. However, very rarely, circumstances truly beyond a student's control prevents him or her from completing work in the course. In such cases the instructor can give a grade of "I". The student will be given instructions and a deadline for completing the work, usually no more than 30 days past the end of the semester. University and department policy dictate that "I" grades can be given only if the following conditions are met:

  • An Incomplete will only be given for missing a small part of the course.
  • An Incomplete will only be given when the student misses work due to circumstances beyond his/her control.
  • An Incomplete will only be given when the student is passing the course except for the missed material.
  • An Incomplete is to be made up with the original course instructor within the time specified by the appropriate University regulation (see appropriate document above), and usually within the following semester.
  • An Incomplete will not be given to allow the student to informally retake the entire course, and have that grade count as the grade of the original course. Incompletes can not be given as a shelter from poor grades. It is your responsibility to make a timely resignation from the course if you are doing poorly for any reason. See your HUB Student Center page for the last day to resign the course, as well as drop/add dates. (Start here.)
• Letter grades. The following table indicates the number to letter grade mapping I will use to assign final grades at the end of the course. The Grade points column is included for your convenience only, and is not official information. The official mapping can be found in the Undergraduate Catalog.

  Percentage score	Letter grade	Grade points
  90-100	A	4.0
  85-89	A-	3.67
  80-84	B+	3.33
  75-79	B	3.0
  70-74	B-	2.67
  65-69	C+	2.33
  60-64	C	2.0
  55-59	C-	1.67
  50-54	D	1.0
  0-49	F	0.0

Computing Resources

You will be provided with a CSE undergraduate computing account. The name of the server that you will be connecting to in the lab will be nickelback.cse.buffalo.edu. You have the ability to connect to

• timberlake.cse.buffalo.edu,
• beatles.cse.buffalo.edu,
• coldplay.cse.buffalo.edu,
• pollux.cse.buffalo.edu

and many other servers remotely from other sites, on or off campus. Please see the list of servers on the department's IT services page for more information.

You are expected to become proficient at using the machines in the lab, the Unix system, the C++ compiler, and whatever other software development tools the course requires you to use. It is your responsibility to ensure that any programs you write for this course compile using the C++ compilers installed on the department's machines.

You are also required to check the course Piazza Q&A site often for announcements, lecture summaries, and other materials. Please also read mail sent to your CSE e-mail account. Any e-mail communication that you send regarding this course should be sent from your CSE e-mail account or your UB e-mail account. E-mails from non-UB accounts will likely not be acknowledged nor answered. Please include an informative subject line in all e-mails, and include your full name in any e-mail correspondence.

All e-mail that we send in reply to your e-mail will be sent to the address from which you sent your e-mail. Our feedback on materials you hand in electronically will be sent to your CSE e-mail account only. Since you may request re-grades of work only within a set period from the time that the feedback was provided to you, it is in your best interest to read your CSE e-mail account on a daily basis.

Course Organization

The course has both a lecture component and a recitation component. Each component plays a role in helping you achieve the objectives of the course. If you do not participate fully in both you should not expect to do well in the course.

• Lectures: The conceptual and theoretical course content will be delivered primarily in the lectures, complemented by readings from the textbook and other materials linked to from the course's website and blog. You must review readings prior to attending a lecture, and you are expected to review the readings again, along with any notes you took, after the lecture.

  You are expected to attend all lectures. If you are unable to attend a lecture because of sickness or similar reasons, make sure you get the notes from a classmate. If you are out of class for an extended period of time because of sickness, notify your instructor as soon as possible, and see your instructor immediately upon your return in order to determine how to catch up. If you have missed a significant portion of the semester due to illness, it is recommended that you resign from the course.

• Recitations The recitations are an integral part of the course. They will cover C++ programming in detail. Attendance in recitation will therefore be critical for your ability to complete the programming projects.

  The recitations may review and extend lecture material and are also an excellent forum for asking more individual questions about the course material than can typically be addressed in lecture. Some material needed to do the programming projects will be covered only in recitation.

• Time outside of class

  Office hours:

  Office hours offer you the opportunity to ask more individual questions about the course material than can typically be addressed in lecture. Both the instructor and the teaching assistants have scheduled office hours. Office hours are held on a first-come first-served drop-in basis. No appointment is necessary to attend office hours. Be aware that office hours become increasingly busy the closer it is to a project deadline. Plan your use of office hours accordingly. Individual appointments may be arranged, if needed, as schedules allow.

  Study time:

  In this course, as in any course, you are expected to put in additional time beyond the scheduled class times. Professors generally expect that for each credit hour a class carries a typical student will put in 2 - 3 hours of time each week outside of class. Since this is a 4 credit course that translates into 8 - 12 hours of time outside of lecture and recitation times, each week. During this time you should review your lecture notes, attend office hours as needed, get hands-on practice applying the concepts and theoretical constructs discussed in class, and possibly arrange to meet in small groups to study or review the concepts from class. As a rough guide, you should expect to spend at least the following time working on this course, each week:

  • Lectures: 3 hours
  • Recitation time: 1 hour
  • Programming assignments: 5 hours
  • Individual study: 4 hours

Academic Honesty:

• No tolerance on plagiarism:
  • 0 on the particular assignment/exam for first attempt
  • Fail the course on the second
• Group study/discussion is encouraged, but the submission must be your own work
• On the Programming Assignments: discussions of ideas are welcome, but NO exchanges of source codes, please.
• I will take cheating VERY VERY seriously. Don't waste your time begging!!
• More details from UB's Undergraduate Catalog's Academic Integrity Section, and our department's page.

Disabilities

If you have a diagnosed disability (physical, learning, or psychological) that will make it difficult for you to carry out the course work as outlined, or that requires accommodations such as recruiting note-takers, readers, or extended time on exams or assignments, you must consult with the Office of Disability Services (25 Capen Hall, Tel: 645-2608, TTY: 645-2616, Fax: 645-3116, http://www.student-affairs.buffalo.edu/ods/). You must advise your instructor during the first two weeks of the course so that we may review possible arrangements for reasonable accommodations.

Counseling Center

Your attention is called to the Counseling Center (645-2720), 120 Richmond Quad. The Counseling Center staff are trained to help you deal with a wide range of issues, including how to study effectively and how to deal with exam-related stress. Services are free and confidential. Their web site is http://www.student-affairs.buffalo.edu/shs/ccenter/

Misc. Items:

• Students are encouraged to discuss homework problems with classmates, post questions and answers on the Piazza site. However, do not share codes!!!, and the program/written assignment submitted must be written on your own.
• Absolutely no lame excuses please, such as "I have to go home early, allow me to take the test on Nov 1", or "I had a fight with my girlfriend, which effects my performance", blah blah blah. Even when they are true, they are still lame.
• No extra work in the next semester given to improve your grade.