[  http://web.cs.dal.ca/~vlado/csci1110  ] Fall 2016 (Sep6-Dec6) Faculty of Computer Science Dalhousie University

CSCI 1110 — Computer Science I and II

Course Description

This course covers the combined topics of Computer Science I and II in an enriched manner. Procedural programming is briefly reviewed, including variables, data types, expressions, assignment statements, control-structure statements, loops, arrays, and procedures (methods). Problem solving through programming is introduced and remains the fundamental theme throughout the course. Particular emphasis is placed on specifying and understanding the problem and its solution, followed by implementation. Various fundamental approaches, such as iteration, nested iteration, and recursion, are introduced. Students are introduced to object-oriented programming and the fundamental concepts of abstraction, encapsulation, inheritance, polymorphism, and modularity, as well as the mechanisms: classes, objects, instances, references, and methods. Lastly, students are introduced to a variety of abstract data types, such as lists, stacks, queues, and trees, simple implementations there of, applications, and algorithms that manipulate them, in particular, searching and sorting.

All material discussed in class will be approached with a view to solving problems. Each week a new problem will be presented and students will learn the material needed to solve the problem. The problem set is specifically chosen to serve as a broad introduction to computer science. Note: This course will be taught in a flipped class-room style format. Students will be expected to do extensive readings on their own to learn the fundamental concepts. Lecture time will be used to answer student question, clarify misconceptions, and most importantly, apply the material in the readings to solve problems.

(link to calendar description)
Academic Integrity Policy

Course Calendar

References