Brainscape's Knowledge GenomeTM

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


See full index

Computing > Definitions > Flashcards

Definitions Flashcards

1
Q

Array

A

A finite, ordered set of elements of the same type.

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

Overflow

A

reached maximum size but trying to push

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

Underflow

A

empty but trying to pop.

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

Stacks

A

Items are added to the top of the stack and removed from the front.Used to hold return addresses when subroutines are called, when you press back in browser and undo in word processing.

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

List

A

An abstract data type consisting of a number of items which may occur more than once.

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

Pop

A

removing and returning an item from data strucutre

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

Push

A

Adding an item to a data structure

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

Queue

A

An ordered collection of items where new elements are added at the end of a queue and removed from the front of the queue. Used for waiting to print (queue on disk)

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

Dynamic Data Structure

A

A collection of data in memory that has the ability to increase or decrease in size while a program is running

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

Static Data Structure

A

A collection of data in memory that is fixed in size and cannot increase or decrease in size while the program is running.

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

Abstract data types

A

a data type created by the programmer rather than defined in a programming language.

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

Records

A

To store data permanently so you can read and update it at future dates. (Database)

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

Tuples

A

A dynamic data structure where the elements do not have to be the same type, and the number of elements in tuple can increase or decrease.

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

2-dimensional array

A

A collection of data items of the same data type Under one identifier but uses two index numbers. It can be represented as a table.

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

Compression

A

reduce the storage space of files on disk.

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

Lossy compression

A

non-essential information is removed from the original file.

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

Lossless compression

A

retains all information required to replicate the original file exactly.

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

Attribute

A

a property or characteristic of an entity.

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

Flat file database

A

consists of a single file (one entity).

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

Relational Databases

A

different entities in a system may be linked in some way, and the two entities are said to be related.

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

Primary Key

A

An entity’s unique identifier, normally a numeric ID.

22
Q

Secodary Key

A

An index so that something can be quickly searched up. It would be quicker to search a secondary key like a name than a primary key ID.

23
Q

Index

A

so that a record can be quickly located in the database an index is maintained so that it will give the position of each record. Primary keys and other things that are often searched (secondary keys) are indexed.

24
Q

Foreign Key

A

the attribute that links the two entities/table (attribute that is common in both tables, can be more than one.)

25
Q

Composite Primary Key

A

A primary key which consists of more than one attribute. (used when there is a many to many relationship between entities.)

26
Q

Referral integrity

A

states relationships must be consistent, so when a primary key field changes so does the foreign key that has the link. And ensuring a primary key that is responsible for the link is not deleted

27
Q

Normalisation

A

a process used to come up with the best possible design for a relational database.

28
Q

Internet

A

is a network of networks set up to allow computers to communicate with each other globally, using the same protocol.

29
Q

The World Wide Web (WWW)-

A

is a collection of web pages that resides on computers connected to the Internet.

30
Q

Internet Service Providers

A

distributes internet connection to smaller providers who provide it to individual homes.

31
Q

Uniform Resource Locators(URLs)

A

the full address of an Internet source.

32
Q

Domain Names

A

identifies the area that an internet resource resides in

33
Q

Domain Name System(DNS)

A

a hierarchical decentralized naming system for computers, services, or other resources connected to the Internet or a private network. It catalogues all domain names and has a table corresponding domain names to IP addresses

34
Q

Internet Protocol (IP addresses)

A

A unique address that is assigned to a network device.

35
Q

Wide Area Networks (WANs)

A

are distributed around different regions and can connect to multiple LANs. Also uses packet switching.

36
Q

Local Area Networks (LANs)

A

Is small and local consisting of a number of computing devices on a single site, connected by cables.

37
Q

Physical Bus Topology(Bus network)

A

in a LAN each node is connected to a main cable.

38
Q

Physical topology

A

how the network is interconnected with wires and cables.

39
Q

Logical topology

A

the communication mechanism for all nodes in a network and how they communicate across physical topology.

40
Q

Wi-fi

A

a local area wireless technology that enables you to connect a device such as a PC to a network resource

41
Q

Circuit switching

A

creates a direct link between two devices for the duration of the communication.

42
Q

Packet switching

A

Splits data into packets and send the data across a network. There can be multiple transmission at different frequencies meaning the bandwidth is in constant use

43
Q

Routers

A

used to connect to another network, traversing between them is called a hop.

44
Q

Gateways

A

Going from one network to another network with a different protocol requires a gateway.

45
Q

Media Access Control (MAC) addresses

A

Every computer device has NIC which has has its own MAC address which uniquely identifies the device.

46
Q

Protocol

A

a set of rules defining common methods of data communication. These rules need to be standard across all devices in order for them to communicate to each other.

47
Q

JavaScript

A

programs the behaviour of the web page

48
Q

HTML

A

a language used for creating web pages and web applications. The code describes the content and structure of a web page.

49
Q

CSS

A

a scripting language similar to HTML that is used to describe the layout and styles of a web page. (describes how HTML elements are to be displayed on screen, paper, or in other media).

50
Q

Client-server networking

A

One or more computers are known as clients and are connected to a powerful central computer (the server). The client is dependent on the server to provide and manage the information, and all data is stored on the server. In a large network there may be many servers, each performing different tasks.

Computing (13 decks)

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