CIS 3100 Study Guide - Fall 2018, Comprehensive Midterm Notes - Computer Memory, Random-Access Memory, Machine Code

309 views33 pages
CIS 3100
MIDTERM EXAM
STUDY GUIDE
Fall 2018
Unlock document

This preview shows pages 1-3 of the document.
Unlock all 33 pages and 3 million more documents.

Already have an account? Log in
Unlock document

This preview shows pages 1-3 of the document.
Unlock all 33 pages and 3 million more documents.

Already have an account? Log in
CIS 3- Intro to Programming
- Prorammin in asi leel
- Computin deie runs on sotare
- Ho to reate/run on sotare
- Eel / Aess/ Dataase
- addon/ plu-in/ etension
- Prorams in ars
- Naiations
- Android- jaa
- Apple- ojetie 
- Aumented realit
- Blendin
- Plain ojetie in D ie
- Readin aout aumented realit
- to/three ame enines
- . Unit ame enine
- . Unreal ame enine
- maileap
- Mirosot hololens
- Hololens deelopment tutorial
- Look here mone is oin
- Ne inestments
- Bulk o inestments oes to data analtis
- Aumented realit
- Automation sstems
- Cloud ased apps - er poerul
Write in lanuae deie speaks
 ateories omputer understands
. Data
a. Come rom ile, user inputs, et
. Statements
a. That allos u to do operations on data
Some part o inar data that represents ode that’s supposed to operate on data
- te
find more resources at oneclass.com
find more resources at oneclass.com
Unlock document

This preview shows pages 1-3 of the document.
Unlock all 33 pages and 3 million more documents.

Already have an account? Log in

 - sutration su
 - addition add
- multipliation mul
{I this is date, it ould mean a numer
Eer statement is hat the omputer should eeute}
- push
Asseml language Mahine language diret mapping
Push 
Push 
Add
No omputer knos i u put [Push  Push Add] in one lon inar ormat omputer ill
diide into 8 use that and eeute it and put result somehere in memor
Compiled Language
C/C++ Compilers proram that takes proram in ertain lanuae and transorms it into
mahine lanuae Mirosot Compiler another eample is GCC
Lanuae
Push 
Push 
Add
{I just rote a proram ^^ that takes tet ile enerates inar ile that omp
understands
Write proram in more human riendl a}
+
Proram takes + tet inormation statement
Conerts it into mahine orm
E.. Fortran
Cool
Pasal
Interpreted language
{Eample} Java te ode
- Wrote proram that onerts into mahine ode
- Don't kno i user runnin on  te,  te, inside t, ar proessor
- Don’t kno the CPU
- Don’t kno the instrution set
- So hat should I do?
find more resources at oneclass.com
find more resources at oneclass.com
Unlock document

This preview shows pages 1-3 of the document.
Unlock all 33 pages and 3 million more documents.

Already have an account? Log in

Document Summary

Readin(cid:307) a(cid:267)out au(cid:307)mented realit(cid:459) t(cid:453)o/three (cid:307)ame en(cid:307)ines (cid:487). Bulk o(cid:306) in(cid:452)estments (cid:307)oes to data anal(cid:459)ti(cid:268)s. Write in lan(cid:307)ua(cid:307)e de(cid:452)i(cid:268)e speaks (cid:488) (cid:268)ate(cid:307)ories (cid:268)omputer understands (cid:487). Data: come (cid:306)rom (cid:306)ile, user inputs, et(cid:268) (cid:488). Statements: that allo(cid:453)s u to do operations on data. Some part o(cid:306) (cid:267)inar(cid:459) data that represents (cid:268)ode that"s supposed to operate on data (cid:487)(cid:486)(cid:486)(cid:486)(cid:487)(cid:486)(cid:487)(cid:486)- (cid:267)(cid:459)te (cid:486)(cid:486)(cid:486)(cid:486)(cid:486)(cid:487)(cid:486)(cid:486) su(cid:267) (cid:486)(cid:486)(cid:486)(cid:486)(cid:486)(cid:486)(cid:486)(cid:486) - su(cid:267)tra(cid:268)tion (cid:486)(cid:486)(cid:486)(cid:486)(cid:486)(cid:486)(cid:486)(cid:487) - addition add (cid:486)(cid:486)(cid:486)(cid:486)(cid:486)(cid:486)(cid:487)(cid:486)- multipli(cid:268)ation mul. {i(cid:306) this is date, it (cid:268)ould mean a num(cid:267)er. E(cid:452)er(cid:459) statement is (cid:453)hat the (cid:268)omputer should e(cid:458)e(cid:268)ute} (cid:486)(cid:486)(cid:486)(cid:486)(cid:486)(cid:486)(cid:487)(cid:487)- push. No(cid:453) (cid:268)omputer kno(cid:453)s i(cid:306) u put [push (cid:491) push add] in one lon(cid:307) (cid:267)inar(cid:459) (cid:306)ormat (cid:563)(cid:268)omputer (cid:453)ill di(cid:452)ide into 8(cid:564) use that and e(cid:458)e(cid:268)ute it and put result some(cid:453)here in memor(cid:459) C/c++ (cid:563)compilers pro(cid:307)ram that takes pro(cid:307)ram in (cid:268)ertain lan(cid:307)ua(cid:307)e and trans(cid:306)orms it into ma(cid:268)hine lan(cid:307)ua(cid:307)e mi(cid:268)roso(cid:306)t compiler (cid:563)another e(cid:458)ample is gcc(cid:564)(cid:564) {i just (cid:453)rote a pro(cid:307)ram ^^ that takes te(cid:458)t (cid:306)ile (cid:307)enerates (cid:267)inar(cid:459) (cid:306)ile that (cid:268)omp understands.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers