Get 2 days of unlimited access
at Miami University

Textbook Notes for Computer Science & Software Engineering at Miami University


MIAMIOHCSE 385Mr. Michael StahrSpring

CSE 385 Chapter Notes - Chapter 1: Relational Model, Unique Key, Database

OC21295443 Page
0
1 - an introduction to relational databases and sql. Three hardware components: clients (pcs on desk), network(wiring and everything connecting clients
View Document
MIAMIOHCSE 278Dr. Fabio GuerinoniFall

CSE 278 Chapter 1: SQL Commands

OC21295441 Page
0
View Document
MIAMIOHCSE 274Dr. Zaobo HeFall

CSE 274 Chapter Notes - Chapter 3: Linked Data, Data Type

OC21295442 Page
0
View Document
MIAMIOHCSE 385Mr. Michael StahrSpring

CSE 385 Chapter 3: Retrieving from Single Table

OC21295443 Page
0
3 - how to retrieve data from a single table. To check dates in where: invoicedate between 2016-01-01" and. * in select clause retrieves all columns in
View Document
MIAMIOHCSE 278Dr. Fabio GuerinoniFall

CSE 278 Chapter Notes - Chapter 8: Memory Address, Bounds Checking, Operand

OC21295442 Page
0
View Document
MIAMIOHCSE 174Alberto Castro- HernándezFall

CSE 174 Chapter Notes - Chapter 4: Cash Register, Monte Carlo Method, Random Number Generation

OC21295442 Page
0
Loops repeatedly execute instructions until a goal has been reached. The while loop syntax while (condition) { statements. If the condition remains tru
View Document
MIAMIOHCSE 278Dr. Fabio GuerinoniFall

CSE 278 Chapter 1: SQL Intro

OC21295441 Page
0
View Document
MIAMIOHCSE 274Dr. Zaobo HeFall

CSE 274 Chapter Notes - Chapter 5: Operand, Runtime System, Program Counter

OC21295442 Page
0
View Document
MIAMIOHCSE 274Dr. Zaobo HeFall

CSE 274 Chapter Notes - Chapter 2: Unified Modeling Language

OC21295442 Page
0
2 - bag implementations that use arrays: array based: implementations that use an array to store data. Implementing the core methods: we can add to our
View Document
MIAMIOHCSE 274Dr. Zaobo HeFall

CSE 274 Chapter Notes - Chapter 21: Hash Table, Hash Function, Array Data Structure

OC21295442 Page
0
Technique that determines index of an entry in an array using only the entry"s search key, without searching. This array is called a hash table. Hash f
View Document
MIAMIOHCSE 174Alberto Castro- HernándezFall

CSE 174 Chapter Notes - Chapter 5: Local Variable, Top-Down And Bottom-Up Design, Return Statement

OC21295442 Page
0
Packages a computation consisting of multipole steps into a form that can be easily understood and reused. You call a method in order to execute its in
View Document
MIAMIOHCSE 274Dr. Zaobo HeFall

CSE 274 Chapter 6: Stack Implementations

OC21295442 Page
0
A linked implementation: stack implementations will implement fastest if first node in chain references the top entry in stack. Outline of class: topno
View Document
Showing 1 — 12 of 15 result

Textbook Notes (270,000)
US (100,000)
MiamiOH (600)
CSE (10)