Linked lists are best suited _____________________.
for the size of the structure and the data in the structure are constantly changing
The operation of processing each element in the list is known as ________________.
Traversal
The situation when in a linked list START=NULL is ____________________.
Underflow
Each node in singly linked list has _______ fields.
2
Which of the following is two way lists?
List traversed in two directions
Which is the pointer associated with the availability list?
Avail
Value of first linked list index is _______________.
0
In linked lists, there are no NULL links in ______________
Circular linked list
Each node in a linked list must contain at least ___________________.
Two fields
The dummy header in linked list contains ____________________.
First record of the actual data
In a linked list, the ____________ contains the address of next element in the list.
Link field
LINK is the pointer pointing to the ____________________.
Predecessor node
This refers to a linear collection of data items.
List
What is a run list?
Small batches of records from a file
This indicates the end of the list.
Sentinel
This is a linear list in which insertions and deletions are made to form either end of the
structure.
Dequeue
Indexing the ________________ element in the list is not possible in linked lists.
Middle
A linear list in which the pointer points only to the successive node.
Singly linked list
This may take place only when there is some minimum amount or no space left in free storage
list.
Garbage collection
A linear list in which the last node points to the first node.
Circular linked list
This form of access is used to add and remove nodes from a queue.
FIFO, First In First Out
In linked representation of stack, ___________ fields hold the elements of the stack.
INFO
This form of access is used to add/remove nodes from a stack.
LIFO
In the linked representation of the stack, __________ pointer behaves as the top pointer variable
of stack.
Start
New nodes are added to the ________ of the queue.
Back
In linked representation of stack, the null pointer of the last node in the list signals
_____________________.
Bottom of the stack
What happens when you push a new node onto a stack?
The new node is placed at the front of the linked list
What is a queue?
FIFO
Which of the following names does not relate to stacks?
FIFO lists
The retrieval of items in a stack is ___________ operation.
Pop
The term push and pop is related to _____________.
Stacks
Which is the pointer associated with the stack?
Top
The elements are removal from a stack in _________ order.
Reverse
This is the insertion operation in the stack.
Push
The term used to insert an element into stack.
Push
Stack follows the strategy of ________________.
LIFO
This is the term used to delete an element from the stack.
Pop
Deletion operation is done using __________ in a queue.
Front
A pointer variable which contains the location at the top element of the stack.
Top
Which of the following is an application of stack?
All
The worst case occurs in linear search algorithm when ________________.
Item is the last element in the array or is not there at all
If the number of records to be sorted is small, then __________ sorting can be efficient.
Selection
The complexity of sorting algorithm measures the __________ as a function of the number n of
items to be shorter.
Running time
Which of the following is not a limitation of binary search algorithm?
Binary search algorithm is not efficient when the data elements more than 1500
The average case occurs in linear search algorithm _______________.
When item is somewhere in the middle of the array
Binary search algorithm cannot be applied to _______________.
Sorted linked list
The complexity of linear search algorithm.
O(n)
Sorting algorithm can be characterized as ________________.
Both
State True or False for internal sorting algorithms.
i. Internal sorting are applied when the entire collection if data to be sorted is small enough that
the sorting can take place within main memory.
ii. The time required to read or write is considered significant in evaluating the performance of
internal sorting.
True, false
The complexity of bubble sort algorithm.
O(n2)
The complexity of merge sort algorithm.
O(n logn)
__________________ is putting an element in the appropriate place in a sorted list yields a larger
sorted order list.
Insertion
_____________ order is the best possible for array sorting algorithm which sorts n item.
O(n+logn)
The rearranging of pairs of elements which are out of order, until no such pairs remain.
Exchange
The method used by card sorter.
Radix sort
Which of the following sorting algorithm is of the divide and conquer type?
Merge sort
___________ sorting algorithm is frequently used when n is small, where n is the total number of
elements.
Insertion
Which of the following sorting algorithm is of priority queue sorting type?
Selection sort
Which of the following is not the required condition for binary search algorithm?
There must be mechanism to delete and/or insert elements in list
Partition and exchange sort is ____________.
Quick sort
This is the operation of processing each element in the list.
Traversal
Another name for directed graph.
Digraph
These are binary trees with threads.
Threaded trees
Graph G is _____________ if for any pair u, v of nodes in G, there is a path from u to v or path
from v to u.
Unliterally connected
In binary trees, nodes with no successor are called _______________.
Terminal nodes
A connected graph T without any cycles is called ________________.
Free graph
Trees are ________ if they are similar and have the same contents at corresponding nodes.
Copies
A connected graph T without any cycles is called a ____________.
All of these
Every node N in a binary tree T except the root has a unique parent called the ________ of N.
Predecessor
In a graph, if E=(u,v), it means _____________.
E begins at processor u and ends at successor v
What does the sequential representation of binary trees use?
Array with pointers
In a graph, if e=[u,v], then u and v are called _______________
All of the choices
TREE[1]=NULL indicates tree is _________
Empty
This is a binary tree whose every node has either zero or two children.
Extended binary tree
Linked representation of binary tree needs ______ parallel arrays.
The depth of complete binary tree is given by ________________.
Dn = log2n+1
In a 2-tree, nodes with 0 children are called ___________.
External node
Which indicates pre-order traversal?
Root, left sub-tree, right sub-tree
In an extended binary tree, nodes with 2 children are called _________________.
Internal node
This is a terminal node in a binary tree.
Leaf
