CS 241 Data Structures & Algorithms I

  • Instructor: Prof. Sung-Hyuk Cha
    • Email: scha@pace.edu
    • Tel: (212) 346-1253
    • Office: 163 Williams, Rm. 234 at NYC
    • Office Hours: T & Th 11:30 am ~ 1 pm and W 1 ~ 3pm.


  • CRN: 70276

  • Meeting:
    • Time: TR 01:25 - 03:20 P.M., Fall 2011
    • Place: Rm 237 at 163 Williams st.

  • Textbook: Data Abstraction and Problem Solving with Java: Walls and Mirrors, 3/E, Janet J. Prichard and Frank M. Carrano, Prentice Hall, 2011

  • Course Goals:
    The goals of this course are to extend and deepen the student's knowledge and understanding of algorithms and data structures and the associated design and analysis techniques. We examine the basic data structures and investigate the fundamental algorthms to manipulate them.

  • Course Description:
    Fundamental nature of information and storage structures and their manipulation. Linear lists, strings, arrays, stacks, representation of trees and graphs, multi-linked structures iterative and recursive programming techniques, storage systems, structures, and allocation. Introduction to sorting and searching techniques.

  • Prerequisites: A grade of "C" or better in CS 122

  • Lecture Notes: can be accessed using the http://blackboard.pace.edu.
    Blackboard Login Procedures for Registered Students are available here

  • Schedule: subject to change

    WeekTuesdayThursday
    1 9/6 9/8 Introduction
    2 9/13 Ch3 Recursion 9/15 Ch3 Recursion
    3 9/20 Ch5 Linked Lists 9/22 Ch5 Linked Lists
    4 9/27 Ch7 Stacks 9/29 Rosh Hashanah
    5 10/4 Ch7 Stacks 10/6 Ch7 Stacks
    6 10/11 Ch8 Queues 10/13 Ch8 Queues
    7 10/18 Ch6 Recursion 10/20 Ch6 Recursion
    8 10/25 Ch6 Recursion 10/27 Midterm Exam
    9 11/1 Ch10 Algorithm Efficiency & Sorting 11/3 Ch10 Algorithm Efficiency & Sorting
    10 11/8 Ch12 Priority Queues 11/10 Ch12 Priority Queues
    11 11/15 Combinatorics 11/17 Ch11 Trees
    12 11/22 Ch11 Trees 11/24 Thanksgiving Break
    13 11/29 Ch13.1 Balanced Search Trees 12/1 Ch13.1 Balanced Search Trees
    14 12/6 Ch13.2 Hashing 12/8 Review
    15 12/13 Presentation 12/15
    16 12/20 Final Exam  

  • Evaluation:
    • Attendance & Quizzes (10%):
    • Homeworks (20%):
    • Group Project (20%): A report and presentation
    • Midterm Exam (25%):
    • Final Exam (25%):

  • Course Policies
    • All homeworks must be submitted at the beginning of the class. No late homework will be accepted.