CSC 3102 Chapter : CSC 3102 Spring 2017 Syllabus
Document Summary
Section 1: tth 1:30 p. m. - 2:50 p. m. class webpage:http://www. csc. lsu. edu/ duncan/courses/csc3102-s17. Description and utilization of formal abstract data type representations, es- pecially of sequences, trees and graphs. Time and space analysis of recursive and non-recursive algorithms. Sorting algorithms, graph algorithms and al- gorithm design techniques. Supplementary reading: data structures and algorithm analysis in c++ 4/e, Mark allen weiss (isbn:978-0132847377: data structures and algorithm analysis in java 3/e, Csc 1254 or csc 1351 and credit or concurrent enrollment in csc 2259 or. To explore formal methods of analyzing algorithms and data structures so that students can make appropriate choices when designing programs. Grading will be based on homework assignments, programming projects and exams. Final grade will be determined by overall average as follows: Table 1: percentage score to letter grade assignment. Class policies: attendance: there will be no make-up for missed work. A grade of 0 is awarded for missed work in the absence of a valid excuse.
