3450335
Description
Quiz by pstevens1963, updated more than 1 year ago
|
Created by pstevens1963
about 9 years ago
|
|
Question 1
Question
Which data structure has a fixed size that can not be changed during run time?
Answer
-
Dynamic Data Structure
-
Static Data Structure
Question 2
Question
Which of the following are examples of dynamic data structures?
Answer
-
Binary Tree
-
Record Structure
-
An Array
-
A Two Dimensional Array
-
A Linked List
-
A Queue
-
A Stack
Question 3
Question
Which of the following are benefits of a static data structure?
Answer
-
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
Question 4
Question
The size of a dynamic data structure can increase and decrease during run time.
Answer
- True
- False
Question 5
Question
Which of the following a disadvantages of static dynamic data structures.
Answer
-
Programmer has to estimate space required
-
More difficult to program
-
Can waste a lot of memory space
-
Takes longer to implement searches
Question 6
Question
Which of the following are examples of static data structures?
Answer
-
Queue
-
Linked List
-
An Array
-
Binary Tree
-
A record structure
-
A two dimensional array
-
Stack
Question 7
Question
FIFO means [blank_start]First[blank_end] [blank_start]In[blank_end] [blank_start]First[blank_end] [blank_start]Out[blank_end]
Answer
-
First
-
In
-
First
-
Out
Question 8
Question
LIFO means [blank_start]Last[blank_end] [blank_start]In[blank_end] [blank_start]First[blank_end] [blank_start]Out[blank_end]
Answer
-
Last
-
In
-
First
-
Out
Question 9
Question
Which of the following a re variables found in a Queue?
Answer
-
Top
-
Rear
-
Max Number
-
Front
Question 10
Question
Which of the following operations puts an item of data onto a stack?
Answer
-
Pop
-
Push
Question 11
Question
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]
Answer
-
empty
Question 12
Question
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]
Answer
-
circular
-
queue
Question 13
Question
Where is an item of data removed from in a queue?
Answer
-
Front
-
Rear
Question 14
Question
An item of data is removed from the [blank_start]top[blank_end] of a stack data structure
Answer
-
top
Question 15
Question
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
Answer
-
estimate
-
guess
-
enter
-
memory
-
space
-
programming code
-
static
-
dynamic
Want to create your own Quizzes for free with GoConqr? Learn more.