Thursdays 6-8pm [Mingo Sanchez], 7-9pm [Clara Hunnewell]<\/li>\n<\/ul>\nAll study groups are in\u00a0Searles 224.<\/p>\n
Labs and Homework<\/h2>\n
The lab time is dedicated to \u00a0practice problems, and sometimes to finishing some of the details from lectures. A lab will usually contain a set of problems to be completed in the lab, and a problem set that becomes the homework assignment for the following week. \u00a0Learning in this class depends crucially on seeing new problems, and we strongly suggest that you spend the lab time working on the suggested problems, rather than starting the assignment.<\/p>\n
The assignment is considered an opportunity for learning and completing the assignment is a learning\u00a0process<\/b>. You are not expected to sit down for a few hours and solve everything in a breath! Instead, you are expected to view it as a process: read the problems, understand what they are asking, come up with initial solutions, figure out whether they work or not, fix them, repeat. The whole process is supposed to be interactive between you, the group of people you collaborate with, \u00a0the TAs and study group leaders, and the instructors.<\/p>\n
The course relies heavily on group work and peer instruction, so it is crucial that you attend all classes and all labs. There is a lot of research that shows the benefits of peer instructions compared to standard lecturing. The process of explaining an argument is beneficial for everybody involved. You’ll work in groups in class, during labs, and in the study groups.<\/p>\n
Homeworks, Exams and Grading policy<\/h2>\n
Homework:<\/strong>\u00a0The weekly lab will contain some problems to be solved in the lab, and a set that constitues the homework for the subsequent week. The homeworks will generally be due a week later (unless specified otherwise). Late assignments are not accepted (except in case of medical reasons).<\/p>\nExams:<\/strong>\u00a0There will be two exams, one half-way through the semester [see syllabus], and the second one during the final exam period [check precise date in posted in polaris]. Tentatively, the first exam will be take-home, the second exam will be in-class; this is just tentative, and may change. \u00a0The exams will be open book and open notes, and non-cumulative (to the extent possible).<\/p>\nHomework collaboration policy:<\/strong>\u00a0You are encouraged to work on problems in a group. You will find that you will gain a better understanding of the material by discussing the problems with your partners. However, you must write up the solutions\u00a0individually<\/strong>. Limit your collaborators to three or less, and list the names of the collaborators on the homework.<\/p>\nGrading policy:<\/strong>\u00a0The final grade is determined as follows:<\/p>\n\n- Homework assignments (40%).<\/li>\n
- 2 exams (2 x 30 = 60%).<\/li>\n
- Class participation (5%)<\/li>\n<\/ul>\n
Topics<\/h2>\n
The following general topics will be covered, which correspond to chapters in your textbook and will be studied approximately in the same order as they appear in the textbook. For a precise schedule, check the\u00a0syllabus<\/a>.<\/p>\n\n- Mathematical foundation (growth of functions, summations, recurrences, induction)<\/li>\n
- Sorting algorithms (insertion sort, selection sort, mergesort, quicksort, heapsort, sorting lower bounds, bucket sort, radix sort)<\/li>\n
- Searching and data structures (binary search trees, red-black trees, augmented search trees, skip lists)<\/li>\n
- Priority queues (binary heap)<\/li>\n
- Selection<\/li>\n
- Paradigms (divide-and-conquer, greedy, dynamic programming)<\/li>\n
- Graph Algorithms (traversal, minimum spanning trees, shortest paths)<\/li>\n
- [Time-permitting: Network algorithms (network flow) and\u00a0String matching algorithms]<\/li>\n
- NP-completeness (quick intro)<\/li>\n<\/ul>\n
Academic Integrity<\/h2>\n
You are expected to follow Bowdoin’s academic honor code. Collaboration on homeworks is encouraged, however you are responsible to write the solutions on your own, and list the names of all your collaborators. You may not glance over someone else’s written solution, and you may not share your problems sets and exams with anybody else, this term or in the future. Any violation will be reported and treated according to Bowdoin’s academic integrity guidelines.<\/p>\n","protected":false},"excerpt":{"rendered":"
Basic info Lecture (A): Tu, Thu 10-11:25 (Searles 223, Toma) Lecture (B): M, We 8-9:25 (Searles 126, Majercik) L1:\u00a0Fri 11:30 – 12:55 (Searles 126, Toma) L2: Fri 10-11:25 (Searles 126, Majercik) Prerequisites: csci 101 (Intro to CS) and csci 2101 (Data Structures). Generally speaking, a good mathematical background and good QR skills are not required, […]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-7","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/courses.bowdoin.edu\/computer-science-2200\/wp-json\/wp\/v2\/pages\/7","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/courses.bowdoin.edu\/computer-science-2200\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/courses.bowdoin.edu\/computer-science-2200\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/courses.bowdoin.edu\/computer-science-2200\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/courses.bowdoin.edu\/computer-science-2200\/wp-json\/wp\/v2\/comments?post=7"}],"version-history":[{"count":0,"href":"https:\/\/courses.bowdoin.edu\/computer-science-2200\/wp-json\/wp\/v2\/pages\/7\/revisions"}],"wp:attachment":[{"href":"https:\/\/courses.bowdoin.edu\/computer-science-2200\/wp-json\/wp\/v2\/media?parent=7"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}