Databases - Upwork

Question: The operation for removing an entry from a stack is traditionally called _______.
A
delete

B
peek

C
pop

D
remove

Note: Not available
1. Report
Question: Which queue allows insertion and deletion at both ends?
A
Simple queue

B
Circular queue

C
Dequeue

D
Special queue

Note: Not available
1. Report
Question: What kind of initialization needs to be done for a chained hash table?
A
None

B
The key at each array location must be initialized

C
The head pointer of each chain must be set to NULL

D
Both B and C must be carried out

Note: Not available
1. Report
Question: The number of nodes in the largest maximal independent set of the complete bipartite graph K(4,2) is_____ .
A
2

B
3

C
4

D
6

Note: Not available
1. Report
Question: Which of the following techniques is used to resolve collision in hashing?
A
Separate chaining

B
Open addressing

C
Linear probing

D
All of the above

Note: Not available
1. Report
Question: 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?
A
Neither of them changes

B
Only front_ptr changes

C
Only rear_ptr changes

D
Both change

Note: Not available
1. Report
Question: Which of the following operations is performed more efficiently by the doubly linked list than by the linear linked list?
A
Deleting a node the location of which is given

B
Searching an unsorted list for a given item

C
Inserting a node after the node with a given location

D
Traversing the list to process each node

Note: Not available
1. Report
Question: 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?
A
ABCD

B
ABDC

C
DCAB

D
DCBA

Note: Not available
1. Report
Question: What is the meaning of the statement: "Entries in a stack are 'ordered'"?
A
A collection of stacks can be sorted

B
Stack entries may be compared with the '<' operation

C
The entries must be stored in a linked list

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

Note: Not available
1. Report
Question: A given connected graph G is a Euler graph if and only if all vertices of G are of ______.
A
the same degree

B
even degrees

C
odd degrees

D
different degrees

Note: Not available
1. Report

First Prev 13 14 15 16 17 Next Last

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

Question: Which queue allows insertion and deletion at both ends?

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

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

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

Question: 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?

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

Question: 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?

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

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