Compsci 170 Introduction to Computer Science Fundamentals

Compsci 170 is an introductory course that covers the fundamental concepts of computer science. This course is designed to provide a solid foundation in programming, algorithms, and data structures.

In Compsci 170, students learn to program in a high-level language, such as Python, and are introduced to basic programming concepts like variables, data types, and control structures. Students also learn to write algorithms to solve problems and understand the time and space complexity of these algorithms.

The course covers various topics, including object-oriented programming, recursion, and sorting algorithms. Students learn to analyze and solve problems using logical thinking and problem-solving skills.

Compsci 170 is a 4-unit course that meets for 3 hours per week, with a lab component that meets for 1 hour per week.

The course covers the basics of programming with Python, including data types, control structures, functions, and object-oriented programming.

You'll be expected to write and submit code for most assignments, with a focus on problem-solving and algorithmic thinking.

The course also covers data structures, including lists, stacks, and queues, which are essential for any programming career.

Each assignment is due on a specific date, and late submissions will incur a penalty of 10% per day.

You'll have the opportunity to work on a final project that applies the concepts learned throughout the course to a real-world problem or scenario.

The course is designed to be taken concurrently with a companion course, Compsci 171, which covers more advanced topics in computer science.

The recommended textbook for Compsci 170 is "Introduction to Algorithms" by Thomas H. Cormen, which covers the basics of algorithms and data structures.

This textbook is a comprehensive resource that provides a clear and concise introduction to the fundamental concepts of computer science.

The course also uses online resources such as MIT OpenCourseWare, which offers lecture notes, assignments, and exams from previous semesters.

These online resources can be a valuable supplement to the textbook, providing additional practice problems and examples to help reinforce your understanding of the material.

In addition to the textbook and online resources, the course also recommends several other books and online resources, including "The Algorithm Design Manual" by Steven S. Skiena.

These additional resources can provide further insight and practice problems to help you master the concepts covered in the course.

We encourage collaboration in Compsci 170, but with clear boundaries. You can discuss assignments with your peers, but never read or possess another student's solution or partial solution.

You're responsible for producing original work, and it's your job to ensure your submissions are clearly your own. If you receive a significant idea from someone, give credit where credit is due.

The following activities are strictly forbidden in graded coursework:

Don't fall behind and panic – ask for help early if you're struggling. The other students in the class are likely facing similar challenges.

To be successful in this course, you need to have a solid foundation in certain areas. You should be comfortable with mathematical induction.

You'll also need to have a good grasp of big-O notation, sorting algorithms, basic data structures, and binary heaps. If you're a transfer student and didn't get a thorough understanding of binary heaps, you should read Chapter 7 of Cormen, Leiserson, and Rivest.

Prior knowledge of C or C++ is also required, as you'll be using one of these languages for a project in the course. If you're not familiar with C or C++, you'll need to get up to speed quickly.

Familiarity with the Unix operating system and basic tools is also important. You can learn more about Unix by checking out the CSUA Web pages or attending help sessions taught by student groups.

Collaboration and Cheating Policy is a crucial aspect of academic integrity. We encourage you to discuss the work with your peers before doing each assignment, but make sure to write your homework strictly by yourself.

You should never read another student's solution or partial solution, nor have it in your possession, either electronically or on paper. This includes handwritten, printed, or electronic solutions.

If you receive a significant idea from someone in the class, it's essential to explicitly acknowledge that person in your solution. This is a good scholarly conduct and protects you from accusations of theft.

Here are the activities that are specifically forbidden in all graded course work:

It's essential to remember that nobody starts the semester with the intention of cheating. Students who cheat often do so because they fall behind and panic. Don't be afraid to ask for help if you're struggling – it's better to deal with your misunderstanding early than to deal with the consequences later.

In Compsci 170, you'll have the opportunity to work on assignments that help you develop problem-solving skills and apply theoretical concepts to real-world problems.

The course has a mix of individual and group assignments, with some requiring you to work on coding projects and others focusing on written reports.

You can expect to work on 4-5 assignments throughout the course, each with a unique focus and set of requirements.

Each assignment is designed to help you build on the skills and knowledge you gain from the lectures and readings.

One of the key evaluation criteria is your ability to write clear and concise code, with comments that explain your thought process.

Your code will be reviewed for efficiency, readability, and adherence to best practices.

You'll also be graded on your ability to analyze problems and come up with creative solutions.

The final project is a comprehensive assignment that requires you to apply all the skills and knowledge you've gained throughout the course.

It's a great opportunity to showcase your abilities and demonstrate your understanding of the course material.