Syllabus
CSCI 3300
Introduction to Algorithms and Data Structures
Section 001
Fall 2015

Class meeting 9:00–9:50am MTWF, Austin 302
Instructor Karl Abrahamson
Office Sci&Tech C-113
Office hours MTWF 2:00–3:00 and Tu 11:00–12:00
or by appointment
Phone 328-9689
Email abrahamsonk@ecu.edu
Course web page www.cs.ecu.edu/~karl/3300/fall15/
My web page www.cs.ecu.edu/~karl/
Text (recommended) Programming Abstractions in C, by Eric S. Roberts
Lecture notes CSCI 3300 Notes (www.cs.ecu.edu/~karl/3300/fall15/Notes/).

Contents

  1. Preamble
  2. Prerequisites
  3. Course objectives
  4. Grading
  5. Programming Assignments
  6. Attendance policy
  7. Recommendations for success
  8. Lecture schedule and reading assignments
  9. Ethical issues
  10. Additional information

Preamble

This class will interfere with your social life. It will cut into your leisure time.

You will need to read the lecture notes and work the exercises in the lecture notes to be successful. Plan to spend about 10 hours per week outside of class working on reading and assignments for this course. The amount of time that you need to spend will depend on how efficiently you work. If you cannot commit adequate time to this course, I recommend that you drop the class.

I will show you how to work efficiently. In the past, many have ignored my advice and even their own reasoning and used methods that are proven time wasters. Hopefully, this class will do better. Here are a few things that you should do and things to avoid.

Do.

  1. Read the notes. Do the exercises in the notes. The exercises will help you to remember what you read and understand what you are doing when you work on assignments.

  2. Start to work on assignments early.

  3. Write sensible, concise and precise documentation in your programs early. Do not try to keep information about what a function does only in your head. Writing it down forces you to make your thoughts precise, and that is crucial. It also is very valuable when you come back to your work. You will have forgotten things.

  4. Follow sound debugging procedures, as explained in class. Put useful traces in your program. Learn how and when to use a debugger.

  5. Proofread what you write.

  6. Draw pictures of data structures that you use. You cannot keep them in your head.

  7. Ask questions when you are stuck.


Do not.

  1. Do not wait until the due date to start an assignment.

  2. If your program does not work, do not try random experimentation to try to get it work. That will waste your time as you make your program further and further from correct.

  3. If you start late, you will be tempted to turn in someone else's work. Do not plagiarize work, regardless of how tempting it is.


Prerequisites

The prerequisite is CSCI 2310 or equivalent. You should be familiar with the basics of a programming language, such as Java, C++ or C#.

IMPORTANT
This course offers more advanced material on the general topic covered in CSCI 2310, and so, according to university policy, you cannot repeat CSCI 2310 for credit after completing CSCI 3300. If you received a grade of less than C in CSCI 2310, or if you need to retake CSCI 2310 for any reason, do not take CSCI 3300 without consulting me.

Course objectives

The focus of this course is advanced computer programming techniques and algorithms, primarily those that rely on data representation schemes. The language is C++, with emphasis on the C subset. Students are not expected to have used C or C++ before. Part of this course is an introduction to C++, covering all aspects needed in this course.

This course emphasizes concrete aspects of data structures, also called physical data structures. Data abstraction, the other side of data structures, is emphasized in CSCI 3310, although we introduce some of its most basic ideas in this course.

You will come out of the course able to write working multi-module C++ programs using complex data structures. You should be able to offer arguments concerning the correctness of your programs, and be aware of algorithmic and efficiency issues. For more, see student competencies below.

Topics

The following is a partial list of topics to be covered (though not exactly in the order listed).

  1. The C++ programming language. Variables, expressions and statements. Control structures. Functions. Recursion. Types and data, including structures and arrays.

  2. Pointers and memory management. Dynamic memory allocation and deallocation

  3. Physical data structures, including linked lists, trees and hash tables.

  4. Algorithms on physical data structures, including both iterative and recursive algorithms. Correctness and efficiency of algorithms.

  5. Abstract data types.

  6. Designing, understanding, testing and debugging programs.

Student competencies

After successfully completing this course, students will have the following abilities.


Grading

Quizzes and the final exam

There will be 13 quizzes, one the following dates.

  1. Friday, August 28
  2. Friday, September 4
  3. Friday, September 11
  4. Friday, September 18
  5. Friday, September 25
  6. Friday, October 2
  7. Friday, October 9
  8. Friday, October 23
  9. Friday, October 30
  10. Friday, November 6
  11. Friday, November 13
  12. Friday, November 20
  13. Friday, December 4
Each quiz will take roughly half of the class period. After the quiz, I will cover new material. There will be no makeups for missed quizzes.

You can bring one prepared 8.5x11" piece of paper, written on both sides, to each quiz. I will not collect those papers.

I will drop your lowest two quiz grades and count the remaining 12.

The final exam will be at 8:00-10:30am Wednesday, December 16, in Austin 302. The final exam will cover all of the material for the course. You can bring two prepared 8.5x11" pieces of paper to the final exam.

Computing grades

Grades will be computed as follows.

Grading
Twelve quizzes (best of 13) 36% (3% each)
A comprehensive final exam 22%
Nine programming assignments 34% total. By assignment number:
(0: 1%) (1: 3%) (2: 3%) (3: 3%) (4: 3%) (5: 3%) (6: 6%) (7: 6%) (8: 6%)
Attendance 8%

You will start with 8 points for attendance and lose one point for each unexcused absence.

Tentative cutoffs for grades will be as follows. These cutoffs will not be raised.

Grade cutoffs
A 93%
A– 90%
B+ 87%
B 83%
B– 80%
C+ 76%
C 72%
C– 68%
D+ 64%
D 60%
D– 56%

Important proviso.

It is not possible to learn the material of this course effectively without actually "getting your hands dirty" and doing the programming. Accordingly:

In order to pass this course, you must receive at least a 50% grade in the programming assignments.
This outweighs the score computed by adding grades together.

Incompletes

No incompletes will be issued in this course except for extraordinary circumstances, and even then only if you are nearly done already and have done work of acceptable quality, so that it is realistic that you can pass the course. An incomplete will not be given simply because a student could not find the time to do the course work. By registering for this course, you are committing to finding time to do the work.


Programming assignments

Writing and running programs

The programming assignments are available from the course web page.

The programming assignments for this course are probably larger than you have done before. Expect them to take time to complete. If you start on the due date, you will not be able to complete them. Start early, and plan for unexpected difficulties. If you have two weeks to do an assignment, there is a reason.

I will compile and run programs using the g++ compiler on Linux. I will use the following flags when compiling programs:

-g -Wall -Wshadow -Wuninitialized -O
I strongly suggest that you use the same flags.

Grading of submissions

Grading of submissions is explained in the notes. Read that page about how programs will be graded so that you are aware of expectations.


Attendance policy

You are expected to attend class. You are responsible for announcements and assignments given in class. If you miss a class, it is up to you to obtain notes and any other information that was provided in the class. Excuses that you did not know about something because you did not come to class and did not obtain the information will not count for anything at all.

Those who do not attend class can count on doing poorly in this course. If you choose not to attend class, then you must live with the consequences of that decision, however bad they are.

Even if you believe you already know what we are covering, come to class. If you don't, you will end up missing material that you did not know we were going to cover and you will fall behind.

If you are having trouble understanding the lectures, do not stop coming to class. Come to office hours or ask for help from teaching assistants in the lab (Austin 208/209). Get help as early as possible.


Recommendations for success

  1. Attend class. Arrive on time.

  2. Do not bring distractions to class. If you read your email, listen to music, or engage in other distracting activities during class, you will get very little out of class. That will show up in your grade.

  3. Ask questions in class. If you do not understand something, ask a question about it.

  4. Ask questions outside of class. Your best bet is to use email. If you have a question about an assignment, attach all of your files to the email message. Do not just copy the part that you think is wrong into the email message. Ask questions early. Do not wait until the last minute.

    Please use a subject indicating that you are asking a question for CSCI 3300, and always include your name in your email. A reasonable subject for a question about assignment 3 is

    CSCI 3300 question about assignment 3
    Please send email to the address listed on the first page of this syllabus. Do not expect immediate answers. Give yourself time to get answers.

  5. Schedule time to work outside of class.

  6. Do not allow yourself to fall behind. Work on the assignments early. Do not wait until just before the deadline. If you start to fall behind, work right away to catch up. If you are falling behind because you do not understand something, ask for help. Do not just give up!

  7. Read the lecture notes twice. Take a break (like a whole day or longer) in between. Work the exercises. Later in the term, go back over notes that you looked at earlier in the term. You will learn much more that way.

  8. Get adequate sleep. Sleep is important both before and after you learn new concepts. Sleep before enables you to concentrate, and sleep afterwards is critical for moving new information into permanent memory.


Lecture schedule and reading assignments

The following schedule lists brief topics along with sections from the lecture notes that cover them. You should read the relevant sections of the lecture notes before the class. Sections in parentheses are important to read but will probably not be discussed in class except to answer questions.

The notes have exercises, with answers. To do well in this course, you will need to do the exercises. Compare your answer to the answer given.

This outline is tentative and might need to be adjusted.

Date Topics Reading
M. 8/24 Introduction. Syllabus. General advice.
System: Linux. C++ and machine language.
Compiling and running C++ programs.
Assn. 0 assigned.
(1. Introduction)
(2. Advice)
3.1. Logging in
3.2. Basic Linux
3.3. Compiling and running C++ programs
(3.6. Submitting assignments)
T. 8/25 C++: Numeric expressions and types. Numeric Constants.
Variables and assignment. Abbreviations for assignments.
Statements and sequencing.
(5.1. Discussion of C++)
5.3.1. Expressions
5.3.2. Numeric expressions
5.3.6. Precedence
5.4. Statements
5.5. Variables
(6.1. Standards: motivation)
(6.2. Standards: file names)
(6.9.1. Standards: statements)
W. 8/26 C++: Boolean values and expressions. Comparisons.
If-statements.
Compound statements. Indentation.
Coding standards for if-statements.
5.3.3. Boolean values and expressions
5.6.1. Making decisions
(6.3. Standards: file format and indentation)
(6.6. Standards: types, constants and expressions)
(6.9.2. Standards: components of statements)
(6.9.3. Standards: conditionals)
F. 8/28 Quiz 1.
C++: Functions. Defining functions.
Parameter passing.
5.7.1. Functions
5.7.2. Defining functions
(6.4. Standards: variable and function names)
(6.5. Standards: variables and parameters)

Review: (work all of the exercises!)
5.3.1. Expressions
5.3.2. Numeric expressions
5.5. Variables
5.3.3. Boolean values and expressions
5.6.1. Making decisions
M. 8/31 C++: While-loops. For-loops.
Infinite loops.
Coding standards for loops.
5.6.3.1. While-loops
5.6.3.3. For-loops
5.6.3.5. Infinite loops
(6.9.4. Standards: loops)
(6.9.5 Standards: commas and gotos)
T. 9/1 C++: Procedures. Input and output using the stdio library.
The main function.
Assn. 0 due.
5.7.4 Procedures
5.7.6 Main
5.9.1. Standard input and standard output
5.9.2.1. Output
5.9.2.3. Input
(5.9.4. Buffering)
W. 9/2 Documentation: Contracts.
C++: Scope. Frames. Assn. 1 assigned.
5.8. Scope
5.7.2. Frames
5.2. C++ comments
(4.1. Documentation)
4.2. Contracts
(4.3. Other documentation)
(Assignment 1)
F. 9/4 Quiz 2.
Algorithm development.
(8.1. Process)
(8.2. Discovery)

Review: (work all of the exercises!)
5.7.1. Functions
5.7.2. Defining functions
5.6.3.1. While loops
5.6.3.3. For-loops
M. 9/7 Holiday  
T. 9/8 Algorithms: Loops.
Scan algorithms. Search algorithms
Loop invariants.
8.5. Scan algorithms
8.6. Loop invariants
8.7. Search algorithms
W. 9/9 Algorithms: Recursion. 8.3. Recursion
F. 9/11 Quiz 3.
Algorithms: Recursion.
Scan algorithms.
Assn. 2 assigned.
8.5. Scan algorithms
8.7. Search algorithms
8.4. Tail recursion
(Assignment 2)

Review: (work all of the exercises!)
4.2. Contracts
5.7.2. Defining functions
8.3. Recursion
8.5. Scan algorithms
8.7. Search algorithms
M. 9/14 Algorithms: Recursion. Search algorithms.
Tail recursion.
C++: The memory and pointers.
5.10.1. Memory
5.10.2. Pointers
8.7. Search algorithms
T. 9/15 C++: Calling modes. Const pointers.
Areas of memory.
Allocating and deallocating memory.
Dangling pointers. Memory leaks.
Assn. 1 due.
5.7.5. Parameter passing
5.10.3. More on pointers
5.10.4. Areas of memory
5.10.5. Using the heap
5.10.6. Dangling pointers and memory faults
W. 9/16 Arrays.
Arrays as pointers.
Arrays as parameters.
Allocating and deallocating arrays.
5.11.1. Arrays
5.11.2. Array size
5.11.4. Arrays as parameters
5.11.5. Allocating and deallocating arrays
F. 9/18 Quiz 4.
C++: Pointer arithmetic.
5.11.3. Arrays as pointers

Review: (work all of the exercises!)
5.10.2. Pointers
5.10.5. The heap
5.10.6. Dangling pointers
8.3. Recursion
8.5 Scan algorithms
8.7 Search algorithms
M. 9/21 Assignment 3.
Assn. 3 assigned.
Assignment 3
T. 9/22 Working with arrays.
Assn. 2 due.
W. 9/23 C++: Characters.
Null-terminated strings.
String constants.
5.3.4. Characters
5.12.1. Null-terminated strings
(5.12.2. String type)
F. 9/25 Quiz 5.
C++: Structures.
5.13.1. Structures

Review: (work all of the exercises!)
5.11.1. Arrays
5.11.3. Arrays as pointers
5.11.5. Allocating arrays
5.11.4. Arrays as parameters
M. 9/28 C++: Structures. Constructors.
Structures as function parameters.
5.13.2. Using structures
5.13.3. Constructors
5.13.4. Structure parameters
T. 9/29 Assignment 4.
Assn. 4 assigned.
Assignment 4
W. 9/30 Data structures: Linked lists.
Functions on linked lists.
Assn. 3 due.
5.13.5 Additional issues on structures
10.1.3. Linked lists
10.1.4. Nondestructive functions on linked lists
F. 10/2 Quiz 6.
Data structures: Abstract data types.
Conceptual lists.
10.1.1. Conceptual lists

Review: (work all of the exercises!)
5.3.4. Characters
5.12.1. Null-terminated strings
5.7.5. Parameter passing
5.13.1. Structures
5.13.2. Using structures
5.13.3. Constructors
M. 10/5 Equations on lists. 10.1.2. Equations
T. 10/6 Data structures: Looping over linked lists.
Destructive operations.
10.1.6. Looping over lists
10.1.7. Destructive operations on lists
W. 10/7 Data structures: More on linked lists.
Memory sharing. Comparison with arrays.
10.1.5. Memory sharing
10.1.8. Comparison with arrays
F. 10/9 Quiz 7.
Assignment 5.
Data structures: Priority queues.
Assn. 4 due.
Assn. 5 assigned.
Assignment 5
10.3.4. Priority queues

Review: (work all of the exercises!)
10.1.1. Conceptual lists
10.1.2. Equations
10.1.3. Linked lists
10.1.4. Nondestructive functions on linked lists
10.1.6. Looping over lists
10.1.7. Destructive operations on lists)
M. 10/12 and T. 10/13 Fall break  
W. 10/14 System: Linking. Header files.
Function prototypes.
Make and makefiles.
3.4. Linking
5.7.3. Function prototypes
(3.5. Make)
(5.15. Preprocessor)
(6.11. Standards: preprocessor)
(6.14. Standards: other)
F. 10/16 Data structures: FIFO queues.
Representing a queue as a linked list.
10.3.1. FIFO queues
10.3.2. Linked queues
M. 10/19 Data structures: Representing a FIFO queue as an array. 10.3.3. Array queues
5.11.6. Reallocating an array
T. 10/20
W. 10/21 Data structures: Trees. 10.2.1. Trees
10.2.2. Trees in C++
F. 10/23 Quiz 8.
Data structures: Functions on trees.
Review: (work all of the exercises!)
10.3.1. FIFO queues
10.3.2. Linked queues
M. 10/26 Assignment 6.
Assn. 5 due.
Assn. 6 assigned.
Assignment 6
T. 10/27 Cost: Algorithm analysis.
Big O notation. Logarithms.
9.1. Analysis
9.2. Example
(9.3. Profilers)
W. 10/28 Data structures: Tables. Binary search trees. 10.2.4. Tables and sets
10.2.5. Binary search trees
F. 10/30 Quiz 9.
Algorithms: Traversing trees.
10.2.3. Traversing trees

Review: (work all of the exercises!)
10.2.1. Trees
10.2.2. Trees in C++
10.2.5. Binary search trees
9.1. Analysis
M. 11/2 Data structures: More on binary search trees. 10.2.5. Binary search trees
T. 11/3 Data structures: Balanced binary search trees. 10.2.6. Balanced search trees
W. 11/4 Data structures: More on balanced binary search trees. 10.2.6. Balanced search trees
10.2.7. Implementation of balanced trees
F. 11/6 Quiz 10. Review: (work all of the exercises!)
10.2.1 Trees
10.2.2 Trees in C++
10.2.5. Binary search trees
10.2.6. Balanced search trees
M. 11/9 Assignment 7. Assn. 6 due. Assn. 7 assigned. Assignment 7
T. 11/10 Data structures: Heaps and priority queues. 10.3.5. Heaps
W. 11/11 Data structures: More on heaps. 10.3.5. Heaps
F. 11/13 Quiz 11.
Algorithms: Elementary sorting.
Review: (work all of the exercises!)
9.1. Analysis
10.3.5. Heaps
M. 11/16 Algorithms: HeapSort. 10.3.6. Heapsort
T. 11/17 Algorithms: Sorting a linked list. 10.1.9. Sorting a linked list
W. 11/18 Quicksort.  
F. 11/20 Quiz 12. A lower bound for sorting. Review: (work all of the exercises!)
10.3.5. Heaps
10.3.6. Heapsort
10.1.9. Sorting a linked list
M. 11/23 Assignment 8. Assn. 7 due. Assn. 8 assigned. Assignment 8
T. 11/24 Data structures: Hash tables with chaining. 10.4. Hash tables
W. 11/25 to F. 11/27 Thanksgiving break  
M. 11/30 Data structures: Hash tables with open addressing.  
T. 12/1 Review. 10.1.1. Conceptual lists
10.1.2. Equations on lists
10.1.3. Linked lists
10.1.4. Nondestructive functions on linked lists
10.1.6. Looping over lists
W. 12/2 Review. 5.11.3. Arrays as pointers
5.12.1. Null-terminated strings
10.2.6. Balanced search trees
F. 12/4 Quiz 13. Review: (work all of the exercises!)
10.4. Hash tables
10.1.1. Conceptual lists
10.1.2. Equations on lists
10.1.3. Linked lists
10.1.4. Nondestructive functions on linked lists
10.1.6. Looping over lists
M. 12/7 Open.
Assn. 8 due.
 
T. 12/8 Reading day.  
W. 12/16 Final exam, 8:00–10:30am.  

Ethical issues

You can feel free to get help from anyone on the following issues concerning programming assignments.

  1. Understanding the problem description.
  2. Using the system software and hardware.
  3. Understanding the source of compile errors.
  4. Understanding broad issues of program or algorithm design for the problem.

But, other than from the instructor or graduate student tutor, it is considered cheating to obtain assistance for the following.

  1. Writing your program. This means any discussion about writing code or specifying algorithmic details.
  2. Fixing your program beyond syntax errors except for having someone ask you questions about your code. You must figure out how to change your code when errors are discovered (or talk to the instructor).

Never submit someone else's work as your own. That is plagiarism. Do not get a copy of a function definition from someone else and insert it into your program. Violations of these policies will be handled in a manner consistent with official university policy. If you submit someone else's work as your own, expect to recieve no credit. If your submission is 50% your work and 50% someone else's work, expect to receive no credit.

Note. To avoid problems with people stealing your work, do not recycle printouts of your program code in a place whether other students can pick them up. If someone asks for a copy of your work, do not supply it. Doing so risks receiving no credit for your own work.


Additional information

For information about

please see the auxiliary information at http://www.cs.ecu.edu/~karl/3300/fall15/syllabus-aux.html.