A significant part of this syllabus is copied verbatim from a previous incarnation of this course taught by Adrienne Decker in 2009.
|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|
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.
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:
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:
This course has a strong relationship with the following program objectives for computer science:
CSE 115/116, 119. Basic Object-Oriented Design Concepts. Basic Discrete Mathematics Concepts. Elementrary Calculus.
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).
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:
|Percentage score||Letter grade||Grade points|
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
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.
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.
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.
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.
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.
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:
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.
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/