COSC-160: Data Structures

Fall 2020

Contents

Announcements

  • 10/25/20: Posted the midterm exam.
  • 10/22/20: Posted hw5 and p4.
  • 10/13/20: Posted my solution to hw4.
  • 10/6/20: Moved the deadline for p3 and the dates of the midterm back one week.
  • 9/30/20: Posted p3.
  • 9/29/20: Posted hw4.
  • 9/26/20: Posted my solution to hw3.
  • 9/23/20: Posted my solution to hw2.
  • 9/16/20: Posted hw3 and p2.
  • 9/7/20: Posted Pseudocode and Analysis Cheat Sheet, which you can also access through the Files section of the Canvas site.
  • 9/5/20: Posted everything you need to know about the Course Assistant: their names, office hours, and the operating systems and development environments with which they are familiar.
  • 9/3/20: Posted COSC-160 Student Directory, which you can also access through the Files section of the Canvas site.
  • 9/2/20: Posted hw2.
  • 8/25/20: Posted p1.
  • 8/25/20: Posted hw1.
  • 8/17/20: Posted hw0, an optional quiz designed to assess your understanding of concepts covered in COSC-052 and COSC-030.
  • 8/10/20: Set the assignment deadlines.
  • 7/10/20: Arranged the schedule of topics.
  • 3/22/20: Created this Web page.
  • Where, When, Who

    Section 01 Class Time: MW 9:30–10:45 AM
    Section 01 Classroom: WGR 202
    Section 02 Class Time: TR 9:30–10:45 AM
    Section 02 Classroom: REI 281
       
    Instructor: Mark Maloof
    Office: 325 St. Mary's Hall
    Mailbox: 329A St. Mary's Hall
    Office Hours: MWR 3:30–4:30 PM ET, T 4:30–5:30 PM ET via Zoom (or by appointment). Please send me e-mail for the Zoom link.

    Description

    This course is designed as a second year course for majors and minors and covers basic data structures and algorithm analysis. Starting with the art and science of analyzing algorithms, the main goal of this course is to learn various techniques for organizing data so that computer programs can access, modify, and delete data efficiently. Topics covered include basic data structures (for example, lists, stacks and queues), trees, hashing, heaps, disjoint sets, and graphs, self-adjusting data structures; worst-case, average-case, and amortized analysis; and basic problem solving techniques. The topics are theoretical in nature but have dramatic impact in practice.

    Prerequisites: Computer Science II (COSC-052) and either Mathematical Methods for Computer Science (COSC-030) or Introduction to Proofs and Problem Solving (MATH-200)

    Required Text:

    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 have 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 and master's students to Georgetown's Honor Council. I am obligated to refer all suspected cases of academic dishonesty by doctoral students to the dean of the Graduate School. If you have any questions about these policies or how they apply, please discuss such concerns with me during class, during office hours, by e-mail, or using the class's discussion board.

    In my experience, students at Georgetown do honest work. The very 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 always follow proper scholarly practice for all submitted work, whether graded or ungraded and whether a draft or final version of a proposal, paper, program, or problem set. As scholars, we must acknowledge our reliance on the work of others through citation. You can never submit someone else's work as your own without proper attribution. The University assumes that students learned how to properly cite material at their previous institutions. If this is not the case, please let me know.

    Indeed, 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 theorems, proofs, algorithms, programs, and code fragments may require the same treatment as any other form of expression.

    For convenience, you do not need to cite the course materials, which are the syllabus, sources linked from the syllabus, the course textbook, the class lectures and discussion, posts on the discussion board, and conversations with me and the course's teaching assistants. You must, however, cite the use of any source that is not part of the course materials. Note that “the textbook” does not extend to the textbook's Web site, its contents, lecture slides, solution manuals, code repositories, or any other material related to the textbook. The syllabus links to any such material pertinent for the class. If you are unsure about what requires citation or what constitutes proper scholarly practice, please ask me during class, during office hours, by e-mail, or using the discussion board.

    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 materials that I create and use for my courses (“Course Materials”) are my intellectual property. You may not disseminate or reproduce them in any form for public distribution (e.g., sale, exchange, etc.) without my written permission. Course Materials include all written or electronic documents and materials that I provide, including but not limited to syllabi, current and past assessments and their solutions (e.g., exams, homeworks, projects, problem sets, etc.), and presentations such as lectures, videos, slides, etc. Course Materials may only be used by students enrolled in the course for academic (i.e., course-related) purposes. Furthermore, your solutions to assessments are derivative works of my copyrighted material and are therefore subject to that protection because they necessarily incorporate my protected expression. Consequently, you may not further disseminate or reproduce in any form for distribution (e.g., uploading to websites, sale, exchange, etc.) your solutions to assessments.

    Published course readings (book chapters, articles, reports, etc.) available in Canvas are copyrighted material. I make these works available to students through licensed databases or fair use. They are protected by copyright law, and may not be further disseminated or reproduced in any form for distribution (e.g., uploading to websites, sale, exchange, etc.) without permission of the copyright owner.

    You can find more information about intellectual property and copyright here: https://www.library.georgetown.edu/copyright. You can find more information about computer acceptable use policy and intellectual property here: https://security.georgetown.edu/it-policies-procedures/computer-systems-aup.

    Copyright issues aside, if you post your solutions to assessments on the Internet, it is possible that students in future classes will find your solutions and submit them as their own work without attribution. Naturally, students who do so violate my course policies, and the Honor Council will with high probability find them in violation and sanction them. The Honor Council may also find you in violation because you facilitated cheating and violated copyright law and the Web site's terms of service.

    I understand that it is often important for securing a job or an internship for students to provide prospective employers with a portfolio of their work. I recommend that students devise a scheme for doing so that does not violate copyright law, does not violate the terms of service of the site on which you have posted material protected by copyright, and does not facilitate cheating.

    The following list details acceptable and unacceptable practices:

    Policies dealing logistics:

    For flexibility, each student has two Get-Out-Of-Jail-Free cards—virtual cards, of course—and 36 grace hours. Students can use their goojf cards to avoid a homework without a grading penalty, obtain an additional submission to Autoloab, or avoid answering one question on the midterm or final exam. Students can use their grace hours to obtain extensions on homeworks, projects, and the midterm exam. Grace hours can not be used for an extension on the final project (p5) or the final exam because of university rules and grading deadlines.

    To use the cards and hours for an assignment, students must post a private message on Piazza before 4:30 PM ET on the day the assignment is due. There can be only one request of each type per assignment. For example, students can not use two cards for a project, and they can not make two requests to use their grace hours on an assignment. They can, however, use a card and their grace hours on a project or the midterm exam.

    For grace hours, students must specify the number of hours they will use. If they submit their project beyond the new deadline, it will be late and the usual deduction will apply. Once a request to use a goojf card or grace hours has been made, it can not be retracted. Unused submissions and hours can not be reclaimed. Cards and hours can not be transferred to other students. Note that cards and grace hours are intended for use in normal circumstances. Students who experience extraordinary setbacks, such as medical or family emergencies, may qualify for an extension without using their grace hours. Students in these situations should contact the instructor.

    Everything You Need to Know about the CAs

    Name NetID Office Hours Operating Systems IDEs and command-line tools
             
    Cristina Lopez cml322 M 11 AM–1 PM ET, W 11 AM–12 PM ET Linux (cs-class), Windows Eclipse, vi
    Elena Mehiel ekm64 TR 11 AM–12 PM ET, F 2–3 PM ET Linux (cs-class), Windows vi, Code::Blocks
    Ron Talmor rt701 T 2–3 PM ET, R 5–6 PM ET, F 11 AM–12 PM ET Linux (cs-class), MacOS nano, CLion
    Simra Ali sia33 W 11:15 AM–12:15 PM ET, R 2–3 PM ET, F 12–2 PM ET Linux (cs-class), MacOS nano, Terminal, sublime

    Schedule

    Week 
    Topic 
    Chapters 
         
    1 Maps and Hash Tables
    9.1, 9.2
    2   Algorithms and Pseudocode
    3   Algorithm Analysis, Asymptotic Notation
    4   Analysis of Elementary Data Structures
    5, 6
    5 Trees, Binary Trees, Binary Search Trees
    6 Traversals, Operations
    7 Binary Search Trees
    8 Multi-way trees, (a, b) trees, (2, 4) trees
    9 B-trees, Midterm
    10 Red-black trees
    11 AVL trees
    12 Splay Trees
    13 Heaps and Priority Queues
    14 Graph Algorithms
    14 Graph Algorithms
    16 Sorting: Merge-Sort and Quick-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 © 2020 Mark Maloof. All Rights Reserved. This material may not be published, broadcast, rewritten, or redistributed.