Part 1 ITE6201 Data Structures and Algorithm Analysis

 ITE6201 Data Structures and Algorithm Analysis

Which is the pointer associated with the availability list?

Select one:

Feedback

A simple sorting algorithm that works the way we sort playing cards in our hands.
Select one:

Feedback

stack() creates an empty stack.
Select one:

Feedback

A Data Structure that can be accessed only at one of its ends for storing and retrieving data.
Select one:

Feedback

Which of the following is two way lists?

Select one:

Feedback

Unsorted lists are elements arranged according to some criteria.
Select one:

Feedback

In linked lists, there are no NULL links in ______________

Select one:

Feedback

The situation when in a linked list START=NULL is ____________________.

Select one:

Feedback

Value of first linked list index is _______________.

Select one:

Feedback

Each node in a linked list must contain at least ___________________.

Select one:

Feedback

dequeue() takes the last element from the queue.
Select one:

Feedback

Stack and Queue is a linear data structure.
Select one:

Feedback

Stack and Queue is a linear data structure.
Select one:

Feedback

What is a run list?

Select one:

Feedback

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

Select one:

Feedback

To take the topmost element from a stack
Select one:

Feedback

This indicates the end of the list.

Select one:

Feedback

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

Select one:

Feedback

There are two types of linked lists; sorted lists and unsorted lists.
Select one:

Feedback

Accessing a linked list from head node until the last node of the list is
Select one: