Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.12202/7655
Title: | COMP 1320C Data Structures |
Authors: | Broder, Alan J. |
Issue Date: | Jan-2021 |
Citation: | Broder, Alan J. (2021, Spring), Syllabus, COMP 1320C Data Structures, Stern College for Women, Yeshiva University. |
Series/Report no.: | SCW Syllabi;COMP 1320C |
Abstract: | Overview: This course provides a survey of fundamental data structures and algorithms needed to implement efficient, scalable programs. Upon successful completion of this course you will have mastered the material needed to analyze a computing problem and to select the data structure that solves the problem with predictable and appropriate use of computing time and memory resources. _____ This course covers the following topics: arrays, sorting, stacks and queues, linked lists, recursion, binary trees, hash tables, heaps, and graphs. A significant part of this course involves actually writing Python programs that implement the above topics – in labs, for homework, and on exams. However, this course is not a Python programming course, so students must have already mastered Python programming through prior coursework or independent study. ____ Prerequisites: COMP 1300C, and competence in Python programming, including the ability to define new classes and methods, and to use inheritance. |
Description: | SCW syllabus / YU only |
URI: | https://hdl.handle.net/20.500.12202/7655 |
Appears in Collections: | Stern College Syllabi -- Spring and Fall 2021-2022 courses --- COMP (Computers) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
COMP1320C.Broder.Spring2021 O.pdf Restricted Access | 158.47 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License