Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

CSP - The Internet > The Internet > Flashcards

The Internet Flashcards

1
Q

fault tolerance

A

a process that enables an operating system to respond to a failure in hardware or software

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

what is the internet?

A

● A philosophy of making information and
knowledge open and accessible to ALL
● A network of networks
● Built on open, agreed upon protocols

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

the internet…

A
  • is decentralized
  • has a high fault tolerance
  • is scalable
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

decentralized

A

controlled by several local offices or authorities rather than one single one

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

computing device

A
  • object that can run a program
  • ex. computer, tablets, servers, routers
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

computing system

A

group of computing devices and programs working together for a common purpose

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

computing networks

A
  • a group of interconnected computing devices capable of sending or receiving data
  • type of computing system
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

path

A

the sequence of directly connected computing devices that begins at the sender and ends at the receiver

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

routing

A
  • the process of finding a path from sender to receiver
  • dynamic (not pre decided)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

bandwidth

A
  • the maximum amount of data that can be sent in a fixed amount of time
  • usually measured in bits per second
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

modem

A

Allows Computers to talk to
one another over telephone
lines

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

how to organize data

A
  1. Chunk your data into pieces: packets
  2. Individually route the packers on the most efficient path
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

packets have…

A

metadata

**Who is sending the
data, Where are the
sending it, Instructions for
reassembling the
data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

packets might arrive….

A

In order, Out of Order, Not at all

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

protocols

A
  • agreed-upon set of rules that specify the behavior of a system
  • open and available to everyone
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

internet protocol (IP)
a set of standards for addressing and routing data on the Internet

IPv4 vs IPv6
- IPv4: 32-bit address; est. 1981; 4.3 billion possible addresses; ex. 192.168.1.1

  • IPv6: 128-bit address; est. 2012; 340 undecillion possible addresses; ex. 2001:0db8::1
A
17
Q

when to use TCP

A
  • When things need to be perfect
  • Used for programs, emails, webpages
  • Doubling network traffic
18
Q

transmission control protocol (TCP)

A
  • designed to send packets across the internet and ensure the successful delivery of data and messages
  • uses packet switching
  • finds the most efficient pathways
  • Makes sure files are downloaded completely and correctly
  • Adds its own header to packets
  • Requires an acknowledgement OR it resends
19
Q

internet service provider (ISP)

A
  • your IP address is assigned to you by your ISP
  • your internet activity goes through the ISP, and they route it back to you, using your IP address.
20
Q

IPv4

A
  • IPv4: 32-bit address; est. 1981; 4.3 billion possible addresses; ex. 192.168.1.1
21
Q

IPv6

A
  • IPv6: 128-bit address; est. 2012; 340 undecillion possible addresses; ex. 2001:0db8::1
22
Q

user datagram protocol (UDP)

A
  • When speed is more important than perfection
  • Adds header information
  • Destination computer does not acknowledge receipt of packets
  • Faster but risks dropped packets
23
Q

hypertext transfer protocol

A
  • Used for accessing web pages
  • Hypertext documents contain texts with links
  • HTTP send information back in plain text
  • HTTPS = encrypts
  • S stands for SSL protocol (Secure Sockets Layer)
24
Q

domain name system (DNS)

A
  • Service that maps IP addresses to their domain name
  • Instead of 216.58.216.142 you can type testout.com
  • DNS server looks up the IP address and sends it back to the host computer
25
Q

world wide web vs. internet

A

WWW - the pages you see when you’re at a device and you’re online

internet - the network of connected computers that the web works on, as well as what emails and files travel across

***The Web uses The Internet

26
Q

sequential computing

A

computational model in which operations are performed in order one at a time

27
Q

parallel computing

A

computational model where the program is broken into multiple smaller sequential computing operations, some of which are performed simultaneously

28
Q

computer processing unit (CPU)

A

the CPU follows, or executes, each line of the computer program in order, turning the data from the user into information. This is called processing.

29
Q

cores

A
  • physically separate processing units on the same CPU
  • allows for parallel processing

**e-cores = efficiency
**p-cores = performance

30
Q

threads

A
  • Creates virtual separate processing units on the same core
31
Q

distributed computing

A

computational model in which multiple devices are used to run a program

32
Q

comparing efficiency of solutions

A

can be done by comparing the time it takes them to perform the same task.

33
Q

sequential solution

A

takes as long as the sum of all of its steps

34
Q

parallel computing solution

A

takes as long as its sequential tasks plus the longest of its parallel tasks

35
Q

parallel computing

A
  • Parallel computing consists of a parallel portion and a sequential portion
  • can scale more effectively than solutions that use sequential computing
  • When increasing the use of parallel computing in a solution, the efficiency of the solution is still limited by the sequential portion. At some point, adding parallel portions will no longer meaningfully increase efficiency.
36
Q

distributed computing

A
  • allows problems to be solved that could not be solved on a single computer because of either the processing time or storage needs involved
37
Q

speed-up of parallel solution

A

time for sequential processing / time for parallel processing

CSP - The Internet (1 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions