3450335
Descripción
Test por pstevens1963, actualizado hace más de 1 año
|
Creado por pstevens1963
hace alrededor de 9 años
|
|
Pregunta 1
Pregunta
Which data structure has a fixed size that can not be changed during run time?
Respuesta
-
Dynamic Data Structure
-
Static Data Structure
Pregunta 2
Pregunta
Which of the following are examples of dynamic data structures?
Respuesta
-
Binary Tree
-
Record Structure
-
An Array
-
A Two Dimensional Array
-
A Linked List
-
A Queue
-
A Stack
Pregunta 3
Pregunta
Which of the following are benefits of a static data structure?
Respuesta
-
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
Pregunta 4
Pregunta
The size of a dynamic data structure can increase and decrease during run time.
Respuesta
- True
- False
Pregunta 5
Pregunta
Which of the following a disadvantages of static dynamic data structures.
Respuesta
-
Programmer has to estimate space required
-
More difficult to program
-
Can waste a lot of memory space
-
Takes longer to implement searches
Pregunta 6
Pregunta
Which of the following are examples of static data structures?
Respuesta
-
Queue
-
Linked List
-
An Array
-
Binary Tree
-
A record structure
-
A two dimensional array
-
Stack
Pregunta 7
Pregunta
FIFO means [blank_start]First[blank_end] [blank_start]In[blank_end] [blank_start]First[blank_end] [blank_start]Out[blank_end]
Respuesta
-
First
-
In
-
First
-
Out
Pregunta 8
Pregunta
LIFO means [blank_start]Last[blank_end] [blank_start]In[blank_end] [blank_start]First[blank_end] [blank_start]Out[blank_end]
Respuesta
-
Last
-
In
-
First
-
Out
Pregunta 9
Pregunta
Which of the following a re variables found in a Queue?
Respuesta
-
Top
-
Rear
-
Max Number
-
Front
Pregunta 10
Pregunta
Which of the following operations puts an item of data onto a stack?
Respuesta
-
Pop
-
Push
Pregunta 11
Pregunta
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]
Respuesta
-
empty
Pregunta 12
Pregunta
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]
Respuesta
-
circular
-
queue
Pregunta 13
Pregunta
Where is an item of data removed from in a queue?
Respuesta
-
Front
-
Rear
Pregunta 14
Pregunta
An item of data is removed from the [blank_start]top[blank_end] of a stack data structure
Respuesta
-
top
Pregunta 15
Pregunta
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
Respuesta
-
estimate
-
guess
-
enter
-
memory
-
space
-
programming code
-
static
-
dynamic
¿Quieres crear tus propios Tests gratis con GoConqr? Más información.