Hudson county community college course syllabus



Download 20.02 Kb.
Date conversion26.05.2016
Size20.02 Kb.
HUDSON COUNTY COMMUNITY COLLEGE

COURSE SYLLABUS
TITLE OF COURSE: Data Structures and Advanced Programming NUMBER: CSC 214-01
TERM: Spring/YEAR: 2014 CLASS MEETINGS: Tue 06:00 – 09:45 pm D207
PREREQUSITE(S): CSC 115
INSTRUCTOR: Juan P Rodriguez, PhD
EMAIL ADDRESS:jprodrix@yahoo.com PHONE: (973) 416-4575


  1. COURSE DESCRIPTION:

The course examines Data Structures and their software implementation. Topics cpvered include top-down design, pointer variables and dynamic data structures, linked lists, stacks, queues, recursion, graphs, tree search and backtracking, and sorting/searching techniques.

  1. COURSE OBJECTIVES:

Upon completion of the course, the students will be able to:

    1. Master the implementation of Linked data Structures

    2. Understand advanced data structures (hash tables, queues, stacks and graphs).

    3. Write recursive and graph algorithms (shortest path and minimum spanning tree)

    4. Use a variety of sorting algorithms including quick sort, merge sort and heap sort.


3. TEXTBOOKS REQUIRED:

  1. D. S. Malik, C++ Programming: Program Design Including Data Structures, 6th Edition. Cengage Learning, 2013, ISBN-13: 9781133526322




  1. EVALUATION METHODS:

    1. Sources and points




Item

Points

Midterm exam

200

Final exam

200

Class Projects

600

TOTAL

1000




  1. Grades and points required

967 and up: A+ 934 – 966: A

901 – 933: A- 867 - 900: B+

834 – 866: B 801 – 833: B-

701 - 800: C 601 - 700: D

600 and under: F


  1. COURSE OUTLINE:




Week

Topics

1

02/04/14

Introduction to Arrays(Book Chapter 08) and Videos

Introduction to Data Structures - Videos



2

02/11/14

Arrays – Continued

Time Complexity in Programs



3

02/18/14

Linked Lists 01

4

02/25/14

Linked Lists 02

5

03/04/14

Stacks

6

03/11/14

Queues

7

03/18/14

Mid Term Exams – Lecture and Lab

8

03/25/14

Spring Break

9

04/01/14

Heaps

10

04/08/14

Search Algorithms

11

04/15/14

Sort Algorithms

12

04/22/14

Binary Trees

13

04/29/14

Graphs

14

05/06/14




15

05/13/14

Final Exams – Lecture and Lab




  1. ATTENDANCE POLICY:

    1. Classes: Students are expected to attend each class and to arrive on time. Regular attendance is vital because lectures are based on the material learned on the previous lecture.

    2. Assignments are due at the start of the class on their due date. A penalty of 10% will be charged for each day the assignment is late. No e-mailed assignments will be accepted unless under special circumstances and by prior arrangement with the Instructor.

    3. Exams (midterm and final): In general, no exams will be made up and a missed exam will have a grade of 0. In extraordinary circumstances, by prior arrangement or in cases of documented emergencies, exceptions will be made at the discretion of the Instructor. Missing an exam because of a vacation is not a valid reason. Schedule vacations around exams dates, not the reverse.


  1. USE OF ELECTRONIC COMMUNICATION DEVICES:

    1. No electronic devices will be used during the lectures or exams. During lectures, set your cell phone to vibrate and, if you need to use it, step out and do it outside the classroom.

    2. Cell phone texting and listening of mp3 players via earphones will be allowed, at the discretion of the instructor, during the lab portion of the class. Cell phone calls are to be done out of the class room.




  1. DISABILITY SUPPORT STATEMENT:

Students with disabilities who believe that they might need accommodations in this class are encouraged to contact, Disability Support Services at (201) 360-4157, as soon as possible to better ensure that such accommodations are implemented in a timely fashion.   All disabilities must be documented by a qualified professional such as a Physician, Licensed Learning Disabilities Teacher Consultant (LDTC), Psychiatrist, Psychologist, Psychiatric Nurse, Licensed Social Worker or Licensed Professional Counselor, who is qualified to assess the disability that the student claims to have and make recommendations on accommodations for the student.   All information provided to the Disability Support Services Program will be confidential between the program, professors involved with the student and individual student.


  1. ACADEMIC INTEGRITY STATEMENT:

Academic Integrity Standards


Academic integrity is central to the pursuit of education. For students at HCCC, this means maintaining the highest ethical standards in completing their academic work. In doing so, students earn college credits by their honest efforts. When they are awarded a certificate of degree, they have attained a goal representing genuine achievement and can reflect with pride on their accomplishment. This is what gives college education its essential value.
Violations of the principle of academic integrity include:

  • Cheating on exams

  • Reporting false research data or experimental results

  • Allowing other students to copy one’s work to submit to instructors

  • Communicating the contents of an exam to other students who will be taking the same test

  • Submitting the same project in more than one course, without discussing this first with the instructor

  • Submitting plagiarized work. Plagiarism is the use of another writer’s words or ideas without properly crediting that person. This unacknowledged use may be from published books or articles, the Internet, or another student’s work

When students act dishonestly in meeting their course requirements, they lower the value of education for all students. Students who violate the college’s policy on academic integrity are subject to failing grades on exams or projects, or for the entire course. In some cases, serious or repeated instances of academic integrity violations may warrant further disciplinary action.





The database is protected by copyright ©essaydocs.org 2016
send message

    Main page