Section: | Class Hours: | Room: | Instructor: | E-mail: | Office: | Office Hours: |
---|---|---|---|---|---|---|
CMP 338 I401 (61817) | M, W 11:00 AM - 12:40 PM | GI-231 | Sameh Fakhouri | sameh DOT fakhouri AT lehman DOT cuny DOT edu | GI-102 | Mondays & Wednesdays 3:30-5:00 PM |
Description: 4 hours, 4 credits
Abstract characterizations as well as the design and implementation of data structures such as arrays, stacks, queues, linked lists, binary search trees, heaps, and graphs along with algorithms that make use of such structures including algorithms for sorting, searching, and memory management, will be studied. Algorithms will be analyzed for their asymptotic behavior in terms of time complexity and space requirements will be considered as well. Implementation issues will be considered and students will write programs that embody these data structures and algorithms.
Expectations: Students are expected to learn both the material covered in class and the material in the textbook and other assigned reading. Completing homework is an essential part of the learning experience. Students should review topics from prior courses as needed using old notes and books.
Honor Code: You are encouraged to work together on the overall design of the homework. However, for specific homework assignments, all work must be your own. You are responsible for knowing and following Lehman's academic integrity code (available from the Undergraduate Bulletin, Graduate Bulletin, or the Office of Academic Standards and Evaluations). All incidents of cheating will be reported to the Vice President of Student Affairs.
Email: I will be communicating with you on a regular basis throughout the semester using your email address on Blackboard. You must verify that blackboard has your Lehman College email address. You must check that email address on a regular basis. There will be no acceptable excuse for missing an email announcement.
Homework: Homework is due most weeks. Homework assignments are posted on the class website, they reinforce concepts covered in class.
All homework will be submitted on Mimir. You need to register on the website and join our course by using the course code = 118355233c
All homework assignments have a deadline, No late homework will be accepted.
Exams:
Grades: The grading for the course will be based on:
Since the final exam is comprehensive, if you do better on the final exam than the midterm exam, the final grade can replace the midterm grade. This will be done automatically when your final grade is calculated. Please note that There are no make-up exams.
Textbook: Data Structures and Algorithms in Java (Sixth Edition) by Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser. (ISBN: 978-1-118-77133-4).
Accommodating Disabilities: Lehman College is committed to providing access to all programs and curricula to all students. Students with disabilities who may need classroom accommodations are encouraged to register with the Office of Student Disability Services. For more info, please contact the Office of Student Disability Services, Shuster Hall, Room 238, phone number, 718-960-8441.
Technology: Students will need to have access to personal computers with the Java IDE, Eclipse, software installed. Such computers are available for student use on campus. For students with their own computers, Java and Eclipse are available free of charge on the internet.
Java Download | Eclipse Download | Java Documentation |
---|---|---|
Java SE Development Kit 8 Downloads
Download Java SE Development Kit 8u161 Open Downloaded File and Follow Install Instructions |
Eclipse Download
Download Eclipse IDE for Java Developers Open Downloaded File and Save Eclipse on Your Desktop |
Java Platform, Standard Edition 8 API Specification |
At the end of the course, students should:
For each algorithm, verification of its correctness and analysis of its efficiency will be considered.