Difference between revisions of "CS 1301"
m (Zxcv moved page CS 1301 - Intro to Computing to CS 1301 without leaving a redirect) |
|||
(7 intermediate revisions by 3 users not shown) | |||
Line 1: | Line 1: | ||
+ | {{DISPLAYTITLE:CS 1301 - Introduction to Computing}} |
||
⚫ | |||
⚫ | '''CS 1301''', formally known as '''Introduction to Computing''', is an introductory 3 credit hour [[Computer Science|CS]] class aimed at people with zero or near-zero programming experience, and provides a gentle introduction to Python programming, with the context of using Python in non-computing contexts. CS 1301 is taken by nearly all majors. |
||
+ | ==Workload== |
||
⚫ | |||
+ | {{Collapsed| |
||
− | |||
− | == |
+ | ==Topics List== |
+ | | |
||
− | ===Topics Covered=== |
||
As of Spring 2021, the topics covered in the class were: |
As of Spring 2021, the topics covered in the class were: |
||
#Introduction to Programming |
#Introduction to Programming |
||
+ | ##What is Programming? |
||
⚫ | |||
+ | ##How Programs are Run |
||
+ | ##Types of Errors |
||
⚫ | |||
+ | ##Styles of Programming |
||
#Variables and Data Types |
#Variables and Data Types |
||
+ | ##Variables |
||
+ | ##Expressions |
||
+ | ##Statements |
||
+ | ##Primitive Data Types |
||
#Operators |
#Operators |
||
+ | ##Relational Operators |
||
+ | ##Mathematical Operators |
||
+ | ##Logical Operators |
||
#Conditionals, Loops, and Control Flow |
#Conditionals, Loops, and Control Flow |
||
+ | ##What are Control Structures? |
||
+ | ##If/Else Statements |
||
+ | ##For/While Loops |
||
#Error Handling |
#Error Handling |
||
+ | ##Exceptions |
||
+ | ##Writing Exceptions |
||
#Functions |
#Functions |
||
+ | ##What are Functions? |
||
+ | ##Writing Functions |
||
+ | ##Built-In Functions |
||
#Strings, Lists, and Dictionaries |
#Strings, Lists, and Dictionaries |
||
+ | ##Strings |
||
+ | ##Lists |
||
+ | ##Dictionaries |
||
+ | ##Compound Structures |
||
#File I/O |
#File I/O |
||
+ | ##File Reading |
||
+ | ##File Writing |
||
#Objects |
#Objects |
||
+ | ##Built-In Objects |
||
+ | ##Creating Data Types |
||
+ | ##Objects and Classes |
||
+ | ##Using Objects |
||
#Sorting |
#Sorting |
||
+ | ##Linear Search |
||
− | ===How It Fits Into the Curriculum=== |
||
+ | ##Binary Search |
||
− | CS 1301 (or its variations) is required by nearly all majors at Georgia Tech, as a part of its Core/General Education Requirements. Thus, every major must take some version of this class. For CS, [[Computer Engineering|CompE]], [[Computational Media|CM]], and [[Mathematics|Math]] majors, it also serves as the prerequisite for [[CS 1331]], the second core CS class. |
||
+ | ##Bubble Sort |
||
+ | ##Insertion Sort |
||
+ | ##Merge Sort |
||
+ | ##A Brief Introduction to Big-O Notation |
||
+ | }} |
||
+ | |||
+ | ==Prerequisite Knowledge== |
||
+ | Since this class is built for beginners, no prerequisite knowledge, other than basic algebra, is required! |
||
+ | |||
+ | == Future Outlook == |
||
+ | For CS, CompE, EE, and Math majors with the Discrete Math concentration, CS 1301 is probably the most important class to complete, as it essentially unlocks the rest of the degree. Therefore, it is extremely critical that this class is completed as early as possible. Classes that directly require CS 1301 are: [[CS 1331]] (Introduction to OOP), [[CS 4400]] (Introduction to Databases), and [[ECE 2020]] (Digital System Design). |
||
+ | |||
==Registration Info== |
==Registration Info== |
||
CS 1301 is not a [[Glossary#Linked Course|linked course]], but does have an optional [[Glossary#Recitation|recitation]] section (under the label CS 1301R). |
CS 1301 is not a [[Glossary#Linked Course|linked course]], but does have an optional [[Glossary#Recitation|recitation]] section (under the label CS 1301R). |
||
Line 28: | Line 72: | ||
To get AP or IB credit for this class, you must earn at least one of the following: |
To get AP or IB credit for this class, you must earn at least one of the following: |
||
*A 4 or higher on the AP Computer Science A exam |
*A 4 or higher on the AP Computer Science A exam |
||
− | *A 5 or higher on the IB Computer Science |
+ | *A 5 or higher on the IB Computer Science HL exam |
+ | |||
⚫ | |||
+ | == Resources == |
Latest revision as of 05:21, 20 August 2023
CS 1301, formally known as Introduction to Computing, is an introductory 3 credit hour CS class aimed at people with zero or near-zero programming experience, and provides a gentle introduction to Python programming, with the context of using Python in non-computing contexts. CS 1301 is taken by nearly all majors.
Workload[edit | edit source]
Topics List
As of Spring 2021, the topics covered in the class were:
- Introduction to Programming
- What is Programming?
- How Programs are Run
- Types of Errors
- Methods of Debugging
- Styles of Programming
- Variables and Data Types
- Variables
- Expressions
- Statements
- Primitive Data Types
- Operators
- Relational Operators
- Mathematical Operators
- Logical Operators
- Conditionals, Loops, and Control Flow
- What are Control Structures?
- If/Else Statements
- For/While Loops
- Error Handling
- Exceptions
- Writing Exceptions
- Functions
- What are Functions?
- Writing Functions
- Built-In Functions
- Strings, Lists, and Dictionaries
- Strings
- Lists
- Dictionaries
- Compound Structures
- File I/O
- File Reading
- File Writing
- Objects
- Built-In Objects
- Creating Data Types
- Objects and Classes
- Using Objects
- Sorting
- Linear Search
- Binary Search
- Bubble Sort
- Insertion Sort
- Merge Sort
- A Brief Introduction to Big-O Notation
Prerequisite Knowledge[edit | edit source]
Since this class is built for beginners, no prerequisite knowledge, other than basic algebra, is required!
Future Outlook[edit | edit source]
For CS, CompE, EE, and Math majors with the Discrete Math concentration, CS 1301 is probably the most important class to complete, as it essentially unlocks the rest of the degree. Therefore, it is extremely critical that this class is completed as early as possible. Classes that directly require CS 1301 are: CS 1331 (Introduction to OOP), CS 4400 (Introduction to Databases), and ECE 2020 (Digital System Design).
Registration Info[edit | edit source]
CS 1301 is not a linked course, but does have an optional recitation section (under the label CS 1301R).
When registering for this course, you must register for a lecture section (the ones marked by a single letter: A, B, C) under CS 1301. If you decide to take a recitation section as well, you must register for a section under CS 1301R that corresponds to the same lecture section letter that you picked. For example, if you registered for Section B lecture, you must register for a recitation section that starts with B (e.g. B01, B04, etc.).
Prerequisites[edit | edit source]
None
AP/IB Credit[edit | edit source]
To get AP or IB credit for this class, you must earn at least one of the following:
- A 4 or higher on the AP Computer Science A exam
- A 5 or higher on the IB Computer Science HL exam