<p>As a current EECS freshman planning out my spring schedule I'm wondering, should I use my AP credit to skip CS61B and just go to CS61CL? I got a 5 on the AP CS AB exam but it was in my junior year and I'm not sure if I remember everything. Furthermore doesn't 61B cover more / more complex concepts than the AP class?</p>
<p>Same situation as you, but I chose NOT to skip 61B. I ended up learning a lot from the class that I didn't know about in high school, especially the efficient use of different data structures.</p>
<p>One thing that was special about my situation: I was at a high school where the CS program didn't teach anything about data structures at all, i.e. Computer Science A only. I was the only one in my high school who took the AB exam. I got a 5 only because I taught myself data structures from a textbook in a week, but that couldn't be compared with the depth of knowledge obtained in a semester of a college level class in 61B.</p>
<p>well we did learn data structures.. trees, hash tables ( a bit), and so on
so it wasn't really like your situation. however my faculty adviser today told me i should just take 61CL. :/</p>
<p>it also slows me down in that i won't be able to practically take an EE class until second semester of sophomore year, and i need to take cs70 in first semester of soph year. what i'm hoping will happen is as follows.. </p>
<p>cs61b with Hilfinger is not a grade booster. Not to anyone. You might have taken AP CS AB, but that's like getting a five meter head start climbing up Everest.</p>
<p>wow, I am also the only one in my high school (over 2500 people) who took cs ap ab. I am thinking about skip to cs61cl and maybe took sometime to watch the webcasts for cs61b. Is CS61CL really hard? My TA and lab assistants are taking it right now, and they said it's manageable compare to cs61a.</p>
<p>I never said it was hard. What I meant was that the quality of instruction in the non-L version of C is much greater. Watch some Garcia lectures and compare those to the CL lectures.</p>
<p>are the data structures and basic algorithms you talked about covered in ap cs ab?
ap cs ab covers:
D. Two-dimensional arrays
E. Linked lists (singly, doubly,
circular)
F. Stacks
G. Queues
H. Trees
I. Heaps
J. Priority queues
K. Sets
L. Maps
1. Traversals
2. Insertions
3. Deletions
4. Iterators
3. Hashing
4. Quicksort
5. Heapsort</p>
<p>I remember doing maps, sets, heaps, priority queues, hashing, etc., but I don't recall how they work. >_< At all. I guess I should be taking 61b in the spring.. better safe than sorry, right?</p>