data structures and algorithms: prelim quiz

dequeue

a linear list in which insertions and deletions are made to form either end of the structure

avail

which is the pointer associated with the availability list?

circular linked list

linear list in which the last node points to the first node

2

each node in singly linked list has … fields

circular linked list

linked lists, there are no NULL links in…

for the size of the structure and the data in the structure are constantly changing

linked lists are best suited …

small batches of records from a file

what is a run list?

underflow

situation when in a linked list START=NULL is

first record of the actual data

dummy header in linked list contains

list traversed in two directions

two way lists

0

value of first linked list index is …

singly linked list

linear list in which the pointer points only to the successive node

garbage collection

may take place only when there is some minimum amount or no space left in free storage list

link field

a linked list, the ____________ contains the address of next element in the list

two fields

each node in a linked list must contain at least

sentinel

indicates the end of the list

list

this refers to a linear collection of data items.

traversal

operation of processing each element in the list is known as …

traversal

the operation of processing each element in the list is known as …

two fields

each node in a linked list must contain at least …

circular linked list

in linked lists, there are no NULL links in …

circular linked list

linear list in which the last node points to the first node.

list

refers to a linear collection of data items

the new node is placed at the front of the linked list

what happens when you push a new node onto a stack?

top

a pointer variable which contains the location at the top element of the stack

infix to postfix, finding factorial, and tower of Hanoi

which of the following is an application of stack?

FIFO lists

which of the following names does not relate to stacks?

lifo

stack follows the strategy of …

bottom of the stack

linked representation of stack, the null pointer of the last node in the list signals …

FIFO, First In First Out

this form of access is used to add and remove nodes from a queue

reverse

the elements are removal from a stack in … order

back

new nodes are added to the ________ of the queue

FIFO, First In First Out

this form of access is used to add and remove nodes from a queue

LIFO

stack follows the strategy of …

push

the term used to insert an element into stack

all of these

which of the following is an application of stack?

push

this is the insertion operation in the stack