Computer Science 1254
Develops solutions to problems using an object-oriented approach and emphasizes the concepts of recursion; dynamic memory allocation; data structures (lists, stacks, queues, trees); exception handling.
CSC 1253; credit or registration in MATH 1550. Credit will not be given for both this course and CSC 1351.
Lectures - Section 1: TTH 12:00
- 1:20 pm 0221 Tureaud Hall
Instructor
William E. Duncan
homepage: http://www.csc.lsu.edu/~duncan
1. Required: STARTING OUT WITH C++ From Control Structures through Objects 9/e, Tony Gaddis (ISBN: 9780134498379)
2. Recommended: C++: The Complete Reference, Herbert Schildt (ISBN: 0072226803)
To introduce students to some fundamental data structures, Abstract Data Types and searching and sorting algorithms. By the end of this course students will be able to:
Grading will be based on programming assignments and exams.
Programming Assignments 25%
Exam 1 25%
Exam 2 25%
Final Exam 25%