CSE 10001 Principles of Computing is an introductory Computer Science and Engineering course that explores computer science by examining the questions of what is computing, how do we compute, how do different aspects of modern computing technology work, and how does computing impact the individual and society. In addition to studying how modern computing hardware, software, and communications function, students will also utilize scripting languages to explore and practice foundational programming concepts such as syntax, variables, conditional execution, iteration, functions, data structures, and algorithms.
Upon successful completion of this course, students will be able to:
Identify the main hardware components of a modern computer system, describe how digital information is stored and manipulated, and explain how a CPU functions.
Perform basic algorithms, distinguish between different types of programming languages, and describe what abstractions operating systems provide.
Understand basic networking concepts, describe how the Internet and World Wide Web work, compose a basic website, and discuss the various social and ethical issues surrounding information sharing and privacy.
Employ common programming patterns and abstractions, choose appropriate data structures, trace the execution of programming code, and construct Python code to solve problems and automate processes in different domains and disciplines.
Unit | Date | Topics | Assignment |
---|---|---|---|
Hardware | |||
Inside a Computer | 01/16 | Introduction, Hardware Slides Slides | Reading 00 |
01/18 | Programming Slides Notebook | Lab 00 | |
Information Representation | 01/21 | Data Representation Slides Notebook | Reading 01 |
01/23 | Variables, Expressions, Functions Slides Notebook | ||
01/25 | Functions, RGB Colors Notebook | Lab 01 | |
CPU, Conditional Execution | 01/28 | CPU Slides Notebook | Reading 02 |
01/30 | Conditional Execution Slides | ||
02/01 | Letter Grade, Stadium Seating Notebook | Lab 02 | |
Software | |||
Iteration, Lists | 02/04 | Iteration Slides Notebook | Reading 03 |
02/06 | Lists Slides Notebook | ||
02/08 | Fizz Buzz Boom, Palindromes Notebook | Lab 03 | |
Algorithms | 02/11 | Algorithms Slides Notebook | Reading 04 |
02/13 | Strings Slides Notebook | ||
02/15 | Duplicates Notebook | Lab 04 | |
Data Structures | 02/18 | File I/O Slides Notebook | Reading 05 |
02/20 | Dicts Slides Notebook | ||
02/22 | Spell Check Notebook | Lab 05 | |
Software Systems | 02/25 | Operating Systems Slides | Reading 06 |
02/27 | Images Slides Notebook | ||
03/01 | Image Filters | Lab 06 | |
Midterm | 03/04 | Intellectual Property | Reading 07 |
03/06 | Review Notebook | ||
03/08 | Checklist Midterm | ||
Spring Break | |||
Communications | |||
Networking | 03/18 | The Internet Slides | Reading 08 |
03/20 | Networks Notebook | ||
03/22 | Bandwidth and Latency | Lab 07 | |
Web Programming | 03/25 | HTTP, HTML, CSS Slides | Reading 09 |
03/27 | Static Pages | ||
03/29 | Static Website | Lab 08 | |
04/01 | Tornado Slides | Reading 10 | |
04/03 | Forms | ||
04/05 | Guest Book | Lab 09 | |
Data & Information | 04/08 | Cloud Computing Slides | Reading 11 |
04/10 | Advertising | ||
04/12 | Privacy | Lab 10 | |
Privacy & Security | 04/15 | Privacy Slides | Reading 12 |
04/17 | Cryptography | ||
04/19 | Easter | ||
04/22 | Easter | ||
04/24 | Password Cracking | ||
04/26 | Password Cracking | Lab 11 | |
Wrapping Up | 04/29 | Closing Time | |
05/01 | No Class | ||
05/03 | Reading Day | ||
Final | 05/06 | Checklist Final |
Component | Points |
---|---|
Readings Weekly reading assignments. | 12 × 4 |
Labs Weekly lab assignments. | 12 × 12 |
Exams Midterm and Final Exams. | 40 + 60 |
Participation Regular class attendation and contribution to course community. | 8 |
Total | 300 |
Grade | Points | Grade | Points | Grade | Points |
---|---|---|---|---|---|
A | 280-300 | A- | 270-279 | ||
B+ | 260-269 | B | 250-259 | B- | 240-249 |
C+ | 230-239 | C | 220-229 | C- | 210-219 |
D | 195-209 | F | 0-194 |
All Readings and Labs are to be submitted to the appropriate Google Form. Unless specified otherwise:
Students are expected to attend and contribute regularly in class. This means answering questions in class, participating in discussions, and helping other students.
Foreseeable absences should be discussed with the instructor ahead of time.
Any student who has a documented disability and is registered with Disability Services should speak with the professor as soon as possible regarding accommodations. Students who are not registered should contact the Office of Disabilities.
Any academic misconduct in this course is considered a serious offense, and the strongest possible academic penalties will be pursued for such behavior. Students may discuss high-level ideas with other students, but at the time of implementation (i.e. programming), each person must do his/her own work. Use of the Internet as a reference is allowed but directly copying code or other information is cheating. It is cheating to copy, to allow another person to copy, all or part of an exam or a assignment, or to fake program output. It is also a violation of the Undergraduate Academic Code of Honor to observe and then fail to report academic dishonesty. You are responsible for the security and integrity of your own work.
In the case of a serious illness or other excused absence, as defined by university policies, coursework submissions will be accepted late by the same number of days as the excused absence.
Otherwise, there is a penalty of 25% per day late (except where noted). You may submit some parts of an assignment on time and some parts late. Each submission must clearly state which parts it contains; no part can be submitted more than once.
This course will be recorded using Panopto. This system allows us to automatically record and distribute lectures to you in a secure environment. You can watch these recordings on your computer, tablet, or smartphone. In the course in Sakai, look for the "Panopto" tool on the left hand side of the course.
Because we will be recording in the classroom, your questions and comments may be recorded. Recordings typically only capture the front of the classroom, but if you have any concerns about your voice or image being recorded please speak to me to discuss your concerns. Except for faculty and staff who require access, no content will be shared with individuals outside of your course without your permission.
These recordings are jointly copyrighted by the University of Notre Dame and your instructor. Posting them to other websites (including YouTube, Facebook, SnapChat, etc.) or elsewhere without express, written permission may result in disciplinary action and possible civil prosecution.
For the assignments in this class, you may discuss with other students and consult printed and online resources. You may quote from books and online sources as long as you cite them properly. However, you may not look at another student's solution, and you may not look at solutions.
The following table summarizes how you may work with other students and use print/online sources:
Resources | Solutions | |
---|---|---|
Consulting | Allowed | Not Allowed |
Copying | Cite | Not Allowed |
See the CSE Guide to the Honor Code for definitions of the above terms.
If an instructor sees behavior that is, in his judgment, academically dishonest, he is required to file either an Honor Code Violation Report or a formal report to the College of Engineering Honesty Committee.