ITE-6201 - Data Structures and Algorithm Analysis oed answer key

Showing 21 to 40 of 228 total answers.

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

Stack consists of five basic operations

Answer

True

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

The complexity of merge sort algorithm.

Answer

O(n logn)

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

The top element of a tree is called the

Answer

root

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

The complexity of bubble sort algorithm.

Answer

O(n2)

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

To take the topmost element from a stack

Answer

pop()

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

TREE[1]=NULL indicates tree is _________

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

Which of the following is two way lists?

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

This is a terminal node in a binary tree.

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

Which of the following is a two-way list?

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

A NULL pointer does not always mean empty.

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

An electronic address book ordered by name

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

Stack is also called the ________________.

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

The complexity of linear search algorithm.

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

pop() takes the first element of the stack.

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

Stack and Queue is a linear data structure.

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

There are 3 auxiliary operations of a stack

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

A binary search cannot be applied to a tree.

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

A leaf in a tree is a node with no children.

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

Partition and exchange sort is ____________.

Page 2 of 12