Chapter 9&10 - Algorithm Design And Program Solving + Data Types & Structures Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

Abstraction

A

The process of extracting information that is essential while ignoring what is not relevant for the provision of a solution

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

Decomposition

A

The process of breaking a complex problem down into smaller parts

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

Pattern recognition

A

Identification of parts of a problem that are similar and could use the same solution

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

Structured English

A

Method of showing the logical steps in an algorithm, using an agreed subset of straightforward English words for commands and mathematical operations

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

Flowchart

A

Diagrammatic representation of an algorithm

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

Algorithm

A

Ordered set of steps to be followed in the completion of a task

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

Pseudocode

A

Method of showing the detailed logical steps in an algorithm, using key words, identifiers with meaningful names, and mathematical operators

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

Stepwise refinement

A

The practice of subdividing each part of a larger problem into a series of smaller parts, and so on, as required

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

Benefits of abstraction (3)

A

Time required to develop the program is reduced so the program can be delivered to the customer more quickly
Program is smaller in size so takes up less space in memory and download times are shortened
Customer satisfaction is greater as their requirements are met without any irrelevant features

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

Process of abstraction (3)

A

Identify purpose of the model of the situation
Identify sources of information
Use information gathered from appropriate sources to identify what details aren’t necessary and need to be removed

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

Data type

A

Classification attributed to an item of data, which determines the types of value it can take and how it can be used

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

Identifier

A

Unique name applied to an item of data

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

Record (data type)

A

Composite data type constructed using several of the basic data types available in a particular programming language

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

Array

A

Data structure containing several elements of the same data type

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

Index [array]

A

Numerical indicator of an item of data’s position in an array

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

Lower bound

A

Index of the first element in an array, usually 1 or 0

17
Q

Upper bound

A

Index of the last element in an array

18
Q

Linear search

A

Method of searching in which each element of an array is checked in order to

19
Q

Bubble sort

A

Method of sorting data in an array into alphabetical/numerical order items and swapping them if they are in the wrong order

20
Q

File

A

Collection of data stored by a computer program to be used again

21
Q

ADT

A

Abstract data type
Collection of data and a set of operations on that data

22
Q

Stack

A

List containing several items operating on the last in, first out principle

23
Q

Queue

A

List containing several items operating on the first in, first out principle

24
Q

Linked list

A

List containing several items in which each item in the list points to the next item in the list

25
Q

Basic data types (6)

A

String
Boolean
Char
Date
Integer
Real

26
Q

Uses of stacks (3)

A

Memory management
Expression evaluation
Backtracking in recursion

27
Q

Uses of queues (3)

A

Management of files sent to a printer
Buffers used with keyboards
Scheduling

28
Q

Uses of linked lists (3)

A

Using arrays to implement a stack
Using arrays to implement a queue
Using arrays to implement a binary tree

29
Q

3 ADTs

A

Linked lists
Stacks
Queues