Comp 271 - Structured Programming and Data Structures

Instructor : Prof. Chandra N. Sekharan

• E-mail : chandra@cs.luc.edu
• Telephone : 312-915-7985
• Office : Lewis Towers 512 D
• Office Hours: Tuesday: 2:30 pm to 4:30 pm

Textbook :

Programming Environment : We will be programming in Java.  You will need to have access to JDK 1.4.x or a suitable IDE such as JBuilder 8.0 (Personal edition) or Blue J.  The labs machines are equipped with these.

Campus Network, Rights and Responsibilities: As a user of the campus network, you should be aware of your rights and responsibilities in
  http://www.luc.edu/infotech/cease/rights.html

Website: http://web.cs.luc.edu/~chandra/COMP271

Prerequisites : Comp 170 in Java

Topics to be Covered:

1 Important Features of Java
2 Interfaces and Collection Classes
3 Introduction to Software Engineering
4 Recursion
5 Array Lists
6 Linked Lists
7 Queues and Stacks
8 Binary Trees and Binary Search Trees
9 Balanced Binary Search Trees
10 Tree maps and Tree sets
11 Priority Queues
12 Sorting
13 Searching and The Hash Classes
14 Graphs, Trees, and Networks
Appendix 1 Mathematical Background
Appendix 3 The Java Collections Framework

 

Grading:  Homework: 50%;     Midterm: 25%;    Finals: 25%.  The quizzes are treated as homework assignments for grading purposes.

Final Exam: May 13th, 1:45 pm to 3:45 pm.

Midterm: 3rd March, 2005.

Late or incorrect assignments: In this class lateness penalties of 3% per day or fraction of a day apply. If there is some special reason for an assignment being turned in late, preferably communicate to me directly first AND make a comment at the top of your source code in the main program. (This reminder helps!)  It is your responsibility to fully test your programs.   Non-working programs will be marked down drastically, if they get any credit at all.  It is better to be a couple of days late and get your assignment working in all cases than to pass it in and have it bomb when being graded! 

I use the scale with the following minimum requirements: A 90; B+ 85; B 80 ;C+ 75; C 70 ;D+ 65 ;D 60.

Missed Exams:  If you must miss an exam, let me know well in advance. Then if you have a good reason we can possibly make other arrangements. This flexibility depends on your clear, prompt, timely communication.

IMPORTANT POLICY:  If you have an excuse for not being prepared to take an exam, but decide to take it anyway, you don't get to change your mind after you see a poor grade. In certain circumstances I may allow you to delay an exam due to illness, but I will not let you be reexamined due to a poor grade.

Academic Dishonesty : The penalty for cheating may be anywhere from a 0 on an assignment to a grade of "F" in this course. The appropriate dean will be informed in writing of any cheating incidents. Cheating consists of, but is not limited to:

·         Using or copying another person's work on an exam or assignment in any fashion.

·         Work includes outlines, pseudocode, code, documentation, test data, and analyses.

·         The person could be in this semester's class or a previous semester.

·         Allowing your own work to be copied or used by another student

·         Submitting as your own work something that has been written by another person

·         Using any unauthorized reference on an exam or assignment

Any collaboration among students on program code or algorithms or on exams constitutes cheating for all of the students involved. Help from any source is fine concerning the meaning of assignment specifications (not the plan for the solution or the actual solution).