Data Structures and Algorithms Quiz # 5

The operation for removing an entry from a stack is traditionally called _______.

delete

peek

pop

remove

Which queue allows insertion and deletion at both ends?

Simple queue

Circular queue

Dequeue

Special queue

What kind of initialization needs to be done for a chained hash table?

None

The key at each array location must be initialized

The head pointer of each chain must be set to NULL

Both B and C must be carried out

The number of nodes in the largest maximal independent set of the complete bipartite graph K(4,2) is_____ .

2

3

4

6

Which of the following techniques is used to resolve collision in hashing?

Separate chaining

Open addressing

Linear probing

All of the above

You have implemented a queue with a linked list keeping track of a front pointer and a rear pointer. Which of these pointers will you change during an insertion into a NONEMPTY queue?

Neither of them changes

Only front_ptr changes

Only rear_ptr changes

Both change

Which of the following operations is performed more efficiently by the doubly linked list than by the linear linked list?

Deleting a node the location of which is given

Searching an unsorted list for a given item

Inserting a node after the node with a given location

Traversing the list to process each node

Four characters are placed in a queue in the following order: D, C, B, and A. If they are removed one at a time, what will be the order of their removal?

ABCD

ABDC

DCAB

DCBA

What is the meaning of the statement: "Entries in a stack are 'ordered'"?

A collection of stacks can be sorted

Stack entries may be compared with the '<' operation

The entries must be stored in a linked list

There is a first entry, a second entry, and so on

A given connected graph G is a Euler graph if and only if all vertices of G are of ______.

the same degree

even degrees

odd degrees

different degrees

Which of the following data structures has a balanced condition?

AVL Tree

Doubly Linked List

Double Ended Queue

Stack

A matrix is called sparse when______

most of its elements are non-zero

most of its elements are zero

all of its elements are non-zero

None of the above

Which of the following operations in the simple linked list will modify the beginning of the linked list?

Deletion of the first node

Insertion after the last node

Insertion after the first node

None of the above

You have implemented a queue with a circular array keeping track of the first item, the last item, and the count (the number of items in the array). Suppose the address of the first is zero, and that of the last is CAPACITY-1, what can you say about the count?

The count must be zero

The count must be CAPACITY

The count can be zero or CAPACITY, but no other value can occur

None of the above

In the linked representation of a sparse matrix, the head node for a column list stores_____

a pointer to the next column head node

a pointer to the first node in the column list

column number

All of the above

The hashing function which dynamically adapts to changes in the table being accessed is called ________.

Real

Linear

Partial

Virtual

What will happen if in data structure a pop operation on the stack causes the stack pointer to move past the origin of the stack?

Overflow

Underflow

Null

Garbage collection

If h is the depth of the tree, which formula will be used to find the maximum number of nodes n in a perfect binary tree?

2h + 1 - 1

2h + 1

2h

2h + 1 + 1

What is the minimum number of edges and vertices possible in a non- planar graph?

10 edges, 5 vertices

9 edges, 6 vertices

6 edges, 4 vertices

9 edges, 5 vertices

Which of the following is the worst-case scenario for operations on heaps?

Neither insertion nor removal is better than linear

Insertion is better than linear, but removal is not

Removal is better than linear, but insertion is not

Both insertion and removal are better than linear

Which of these are standard operations of Stack Data Structure?

Push, delete

Insert, pop

Put, extract

Push, pop

Suppose we have a circular array implementation of a queue, with ten items in the queue stored at data[2] through data[11]. The CAPACITY is 42. Where does the enqueue member function place the new entry in the array?

data[1]

data[2]

data[11]

data[12]

A binary search tree is generated by inserting the following integers in the order: 50,15,62,5,20,58,91,3,8,37,60,24. How many nodes are in the left and right subtrees, respectively?

(4,7)

(7,4)

(8,3)

(3,8)

What is the worst-case scenario for the binary search for finding a single item in an sorted array?

Constant time

Logarithmic time

Linear time

Quadratic time

What is the maximum depth of recursive calls a function may make?

1

2

n (where n is the argument)

There is no fixed maximum

Consider this binary search tree.
This question is based upon the figure shown below
Consider this binary search tree.
Which will be the new root if you remove the root and replace it with something from the left subtree?

1

2

4

5

You have implemented a queue with a linked list keeping track of a front pointer and a rear pointer. Which of these pointers will you change during an insertion in the middle of a NONEMPTY queue?

Neither of them changes

Only front_ptr changes

Only rear_ptr changes

Both change

The number of distinct simple graphs with up to three nodes is _______.

15

10

7

9

Which formula is the best approximation for the depth of a heap with n nodes?

log (base 2) of n

The number of digits in n (base 10)

The square root of n

n

What do we call a binary tree in which all the levels, except possibly the last level, have the maximum number of nodes, and in which all the nodes at the last level appear as far left as possible?

Full binary tree

2-Tree

Threaded tree

Complete binary tree

Quiz:	Data Structures and Algorithms Quiz # 5
Subject:	Basic Data Structures And Algorithms
Total Questions:	286 MCQs
Time:	286 Minutes

Data Structures and Algorithms Quiz # 5

The operation for removing an entry from a stack is traditionally called _______.

Which queue allows insertion and deletion at both ends?

What kind of initialization needs to be done for a chained hash table?

The number of nodes in the largest maximal independent set of the complete bipartite graph K(4,2) is_____ .

Which of the following techniques is used to resolve collision in hashing?

You have implemented a queue with a linked list keeping track of a front pointer and a rear pointer. Which of these pointers will you change during an insertion into a NONEMPTY queue?

Which of the following operations is performed more efficiently by the doubly linked list than by the linear linked list?

Four characters are placed in a queue in the following order: D, C, B, and A. If they are removed one at a time, what will be the order of their removal?

What is the meaning of the statement: "Entries in a stack are 'ordered'"?

A given connected graph G is a Euler graph if and only if all vertices of G are of ______.

Which of the following data structures has a balanced condition?

A matrix is called sparse when______

Which of the following operations in the simple linked list will modify the beginning of the linked list?

You have implemented a queue with a circular array keeping track of the first item, the last item, and the count (the number of items in the array). Suppose the address of the first is zero, and that of the last is CAPACITY-1, what can you say about the count?

In the linked representation of a sparse matrix, the head node for a column list stores_____

The hashing function which dynamically adapts to changes in the table being accessed is called ________.

What will happen if in data structure a pop operation on the stack causes the stack pointer to move past the origin of the stack?

If h is the depth of the tree, which formula will be used to find the maximum number of nodes n in a perfect binary tree?

What is the minimum number of edges and vertices possible in a non- planar graph?

Which of the following is the worst-case scenario for operations on heaps?

Which of these are standard operations of Stack Data Structure?

Suppose we have a circular array implementation of a queue, with ten items in the queue stored at data[2] through data[11]. The CAPACITY is 42. Where does the enqueue member function place the new entry in the array?

A binary search tree is generated by inserting the following integers in the order: 50,15,62,5,20,58,91,3,8,37,60,24. How many nodes are in the left and right subtrees, respectively?

What is the worst-case scenario for the binary search for finding a single item in an sorted array?

What is the maximum depth of recursive calls a function may make?

Consider this binary search tree.This question is based upon the figure shown belowConsider this binary search tree.Which will be the new root if you remove the root and replace it with something from the left subtree?

You have implemented a queue with a linked list keeping track of a front pointer and a rear pointer. Which of these pointers will you change during an insertion in the middle of a NONEMPTY queue?

The number of distinct simple graphs with up to three nodes is _______.

Which formula is the best approximation for the depth of a heap with n nodes?

What do we call a binary tree in which all the levels, except possibly the last level, have the maximum number of nodes, and in which all the nodes at the last level appear as far left as possible?

Consider this binary search tree.
This question is based upon the figure shown below
Consider this binary search tree.
Which will be the new root if you remove the root and replace it with something from the left subtree?