CIS Logo SVC Logo

   Computing & Information Systems
   Department

 

Schoology Facebook        Search CIS Site      Tutorials

CS 111 Home Page



C++ Programming II



Fall 2017

This course continues the study of programming and problem solving where CS 110 left off. More advanced programming techniques and stricter programming style will be put into practice while covering more advanced data structures and algorithms, such as arrays, strings, file processing, stacks, queues, linked lists, classes, class definition, and recursion.

Further Information

Help is Available

  • The CIS Department Tutoring/Lab Schedule shows when the lab is available, when the tutors are on duty, and which tutors can assist with this course.
  • The Collaborative Learning Program (CLP) is offering sessions for CS 111 students this semester. This is a great opportunity to learn with fellow students in sessions run by a student. No pressure from professors! Each week these sessions will be held on Monday, 7:30 - 8:30 pm in E106 (east wing of Dupre). These sessions will be facilitated by student Christian Estok. See our syllabus for how attending can boost your grade.
  • See Br. David's schedule for office hours, other times he might be available, etc.

Note on Flu

Because of the possibility of the flu affecting us on campus, please practice good hand washing, etc. If a doctor will prescribe Tamiflu or similar for you, it is said that it reduces the length and the severity of the flu. If you get the flu, please notify me by phone or e-mail and stay home for 24 hours after the symptoms are over. Check with me about what you miss. You will not be penalized for missing class in this situtation. It is better to stay away from class and not spread the flu when you are ill.

Homework, Labs, and Announcements

Exams

  • First Exam:
    • Fri, Oct 6
    • Closed book, closed notes, pencil and paper exam.
    • However, you are to bring one page of notes, 8.5" by 11", to the exam. Put on this sheet any important items that you think you might not remember.
    • You may use a calculator on the exam. Phones, computers, and other electronic devices cannot be used.
    • Covers CS 110 review material, software engineering, arrays, sorting and searching, pointers, text files, functions and parameters, and strings. Structures will not be on this exam.
    • See your review packet, homework, and labs for a good idea of types of questions that you might have on this exam.
  • Second Exam:
    • Mon, Nov 6
    • Closed book, closed notes exam.
    • You may (and definitely should) bring one page of notes, 8.5" by 11", to the exam. Put on this sheet any important items that you think you might not remember. I strongly suggest a small, but complete class with constructors, overloaded operators, etc. Have the class definition, the code for the class functions, and a small test program that uses the class functions.
    • You may use a calculator on the exam. Phones, computers, and other electronic devices cannot be used.
    • Covers especially pointers, dynamic memory allocation, text and binary files, structures, classes, arrays of structures, arrays of objects, copy constructors, overloaded operators (including the assignment operator), and destructors. To some extent, earlier topics have to be included to deal with these new areas. Linked lists will not be on this exam.
    • See your review packet, homework, and labs for a good idea of types of questions that you might have on this exam.
  • Final Exam:
    • Tue, Dec 12, 4:00 pm - 6:00 pm
    • Closed book, closed notes exam.
    • You may (and definitely should) bring two pages of notes, examples, or whatever you want, 8.5" by 11", to the exam. Put on these sheets any important items that you think you might not remember. I strongly suggest a small, but complete example of a class, the class functions, and the use of these functions as one of the items.
    • You may use a calculator on the exam. Phones, computers, and other electronic devices cannot be used.
    • Although this is a cumulative exam, it will concentrate more on the items studied since the second exam. Thus you should expect to see mostly questions about linked lists, stacks, queues, inheritance, recursion, the ACM code of ethics, and secure versus insecure programming. There will be some questions about the more important items among the older topics. Classes and object-oriented programming provide one good example of such a topic.
    • See your review packet, homework, and labs for a good idea of the types of questions that you might have on this exam.

Instructor: Br. David Carlson



Maintained by: Br. David Carlson
Last updated: December 05, 2017
Disclaimer