Which data structure has a fixed size that can not be changed during run time?
Dynamic Data Structure
Static Data Structure
Which of the following are examples of dynamic data structures?
Binary Tree
Record Structure
An Array
A Two Dimensional Array
A Linked List
A Queue
A Stack
Which of the following are benefits of a static data structure?
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
The size of a dynamic data structure can increase and decrease during run time.
Which of the following a disadvantages of static dynamic data structures.
Programmer has to estimate space required
More difficult to program
Can waste a lot of memory space
Takes longer to implement searches
Which of the following are examples of static data structures?
Queue
Linked List
A record structure
A two dimensional array
Stack
FIFO means
LIFO means
Which of the following a re variables found in a Queue?
Top
Rear
Max Number
Front
Which of the following operations puts an item of data onto a stack?
Pop
Push
In a Queue data structure, if the Front Pointer and the Rear pointer have the same value then the queue is
If the rear of the queue is linked to the front of the queue then the type of queue is called a
Where is an item of data removed from in a queue?
An item of data is removed from the of a stack data structure
A programmer has to ❌ the amount of ❌ to allocate for a ❌ data structure
Please wait - loading…