Fall 2022 - CMPT 125 D100
Introduction to Computing Science and Programming II (3)
Class Number: 5198
Delivery Method: In Person
Course Times + Location:
Mo 2:30 PM – 4:20 PM
AQ 3182, Burnaby
We 2:30 PM – 3:20 PM
AQ 3181, Burnaby
Exam Times + Location:
Dec 13, 2022
12:00 PM – 3:00 PM
RCB IMAGTH, Burnaby
Prerequisites:CMPT 120 or CMPT 130, with a minimum grade of C-.
A rigorous introduction to computing science and computer programming, suitable for students who already have some background in computing science and programming. Intended for students who will major in computing science or a related program. Topics include: memory management; fundamental algorithms; formally analyzing the running time of algorithms; abstract data types and elementary data structures; object-oriented programming and software design; specification and program correctness; reading and writing files; debugging tools; shell commands. Students with credit for CMPT 126, 129, 135 or CMPT 200 or higher may not take this course for further credit. Quantitative.
This course is a rigorous introduction to computing science, intended primarily for students who have already taken CMPT 120 as an introduction to algorithms and programming. Students will learn fundamental concepts of computing science, basic principles of algorithm design and software development. All case studies will be presented in C and C++. Students will also learn the basic shell commands in Linux, and will learn how to run and debug their code using VS Cod
- Brief review of elementary programming and problem solving; introduction to C.
- Basic shell commands in Linux
- Running/Debugging using Visual Studio Code
- Performance measurements; algorithm design and analysis; asymptotics; fundamental algorithms.
- Encodings of basic types: int, unsigned, float, char, pointer.
- The memory model: addresses, dynamic data types, safe initialization, safe cleanup, and safe arrays.
- Good coding style; defensive coding practices; testing.
- Recursion: simple recursion; recursion on trees; divide and conquer algorithms.
- Reasoning about programs: assertions, invariants, and correctness.
- Abstract data types; information hiding;
- Elementary data structures: stacks, queues, binary trees
Final Exam - 35% Lab Exam - 20% Midterm Exam - 20% Homework assignments - 25%
REQUIRED READING NOTES:
Your personalized Course Material list, including digital and physical textbooks, are available through the SFU Bookstore website by simply entering your Computing ID at: shop.sfu.ca/course-materials/my-personalized-course-materials.
ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS
SFU’s Academic Integrity website http://www.sfu.ca/students/academicintegrity.html is filled with information on what is meant by academic dishonesty, where you can find resources to help with your studies and the consequences of cheating. Check out the site for more information and videos that help explain the issues in plain English.
Each student is responsible for his or her conduct as it affects the university community. Academic dishonesty, in whatever form, is ultimately destructive of the values of the university. Furthermore, it is unfair and discouraging to the majority of students who pursue their studies honestly. Scholarly integrity is required of all members of the university. http://www.sfu.ca/policies/gazette/student/s10-01.html