Help
Options
Didn't know it?
click below
click below
Knew it?
click below
click below
Don't Know
Remaining cards (0)
Know
retry
shuffle
restart
0:00
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
CS 1308 - Exam 1
Texas State / Computer Science / Spring '10 / Priebe
| Question | Answer |
|---|---|
| RESOURCE SHARING | SHARING OF PHYSICAL RESOURCES, SUCH AS PRINTERS, FILES, DATABASES |
| INFORMAITON SHARING | WWW, ACCESSING SCIENTIFIC/LEGAL/MEDICAL/COMMERCIAL DATA FILES STORED ANYWHERE IN THE WORLD |
| ELECTRONIC COMMERCE | E-COMMERCE, SUPPORTS PAPERLESS EXCHANGE OF GOODS, INFO, AND SERVICES. ATMS, ELECTRONIC TICKETS, ETC. |
| COMPUTER NETWORK | SET OF independent COMPUTERS CONNECTED BY TELECOMMUNICAITON LINKS |
| NODES OR HOSTS | WHAT INDIVIDUAL COMPUTERS, THEMSELVES, ARE CALLED |
| PROTOCOL | AN AGREED UPON LANGUAGE THAT COMPUTERS USE TO COMMUNICATE W/ EACH OTHER, ONCE THEY HAVE A PHYSICAL CONNECITON (HTTP, FTP) |
| CLIENT-SERVER MODEL | COMMON MEANS OF DISTRIBUTING INFO AND SERVICES (web browser → WEB SERVER, email client → EMAIL SERVER / ftp client → FTP SERVER) |
| MODEM | MODulates & DEModulates an analog signal or carrier to encode digital data |
| ANALOG VS. DIGITAL | |
| BANDWIDTH | CAPACITY OF THE COMMUNICATION MEDIUM |
| LANs | CONNECTS COMPUTERS THAT ARE GEOGRAPHICALLY CLOSE (SAME BLDG/CAMPUS). EACH HAS ITS OWN NETWORK ADDRESS. A PRIVATE NETWORK OWNED/OPERATED BY THE COMPANY/INSTITUTION |
| ETHERNET | CONTENTION BASED TRANSMISSION. USERS COMPETE FOR THE SAME LINE, & BROADCAST A MESSAGE. OPERATES AT 10, 100, OR 1000 MBPS (MILLION BITS/SECOND, 1GBPS). SHARED CABLE W/ TRANCIEVERS AND BRIDGES. HUBS TO WHICH EVERY COMPUTER CONNECT. CONTROL DISTRIBUTED. |
| WANs | EXTEND across TOWN/COUNTRY/OCEANS/PUBLIC AREAS....USED PURCHASED POINT TO POINT LINES.USES STORE AND FORWARD PACKET SWITCHING. PACKET UNIT HOPS FROM ONE NODE TO ANOTHER, UNTIL IT REACHES ITS DESTINATION. |
| PACKET TRANSMISSION | FIXED BLOCK SIZE OF INFO W/ AN ADDRESS FIELD FOR ITS DESTINATION. LARGE DATA MUST BE BROKEN INTO THESE. ROUTER SENDS ACK (ACKNOWLEDGEMENT) ONCE TRANSMITTED TO AJACENT NODE. |
| ROUTING ALGORITHMS | TRY TO DETERMINE THE SHORTEST PATHS FOR PACKET TRANSMISSION |
| INTERNET (HISTORY) | DEV. BEGAN AT MIT 1962, LATER FUNDED BY ARPA (RESEARCH OFFICE OF DOD). ARPANET. 1970S – RAPID EXPANSION OF ACADEMIC/COMMERCIAL COMMUNITIES. BACKBONE PRIVATIZED MID 90s. ALLOWED COMMERCIAL ENTERPRISES TO MAKE $$ VIA INTERNET. INTERNET IS NOT WWW |
| INTERNET (ADDRESSES) | 32 BIT IP ADDRESS FOR EACH COMPUTER (E.G. 192.207.177.133). STATIC IP. DYNAMIC HOST CONFIGURATION PROTOCOL (DHCP) 2^32 POSSIBLE ADDRESSES...WE'RE RUNNING OUT! 1Pv6 COMING SOON. |
| DNS | DOMAIN NAME SERVERS. DIRECTORY OF MACHINES FOUND WITHIN DOMAIN. EACH RESPONSIBLE FOR PROVIDING A NAME SERVER, CONTAINS MNEMONIC ADDRESS & CORRESPONDING NUMERIC INTERNET ADDRESS. MAPS IP ADDRESS TO COMPUTER NAME. HELPS MAKE NETWORK RELIABLE/ROBUST |
| PACKET ROUTING | ROUTED LOCALLY THROUGH ROUTERS TO THE INTERNET SERVICE PROVIDER. |
| WWW | CLIENT-SERVER MODEL: CLIENT REQ/S WEB PAGE FROM THE SERVER, USING HTTP (HYPERTEXT TRANSFER PROTOCOL) VIA THE TCP AND A URL. |
| URL | UNIFORM RESOURCE LOCATOR |
| HTML | HYPERTEXT MARKUP LANGUAGE |
| WHAT HAPPENS WHEN YOU CLICK A LINK? | 1BROWSER CONNECTS TO DNS, GETS IP ADDRESS FOR WEB SERVER. 2BROWSER USES HTTP REQ. TO ASK THE WEB SERVER FOR THE PAGE 3CONNECTION IS CLOSED 4FOR EACH ADDITIONAL ELEMENT, A NEW HTTP CONNECTION IS MADE. |
| “CLIENT-SIDE” PROGRAMS | SOME PROGRAMS ARE DOWNLOADED TO THE CLIENT, AND DATA IS PASSED TO THE PROGRAM (APPLETS, APPLICATIONS) |
| POP3 | POST OFFICE PROTOCOL, COMMON FOR EMAIL CLIENTS SUCH AS EUDORA, OUTLOOK EXPRESS. USED FOR CHECKING, NOT SENDING, EMAIL. EMAIL STORED ON A MAIL SERVER AND THE CLIENT EITHER COPIES THE MESSEGES FORM THE SERVER, OR REMOVES THEM. |
| SMTP | SIMPLE MAIL TRANSPER PROTOCOL. COMMONLY USED FOR SENDING EMAIL. MORE COMPLEX THAN HTTP. MAINTAINS CONNECTION, CHECKS CLIENT IDENTITY. |
| HTTP | HYPERTEXT TRANSFER PTROTOCOL |
| IMAP | |
| FTP | FILE TRANSFER PROTOCOL. SIMPLE WAY TO TXFR FILES BTWN COMPUTERS. COMMON NAMES: SMARTftp OR FETCH. ANONYMOUS FTP. FTP VIA LOGIN. |
| ROUTER | CREATES ROUTER TO ROUTER HOPS TO FOREIGN NETWORK. PROTOCOL SPECIFIC. MAN MASK IP ADDRESS AND PROVIDE FIREWALL PROTECTION. PROVIDES DHCP FOR CLIENT COMPUTERS. IF WIRELESS, CAN ACT AS AN ACCESS POINT FOR DEVICES. |
| SWITCH | CONNECTS DEVICES ON SAME SECTION OF A NETWORK. NOT VERY SMART (WORKS A BIT LIKE A POWER STRIP). |
| HUB | CENTRALLY LOCATED BOX PROVIDING DEDICATED CABLE CONNECTION TO EACH DEVICE ON LAN. |
| GATEWAY | COMMON ON WAN. MORE INTELLIGENT THAN ROUTER. ALLOWS NETWORKS OF DIFFERENT PROTOCOLS TO BE CONNECTED. |
| REPEATER | BOOSTS CABLE SIGNAL TO EXTEND TOTAL DISTANCE, BEYOND PHYSICAL CABLE LIMIT. |
| COMMUNICATION LINK SPEEDS | SWITCHED PH LINES- 56 KBPS (MAX, NEED MODEM). DEDICATED COMMUNICAITON LINES – DSL 300-1500 KBPS. CABLE MODEM - 1-6MBPS DOWNLOAD. FIBEROPTIC: 15gBPS |
| FIREWALL | MECHANISM USED TO PROTECT A TRUSTED NETWORK , USUALLY WHILE STILL ALLOWING TRAFFIC BTWN THE TWO. CAN BE HARDWARE OR SOFTWARE. BLOCKS PORT SCANS. FILTERS PACKETS. ESP IMPORTANT FOR BROADBAND CABLE ISPs (ROADRUNNER). ALL COMPUTERS = SAME LAN. |
| REVERSING, SHIFTING, FLIPPING TEXT | |
| PUBLIC KEY ENCRYPTION | CREATE A PRIVATE KEY/PAIR. IF A MESSAGE IS ENCRYPTED WITH YOUR PRIVATE YEY, ONLY YOUR PUBLIC JEY WILL DECRYPT IT. USA A PERSON'S PUBLIC KEY TO ENCRYPT A MESSAGE YOU'RE SENDING TO THEM. |
| CAESAR CIPHER | |
| ENCRYPTION | THE ART/SCIENCE OF PUTTING MESSAGES INTO A CODE, AND THE STUDY OF THOSE CODING TECHNIQUES. |
| DECRYPTION | THE MEANS BY WHICH TO BRING OUT THE MEANING FROM A CODED MESSAGE. |
| BISTABLE ENVIRONMENT | ELECTRONIC DEVICES ARE MOST RELIABLE IN THIS. DISTINGUISHING 2 ELECTRONIC STATES: CURRENT FLOWING OR NOT, DIRECTION OF FLOW. COMPUTERS ARE BISTABLE (HENCE BINARY). |
| SWITCH VS. RELAY | SWITCH- 2-STATE DEVICE WHICH CAN BE TOGGLED. RELAY- SWITCH BUILT INTO AN ELECTROMAGNET. CAN IMPLEMENT AND/OR/NOT GATES. WHEN THE CONTROLLING CURRENT IS 1, THE ELECTROMAGNET PULLS THE SWITCH CLOSED, AND THE CONTROLLED CURRENT FLOWS THROUGH THE SWITCH. |
| COMPUTING AND | WHEN BOTH INPUTS ARE 1, THE CIRCUIT IS CLOSED. 000/010/100/111 |
| COMPUTING OR | WHEN EITHER INPUT IS 1, THE CIRCUIT IS CLOSED. 000/011/101/111 |
| COMPUTING NOT | NEW TYPE OF SWITCH, WHICH IS CLOSED AT REST. 01/10 |
| TRANSISTORS | BI-STABLE, SOLID STATE DEVICES. SWITCHING ELECTRONIC, NOT MECHANICAL. NO MOVING PARTS. SMALL, FAST, RELIABLE. CAN SWITCH STATES IN ABOUT ONE 10 BILLIONTH OF A SECOND. 5 MILLION TRANSISTORS CAN FIT ON A CHIP 1CM SQ; DENSITY INCREASING RAPIDLY WICH NEW TECH |
| BOOLEAN LOGIC | DESCRIBES OPERATIONS ON TRUE/FALSE VALUES. MAPS EASILY ONTO BISTABLE ENVIRONMENTS. OPERATES ON ELECTRONIC SIGNALS, MAY BE BUILT FROM TRANSISTORS. EXPRESSIONS CONSTRUCTED BY COMBINING BOOLEAN OPERATIONS. TRUTH TABLES CAPTURE OUTPUT/VALUE OF B. EXPRESSION. |
| CIRCUIT | COLLECTION OF LOGIC GATES. TRANSFORMS SET OF BINARY INPUTS INTO OUTPUTS. VALUES OF OUTPUTS DEPENDANT ON CURRENT INPUT VALUE. COMBINATIONAL CIRCUITS – HAVE NO CYLCLES IN THEM (NO OUTPUTS FEED BACK INTO INPUTS) |
| COMPARE-FOR-EQUALITY CIRCUIT | COMPARES TWO UNSIGNED BINARY INTERGERS FOR EQUALITY. BUILT BY COMBINING TOGETHER 1-BIT COMPARISON CIRCUITS (1-CE). INTERGERS ARE -, IF CORRESPONDING BITS ARE =/ AND TOGETHER 1-CD CIRCUITS FOR EACH PAIR OF BITS. 00/01/10/11 |
| ADDITION CIRCUIT | ADDS TWO UNSIGNED BINARY INTERGERS, SETTING OUTPUT BITS AND AN OVERFLOW. BUILD FROM 1-BIT ADDERS (1-ADD). STARTING W/RIGHTMOST BITS, EACH PAIR PRODUCES A VALUE FOR THAT ORDER, A CARRY BIT FOR THE NEXT PLACE TO THE LEFT. |
| CONTROL CIRCUIT | MULTIPLEXORS/DECODERS. DO NOT PREFORM COMPUTATIONS. CHOOSE ORDER OF OPERATIONS, OR SELECT DATA VALUES DESCRIBED BY THE INSTRUCTION. THE PATTERN OF 1s/0s IN EACH INSTRUCTION WILL DETERMINE WHICH RESULT IS USED FROM THE ALU. |
| CPU | USES INSTRUCTIONS TO MOVE DATA AROUND THE COMPUTER, AND PRODUCE OUTPUT. FOLLOWS THE EXECUTION CYCLE, OVER AND OVER AGAIN: FETCH, DECODE, AND EVALUATE INSTRUCTIONS |
| HARDWARE | PHYSICAL MEDIA WHICH USES ELECTRONIC CURRENT TO PROCESS INSTRUCTIONS. |
| SOFTWARE | INSTRUCTIONS WRITTEN BY HUMANS TO TELL THE COMPUTER WHAT TO DO. |
| STORED-PROGRAM MODEL | 1946 VON NEUMANN. "VON NEUMANN ARCHITECTURE". OUR MODERN MACHINES ARE THIS, FUNDAMENTALLY. STORED BINARY ALGORITHM IN THE COMPUTERS MEMORY, ALONG W. DATA. 1ST ONES; EDVAC, EDSAC |
| VON NEUMANN | HIS ORGANIZATION = ALMOST EVERY MODERN COMPUTER. RAM/CPU/ I/O /SECONDARY STORAGE |
| ANALOG | INFORMATION WE GATHER THROUGH OUR SENSES IS PRIMARILY IN WAVES, AND TYPICALLY THIS. INFO CAN BE QUANTIFIED DOWN TO THE ATOM. |
| DIGITAL | ON/OFF, FULLY CHARGED/DISCHARGED. MAGNETIZED/DEMAGNETIZED. |
| BINARY | COMPUTER INFO COMES IN THIS FORM. 0=OFF, 1=ON. |
| VOLTAGE | DETECTION. 10 LVLS WOULD BE UNRELIABLE, NOT ENOUGH DIFFERENCES BTWN STATES. |
| BIT | 0 OR 1. BINARY DIGIT. |
| BYTE | COLLECTION OF 8 BITS. # OF BITS DETERMINES QTY. OF INFORMATION. 1=2STATES, 2=4STATES, 3=8STATES |
| MACHINE LANGUAGE | SIMPLE INSTRUCTIONS GIVEN BY PROGRAMMERS TO ACCOMPLISH TASKS. ASSEMBLY LANGUAGE TRANSLATED IS INTO THIS. COMPUTERS ONLY UNDERSTAND 1s & 0s. DIFFERENT FOR EACH PROCESSOR. |
| RAM | RANDOM ACCESS MEMORY. PROGRAMS AND DATA ARE STORED IN RAM FOR CPU USE. LOSES ITS MEMORY WHEN THE POWER GOES OFF. FINITE. |
| INPUT.OUTPUT | INPUT - KEYBOARDS, MOUSES, WII. OUTPUT -MONITORS, SPEAKERS, ETC. |
| SECONDARY STORAGE | CONTAINS MUCH MORE STORAGE THAN RAM. HARD DRIVES, USB DRIVES, DVD, CD |
| LOGARITHMS | 1614 NAPIER. CREATED TO SIMPLIFY MATHEMATICAL COMPUTATIONS |
| SLIDE RULE | 1622 |
| PASCALINE | ONE OF THE 1ST MECHANICAL CALCULATORS. COULD DO ADDITION AND SUBTRACTION |
| JAQUARD LOOM/LUDDITES | AUTOMATED LOOM W. PUNCHED CARD DESIGN. |
| DIFFERENCE ENGINE | 1823 BABBAGE. +, -, X, /, TO SIX SIGNIFICANT DIGITS. SOLOVE POLYMONIAL EQUATIONS AND OTHER COMPLEX PROGRAMS. LOVELACE 1ST PROGRAMMER. USED FOR GAMBLING ON HORSES |
| PROGRAMMABLE CENSUS CARDS | 1890 HOLLERITH. AUTOMATICALLY READ, TALLIED, AND SORTED DATA ON PUNCHED CARDS. |
| 1ST GENERAL PURPOSE COMPUTERS | POST 1940. FUELLED BY NEEDS OF WWII. MARK 1, ENIAC, ABC SYSTEM, COLOSSUS, Z1. |
| 1ST GENERATION COMPUTING 50-59 | USED VACCUUM TUBES TO STORE PROGRAMS/DATA. EACH COMPUTER= MULTIPLE ROOMS IN SIZE. NOT VERY RELIABLE. |
| 2ND GENERATION COMPUTING 59-65 | VACUUM TUBES REPLACED W. TRANSISTORS/MAGNETIC CORES. DRAMATIC SIZE REDUCTION. INCREASE-RELIABILITY/COST. HIGH LEVEL PROGRAMMING LANGUAGES. PROGRAMMER BORN |
| 3RD GENERATION COMPUTING 65-75 | USED INTEGRATED CIRCUITS. REDUCTION SIZE/COST. DESK SIZED COMPUTERS. FIRST MINICOMPUTER DEVELOPED. SOFTWARE INDUSTRY FORMED. |
| 4TH GENERATION COMPUTING 75-85 | TYPEWRITER SIZE. MICROCOMPUTER DEVELOPED (ALTAIR 8800) DESKTOP/PERSONAL PCS COMMON. COMPUTER NETWORKS, ELECTRONIC MAIL, GRAPHICAL USER INTERFACES, & EMBEDDED SYSTEMS APPEARED. |
| 5TH GENERATION COMPUTING 85-??? | MASSIVELY PARALLEL PROCESSORS. PDAs. HIGH RESOLUTION GRAPHICS. POWERFUL MULTIMEDIA INTERFACES. INTEGRATED GLOBAL COMMUNICATION. WIRELESS DATA. MASSIVE STORAGE DEVICES. UBIQUITOUS COMPUTING. |
Created by:
goldmeg89
Popular Computers sets