Difference between revisions of "Curriculum Proposal to SCS Faculty May 2011"

From Soma-notes
Jump to navigation Jump to search
Line 64: Line 64:




==COMP 2804: Course Title==
==COMP 2804: Discrete Structures II==


==COMP 3804: Course Title==
===New Course Description===
 
Introduction to discrete mathematics and discrete structures. Topics include: counting, sequences and sums, discrete probability (including random variables, expectation, linearity of expectation,
dependence, concentration results, distributions), simulation, randomized algorithms.
 
===Rationale===


=Software Engineering=
=Software Engineering=

Revision as of 20:51, 3 May 2011

This document contains proposed course changes for the 2012/2013 academic year.

Executive Summary

Introduction

Courses to be Eliminated

  • COMP 2003
    • assembly language => exposure through COMP 2401 and 2405
    • digital logic => COMP 1805
    • number representation => COMP 1805 and 2401
    • processor architectures, interrupts, devices => exposure in COMP 2401
    • multicore => cross-cutting concern

Courses to be Upgraded

We propose to keep the following courses, but not include them in the set of minimum required courses. To facilitate this, we have moved selected topics to other required courses. (Note that at this time we have not finished our design of third year or adjusted streams.)

  • COMP 2805
    • finite automata => COMP 1805
    • rest of formal languages, computability, automata theory => stays
  • COMP 3000: operating systems
    • programmer view of following => COMP 2401
      • process management
      • memory management
      • process coordination and synchronization
      • inter-process communication
      • file systems
      • networking
    • kernel view of above => stays
    • real-time clock management => stays
    • I/O device drivers => stays
  • COMP 3005
    • SQL => COMP 2405
    • data models => COMP 2405
    • database design => COMP 2405
    • entity relationship modeling => stays
    • object-oriented database design, OQL => stays
    • the relational algebra => stays
    • normalization theory => stays
    • physical data organization => stays
  • COMP 3007
    • functional languages, closures => COMP 2405
    • assignment-free programming => COMP 2405
    • recursive functions => cross-cutting, esp. COMP 1406
    • metacircular interpreter => stays
    • prolog, backtracking, cutting, negation => stays
    • semantics of functional programming => stays

Theory

COMP 1805: Discrete Structures I

Old Course Description

Introduction to discrete mathematics and discrete structures. Topics include: propositional and predicate calculus, Boolean algebra, introduction to complexity of algorithms, mathematical reasoning, counting, recurrences, relations, introduction to graphs.

New Course Description

Introduction to discrete mathematics and discrete structures. Topics include: propositional logic, predicate calculus, set theory, complexity of algorithms, mathematical reasoning and proof techniques, recurrences & induction, countability, functions, relations, boolean algebra. Material is illustrated through examples from computing.

Rationale

COMP 2804: Discrete Structures II

New Course Description

Introduction to discrete mathematics and discrete structures. Topics include: counting, sequences and sums, discrete probability (including random variables, expectation, linearity of expectation, dependence, concentration results, distributions), simulation, randomized algorithms.

Rationale

Software Engineering

COMP 2404: Introduction to Software Engineering

Introduction to object-oriented software development, with emphasis on design and implementation of medium-sized programs. Topics include abstraction, modularity, encapsulation, reusability, and design patterns.

COMP 3004: Object-Oriented Software Engineering

No changes.

Programming

  • we already changed 1405 and 1406
  • goal is to teach programming through teaching other topics that are central to modern CS: OS, databases, web

COMP 2401: Introduction to Systems Programming

Old Course Description

Introduction to programming with procedures and primitive data types, designed for B.C.S. students. Topics include: arrays, strings, pointers, heap and stack memory allocation and deallocation, iterative and recursive linked list manipulations, system/library calls.

Precludes additional credit for COMP 1002, COMP 1402, COMP 2001, SYSC 1102, and ECOR 1606.

Prerequisite: COMP 1406.

Restricted to students registered in the B.C.S. program, combined Honours in Computer Science and Mathematics, Honours Computer Mathematics,and Honours Computer Statistics.

Lectures three hours a week.

New Course Description

Introduction to system-level programming with fundamental OS concepts, procedures, primitive data types and user-defined types, designed for B.C.S. students. Basic OS topics include programmer view of the following: process management, memory management, process coordination and synchronization, inter-process communication, file systems and networking. Other topics include: pointers, heap and stack memory allocation and deallocation, system and library calls.

Precludes additional credit for COMP 1002, COMP 1402, COMP 2001, SYSC 1102, and ECOR 1606.

Prerequisite: COMP 1406.

Restricted to students registered in the B.C.S. program, combined Honours in Computer Science and Mathematics, Honours Computer Mathematics,and Honours Computer Statistics.

Lectures three hours a week, tutorials one hour a week.

COMP 2405: Internet Application Programming

Old course description

Design and implementation of Internet application programs. Topics include: fundamentals of the Web, introduction to client/server architectures, Internet programming, Web browsers, hypertext links, network programming.

Precludes additional credit for COMP 2005.

Prerequisite: COMP 2401 and COMP 1406.

Restricted to students registered in the B.C.S. program, combined Honours in Computer Science and Mathematics, Honours Computer Mathematics, and Honours Computer Statistics.

Lectures three hours a week.

New course description

An introduction to Internet application development that emphasizes the computer science fundamentals of the technologies underlying web applications. Topics include: scripting and functional languages, language-based virtual machines, database query languages, remote procedure calls over the Internet, and performance and security concerns in modern distributed applications.

Precludes additional credit for COMP 2005.

Prerequisite: COMP 2401.

Restricted to students registered in the B.C.S. program, combined Honours in Computer Science and Mathematics, Honours Computer Mathematics, and Honours Computer Statistics.

Lectures three hours a week along with weekly one-hour tutorials.

Rationale

   * learn basics of modern web applications?
   * basics of dynamic languages
         o first class functions
         o functional programming concepts (non-mutability) 
   * basics of databases
         o data representation
         o query languages 
   * basics of distributed applications
         o latency vs. bandwidth
         o reliability concerns
         o state vs. stateless
Retrieved from "https://homeostasis.scs.carleton.ca/wiki/index.php?title=Curriculum_Proposal_to_SCS_Faculty_May_2011&oldid=9590"