3450335
Beschreibung
Quiz von pstevens1963, aktualisiert more than 1 year ago
|
Erstellt von pstevens1963
vor fast 9 Jahre
|
|
Frage 1
Frage
Which data structure has a fixed size that can not be changed during run time?
Antworten
-
Dynamic Data Structure
-
Static Data Structure
Frage 2
Frage
Which of the following are examples of dynamic data structures?
Antworten
-
Binary Tree
-
Record Structure
-
An Array
-
A Two Dimensional Array
-
A Linked List
-
A Queue
-
A Stack
Frage 3
Frage
Which of the following are benefits of a static data structure?
Antworten
-
Easier to program since storage requirements know in advance
-
Makes efficient use of memory space
-
Storage no longer required can be returned to the system to be used for other purposes
-
Compiler can allocate space during compilation
-
Easier to check for Overflow
Frage 4
Frage
The size of a dynamic data structure can increase and decrease during run time.
Antworten
- True
- False
Frage 5
Frage
Which of the following a disadvantages of static dynamic data structures.
Antworten
-
Programmer has to estimate space required
-
More difficult to program
-
Can waste a lot of memory space
-
Takes longer to implement searches
Frage 6
Frage
Which of the following are examples of static data structures?
Antworten
-
Queue
-
Linked List
-
An Array
-
Binary Tree
-
A record structure
-
A two dimensional array
-
Stack
Frage 7
Frage
FIFO means [blank_start]First[blank_end] [blank_start]In[blank_end] [blank_start]First[blank_end] [blank_start]Out[blank_end]
Antworten
-
First
-
In
-
First
-
Out
Frage 8
Frage
LIFO means [blank_start]Last[blank_end] [blank_start]In[blank_end] [blank_start]First[blank_end] [blank_start]Out[blank_end]
Antworten
-
Last
-
In
-
First
-
Out
Frage 9
Frage
Which of the following a re variables found in a Queue?
Antworten
-
Top
-
Rear
-
Max Number
-
Front
Frage 10
Frage
Which of the following operations puts an item of data onto a stack?
Antworten
-
Pop
-
Push
Frage 11
Frage
In a Queue data structure, if the Front Pointer and the Rear pointer have the same value then the queue is [blank_start]empty[blank_end]
Antworten
-
empty
Frage 12
Frage
If the rear of the queue is linked to the front of the queue then the type of queue is called a [blank_start]circular[blank_end] [blank_start]queue[blank_end]
Antworten
-
circular
-
queue
Frage 13
Frage
Where is an item of data removed from in a queue?
Antworten
-
Front
-
Rear
Frage 14
Frage
An item of data is removed from the [blank_start]top[blank_end] of a stack data structure
Antworten
-
top
Frage 15
Frage
A programmer has to [blank_start]estimate[blank_end] the amount of [blank_start]memory[blank_end] to allocate for a [blank_start]static[blank_end] data structure
Antworten
-
estimate
-
guess
-
enter
-
memory
-
space
-
programming code
-
static
-
dynamic
Möchten Sie mit GoConqr kostenlos Ihre eigenen Quiz erstellen? eigenen Mehr erfahren.