CSCI528_LECT_Syllabus_SP_2011 (1)

CSCI528_LECT_Syllabus_SP_2011 (1) - CSCI 528 Data...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
CSCI 528 – Data Structures Prerequisite: None IMPORTANT: All studnets mut have a valid UNVA issued by university. Please go to student potral, click on “My profile” and make sure unva emial is your primary email. Since all faculty are using portal to send group emails to students registered for thieir courses, students who use Yahoo, hotmail . .etc may not receive their instructor’s email. Administrative Information: Class Duration: Apr 4 th 2011 to June 26 th 2011 Day/Time: Sunday 6:15 pm – 10:00 pm Location: Manassas Campus Manassas Campus Phone: (703) 392-0487 Annandale Campus Phone: (703) 941-0949 Instructor Contact Information: Instructor: Ramesh Rajgopalan Office Hours: E-mail: Telephone: (703) - 968-5786 eve or cell: 703-626-6742 Instructional Material: Nyhoff, R. L. (2008). ADTs, Data Structures, and Problem Solving with C++ (2nd ed.). Pearson Prentice Hall, ISBN: 0-13-140909-3. The instructor may place required articles or chapters on reserve in the library. Textbooks needed for class are in stock at the campus virtual e-campus bookstore. This bookstore can be found on UNVA’s website . Click on learning resources and then click “bookstore.” This bookstore provides an easy-to-use and inexpensive way to order textbooks on-line. Students receive substantial discounts on both text books and general books. Students also can sell used textbooks on this site. Page 1 of 8
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Course Description: The course introduces the definitions, implementations, and applications of the most commonly used data structures used in Computer Science, including the concept of abstract data types. The course emphasizes the concept of abstract data types (ADTs), object-oriented design paradigm and some of the more advanced topics such as function and class templates, inheritance and polymorphism with C++. The usual data structures, such as stacks, queues, linked lists, and trees, etc., are all covered. The relative efficiency of the algorithms studied is estimated by the informal application of these ideas. The algorithms and data structures discussed include those for sorting, searching, graph problems, dynamic programming, combinatorial search and others. (3 credit hours) Course Learning Outcome: Upon successful completion of the course, the student will be able to: Organize/structure data Design algorithms for various applications Code, document, test and debug programs Be familiar with the concept of abstract data types (ADTs) and OOD, having Reviewed basic data types provided in current programming languages. Covered data structures other than those normally provided as basic types in programming languages. Have a basic understanding of the different implementations of these data structures.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/15/2011 for the course CSCI 528 taught by Professor Rashid during the Spring '11 term at George Mason.

Page1 / 8

CSCI528_LECT_Syllabus_SP_2011 (1) - CSCI 528 Data...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online