Computer Science Courses: 2012-2013
COMPUTER SCIENCE 30. Computer Science. Fall. Mr. Pillai. 4 meetings weekly. Block DL4. Open to members of Classes I or II and to members of Classes III and IV with Permission of the Department. Prerequisite: Math 6 or Permission of the Department. This course teaches the fundamentals of object-oriented programming using Java. Topics covered will include data types, selection constructs, loops, methods, Strings, and object encapsulation. The course stresses the understanding of problem solving in terms of algorithmic development.
COMPUTER SCIENCE 40. Advanced Placement Computer Science: Programming in Java. Spring. Mr. Pillai. 4 meetings weekly. Block DL4. Prerequisite: Computer Science 30 and Permission of the Department. This course is a continuation of Computer Science 30. Students examine and write larger and more complex programs consisting of multiple classes. It will consider style and expression, structured coding, modularization, implementation, testing, and maintenance of software. Related topics include arrays, the construction of classes, inheritance, polymorphism, and recursion. Measuring algorithm efficiency will be considered with particular emphasis on sorting and searching. Additionally, the GridWorld Case Study provided by the College Board will be examined. Prepares students for the A Level Advanced Placement Examination in Computer Science.
COMPUTER SCIENCE 50. Algorithms and Data Structures. Fall. Mr. Pillai. 4 meetings weekly. Block TBA and Lab TBA. Prerequisite: Computer Science 40 and Permission of the Department. After a review of Java classes and the principles of designing classes, there will be an in-depth examination of the Java Collections library, iterators, the efficiency of algorithms using Big-Oh analysis, and predicate logic. THIS COURSE WILL NOT BE OFFERED IN 2012-2013.
COMPUTER SCIENCE 60. Advanced Data Structures. Spring. Mr. Pillai. 4 meetings weekly. Block TBA and Lab TBA. Prerequisite: Computer Science 50 and Permission of the Department. This advanced course in data structures and discrete mathematics will begin with a detailed discussion of problem solving with the following abstract data types: linked lists, stacks, queues, trees, graphs, tables, and priority queues. Algorithm analysis and proving the correctness of recursive functions using mathematical induction will also be considered. The remaining time will be spent on advanced techniques for the management of data such as balanced search trees, 2-3 trees, AVL trees, hashing, sorting data in external files, and searching external tables. THIS COURSE WILL NOT BE OFFERED IN 2012-2013.
COMPUTER SCIENCE 80. Advanced Topics in Computer Science. Fall, Spring. The Department. Block TBA. Prerequisite: Computer Science 30 or Computer Science 40 and Permission of the Department. Especially qualified students may study advanced topics such as multimedia and web design and production, networking, algorithm design and analysis, theory of computation, programming languages, computer architecture, software development, or operating systems. Students in this course will be expected to do a considerable amount of independent study. Interested students should consult with the Computer Science Department before selecting this option. May be taken as either a one-semester, or yearlong course.
