Save
Datorsystem
Kap 8 - Abstrakta datatyper
Save
Share
Learn
Content
Leaderboard
Share
Learn
Created by
Edi B
Visit profile
Cards (50)
What are the basic data structures mentioned?
Arrays
,
aggregates
, lists,
trees
View source
What are the types of lists mentioned?
Stacks
Queues
Ordinary Queues
Priority Queues
View source
What is an array?
A block of
data
with same
type
entries
View source
What does a two-dimensional array consist of?
Rows and columns
View source
What are indices used for in arrays?
To identify
positions
View source
What is an aggregate?
A block of
data items
of different types
View source
What is each data item in an aggregate called?
A
field
View source
How are fields accessed in aggregates?
By
name
View source
What defines a list?
A collection of
data
arranged
sequentially
View source
What is the head of a list?
The
beginning
of the list
View source
What is the tail of a list?
The
end
of
the
list
View source
What does LIFO stand for?
Last-in-first-out
View source
What is a stack?
A list where entries are removed at the
head
View source
What is the top of a stack?
The
head
of the list
View source
What is the bottom or base of a stack?
The
tail
of the list
View source
What does "pop" mean in stack terminology?
To remove the
entry
at the
top
View source
What does "push" mean in stack terminology?
To
insert
an
entry
at the
top
View source
What is a queue?
A list where entries are removed at the
head
View source
What does FIFO stand for?
First-in-first-out
View source
What does "enqueue" mean?
Add
element
to
queue
View source
What does "dequeue" mean?
Remove
element
from queue
View source
What is a priority queue?
A
queue
where
data
is moved by
priority
View source
What is a tree?
A collection of data with
hierarchical
organization
View source
What is a node in a tree?
An
entry
in a
tree
View source
What is the root node?
The node at the
top
View source
What is a terminal or leaf node?
A node at the
bottom
View source
What is a parent node?
The
node
above a
specified node
View source
What is a child node?
A node
below
a
specified
node
View source
What is an ancestor in tree terminology?
Parent,
parent
of parent, etc.
View source
What is a descendent in tree terminology?
Child,
child
of child, etc.
View source
What are siblings in tree terminology?
Nodes
sharing a common
parent
View source
What is a binary tree?
A tree with at most two children per
node
View source
What does depth refer to in a tree?
Longest path from
root
to
leaf
View source
What are the features of a class?
Abstract data type
Properties can be
inherited
Constructor methods to initialize
objects
Contents can be
encapsulated
View source
What is an object?
An instance of a
class
View source
What is the purpose of the push method in the StackOfIntegers class?
To
insert
an entry at the top
View source
What does the pop method do in the StackOfIntegers class?
Removes the
entry
at the
top
View source
What does the isEmpty method check in the StackOfIntegers class?
Whether the stack is
empty
View source
What does the isFull method check in the StackOfIntegers class?
Whether
the
stack
is
full
View source
What is the maximum size of the stack in the StackOfIntegers class?
20
View source
See all 50 cards
See similar decks
Datatypes
OCR Computer Science Paper 2
3 cards
Abstract logical thinking
6 Cs of care
1 card
Inductively-Defined Datatypes and Functions
COMPUTER SCIENCE UNIVERSITY > CS-175 Modelling Concepts 2
8 cards
Data Structures and Abstract Data Types
Computer Science > Paper 1
68 cards
Abstract Data Structures
Computer Science Revision
61 cards
abstract data types
cs practical (p2)
15 cards
4) Devise an abstract model
Computer science > 2 - Elements of computinal thinking > 2.1 - Understand what is meant by computational thinking > 1 - Thinking abstracly
No cards
Data Structures and Abstract Data Types
Computer Science Revision > Paper 1
25 cards
Devise an abstract model
computer science > paper 2 (Mr Bashford) > 2.1 > thinking abstractly
6 cards
Abstract Data Structures
A Level Computer Science > Paper1 > Fundamentals of Data Structures
2 cards
Data structures and abstract data types
A Level Computer Science AQA > Paper 1 > Fundamentals of data structures
35 cards
Data structures and abstract data types
Computer Science > Data Structures
3 cards
Abstract
HS132 : Understanding Typical Communication > x > BIN > Bilingual Development in Children (2021)
3 cards
2.1 Data Structures and Abstract Data Types
Paper 1 Computer Science > Unit 2 Data Structures
290 cards
Dynamic and static structures
Computer science > Paper 1 > Fundamentals of data structures
13 cards
Python Datatypes
28 cards
Files
A Level Computer Science AQA > Paper 1 > Fundamentals of data structures > Data structures and abstract data types
19 cards
Arrays
A Level Computer Science AQA > Paper 1 > Fundamentals of data structures > Data structures and abstract data types
8 cards
Data structures
A Level Computer Science AQA > Paper 1 > Fundamentals of data structures > Data structures and abstract data types
6 cards
Records
A Level Computer Science AQA > Paper 1 > Fundamentals of data structures > Data structures and abstract data types
2 cards
datatypes variables and constants
28 cards