Cooper Union: Preparing for the AP* Computer Science A Exam — Part 2
|
An introduction to how computing can be used to solve real-world problems while encouraging student computational creativity. Part 2 of 2.
About this course
CSAP.1x covers the material of AP Computer Science A which is equivalent to a first-semester, college-level course in computer science. This highly interactive course will introduce students to the fundamental concepts of computer science. The course will be structured to encourage students to think computationally and enjoy problem solving. New York City’s companies, museums, art and architecture will be used as examples to emphasize the ubiquitous role of computing and programming concepts in the world around us.
The course will delve into object- oriented problem solving and design using the Java programming language. Students will have access to practice problems that will help them learn to program without spending hours on finding and fixing syntax errors. These will include online multiple-choice questions in the style of those on the AP exam, mixed-up code that the user drags into the correct order, fill in the blank code and audio tours of the code.
Topics include problem solving, programming design strategies and data structures, algorithms, role of computation in real-world applications like smart phones, google glass and robots. This material may be used for self-study and as a preview by students and teachers considering the September 2015 offering of the course. Video lectures for this course will be available in May 2015. Ancillary material including labs will be added over the Summer of 2015. All of the course will be available September 1, 2015
This is a self-paced course – you may take CSAP.1x on your schedule.
Learn more about our High School and AP* Exam Preparation Courses
Advanced Placement and AP are registered trademarks of the College Board, which was not involved in the production of, and does not endorse, these offerings.
At a Glance:
Institution: Cooper Union
Subject: Computer Science
Level: Introductory
Prerequisites:
Algebra and basic Mathematical reasoning abilities.
Language: English
Video Transcript: English
Associated skills:Google Glass, Syntax, Creativity, Software Design Patterns, Java (Programming Language), Programming Concepts, Problem Solving, Computer Science, Algorithms, Object-Oriented Programming (OOP), Data Structures
User Reviews
Be the first to review “Cooper Union: Preparing for the AP* Computer Science A Exam — Part 2”
Related Products
MITx: Understanding the World Through Data –
Become a data explorer – learn how to leverage data and basic machine learning algorithms to understand the world.
AdelaideX: Computational Thinking and Big Data
Learn the core concepts of computational thinking and how to collect, clean and consolidate large-scale datasets.
StanfordOnline: Algorithms: Design and Analysis, Part 1
Welcome to the self paced course, Algorithms: Design and Analysis! Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience.
GTx: Data Structures & Algorithms I: ArrayLists, LinkedLists, Stacks and Queues
Work with the principles of data storage in Arrays, ArrayLists & LinkedList nodes. Understand their operations and performance with visualizations. Implement low-level linear, linked data structures with recursive methods, and explore their edge cases. Extend these structures to the Abstract Data Types, Stacks, Queues and Deques.
IsraelX: Essentials of Genomics and Biomedical Informatics
This course presents clinicians and digital health enthusiasts with an overview of the data revolution in medicine and how to exploit it for research and in the clinic. The course will not make you a bioinformatician but will introduce the main concepts, tools, algorithms, and databases in this field.
GTx: Data Structures & Algorithms IV: Pattern Matching, Dijkstra’s, MST, and Dynamic Programming Algorithms
Delve into Pattern Matching algorithms from KMP to Rabin-Karp. Tackle essential algorithms that traverse the graph data structure like Dijkstra’s Shortest Path. Study algorithms that construct a Minimum Spanning Tree (MST) from a graph. Explore Dynamic Programming algorithms. Use the course visualization tool to understand the algorithms and their performance.
There are no reviews yet.