syllabus
Post on 25-Oct-2014
26 Views
Preview:
TRANSCRIPT
1
Oakton Community College Kamilla Murashkina
Course Syllabus CSC 241 8C1 847-635-1688 (Division II)
I.
Course Course Course
Prefix Number Name Credit Lecture Lab
CSC 241 Java Data Structures 3 3 1
II. Prerequisite Recommended: MAT 140, CSC 156 or CSC 173
III. Course (Catalog) Description
Course provides a survey of data structures. Content includes elementary methods of complexity analysis
applied to algorithms that manipulate dynamic and static data structures. Object-oriented programming
techniques are utilized to implement lists, trees, tables, graphs and other classes using the Java language.
Algorithms focus on sorting and searching methods.
IV. Learning Objectives
A. Continue applet and application development emphasizing modularity and abstract data types.
B. Utilize object-oriented programming skills to design maintainable classes.
C. Analyze algorithms to optimize memory and time complexity.
D. Implement a collection of data structures into a variety of applications.
E. Survey methods of sorting and searching.
V. Academic Integrity
Students and employees at Oakton Community College are required to demonstrate academic integrity and
follow Oakton's Code of Academic Conduct. This code prohibits:
• cheating,
• plagiarism (turning in work not written by you, or lacking proper citation),
• falsification and fabrication (lying or distorting the truth),
• helping others to cheat,
• unauthorized changes on official documents,
• pretending to be someone else or having someone else pretend to be you,
• making or accepting bribes, special favors, or threats, and
• any other behavior that violates academic integrity.
There are serious consequences to violations of the academic integrity policy. Oakton's policies and
procedures provide students a fair hearing if a complaint is made against you. If you are found to have
violated the policy, the minimum penalty is failure on the assignment and, a disciplinary record will be
established and kept on file in the office of the Vice President for Student Affairs for a period of 3 years.
Details of the Code of Academic Conduct can be found in the Student Handbook.
VI. Sequence of Topics
A. Program Development
1. Complexity analysis of efficiency
a. Big-O notation
2. Design strategies
a. Recursion
2
b. Object-oriented class relationships
i. inheritance , encapsulation and polymorphism
ii. Java packages
iii. dynamic binding
c. Exceptions
B. Abstract data design
1. Abstract Data Types (ADT’s)
2. Lists
a. stacks and queues
b. variations
3. Trees
a. binary search trees
4. Graphs
5. Collections
C. Algorithms
1. Sorting
a. selection & insertion sorts
b. merge, heap & quick sorts
c. bubble sort
2. Searching
a. binary and sequential searches
b. hash functions and tables
c. breadth & depth first searches
VII. Methods of Instruction
Online learning, reading and understanding textbook, writing, debugging and running Java programs,
submitting programs. Self work, and use of a computer laboratory.
VIII. Course Practices Required
Reading of the text is required for understanding the material. Use of a computer laboratory is necessary to
learn the design of software.
IX. Instructional Materials
Required textbook: Java Programming. Program Design Including Data Structures, by D.S. Malik, Course
Technology, Cengage Learning 2006.ISBN-13: 978-1-4188-3540-8, ISBN-10: 1-4188-3540-4 (chapters
8,10,11,12,14,15, 16-21)
The CSC 241 Home Page found at the following URL: https://d2l.oakton.edu. or use myOakton from
www.oakton.edu.
Browser to use: Mozilla Firefox
D2L has access to homework, exams, content, power point and programming assignments.
X. Methods of Evaluating Student Progress
There will be two examinations (20% each), several homeworks (Chapter Practice Tests) (20% total)
and several computer assignments (Programming Exercises) (40% total). Missing the final exam is
3
sufficient reason to fail the course. Aside from that, final grades will be determined by the following
scale.
A 100-90%, B 89.9-80%, C 79.9-70%, D 69.9-60% and F below 60%.
Homework==Practice Tests These are interactive quizzes that are located on the course in D2L. Take
Quizzes/Exams section to examine the homeworks and Exams. You will have 120 minutes to complete
each homework and all of them are to be opened book. Each homework must be completed by 11pm on its
due date. You have the option of taking the homework one more time before due date with the average of
the two homeworks recorded as your grade. Take second attempt only if you flunk first attempt. After due
date Homeworks and Exams are not available
Programming Exercises must be submitted on Oakton Unix and/or Dropbox D2L See LabNotes for
instruction. Each Project must have assigned name and submitted properly.
Program grading requirements : Output 30% - for alignment, spacing and accuracy. Organization 30% -
for use of meaningful data and subroutine names, use of block comments including pseudo-code and other
appropriate documentation. Structure and code 40% - for a structured program which meets the assigned
program specifications, avoiding any unnecessary, incorrect or ambiguous code. Program must compile and
run. . If program does not compile, student gets 0 grade for the assignment.
Midterm and Final are taken in the Testing Center in Oakton Community College (DP campus or
Skokie campus) otherwise to proctor Midterm and Final, contact Robin Nash rnash@oakton.edu
Alternative Education Note: the midterm and final MUST be taken at an authorized testing center. If you
are located far away from OCC, but near another university, it should be possible for us to arrange for you
to have the exams proctored at that school.
Please complete “Getting Started - Get VNC” This will give you experience using the OCC server.
No face-to-face Meetings.
System Requirements: Mozilla Firefox browser.
Logging into myOakton: Your login ID and your password will be given as register for class
Logging into Oakton Unix: Your login ID and your password: will be announced in the beginning of
semester
Login to D2L :
Use myOakton from www.oakton.edu or directly https://d2l.oakton.edu. You find there Content,
Quizzes/Tests, Grades, Homeworks and Exams are in Quiz/Tests section sections/ Project assignments are
in Content section. Syllabus and lab notes are in Course Information Section. Also lab0 from beginning
(previous) csc class included, it not for grade, but completing this lab0 will give you understanding of how
to login to Unix Oakton and how to perform project assignments
If you have a question, please email me, using the D2L mail option.
The course begins on June 04, 2012 and ends on July 26, 2012. The course materials will not be available
until course begins and any access will be denied after course ends. You can start all sections earlier by
reading the textbook and doing Homework and Projects (programming exercises)
Programming exercises must be submitted on Unix Oakton Machine and/or uploaded in Dropbox D2L.
You can do it in any environment at home, but you must move them to Oakton Unix and check that they
work on Unix Oakton. You use Telnet (to connect Oakton Linux), ftp (to move files).
You can find “How to Telnet and ftp “ instructions on section Course Information in D2L
How to install Eclipse Instruction, you can find on my website www.oakton.edu/~kmurashk csc class.
Each chapter has PowerPoint Presentation in Content section D2L
4
Understand that the course is tied to the Oakton Community College Semester system. You may complete
the course before the deadline, but, no grades will be issued until the end of the semester. You need to
finish all material that you want to count toward your grade by the last deadline below. Exceptions are
made only for those experiencing a grave and documented accident on the way to the final and who can
document the experience.
All Projects must be completed. All homework must be done.
Deadlines: see schedule below
After due date you won’t have access to homework and exams. No make up tests, No incomplete grades.
No extended time for homework, exams and projects.
SCHEDULE
Date
start Reading
Programming
Exersices *
Due date for
Programming
Exercises
Sunday 11pm
Homework or Exam
Due date for
homework * and
Exams Sunday
11pm
Week 1 Chapter 8 Chapter8PE June 10 Practice Test 8 June 10
Week 1 Chapter 10 Chapter10PE June 10 Practice Test 10 June 10
Week 2 Chapter 11 Chapter11PE June17 Practice Test 11 June17
Week 2 Chapter 12 Chapter12PE June 17 Practice Test 12 June 17
Week 3 Chapter 14 Chapter14PE June 24 Practice Test 14 June 24
Week 3 Chapter 15 Chapter15PE June 24 Practice Test 15 June 24
Week 4 Review
Week 4
Midterm (chapters
8,10,11,12,14,15)
Available
Monday-Thursday
8am-8pm
June 25 - June 28
Week 5 Chapter 16 Chapter16PE July 8 Practice Test 16 July 8
Week 5 Chapter 17 Chapter17PE July 8 Practice Test 17 July 8
Week 6 Chapter 18 Chapter18PE July 15 Practice Test 18 July 15
Week 6 Chapter 19 Chapter19PE July 15 Practice Test 19 July 15
Week 7 Chapter 20 Chapter20PE July 22 Practice Test 20 July 22
Week 7 Chapter 21 Chapter21PE July 22 Practice Test 21 July 22
Week 8 Review
Week 8
Final (chapters 16-
21)
Available
Monday-Thursday
8am-8pm
July 23-July 26
* Central Time
Aliases: Homework==Quiz==Practice Test
Lab==project==program assignment==program exercise==Chapter#PE==PE#
Exam==Test
5
See the Testing Center hours on Oakton College website
http://www.oakton.edu/studentservices/learning_center/testing/index.php
YOU are responsible for knowing the deadlines. In addition, access to each component (practice tests,
exams, programming exercises) above is dated.
Power Point for each chapter 1-21 is in Content in ppt and html format.
Midterm covers chapters 8,10,11,12,14,15
Chapter 8 User-Defined Classes and ADT’s
Chapter 10 The classes Vector and String, and Enumeration Types
Chapter 11 Inheritance and Polymorphism
Chapter 12 Handling Exceptions and Events
Chapter 14 Recursion
Chapter 15 Generic Methods, Classes, and Array-Based Lists
Final covers chapters 16, 17, 18, 19, 20, 21
Chapter 16 Linked Lists
Chapter 17 Stacks and Queues
Chapter 18 Searching and Sorting Algorithms
Chapter 19 Binary Trees
Chapter 20 Graphs
Chapter 21 Collections
XI. Other Course Information
If you have a documented learning, psychological, or physical disability you may be entitled to reasonable
academic accommodations or services. To request accommodations or services, contact the ASSIST office
in the Learning Center. All students are expected to fulfill essential course requirements. The College will
not waive any essential skill or requirement of a course or degree program.
Office hours: Mondays and Wednesdays 12:30pm-2pm room 2171 Des Plaines campus
top related