Analysis and Comparison is ICS4U

Slides:



Advertisements
Similar presentations
Course Overview CS221 – Advanced Programming Fall 2007 : Ray S. Babcock Computer Science Department Montana State University.
Advertisements

Impact of Alternative Introductory Courses on Programming Concept Understanding Allison Elliott Tew W. Michael McCracken Mark Guzdial College of Computing.
Course Introduction CS 1037 Fundamentals of Computer Science II.
Chapter 8: Introduction to High-level Language Programming Invitation to Computer Science, C++ Version, Third Edition.
Chapter 8: Introduction to High-level Language Programming Invitation to Computer Science, C++ Version, Third Edition.
CSCA48 Course Summary.
Introduction. 2COMPSCI Computer Science Fundamentals.
ICS 102 Computer Programming University of Hail College of Computer Science & Engineering Computer Science and Software Engineering Department.
CS 46B: Introduction to Data Structures June 16 Class Meeting Department of Computer Science San Jose State University Summer 2015 Instructor: Ron Mak.
CSE8A Lecture2 Check the class web page (and discussion board, linked form webpage) for news and info: cse8a.weebly.com Lab starts this week. Discussion.
CS 206 Introduction to Computer Science II 09 / 10 / 2009 Instructor: Michael Eckmann.
ICS102: Introduction To Computing King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science.
8 Strategies for the Multiple Choice Portion of the AP Literature and Composition Exam.
1 CSC 221: Computer Programming I Spring 2008 course overview  What did we set out to learn?  What did you actually learn?  Where do you go from here?
Get out the vote! A pedagogy for engaging students in college mathematics classes Jennifer Applebee Kathleen Shay Middlesex County College Edison, New.
CS 162 Introduction to Computer Science II Winter, 2014: 60 Spring, 2014: 60 Summer, 2014: 71.
1 AP Computer Science Workshop Joe Kmoch Washington HS, Milwaukee, WI July 18, 2003.
Course Code : 15ECSC204 Object Oriented Progamming.
Searching and Sorting Searching algorithms with simple arrays
CSC 241: Introduction to Computer Science I
Greenfoot.
Programming Languages Dan Grossman 2013
AP Computer Science Principals Course Importance and Overview
OBJECT ORIENTED PROGRAMMING II GEORGE KOUTSOGIANNAKIS
Subject : Computer Science
AP Computer Science vs Introductory Class
Computer Engineering Department Islamic University of Gaza
CSC207 Fall 2016.
INTERMEDIATE PROGRAMMING WITH JAVA
CSc 020: Programming Concepts and Methodology II
Analysis of Algorithms
CSC 321: Data Structures Fall 2017
CS 116 OBJECT ORIENTED PROGRAMMING II MIDTERM EXAM INFORMATION
CSC 221: Computer Programming I Spring 2010
Recitation 13 Searching and Sorting.
Analysis of Algorithms
CSC 221: Computer Programming I Fall 2005
Warmup What is an abstract class?
CSC 321: Data Structures Fall 2015
OBJECT ORIENTED PROGRAMMING II GEORGE KOUTSOGIANNAKIS
OBJECT ORIENTED PROGRAMMING II GEORGE KOUTSOGIANNAKIS
Object-Oriented Programming
Week 15 – Monday CS221.
AP Computer Science Principals Course Importance and Overview
Algorithm Analysis CSE 2011 Winter September 2018.
September 27 – Course introductions; Adts; Stacks and Queues
Data Structures (CS212D) Overview & Review.
Building Java Programs
EECE 310 Software Engineering
CS 201 Fundamental Structures of Computer Science
Introduction to Computer Science for Majors II
CS 1428 Final Exam Review.
Analysis of Algorithms
Algorithms Key Revision Points.
Building Java Programs
Review CSE116 2/21/2019 B.Ramamurthy.
CS 1428 Final Exam Review.
Review B.Ramamurthy 4/6/2019 BR.
AP Computer Science Principals Course Importance and Overview
Midterm Review CSE116A,B.
CSC 143 Java Trees.
ICS201 Introduction To Computing II
CSC 321: Data Structures Fall 2018
Course Overview CS221 – Advanced Programming
CS114B Introduction to Computer Science II
CSCE156: Introduction to Computer Science II
Computer Engineering Department Islamic University of Gaza
Design and Analysis of Algorithms (04 Credits / 4 hours per week)
Analysis of Algorithms
Presentation transcript:

Analysis and Comparison is ICS4U AP Computer Science A Analysis and Comparison is ICS4U

Advanced Placement (AP CS A Exam) https://apstudent.collegeboard.org/apcourse/ap-computer-science-a Focus is on Java language not generic CS topics Content Section 1 - 40 MC questions 1 Hour and 15 minutes Section 2 - 4 free-response questions 1 Hour and 45 minutes Most content covered is already in ICS4U curriculum Note: New AP CS Principles course has been approved but not yet offered

AP CS Principles (coming soon) https://apstudent.collegeboard.org/apcourse/ap-computer-science-principles Various Languages can be used to teach concepts

AP Topics Java Basics Object Oriented Concepts Doesn't test any I/O ( GUI or Files ) Object Oriented Concepts Encapsulation, Polymorphism, Inheritance Interfaces, abstract classes, simple UML

AP Topics Data Structures I Data Structures II 1 dimensional arrays ArrayLists Data Structures II 2 dimensional arrays Traversals including for-each (iterator) techniques

AP Topics Searching and Sorting Sorts Searching Selection, Insertion, Merge Sort Searching Linear, Binary Recursive algorithms and simple analysis of algorithms

AP Resources Test Structure and Content was revised in 2015 Removed case study and includes sample student labs Labs Magpie (basics) Elevens (OO design card game) Picture Lab (2 dimensional array processing)

AP Resources Textbooks Java Methods, Gary and Maria Litvin Building Java Programs: A Back to Basics Approach, 3rd edition, Stuart Reges and Marty Stepp A Guide to Programming in Java, 3rd edition, Jan Marelli

Peer Instruction (PI) - Pedagogy Started by Eric Mazur (Physics Professor at Harvard) Overview of Technique Computer Science Educators are being successful using same technique http://www.peerinstruction4cs.org/

Peer Instruction (PI) Show a Multiple Choice questions at beginning of class Students answer individually (Google Form or clicker) Students discuss with others Students re-answer after discussion with others

Assignment and equals operators SOLO VOTE (30 secs) Discuss in team (1 min) GROUP VOTE (20 sec) Assignment and equals operators What is the output of this code? A) 3 5 C) 3 false int x = 3; int y = 2; System.out.println(x = 3); int z = x + y; System.out.println(z); B) true 5 D) true false Big Idea: The idea of = being a right to left “assignment” is hard – that it doesn’t reach back in time to affect other values (rather than a traditional sort of mathematical interpretation of assignment. Also the issue of == producing a boolean value. Correct Answer and Why: B The first print is the result of a boolean expression evaluation using == -> resulting in true. The second print 5 since the previous statement adds 3 + 2 and puts the value 5 into z. Using a Tablet PC or iPad, I draw arrows showing the right to left “movement” or assignment patterns. Incorrect Answers and Why: If students don’t understand or ignore the == part, or didn’t read about booleans they figure 3 is the closest reasonable answer C) Not a very reasonable choice (maybe a better distractor could be used) – though you could ask what prints statement could be written to create this D) Not a very reasonable choice (maybe a better distractor could be used) – though you could ask what prints statement could be written to create this

AP Resources Textbook and Practice Material Time to do some practice Barron's AP Computer Science A, 7th edition, Roselyn Teukolsky Time to do some practice barronsbooks.com/AP/compsci/ap_computer_science.html