- Page 1 and 2:
Computer Science Curricula 2013 Cur
- Page 3 and 4:
Computer Science Curricula 2013 Cop
- Page 5 and 6:
CS2013 Steering Committee ACM Deleg
- Page 7 and 8:
Chapter 5: Introductory Courses ...
- Page 9 and 10:
CC152: Computer Architecture and En
- Page 11 and 12:
Programming Languages and Technique
- Page 13 and 14:
Chapter 1: Introduction ACM and IEE
- Page 15 and 16:
KA subcommittee Chairs (as members
- Page 17 and 18:
Knowledge Areas The CS2013 Body of
- Page 19 and 20:
of the implications of social respo
- Page 21 and 22:
Manaris (College of Charleston), Sa
- Page 23 and 24:
Chapter 2: Principles Early in its
- Page 25 and 26:
novel, interesting, and effective w
- Page 27 and 28:
Appreciation of the interplay betwe
- Page 29 and 30:
to be able to communicate with, and
- Page 31 and 32:
● The learning outcomes and hour
- Page 33 and 34:
● Many strong computer-science cu
- Page 35 and 36:
include appropriate elective materi
- Page 37 and 38:
We use three levels of mastery, def
- Page 39 and 40:
Parallel and Distributed Computing
- Page 41 and 42:
select topics from Tier-2 (to inclu
- Page 43 and 44:
common“CS0” courses: precursor
- Page 45 and 46:
Tradeoffs: A programming-focused in
- Page 47 and 48:
Parallel Processing Traditionally,
- Page 49 and 50:
Chapter 6: Institutional Challenges
- Page 51 and 52:
Computer Science Across Campus An a
- Page 53 and 54:
programs do not have an explicit li
- Page 55 and 56:
accessible, building interdisciplin
- Page 57 and 58:
provide for assessing the effective
- Page 59 and 60:
AL. Algorithms and Complexity (19 C
- Page 61 and 62:
[Core-Tier2] 7. Describe various he
- Page 63 and 64:
Learning Outcomes: 1. Define the cl
- Page 65 and 66:
Architecture and Organization (AR)
- Page 67 and 68:
7. Evaluate the functional and timi
- Page 69 and 70:
AR/Interfacing and Communication [1
- Page 71 and 72:
Computational Science (CN) Computat
- Page 73 and 74:
CN/Introduction to Modeling and Sim
- Page 75 and 76:
CN/Processing [Elective] The proces
- Page 77 and 78:
CN/Data, Information, and Knowledge
- Page 79 and 80:
Discrete Structures (DS) Discrete s
- Page 81 and 82:
DS/Basic Logic [9 Core-Tier1 hours]
- Page 83 and 84:
DS/Graphs and Trees [3 Core-Tier1 h
- Page 85 and 86:
Graphics and Visualization (GV) Com
- Page 87 and 88:
GV/Fundamental Concepts [2 Core-Tie
- Page 89 and 90:
GV/Geometric Modeling [Elective] To
- Page 91 and 92:
GV/Visualization [Elective] Visuali
- Page 93 and 94:
HCI/Foundations [4 Core-Tier1 hours
- Page 95 and 96:
HCI/User-Centered Design and Testin
- Page 97 and 98:
Learning Outcomes: 1. Explain basic
- Page 99 and 100:
o Game engines o Mobile augmented r
- Page 101 and 102:
IAS. Information Assurance and Secu
- Page 103 and 104:
OS/Concurrency 1.5 OS/Scheduling an
- Page 105 and 106:
SP/Social Context 0.5 SP/Analytical
- Page 107 and 108:
11. Discuss the importance of usabi
- Page 109 and 110:
Learning outcomes: [Core-Tier2] 1.
- Page 111 and 112:
Learning outcomes: [Core-Tier2] 1.
- Page 113 and 114:
Learning outcomes: 1. Describe the
- Page 115 and 116:
Information Management (IM) Informa
- Page 117 and 118:
• Design of core DBMS functions (
- Page 119 and 120:
3. Demonstrate use of the relationa
- Page 121 and 122:
IM/Physical Database Design [Electi
- Page 123 and 124:
• Presentation, rendering, synchr
- Page 125 and 126:
IS/Fundamental Issues [1 Core-Tier2
- Page 127 and 128:
4. Describe over-fitting in the con
- Page 129 and 130:
IS/Agents [Elective] Cross-referenc
- Page 131 and 132:
Learning Outcomes: 1. Explain the d
- Page 133 and 134:
Networking and Communication (NC) T
- Page 135 and 136:
NC/Networked Applications [1.5 Core
- Page 137 and 138:
NC/Social Networking [Elective] Top
- Page 139 and 140:
OS/Overview of Operating Systems [2
- Page 141 and 142:
OS/Memory Management [3 Core-Tier2
- Page 143 and 144:
OS/File Systems [Elective] Topics:
- Page 145 and 146:
Platform-Based Development (PBD) Pl
- Page 147 and 148:
Learning Outcomes: 1. Design and im
- Page 149 and 150:
Because the terminology of parallel
- Page 151 and 152:
PD/Parallelism Fundamentals [2 Core
- Page 153 and 154:
Learning outcomes: [Core-Tier1] 1.
- Page 155 and 156:
• Topologies o Interconnects o Cl
- Page 157 and 158:
o Software as a service o Security
- Page 159 and 160:
PL. Programming Languages (8 Core-T
- Page 161 and 162:
PL/Functional Programming [3 Core-T
- Page 163 and 164:
o o o Enforce invariants during cod
- Page 165 and 166:
PL/Compiler Semantic Analysis [Elec
- Page 167 and 168:
• Metaprogramming: Macros, Genera
- Page 169 and 170:
PL/Language Pragmatics [Elective] T
- Page 171 and 172:
emphasize formal analysis (e.g., Bi
- Page 173 and 174:
Learning Outcomes: 1. Analyze and e
- Page 175 and 176:
Software Engineering (SE) In every
- Page 177 and 178:
such system are assigned to the cor
- Page 179 and 180:
Learning Outcomes: [Core-Tier1] 1.
- Page 181 and 182:
SE/Tools and Environments [2 Core-T
- Page 183 and 184:
SE/Software Design [3 Core-Tier1 ho
- Page 185 and 186:
[Elective] • Potential security p
- Page 187 and 188:
o o o o Code segments Libraries and
- Page 189 and 190:
Systems Fundamentals (SF) The under
- Page 191 and 192:
2. Describe how hardware, VM, OS, a
- Page 193 and 194:
2. Describe the scheduling algorith
- Page 195 and 196:
Social Issues and Professional Prac
- Page 197 and 198:
understanding of our commitment to
- Page 199 and 200:
Learning Outcomes: 1. Evaluate stak
- Page 201 and 202:
Learning Outcomes: [Core-Tier1] 1.
- Page 203 and 204:
[Elective] 8. Discuss ways to influ
- Page 205 and 206:
• Differences in access to comput
- Page 207 and 208:
Appendix B: Migrating to CS2013 A g
- Page 209 and 210:
and are treated as a topic geared t
- Page 211 and 212:
GV The storage of analog signals in
- Page 213 and 214:
SDF This new knowledge area pulls t
- Page 215 and 216:
Table B-3: Core Learning Topics and
- Page 217 and 218:
Table B-4: New and Expanded Core Le
- Page 219 and 220:
IAS Core-Tier1: • Analyze the tra
- Page 221 and 222: IS NC Core-Tier2: • Translate a n
- Page 223 and 224: • Describe at least one design te
- Page 225 and 226: • Explain why the creation of cor
- Page 227 and 228: • Use refactoring in the process
- Page 229 and 230: • Apply simple algorithms for exp
- Page 231 and 232: Appendix C: Course Exemplars While
- Page 233 and 234: IS U. San Francisco Artificial Inte
- Page 235 and 236: ACM/IEEE-CS CS2013 Course-Exemplar
- Page 237 and 238: CSCI 140: Algorithms, Pomona Colleg
- Page 239 and 240: AL PD advanced data structures algo
- Page 241 and 242: What is the format of the course Th
- Page 243 and 244: CS 256 Algorithm Design and Analysi
- Page 245 and 246: and other applications including Ba
- Page 247 and 248: • Data races and higher-level rac
- Page 249 and 250: CS/ECE 552: Introduction to Compute
- Page 251 and 252: Body of Knowledge coverage KA Knowl
- Page 253 and 254: AR Assembly Level Machine Organizat
- Page 255 and 256: Body of Knowledge coverage KA Knowl
- Page 257 and 258: Altruism/Collaboration/Competition,
- Page 259 and 260: everyday lives, and therefore at le
- Page 261 and 262: COSC/MATH 201: Modeling and Simulat
- Page 263 and 264: ehaviors, simplifying assumptions;
- Page 265 and 266: MAT 267: Discrete Mathematics, Unio
- Page 267 and 268: Identify a problem and analyze it i
- Page 269 and 270: CS109 covers: • Counting • Comb
- Page 271: CS 250 - Discrete Structures I, Por
- Page 275 and 276: How are students assessed Students
- Page 277 and 278: CS 175 Computer Graphics, Harvard U
- Page 279 and 280: SDF Development Methods Program cor
- Page 281 and 282: cumulate in a multi-week final proj
- Page 283 and 284: Human Aspects of Computer Science,
- Page 285 and 286: FIT3063 Human Computer Interaction,
- Page 287 and 288: HCI New Interactive Technologies Ch
- Page 289 and 290: Course textbooks and materials Ther
- Page 291 and 292: Suggested assignments (set and asse
- Page 293 and 294: Studio track: Six assignments (culm
- Page 295 and 296: We offer several of these courses,
- Page 297 and 298: Suggested assignments (set and asse
- Page 299 and 300: Instructional Approach This course
- Page 301 and 302: CS430: Database Systems, Colorado S
- Page 303 and 304: IM Transaction Processing ACID prop
- Page 305 and 306: Selection from the following, at in
- Page 307 and 308: CS 662; Artificial Intelligence Pro
- Page 309 and 310: Intelligenza Artificiale (Artificia
- Page 311 and 312: CMSC 471, Introduction to Artificia
- Page 313 and 314: Introduction to Artificial Intellig
- Page 315 and 316: IS Basic Knowledge Representation a
- Page 317 and 318: Course textbooks, materials, and as
- Page 319 and 320: What is the format of the course Th
- Page 321 and 322: Computer Networks I, Case Western R
- Page 323 and 324:
CS144: Introduction to Computer Net
- Page 325 and 326:
SF Evaluation Performance figures o
- Page 327 and 328:
As a result of this format, there a
- Page 329 and 330:
SF Reliability through Redundancy H
- Page 331 and 332:
What is the format of the course Th
- Page 333 and 334:
CS 420, Operating Systems, Embry-Ri
- Page 335 and 336:
CPSC 3380 Operating Systems, U. of
- Page 337 and 338:
582219 Operating Systems, Universit
- Page 339 and 340:
RU STY1 Operating Systems, Reykjavi
- Page 341 and 342:
SF Support For Parallelism Thread p
- Page 343 and 344:
What is the format of the course 08
- Page 345 and 346:
Introduction to Parallel Programmin
- Page 347 and 348:
CS in Parallel (course modules on p
- Page 349 and 350:
1: Map-reduce for CS1/WMR 2: Multic
- Page 351 and 352:
CS453: Introduction to Compilers, C
- Page 353 and 354:
PL Language Translation and Executi
- Page 355 and 356:
The project consists of a sequence
- Page 357 and 358:
Given the nature of tutorials, it c
- Page 359 and 360:
Compilers, Stanford University Stan
- Page 361 and 362:
PL Code Generation Method dispatch,
- Page 363 and 364:
Course textbooks and materials We h
- Page 365 and 366:
solutions to truly hard problems, s
- Page 367 and 368:
CSC 131: Principles of Programming
- Page 369 and 370:
PL Type Systems Compositional type
- Page 371 and 372:
Why do you teach the course this wa
- Page 373 and 374:
How are students assessed There are
- Page 375 and 376:
CSE341: Programming Languages, Univ
- Page 377 and 378:
CSCI 334: Principles of Programming
- Page 379 and 380:
PL Language Pragmatics Principles o
- Page 381 and 382:
A large portion of the grade comes
- Page 383 and 384:
15-312 Principles of Programming La
- Page 385 and 386:
How are students assessed There is
- Page 387 and 388:
15-150: Functional Programming, Car
- Page 389 and 390:
teaching a deterministic approach t
- Page 391 and 392:
CIS 133J: Java Programming I, Portl
- Page 393 and 394:
PL Basic Type Systems All core-tier
- Page 395 and 396:
How are students assessed Students
- Page 397 and 398:
CpSc 215: Software Development Foun
- Page 399 and 400:
Why do you teach the course this wa
- Page 401 and 402:
What is the format of the course Th
- Page 403 and 404:
Data Abstraction and Data Structure
- Page 405 and 406:
Software Engineering Practices, Emb
- Page 407 and 408:
SE Requirements Engineering Fundame
- Page 409 and 410:
CS169: Software Engineering, Univer
- Page 411 and 412:
SE Requirements Engineering Require
- Page 413 and 414:
Body of Knowledge coverage KA Knowl
- Page 415 and 416:
• Project Management Tools Report
- Page 417 and 418:
CS2200: Introduction to Systems and
- Page 419 and 420:
Body of Knowledge coverage KA Knowl
- Page 421 and 422:
CS61C: Great Ideas in Computer Arch
- Page 423 and 424:
CSE333: Systems Programming, Univer
- Page 425 and 426:
Body of Knowledge coverage KA Knowl
- Page 427 and 428:
group developed PowerPoint presenta
- Page 429 and 430:
Technology Consulting in the Commun
- Page 431 and 432:
Why do you teach the course this wa
- Page 433 and 434:
Issues in Computing, Saint Xavier U
- Page 435 and 436:
Other comments Many topics in this
- Page 437 and 438:
Ethical decision making is an induc
- Page 439 and 440:
Professional Development Seminar, N
- Page 441 and 442:
Course textbooks and materials A te
- Page 443 and 444:
What is the format of the course Th
- Page 445 and 446:
SP Social Context Online education
- Page 447 and 448:
• Sorting (mergesort) and searchi
- Page 449 and 450:
AL Fundamental Data Structures and
- Page 451 and 452:
Why do you teach the course this wa
- Page 453 and 454:
CSC 221: Introduction to Programmin
- Page 455 and 456:
CSC 222: Object-Oriented Programmin
- Page 457 and 458:
An Overview of the Mulit-paradigm T
- Page 459 and 460:
CSC 151: Functional problem solving
- Page 461 and 462:
CSC 161: Imperative Problem Solving
- Page 463 and 464:
CSC 207: Algorithms and Object-Orie
- Page 465 and 466:
SE Software Design Design principle
- Page 467 and 468:
scheme for computing hours. (Please
- Page 469 and 470:
The canonical computer science majo
- Page 471 and 472:
Notation: < 25% of KU covered # 25-
- Page 473 and 474:
Notation: < 25% of KU covered # 25-
- Page 475 and 476:
Bluegrass Community and Technical C
- Page 477 and 478:
Knowledge Units in a Typical Major
- Page 479 and 480:
Notation: < 25% of KU covered # 25-
- Page 481 and 482:
Appendix: Information on Individual
- Page 483 and 484:
Grinnell College Department of Comp
- Page 485 and 486:
Proposed Curricular Revisions Altho
- Page 487 and 488:
Knowledge Units in a Typical Major
- Page 489 and 490:
Notation: < 25% of KU covered # 25-
- Page 491 and 492:
Notation: < 25% of KU covered # 25-
- Page 493 and 494:
CSC 207 - Object-Oriented Problem S
- Page 495 and 496:
Stanford University Computer Scienc
- Page 497 and 498:
CS Electives • CS108 - Object-Ori
- Page 499 and 500:
Notation: < 25% of KU covered # 25-
- Page 501 and 502:
Notation: < 25% of KU covered # 25-
- Page 503 and 504:
CS 107: Computer Organization and S
- Page 505 and 506:
CS 194: Software Project Design, sp
- Page 507 and 508:
Current electives are • Computer
- Page 509 and 510:
Notation: < 25% of KU covered # 25-
- Page 511 and 512:
Notation: < 25% of KU covered # 25-
- Page 513 and 514:
Add: • Mathematical Foundations o
- Page 515 and 516:
in which these issues are addressed
- Page 517 and 518:
CSCI 315 - Computational Biology Th