3450335
Descrição
Quiz por pstevens1963, atualizado more than 1 year ago
|
Criado por pstevens1963
aproximadamente 9 anos atrás
|
|
Questão 1
Questão
Which data structure has a fixed size that can not be changed during run time?
Responda
-
Dynamic Data Structure
-
Static Data Structure
Questão 2
Questão
Which of the following are examples of dynamic data structures?
Responda
-
Binary Tree
-
Record Structure
-
An Array
-
A Two Dimensional Array
-
A Linked List
-
A Queue
-
A Stack
Questão 3
Questão
Which of the following are benefits of a static data structure?
Responda
-
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
Questão 4
Questão
The size of a dynamic data structure can increase and decrease during run time.
Responda
- True
- False
Questão 5
Questão
Which of the following a disadvantages of static dynamic data structures.
Responda
-
Programmer has to estimate space required
-
More difficult to program
-
Can waste a lot of memory space
-
Takes longer to implement searches
Questão 6
Questão
Which of the following are examples of static data structures?
Responda
-
Queue
-
Linked List
-
An Array
-
Binary Tree
-
A record structure
-
A two dimensional array
-
Stack
Questão 7
Questão
FIFO means [blank_start]First[blank_end] [blank_start]In[blank_end] [blank_start]First[blank_end] [blank_start]Out[blank_end]
Responda
-
First
-
In
-
First
-
Out
Questão 8
Questão
LIFO means [blank_start]Last[blank_end] [blank_start]In[blank_end] [blank_start]First[blank_end] [blank_start]Out[blank_end]
Responda
-
Last
-
In
-
First
-
Out
Questão 9
Questão
Which of the following a re variables found in a Queue?
Responda
-
Top
-
Rear
-
Max Number
-
Front
Questão 10
Questão
Which of the following operations puts an item of data onto a stack?
Responda
-
Pop
-
Push
Questão 11
Questão
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]
Responda
-
empty
Questão 12
Questão
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]
Responda
-
circular
-
queue
Questão 13
Questão
Where is an item of data removed from in a queue?
Responda
-
Front
-
Rear
Questão 14
Questão
An item of data is removed from the [blank_start]top[blank_end] of a stack data structure
Responda
-
top
Questão 15
Questão
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
Responda
-
estimate
-
guess
-
enter
-
memory
-
space
-
programming code
-
static
-
dynamic
Quer criar seus próprios Quizzes gratuitos com a GoConqr? Saiba mais.