COSC-052: Computer Science II

Spring 2018

Contents

Announcements

  • 5/1/18: Posted the room for the final exam: ICC 115.
  • 4/24/18: Updated the submission instructions for p5.
  • 4/18/18: Posted p5.
  • 3/29/18: Changed the due date for p3 to T 4/3 @ 9 PM.
  • 3/28/18: Posted p4.
  • 2/23/18: Posted p3.
  • 1/31/18: Posted p2.
  • 1/26/18: Posted the TA's preferred operatings systems, IDEs, and tools.
  • 1/23/18: Posted hw2.
  • 1/21/18: Changed the deadline for hw1 to W 1/24 @ 5 PM.
  • 1/11/18: Changed the classroom to Reiss 502.
  • 1/8/18: Posted p1.
  • 1/8/18: Posted hw1.
  • 1/3/18: Created this Web page. Set assignment dates.
  • Where, When, Who

    Class Time: MW 2:00–3:15 PM
    Classroom: Reiss 502
       
    Instructor: Mark Maloof
    Office: 325 St. Mary's Hall
    Mailbox: 329A St. Mary's Hall
    Office Hours: None for 24–25 academic year.

    Description

    COSC-052 surveys advanced topics of C++ programming and introductory concepts of data structures. It is intended for computer science majors, minors, and other students with a serious interest in learning C++ programming. The course covers program organization, pointers, self-referential classes, dynamic object creation and destruction, linked lists, recursion, inheritance, abstract base classes, virtual methods, polymorphism, template classes, exception handling, C-style arrays, bit operations, random file access, basic algorithm analysis, big-Oh notation, abstract data types, stacks, queues, deques, lists, vectors, sequences, priority queues, searching, and sorting. COSC-051 followed by COSC-052 is a major introductory sequence and together complete the General Education requirement for Math/Science. This course can also be used to fulfill the math/computer science portion of the General Education Math/Science requirement.

    Prerequisite: Computer Science I (COSC-051).

    Recommended Texts:

    Learning Goals

    By the end of the semester, students will be able to:

    Policies

    My course policies are designed to supplement the University's Undergraduate Honor System and the CS Department's Honor Policy. Unless stated otherwise when I distribute an assignment, the following is the default for all assignments for this course. I've developed my policies from past teaching experiences and from the CS Department's Honor Code at George Mason University.

    I am obligated to refer all suspected cases of academic dishonesty by undergraduate students to Georgetown's Honor Council. If you have any questions about these policies or how they apply, please discuss such concerns with me during class, during office hours, or by e-mail.

    In my experience, students at Georgetown do honest work. The small percentage of students who have submitted someone else's work as their own did so because they did not manage their time wisely.

    Students must follow proper scholarly practice for all submitted work, whether graded or ungraded and whether a draft or final version of a proposal, paper, or program. We must acknowledge our reliance on the work of others through citation.

    Students may be quite adept at and knowledgeable about citing and quoting material from traditional sources, such as books and articles. Typically, we do not have cite facts, common math formulae, or expressions of our own ideas, observations, interpretations, and analyses, However, students new to computer science may not realize that formulae, theorems, proofs, algorithms, and programs can require the same treatment as any other form of expression.

    For convenience, you do not need to cite the course materials, conversations with me or information you obtain from class lectures and discussions. If you are unsure about what requires citation or what constitutes proper scholarly practice, please ask me during class, during office hours, or by e-mail.

    I design my courses and assignments so students have what they need to complete the assignments individually without consulting outside resources. I determine the size of and credit for assignments based on the assumption that the work for them is the result of individual effort using only the course resources and materials. Students who use outside resources to complete assignments may not be eligible for full credit. Students who do not acknowledge their use of outside resources to complete assignments may be in violation of my course policies and the university's policies on academic integrity.

    The following list details acceptable and unacceptable practices:

    Policies dealing logistics:

    Everything You Need to Know about the TAs

    Google Calendar for TA Office Hours

    Name NetID Operating Systems IDEs and command-line tools
           
    Benjamin Maltbie bm926 MacOS Xcode, Eclipse, vi, FileZilla
    Christian Collier chc46 MacOS Xcode, Eclipse, FileZilla
    Clarissa Somers cs1407 MacOS Xcode, vi, sublime, FileZilla
    Daniel Crosson dfc29 MacOS Xcode, Eclipse, make, sftp and scp
    Eibhlin Goggins esg41
    Garrett Hinck gah49 MacOS Xcode, FileZilla
    Isabella Schwartz is392 MacOS Xcode, Eclipse, sublime, FileZilla
    Jonathan Gibson jeg263 MacOS Xcode, FileZilla
    Josh Rosson jnr41 MacOS Xcode, Eclipse, FileZilla
    Jake Mitchell jpm362
    Mark Ozdemir mo732
    Noah Levesque nbl12 MacOS, Windows Xcode, Eclipse, vi, FileZilla
    Paulina Calderon pac84 MacOS Xcode, Eclipse, sublime, FileZilla
    Parth Patel pbp25 MacOS Xcode, Visual Studio, FileZilla
    Sarah A. Ciresi sac282 MacOS, Linux (cs-class or other) Xcode, Eclipse, emacs, sublime, FileZilla
    Elly Meng sm3008
    Sam Thacher smt76
    Sean Letendre srl61 Windows, Linux (cs-class or other) vi, sublime, make, valgrind
    Shoya Yoshida sy519 Windows Visual Studio, sublime, make, valgrind, FileZilla
    Zachary Scherer zs137 MacOS Eclipse

    Schedule

    Week 
    Topic 
    Chapters 
         
    1   Program Organization, make, Doc Comments
    2   Classes, Object Composition, Exception Handling
    3   Classes, Operator Overloading
    4   Inheritance, Polymorphism
    5   Inheritance, Polymorphism
    6   Exception Handling, Implementing Exception Classes
    7   Algorithm Complexity, Asymptotic Notation
    8   Midterm, Self-Referential Classes
    9   Template Classes
    10   Singly Linked Lists
    11   Stacks, Queues
    12   Deques, Priority Queues
    13   Lists
    14 Recursion, Linear Search
    15   Arrays, Vectors, Binary Search
    16   Insertion Sort, Selection Sort
         

    Assignments and Grading

    String Grades::getLetterGrade()
    {
      if (grade >= 94)
        return "A";
      else if (grade >= 90)
        return "A-";
      else if (grade >= 87)
        return "B+";
      else if (grade >= 84)
        return "B";
      else if (grade >= 80)
        return "B-";
      else if (grade >= 77)
        return "C+";
      else if (grade >= 74)
        return "C";
      else if (grade >= 70)
        return "C-";
      else if (grade >= 67)
        return "D+";
      else if (grade >= 64)
        return "D";
      else
        return "F";
    } // Grades::getLetterGrade
    

    I use automatic grading routines to assign an initial grade for the projects. It is important to emphasize that the grade you obtain from Autolab is an initial grade and may not be your final grade. There are many important aspects of a program that are difficult or impossible to assess using automatic grading routines. For example, automatic grading routines can not determine if you have written proper documentation. They can not easily assess if an implementation of an operation is optimally efficient. As a consequence, I start with the initial grade you obtain from Autolab and take further deductions if necessary.

    For complete implementations, I use the following distribution as a guide:

    Notice that an implementation consisting entirely method stubs would obtain an initial grade of 60%. Such an implementation is incomplete, and would be subject to further deductions based on the effort required to implement the required operations.

    In addition to the above, the following deductions may be taken if applicable:

    Materials: Readings, Videos, and Links

    Other Interesting Links

    Copyright © 2019 Mark Maloof. All Rights Reserved. This material may not be published, broadcast, rewritten, or redistributed.