A linear list in which the pointer points only to the Singly linked list

successive node.

Indexing the ________________ element in the list is middle

not possible in linked lists.
Which of the following is a two-way list? List traversed in two directions
LINK is the pointer pointing to the predecessor node
____________________.
This refers to a linear collection of data items. LIST
The operation of processing each element in the list is
known as ________________. traversal
The dummy header in linked list contains first record of the actual data
____________________.
In linked lists, there are no NULL links in circular linked list
______________
In a linked list, the ____________ contains the address Link field
of next element in the list.
Which is the pointer associated with the availability AVAIL
list?
The situation when in a linked list START=NULL is Underflow
____________________.

This is a linear list in which insertions and deletions are Dequeue

made to form either end of the structure.

Linked lists are best suited _____________________. For the size of the structure and the data in the structure
are constantly changing.
This indicates the end of the list. Sentinel

Each node in singly linked list has _______ fields. 2

Each node in a linked list must contain at least Two fields

___________________.

Value of first linked list index is _______________. 0

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

“UGRD-ITE6201-2016S- Data Structure & Algorithm”

Prelim Quiz 1: 10/10 Prelim Quiz 2: 10/10 Prelim Exam: 30/30 Midterm Quiz 1: 10/10 Midterm Quiz 1: 10/10

Note: NOT ALL ANSWERS ARE HERE. Please go to this website below
https://jennysonline.blogspot.com/2019/07/data-structures-and-algorithm-analysis_13.html
A linear list in which the last node points to the first circular linked list
node.

This form of access is used to add/remove nodes from LIFO

a stack.
New nodes are added to the ________ of the queue. Back

Which is the pointer associated with the stack? TOP

Which of the following is an application of stack? All of these

What is a queue? FIFO

This is the term used to delete an element from the Pop

stack.

This is the insertion operation in the stack. Push

Which of the following names does not relate to FIFO list

stacks?

In the linked representation of the stack, __________ Start

pointer behaves as the top pointer variable of stack.
The term used to insert an element into stack. push

The retrieval of items in a stack is pop

___________ operation.
In linked representation of stack, ___________ INFO
fields hold the elements of the stack.
The term push and pop is related to Stacks
_____________.
What is a run list? small batches of records from a file
What happens when you push a new node onto a The new node is placed at the front of the linked list
stack?

Deletion operation is done using __________ in a front

queue.

The dummy header in linked list contains first record of the actual data
____________________.
 The elements are removal from a stack in _________ Reverse
order.

This is a linear list in which insertions and deletions are Dequeue

made to form either end of the structure.
This is the term used to delete an element from the Underflow
stack.
Stack follows the strategy of ________________. LIFO
A pointer variable which contains the location at the Top
top element of the stack.
In linked representation of stack, the null pointer of Bottom of the Stack
the last node in the list signals

Fill in the following table, using Big-O notation to give the worst and average-case times for each of the
stack methods for a stack of size N.

OPERATION WORST-CASE TIME AVERAGE-CASE TIME

Constructor O(1) O(1)
empty O(1) O(1)
size O(1) O(1)
push O(N) O(1)
pop O(1) O(1)
peek O(1) O(1)