Presentation is loading. Please wait.

Presentation is loading. Please wait.

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

Published byLeony Pranata Modified over 5 years ago

Similar presentations

Presentation on theme: "* 312 Foundations II 332 Data Abstractions 311 I 351 Hw/Sw Interface"— Presentation transcript:

1 * 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 * 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, …

3 * 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

4 * 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, …

5 * 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)

6 * 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, …

7 * 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, …

8 * 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)

9 * 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) …

10 * 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, …

11 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)

12 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

13 * 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

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

Similar presentations

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

Synchron’08 Jean-François LE TALLEC INRIA SOP lab, AOSTE INRIA SOP lab, EPI AOSTE ScaleoChip Company SoC Conception Methodology.
Asymptotic Complexity (Big-O Notation) CS 1037 Fundamentals of Computer Science II.

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.

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.
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.

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

CSCE156: Introduction to Computer Science II Instructor Stephen Scott Website
CS 101 Course Summary December 5, 2003. Big Ideas Abstraction Problem solving Fundamentals of programming.

CS 101 Course Summary December 5, Big Ideas Abstraction Problem solving Fundamentals of programming.
Course Introduction CS 1037 Fundamentals of Computer Science II.

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 www.cs.berkeley.edu/~ddgarcia inst.eecs.berkeley.edu/~cs61c.

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 www.cs.berkeley.edu/~ddgarcia 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 91.404 Analysis of Algorithms Prof. Karen Daniels Fall, 2000 Lecture 1 Introduction/Overview Wed. 9/6/00.

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.

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.

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 https://courseware.stanford.edu/pg/courses/317431/

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.

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.

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.

1 Layers of Computer Science, ISA and uArch Alexander Titov 20 September 2014.
Computer Architecture Examples and Hierarchy By Cheuk Wong.

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?

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?

Similar presentations

Ads by Google