OFFICIAL 2012 AP Computer Science A Thread

<p>Let's start studying :)</p>

<p>Why do you think Princeton has no review book?</p>

<p>It’s not that popular. According to the 2010 score distributions, 20,000 people took the exam. I bet the least-taken subject that Princeton covers is Physics C, but that includes 2 exams which total to over 40,000 exam takers per year. Barron’s will suffice :D</p>

<p>Get Litvin’s Be Prepared for the Computer Science Exam in Java. That + Barrons brought me to a 5.</p>

<p>I hear that Barrons and the Stanford lectures are enough.</p>

<p>Stanford lectures are starting to talk about graphics…and no graphics at all on the actual exam…I think I will just learn it anyways, there isn’t TOO much stuff.</p>

<p>thoughts?</p>

<p>^Just learn it for the extra knowledge. It won’t kill you and there’s no rush. Plus, the guy is an excellent teacher and I look forward to the lectures more because of him. Makes me want to go to Stanford :)</p>

<p>Yup, same here. Great teacher.</p>

<p>too bad my public high school’s teachers are BAD.</p>

<p>around when does the stanford lectures become irrelevant?</p>

<p>What are these Stanford lectures that everyone’s talking about?</p>

<p>What are the Stanford lectures? Are they useful?</p>

<p>[Stanford</a> School of Engineering - Stanford Engineering Everywhere](<a href=“http://see.stanford.edu/see/courses.aspx]Stanford”>http://see.stanford.edu/see/courses.aspx)
These are the Stanford Lectures for Engineering. Go to Programming Methodology for the lectures apropos to the AP Computer Science A exam, as CS 106A covers Java. I very much agree that Dr. Mehran Sahami is extremely awesome, but does deviate from the AP around Lecture 20, with some lectures in between that discuss graphics, which are not on the AP. Overall, great study tool.</p>

<p>I posted in the self-study APCS thread as well, so just going to link to my post here
<a href=“http://talk.collegeconfidential.com/13251264-post113.html[/url]”>http://talk.collegeconfidential.com/13251264-post113.html&lt;/a&gt;&lt;/p&gt;

<p>I already have tons of programming experience and am just taking the class for credits, but my teacher has worked at JPL for around 15 years so he knows his stuff. We also get a folder full of PowerPoints talking about Java and labs that we have to do to practice everything. It’s all there.</p>

<p>wow thinking about self-studying this course, too!! just for the knowledge :D</p>

<p>I’m starting tomorrow…I heard Barron’s is good for Comp Sci–any others?</p>

<p>Hey guys, do all think you’re prepared for the exam on Tuesday? I studied independently for this one, and I think that I can easily get a 4, maybe even a 5 (although I somewhat doubt I will). One question, do you guy think that this year’s AP CS exam is going to contain a free response question dealing with recursion (like the one program “eraseblob”)? According to Barron’s, a FR question dealing with recursion crops now and then, but when I was looking through the past FR released questions, for the past 3 or 4 years, none of the FR questions involved recursion. Do you guys think that it could crop up on the 2012 exam? Also, do you think I should even worry about it? </p>

<p>Also, it’s AP cram time for me. Good thing that AP CS is the only AP exam I have this year (I’m a sophomore). How many are you guys taking in addition to AP CS?</p>

<p>I have 7 exams this year, but the only one im really stressing over is comp sci because my college wont take credit for anything less than a 5. I feel like im right on the edge of 4/5, and ive been studying all day. Is barrons harder for comp sci like it is for many other subjects? like a 33/40 on barrons MC translates to what on actual AP?</p>

<p>In my class we’ve done pretty much every FRQ from collegeboard in the last maybe 5 years and there’s been no recursion questions, plus I haven’t seen any in review books (for FRQs). I doubt there really would be a recursion question on the test because of that but who knows.</p>

<p>On the released 2009 exam there was maybe only 1 or 2 questions on recursion and they were fairly simple. Keep in mind on the 2008 practice test there was one that was something like this:</p>

<p>return(methodname((methodname()));</p>

<p>So it wanted you to use recursion 2x. I missed that question because I didn’t notice that but make sure to keep an eye on that.</p>

<p>I’m a sophomore also and I’m doing this one as well as psychology which is a joke, haha. Pretty sure I’m going to get 2 5’s unless there’s some really hard FRQs on the tests.</p>

<p>PS check out this website for your score if you haven’t seen this already. – [AP</a> Pass - AP Computer Science Calculator](<a href=“http://appass.com/calculators/computerscience]AP”>AP Computer Science Test Score Calculator - AP Pass)</p>

<p>I’m taking five tests this year, my teacher told us that for Comp Sci A, we only need to know how to read/interpret recursion codes. collegeboard is not requiring us to know how to write recursions. so it won’t show up on FRQ</p>