Instructor: Dr. Teresa Leyk

Office: 901E Richardson Bldg.

phone: 845-4456

e-mail: teresa@cs.tamu.edu

Course web page: (all information about the course will be there):

http://courses.cs.tamu.edu/teresa/cpsc211/cpsc211-index.html

Class Time: MWF 3:00 pm – 3:50 pm, ZACH 105 B

Lab Time:

Office Hours: MWF 10:15 am – 11:15 am, other times by appointment, 901E Richardson

Course Description: Credit 4. Specification and implementation of basic data structures and abstract data types: linked lists, stacks, queues, trees, hash tables, graphs; performance trade-offs of different implementations; asymptotic analysis of running time and memory usage; comparison and contrasting object oriented languages (typically Java) and non-object-oriented languages (typically C); emphasis on adherence to good software engineering principles.

Prerequisite: CPSC 111 “Introduction to Computer Science Concepts and Programming”, knowledge of C and Java programming languages.

Required Textbook: "Data Structures and Abstractions with Java" by Frank M. Carrano and Walter Savitch, 2003, Prentice Hall, (ISBN 0-13-017489-0). Also, you may need a C reference book: "A first book of ANSI C " by Gary J. Bronson, 3rd ed., Brooks/Cole or “C by Dissection” by Al Kelley and Ira Pohl.

Learning Objectives: At the end of this course students should be able to:

1. Apply the concept of abstract data types (ADTs) for basic data structures.
2. Implement each data structure using object-oriented and non-object oriented programming languages.
3. Understand the relations between data structures and algorithms.
4. Demonstrate familiarity with standard operations on data structures and their best, worst and average case analysis.
5. Understand and be able to apply the principles of abstraction, encapsulation and information hiding to design software using C and Java programming languages.

Course Content (the topics and related chapters according to the textbook):

• Introduction
• Review of Java Programming Language (Chap. 1–3)
• Introduction to Analysis of Algorithms (Chap. 9)
• Lists and Their Implementations, Arrays and Linked Lists, Java Features (Chap. 4–8)
• Stack and Queue (Chap. 20–23)
• Implementation of Sorted Lists in Java (Chap. 13–16)
• Recursion (Chap. 10)
• Sorting Algorithms: Merge and Quick Sort (Chap. 12)
• Binary Trees (Chap. 24, 25)
• Binary Search Trees (Chap. 26, 28)
• Binary Heap and Priority Queue (Chap. 27)
• Graphs (Chap. 29, 30)
• Hash Tables (Chap. 19)
• Main C language topics: arrays, pointers, dynamic memory allocation, function calls

Grading: Your final grade will be determined based on programming homework assignments, quizzes, mid-term exams and the final exam.

• Homework assignments – 40%
  • All homework assignments will be announced in class and posted on the course web page. Most of the programs must be written in Java and/or Standard C, compiled and run on CS departmental computer (Unix machine), and transferred to a course directory for grading using the CSNet turnin program. Each homework assignment will be graded focusing on: design of algorithms, usage of data structures and/or new user-defined types, and their implementation its correctness and tests; a typed report describing implemented algorithms and data structures, and results of computational experiments. All assignments (their electronic submission and a hard-copy of the report and source code) are due at the beginning of class on the due day. A late homework assignment will be accepted up to four working days with a 5% penalty for each late day.
  • Culture assignments that allow you to explore the latest developments in Computer Science or learn about the famous computer scientist like Turing Award winners.
• Exams (closed book) – 48%
  • Exam I (Wednesday, September 24) – 12%
  • Exam II (Wednesday, October 22) – 12%
  • Exam III (Wednesday, November 24) – 12%
  • Final Exam (comprehensive) (Tuesday, December 9, 10:30–12:30 pm) – 12%
• Quizzes – 12% (once a week) over material covered during lectures and reading material from the textbook

Grading Scale: Grades will be assigned according to the following scheme:
90% –100% –> A, 80% – 89% –> B, 70% – 79% –> C, 60% – 69% –> D, 0% – 59% –> F
You can also get 2 points to your final score if you have perfect lab attendance, or 1 point if you have only one absence.

Learning process: From the syllabus you may have noticed that this course focuses on obtaining a computer science background and developing programming skills. Programming is not something what you can learn overnight by reading a textbook or lecture notes, it requires a lot of practice. The class TA, PTs and I are willing to help you to learn and understand the course material and master your programming skills so please see us during our office hours.

A few hints that will help you to succeed in this course:

• attend class and lab meetings regularly
• read lecture notes and related material in the textbook and feel free to ask questions
• study for quizzes and tests
• retype and implement in Java or C examples from the lecture notes and textbook
• complete all labs

In general, Computer Science is not an easy subject but it will payoff after graduation. CNNMoney posted on Feb. 8, 2007 the results of the survey called "The most lucrative college degrees". The value of degree was measured by the average starting salaries for the class 2007. The top salary offers are:

Chemical Eng. – 60,054

Electrical Eng. – 54,599

Mechanical Eng. – 54,587

Computer Science – 51,070

. . .

Liberal Arts Majors – 30,502.

I think that you are aware that the four years you spend in college set the stage for your life. You must learn how to balance school and fun.

Also, CNN Money produced a top fifty list of the Best Jobs in America:

1. Software Engineer
2. College professor
3. Financial adviser
4. Human Resources Manager
5. Physician assistant
6. Market research analyst
7. Computer IT analyst
8. Real Estate Appraiser
9. Pharmacist
10. Psychologist

Notes

• Computer Accounts: To get an account on the Computer Science departmental Unix machines please contact Help Desk in the Bright building. You will have 24 hour access to Unix machines.
• Scholastic Dishonesty: Discussion of solutions is encouraged, but all assignments must be done on your own. If you use sources other than the textbook or lecture notes, list them. Any homework, which in the opinion of the instructor shows evidence of copying, will receive a lower grade or even zero. See the latest issue of the "Texas A&M University Student Rules" under the section "Scholastic Dishonesty" posted on http://student-rules.tamu.edu/.
• Attendance Policy: Student lab attendance is required and is counted as part of the final grade, see the grading section above. Class attendance will not be taken, but you are responsible to learn all material covered in class and read the assigned text from the textbook and do homework assignments. Make-up exams will only be given with documented University-approved excuses (see University Regulations). There are no make-up quizzes or exams. Discuss unusual circumstances in advance with the instructor.
• Students with Disabilities: According to the federal law, all students with disabilities have to have a special learning environment. For more information, please contact the Office of Support Services for Students with Disabilities in Room 126, Koldus building. Their phone number is 845-1637.
• Campus Emergencies or Code Maroon, see link: http://studentaffairs.tamu.edu/emergency.