120 likes | 137 Views
This course covers advanced concepts in computer science using the C++ programming language. Topics include objects, iteration and recursion, flow of control, functions, classes, vectors, arrays, pointers, dynamic memory allocation, containers, templates, data structures, linked lists, stacks, trees, searching, sorting, and graphs.
E N D
CAS CS113Intro to CS II w/Intensive C++ Data Structures in C++
General info • Instructor: • Gene Itkis (itkis@bu.edu) • TF: • Rob Pitts (rip@cs.bu.edu) • Course page: • www.cs.bu.edu/faculty/itkis/cs113 • Also found from the CS dept. courses page Gene Itkis, CS113
Prerequisites • Programming proficiency in C, Pascal, Fortran, or other high-level language(HTML does not count!) • Otherwise, consider transferring to CS111. • If you have taken CS111, consider change to CS112 • UNIX background • Some will be provided in the labs; see also tutorials in IT Gene Itkis, CS113
Warning: Fast Pace CS113 CS111 + CS112 • Thus it is very fast pace • Expect (plan for!!!) heavy workload • Challenging but rewarding Gene Itkis, CS113
Info sources • WEB page www.cs.bu.edu/faculty/itkis/cs113 • Lab sections • Office hours, email –last resort, please (there are ~100 of you, 2 of us) Gene Itkis, CS113
Collaboration NO!!! • Discussing concepts and ideas, as well as system features is OK • Always give credit when using someone else’s work • See web page for more details Gene Itkis, CS113
Credits • Course web page borrows very heavily from Prof. Sclaroff’s Spring’00 course • I made active use of the CS113 materials from the previous years (taught by Professors Sclaroff and Homer) Gene Itkis, CS113
Grading • TBD??? Gene Itkis, CS113
Course contents • Objects,C++ • Iteration & Recursion; Flow of control; Functions • Classes; vectors, arrays, pointers • Dynamic memory allocation; containers; templates • Data structures • Linked-lists • Stacks • Trees • Searching & sorting • Graphs Gene Itkis, CS113
Questions? End of Administrativia