|
FYE Learning Outcomes by Course
-
|
This course provides a survey of computing. Particular topics include Problem Solving,
Computational Thinking, Hardware, Operating Systems, Cloud Computing, Cybersecurity,
Artificial Intelligence, Data Analysis, Web Development, and provides an introduction
to programming in Python. A companion hands-on lab, CSE 1101L, is available and may
be taken independently for students seeking applied experience.
Students who successfully complete this course will be able to:
- Demonstrate an understanding of how computers work, including an overview of hardware,
logic gates, binary, and operating systems.
- Demonstrate an understanding of cloud computing, cyber security principles, basic
networking.
- Demonstrate an understanding of Data Analysis using spreadsheets, databases and data
visualization.
- Demonstrate an understanding of the basics of programming.
- Use computational thinking to ask questions and find different ways to solve problems.
|
-
|
This lab course will allow students to explore various computing fields in real world
scenarios. Topics may include Problem-solving, Computational Thinking, Hardware, Operating
Systems, Cloud Computing, Cybersecurity, Artificial Intelligence, Data Analysis, Web
Development, and provides an introduction to programming in Python. This hands-on
lab complements CSE 1101 lecture but may be taken independently; students who wish
to gain a broader understanding of computing concepts are encouraged to also take
the lecture.
Students who successfully complete this course will be able to:
- Demonstrate an understanding of how computers work, including a overview of hardware,
logic gates, binary, and operating systems.
- Demonstrate an understanding of cloud computing, cyber security principles, basic
networking.
- Demonstrate an understanding of Data Analysis using spreadsheets, databases and data
visualization.
- Demonstrate an understanding of the basics of programming.
- Use computational thinking to ask questions and find different ways to solve problems.
|
-
|
This course provides an introduction to computing with a focus on programming. Instruction
centers on an overview of programming, problem-solving, and algorithm development.
Particular topics include object-oriented design/programming, primitive data types,
arithmetic and logical operators, selection and repetition structures, interactive
user input, exception handling, using and designing basic classes, single-dimensional
data structures with searching and sorting, and arrays. Programming assignments focus
on techniques of good programming style including proper documentation. The student
is taught to efficiently design, code, and debug problem solutions and the relationship
between correct code and security.
Students who successfully complete this course will be able to:
- Apply computational methods to analyze data and solve real-world problems.
- Demonstrate the appropriate use of data types and logical, relational, and arithmetic
expressions in programs.
- Construct algorithmic solutions that incorporate selection and repetition.
- Implement collections appropriately to store and analyze data.
- Define functions and classes in program solutions.
|
-
|
Students who complete this course successfully will be able to:
- Apply computational methods to analyze data and solve real-world problems.
- Demonstrate knowledge of the syntax of a specific programming language.
- Employ IDEs and compilers to learn how to compile, debug, run and test programs.
- Demonstrate the appropriate use of data types and logical, relational, and arithmetic
expressions in programs.
- Construct algorithmic solutions that incorporate selection and repetition.
- Implement collections appropriately to store and analyze data.
- Define functions and classes in program solutions.
|
-
|
The second course in computing provides coverage of more advanced topics of object-oriented
programming. This includes the use of static variables and classes, non-linear data
structures, inheritance and polymorphism, file input/output, exception handling, recursion,
and parameterized types. Elementary data structures (linked lists, stacks, and queues)
are introduced to solve application problems. Graphical user interfaces, parallel
programming, database programming, and event-driven programming are also introduced.
Students will use good programming style including proper documentation.
Students who complete this course successfully will be able to:
- Demonstrate more advanced skills in programming, including the ability to handle multi-
dimensional arrays
- Demonstrate file handling techniques and exception code.
- Recognize the difference between iterative and recursive approaches.
- Demonstrate the ability to use linked lists, stacks, and queues in problem solving.
- Compare "program driven" and "event-driven" approaches to user interaction, including
the relationship between event-driven programs and Graphical User Interfaces
- Discuss principles of concurrency and parallelism.
|
-
|
Students who complete this course successfully will be able to:
- Demonstrate more advanced skills in programming, including the ability to handle multi-dimensional
arrays
- Design and use classes, including inherited classes
- Demonstrate file handling techniques and exception code in a program
- Recognize the difference between iterative and recursive approaches and use them correctly
in a program
- Demonstrate the ability to use linked lists, stacks, and queues in problem solutions
- Understand "program driven" and "event-driven" approaches to user interaction, including
the relationship between event-driven programs and Graphical User Interfaces
- Apply computing concepts in the domains of parallelism and databases
|
|