CSSE 503 - Foundations Structures and Algorithms

Winter 2006

Engr 304, M 6:00-8:40pm

 

Instructor: Professor Roshanak Roshandel

Office Phone: (206) 296-5512

Office: ENGR 507

Office Hours: Mon 5:00-6:00pm and by appointment

E-mail: roshanak@seattleu.edu

 

Required Text

·            Discrete Mathematics and Its Applications, Kenneth H Rosen, McGraw-Hill, 2003, ISBN: 0072930330

 

Suggested Text

·            Data Structures and Problem Solving Using Java, Mark A Weiss, Addison Wesley, 2005, ISBN: 0321322134

·            Online or print resources for Java (if needed)

 

Course Description

Logic, truth tables and proofs; Sets, graph theory and networks; Functions, relations, enumeration and proof of correctness; Computational and asymptotic complexity, big-O notation; Linked lists, stacks and queues; Recursion, trees, heaps, Polish notation; Sorting, hashing and searching; We will be covering various topics listed above both from a mathematical perspective (discrete math) and its application to computer science (data structures)

 

Grading Policy

 

·            Midterm: 30%

·            Final Exam: 40%

·            Homework: 20%

·            Participation (including quizzes, in-class assignments, etc): 10%

 

Attendance Policy

You are responsible for the materials covered in class, assignments announced and modified, etc. There will also be quizzes and in-class assignments. All take-home assignments are due before the start of class on the due date. No late submission will be accepted.

 

Class Format

You are expected to read assigned materials in advance of the relevant class (handouts and textbook). There will be several programming and non-programming assignments, some take home assignments (not graded), a few in-class quizzes and assignments, a midterm, and either an in-class or take home final exam or project. You are encouraged to participate in various class activities, ask questions, discuss and test your ideas. You are also highly encouraged to ask questions either during office hours or by email.

 

Academic Integrity

Plagiarism is the unacknowledged use of the work or intellectual property of other persons, published or unpublished, presented as one’s own work. All students are expected to work on all individual assignments independently. Collaboration on individual assignments is considered cheating and will be penalized accordingly. Other examples of behavior that is not tolerated in this class include copying all or part of someone else’s work and submitting it as your own, sharing your assignment solution with other students in the class, consulting with another student during an exam, and copying text from published literature without proper attribution. If you have questions about what is allowed, please discuss it with the instructor. All students are responsible for reading and following the Seattle University Academic Honesty Policy. Students who violate University standards of academic honesty are subject to disciplinary sanctions, including failure in the course and suspension from the University.