CSC 316 Data Structures
    Syllabus    |    Video Lectures     |     Schedule     |     Logistics   

A survey of fundamental abstract data types along with efficient implementations for each. Emphasizes asymptotic running time as a measure of program performance. Lists, stacks, queues, sparse arrays, binary trees, heaps, balanced search trees, and hash tables. Illustrative applications such as graph, text-processing, or geometric algorithms. 3 credit hours.



Dr. George N. Rouskas, Professor
Computer Science-Engineering
Engineering Building II(Eb2) 3-278, Box 8206
NCSU Campus
Raleigh, NC 27695

Phone: 919-515-3860
Fax: 919-515-7896
Email: rouskas@ncsu.edu
Web Site: http://rouskas.csc.ncsu.edu/
Class Web Site: http://rouskas.csc.ncsu.edu/Courses/CSC316.html

    CSC 316 Course Website