Data Structures (CSCI 2232/5555) Dr. Neelu Sinha Textbook: Nell Dale, “C++ Plus Data Structures”, 4th edition, Jones and Bartlett Publishers, Inc. ISBN-10: 0-7637-4158-2 and ISBN-13: 978-0-7637-4158-7 Prerequisite: Course CSCI 2215/5525 Minimum grade C Course CSCI 1205/5505 TOPICS: 1) Software Engineering Principles: Review of C++ Programming related to Object-oriented design, abstraction, functional decomposition, testing & debugging techniques, concept of generalized test driver, etc. 2) Data Abstraction and Encapsulation C++ Class type Design of Data Structures: Abstraction, Implementation, Application Design and implementation of user defined data type for generalized string input and output, using a generalized test driver. 3) Unsorted and Sorted List Abstract Data Type – Unsorted List Abstract Data Type – Sorted List Comparison of algorithms – Big–O notation Overloading Operators 4) Stacks and Queues Stacks, Queues Pointer Types, Dynamically allocated arrays 5) Linked Structures Implementing Stack and Queue as a linked structure Implementing Sorted and Unsorted List as a linked structure 6) Advanced Lists Circular Linked Lists Doubly Linked Lists Copy Structures, Polymorphism, and Virtual functions 7) Programming with Recursion Formulation of problems and algorithms Recursion as a programming tool 8) Binary Search Trees 9) Priority Queues, Heaps, Graphs, etc 10) Sorting and Searching Algorithms Office Hours: M, W: 9:00 AM – 11:00 AM (or, by appointment) Room #: 262 NAB Tel: (973) 443-8687 Email: sinha@fdu.edu Fax: (973) 443-8683 Grading Policy: Assignments/Projects Quiz Final Exam 40% 30% (~ 7th week) 30% (Finals Week) Note: There will be no makeup for any missed Quiz/Exam. Grading penalties will be assessed for late assignment/project submissions. It is assumed that you are familiar with FDU Academic Integrity Policy. FDU Department of Mathematics, Computer Science, & Physics N. Sinha