* 312 Foundations II 332 Data Abstractions 311 I 351 Hw/Sw Interface

Slides:

Advertisements

Similar presentations

Synchron’08 Jean-François LE TALLEC INRIA SOP lab, AOSTE INRIA SOP lab, EPI AOSTE ScaleoChip Company SoC Conception Methodology.

Advertisements

Asymptotic Complexity (Big-O Notation) CS 1037 Fundamentals of Computer Science II.

Introductory Computer Science Courses Past experiences & thoughts Haakon Ringberg, Thomson Research Paris & Princeton University.

University of Washington Computer Science & Engineering Curriculum Revision: Why, What, How* Dan Grossman University of Washington * Opinions expressed.

University of Washington Computer Science & Engineering Curriculum Revision: Why, What, How* Dan Grossman University of Washington * Opinions expressed.

1 Building a Computer from Scratch: A Hardware Lab Sequence for Computer Science Students Michael Black American University CCSC East.

CSCE156: Introduction to Computer Science II Instructor Stephen Scott Website

CS 101 Course Summary December 5, Big Ideas Abstraction Problem solving Fundamentals of programming.

Course Introduction CS 1037 Fundamentals of Computer Science II.

CS 61C L20 Introduction to Synchronous Digital Systems (1) Garcia, Fall 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.

CS61C L20 Introduction to Synchronous Digital Systems (1) Garcia © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2000 Lecture 1 Introduction/Overview Wed. 9/6/00.

Discrete Structures for Computer Science Ruoming Jin MW 5:30 – 6:45pm Fall 2009 rm MSB115.

ECE 232 L1 Intro.1 Adapted from Patterson 97 ©UCBCopyright 1998 Morgan Kaufmann Publishers ECE 232 Hardware Organization and Design Lecture 1 Introduction.

Foundations of Programming Languages – Course Overview Xinyu Feng Acknowledgments: some slides taken or adapted from lecture notes of Stanford CS242

Do we need theoretical computer science in software engineering curriculum: an experience from Uni Novi Sad Bansko, August 28, 2013.

C.S. Choy95 COMPUTER ORGANIZATION Logic Design Skill to design digital components JAVA Language Skill to program a computer Computer Organization Skill.

1 Layers of Computer Science, ISA and uArch Alexander Titov 20 September 2014.

Computer Architecture Examples and Hierarchy By Cheuk Wong.

1 Computer Systems. 2 Introduction – What is a Computer? This course is all about how computers work What do computer and computer system mean to you?

UTCS 11 Curriculum Reform Department of Computer Sciences University of Texas at Austin 7/10/08.

Mathematics in Computer Science at Loras College Steve Mosiman.

1 A Simple but Realistic Assembly Language for a Course in Computer Organization Eric Larson Moon Ok Kim Seattle University October 25, 2008.

Discrete Mathematics 이재원 School of Information Technology

Relationships Between Structures “→” ≝ “Can be defined in terms of” Programs Groups Proofs Trees Complex numbers Operators Propositions Graphs Real.

1 COMP 3438 – Part II-Lecture 1: Overview of Compiler Design Dr. Zili Shao Department of Computing The Hong Kong Polytechnic Univ.

Motions for Permanent Undergraduate Course Numbers Brian L. Evans On Behalf of the ECE Curriculum Committee September 21, 2015.

CMSC104 Problem Solving and Computer Programming Spring 2011 Section 04 John Park.

Discrete Structures and The Three-Fold Introduction to Computer Science Doug Baldwin Department of Computer Science SUNY Geneseo.

CMSC104 Problem Solving and Computer Programming Spring 2009 Sections 0201 & 0301 Ms. Dawn Block.

The course. Description Computer systems programming using the C language – And possibly a little C++ Translation of C into assembly language Introduction.

순천향대학교 정보기술공학부 이 상 정 1 1. Computer Abstractions and Technology.

Software Engineering Emphasis for Engineering Computing Courses William Hankley Computing & Information Sciences Kansas State University.

1 Beginning & Intermediate Algebra – Math 103 Math, Statistics & Physics.

CSE Undergraduate Curriculum: Where we are / Where we might go Dan Grossman Assistant Professor, 2003-present Curriculum Revision Co-Chair, 2009.

Charles L. Brown Department of Electrical and Computer Engineering EE Undergraduate Curriculum Proposal ECE Faculty Meeting 1/31/14 L.R. Harriott, Joanne.

Charles L. Brown Department of Electrical and Computer Engineering EE Undergraduate Curriculum Proposal SEAS UCC Meeting 2/12/14 L.R. Harriott, Joanne.

EE/CpE Undergraduate Curriculum Proposal L.R. Harriott, Joanne Dugan, Harry Powell, Ron Williams, Bobby Weikle.

Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)

서울대한양대 ( 안 산 ) 충남대 1년1년 컴퓨터기초 (C) 컴퓨터프로그래밍 (C, Java) 컴퓨터프로그래밍 (C) 2. 봄 프로그래밍 원리 (Scheme, ML) Structure & Interpretation of Computer Programs 프로그래밍 방법론.

Beginning 1956  Associate of Science Degree included 27 credits of mathematics  Math 12 Plane Trigonometry  Math 13 Analytical Geometry  Math 91 Calculus.

Computer science Computer science is a broader and much wider field as compared to programming. In the case of programming, we utilize the concepts.

COMPUTER ENGINEERING FIRST YEAR SECOND YEAR Fall Winter Spring

Changing Your Life with a Career in Computing

Design and Analysis of Algorithms (09 Credits / 5 hours per week)

ABET Definitions Objectives Outcomes Broad Statements

CMSC104 Problem Solving and Computer Programming Spring 2008

Final exam: Wednesday, March 20, 2:30pm

CMSC104 Problem Solving and Computer Programming Fall 2010 Section 01

Computer Science Courses

Stateless Combinational Logic and State Circuits

The CS Undergrad Curriculum of 2017: My Biased View from Academia

Metropolitan State University of Denver

COSC121: Computer Systems

Foundations of Programming Languages – Course Overview

CMSC 104 Problem Solving and Computer Programming Fall 2010

Foundations of Programming Languages – Course Overview

CMSC104 Problem Solving and Computer Programming Fall 2010

Lecture 17 Logistics Last lecture Today HW5 due on Wednesday

CS 153 Logic Design Lab Professor Ian G. Harris

Lecturer PSOE Dan Garcia

Lecture 17 Logistics Last lecture Today HW5 due on Wednesday

“Critical” prerequisite flows – CSE

CMSC104 Problem Solving and Computer Programming Spring 2010

“Critical” prerequisite flows – Computer Track

Computing and Informatics Courses

CSCE156: Introduction to Computer Science II

Computer Science Courses in the Major

Design and Analysis of Algorithms (04 Credits / 4 hours per week)

Presentation transcript:

* 312 Foundations II 332 Data Abstractions 311 I 351 Hw/Sw Interface 371 Digital Circuits EE205 Signal Conditioning (or EE215) 344 Management 341 Programming Languages required CS required CompE required not required pre-req co-req or pre-req STAT391 Prob/Stats For CS 331 Sw Design / Impl 333 Systems 390A Tools MATH308 Linear Algebra * recommended (co- or pre-) 369 Design

* logic, proofs, sets, unclocked circuits, finite state machines, 312 Foundations II 332 Data Abstractions 311 I 351 Hw/Sw Interface 371 Digital Circuits EE205 Signal Conditioning (or EE215) 344 Management 341 Programming Languages required CS required CompE required not required pre-req co-req or pre-req STAT391 Prob/Stats For CS 331 Sw Design / Impl 333 Systems 390A Tools MATH308 Linear Algebra * recommended (co- or pre-) 369 Design logic, proofs, sets, unclocked circuits, finite state machines, undecidability, …

* 70% data structures: big-O, trees, heaps, hashing, sorting, graphs 312 Foundations II 332 Data Abstractions 311 I 351 Hw/Sw Interface 371 Digital Circuits EE205 Signal Conditioning (or EE215) 344 Management 341 Programming Languages required CS required CompE required not required pre-req co-req or pre-req STAT391 Prob/Stats For CS 331 Sw Design / Impl 333 Systems 390A Tools MATH308 Linear Algebra * recommended (co- or pre-) 369 Design 70% data structures: big-O, trees, heaps, hashing, sorting, graphs 20-25% threads, parallelism, 5-10% P, NP

* bits, binary numbers, assembly, C, pointers, caching, 312 Foundations II 332 Data Abstractions 311 I 351 Hw/Sw Interface 371 Digital Circuits EE205 Signal Conditioning (or EE215) 344 Management 341 Programming Languages required CS required CompE required not required pre-req co-req or pre-req STAT391 Prob/Stats For CS 331 Sw Design / Impl 333 Systems 390A Tools MATH308 Linear Algebra * recommended (co- or pre-) 369 Design bits, binary numbers, assembly, C, pointers, caching, connection to Java, …

* linux, bash, grep, make, version control, … (1-credit, pass/fail) 312 Foundations II 332 Data Abstractions 311 I 351 Hw/Sw Interface 371 Digital Circuits EE205 Signal Conditioning (or EE215) 344 Management 341 Programming Languages required CS required CompE required not required pre-req co-req or pre-req STAT391 Prob/Stats For CS 331 Sw Design / Impl 333 Systems 390A Tools MATH308 Linear Algebra * recommended (co- or pre-) 369 Design linux, bash, grep, make, version control, … (1-credit, pass/fail)

* non-trivial C/C++ programming, programming for performance, 312 Foundations II 332 Data Abstractions 311 I 351 Hw/Sw Interface 371 Digital Circuits EE205 Signal Conditioning (or EE215) 344 Management 341 Programming Languages required CS required CompE required not required pre-req co-req or pre-req STAT391 Prob/Stats For CS 331 Sw Design / Impl 333 Systems 390A Tools MATH308 Linear Algebra * recommended (co- or pre-) 369 Design non-trivial C/C++ programming, programming for performance, asynchronous I/O, …

* discrete probability / statistics in computing 312 Foundations II 332 Data Abstractions 311 I 351 Hw/Sw Interface 371 Digital Circuits EE205 Signal Conditioning (or EE215) 344 Management 341 Programming Languages required CS required CompE required not required pre-req co-req or pre-req STAT391 Prob/Stats For CS 331 Sw Design / Impl 333 Systems 390A Tools MATH308 Linear Algebra * recommended (co- or pre-) 369 Design discrete probability / statistics in computing (counting, Bayes, …), expectation and variance, …

* software design, testing, specs, 312 Foundations II 332 Data Abstractions 311 I 351 Hw/Sw Interface 371 Digital Circuits EE205 Signal Conditioning (or EE215) 344 Management 341 Programming Languages required CS required CompE required not required pre-req co-req or pre-req STAT391 Prob/Stats For CS 331 Sw Design / Impl 333 Systems 390A Tools MATH308 Linear Algebra * recommended (co- or pre-) 369 Design software design, testing, specs, debugging, design patterns, … (Java)

* functional programming, static vs. dynamic typing, 312 Foundations II 332 Data Abstractions 311 I 351 Hw/Sw Interface 371 Digital Circuits EE205 Signal Conditioning (or EE215) 344 Management 341 Programming Languages required CS required CompE required not required pre-req co-req or pre-req STAT391 Prob/Stats For CS 331 Sw Design / Impl 333 Systems 390A Tools MATH308 Linear Algebra * recommended (co- or pre-) 369 Design functional programming, static vs. dynamic typing, modularity, … (e.g., ML, Scheme, Ruby) …

* SQL, relational algebra, xpath, transactions, MapReduce, … 312 Foundations II 332 Data Abstractions 311 I 351 Hw/Sw Interface 371 Digital Circuits EE205 Signal Conditioning (or EE215) 344 Management 341 Programming Languages required CS required CompE required not required pre-req co-req or pre-req STAT391 Prob/Stats For CS 331 Sw Design / Impl 333 Systems 390A Tools MATH308 Linear Algebra * recommended (co- or pre-) 369 Design SQL, relational algebra, xpath, transactions, MapReduce, …

312 Foundations II 332 Data Abstractions 311 I 351 Hw/Sw Interface 371 Digital Circuits EE205 Signal Conditioning (or EE215) 344 Management 341 Programming Languages required CS required CompE required not required pre-req co-req or pre-req STAT391 Prob/Stats For CS 331 Sw Design / Impl 333 Systems 390A Tools MATH308 Linear Algebra * recommended (co- or pre-) 369 Design 2 credit HW lab: tools for digital design; bridge course using 311 concepts (EEs take a different sequence)

312 Foundations II 332 Data Abstractions 311 I 351 Hw/Sw Interface 371 Digital Circuits EE205 Signal Conditioning (or EE215) 344 Management 341 Programming Languages required CS required CompE required not required pre-req co-req or pre-req STAT391 Prob/Stats For CS 331 Sw Design / Impl 333 Systems 390A Tools MATH308 Linear Algebra * recommended (co- or pre-) 369 Design Joint with EE, significant lab component, Verilog, Timing, Power, Datapath, Control

* 312 Foundations II 332 Data Abstractions 311 I 351 Hw/Sw Interface 371 Digital Circuits EE205 Signal Conditioning (or EE215) 344 Management 341 Programming Languages required CS required CompE required not required pre-req co-req or pre-req STAT391 Prob/Stats For CS 331 Sw Design / Impl 333 Systems 390A Tools MATH308 Linear Algebra * recommended (co- or pre-) 369 Design