Databases - Upwork

Question: Which of the following data structures has a balanced condition?
A
AVL Tree

B
Doubly Linked List

C
Double Ended Queue

D
Stack

Note: Not available
1. Report
Question: A matrix is called sparse when______
A
most of its elements are non-zero

B
most of its elements are zero

C
all of its elements are non-zero

D
None of the above

Note: Not available
1. Report
Question: Which of the following operations in the simple linked list will modify the beginning of the linked list?
A
Deletion of the first node

B
Insertion after the last node

C
Insertion after the first node

D
None of the above

Note: Not available
1. Report
Question: 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?
A
The count must be zero

B
The count must be CAPACITY

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

D
None of the above

Note: Not available
1. Report
Question: What is the worst-case scenario for the binary search for finding a single item in an array?
A
Constant time

B
Logarithmic time

C
Linear time

D
Quadratic time

Note: Not available
1. Report
Question: A binary tree, all the levels of which except possibly the last have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as:
A
Full binary tree

B
2-Tree

C
Threaded tree

D
Complete binary tree

Note: Not available
1. Report
Question: What is the pre-order traversal equivalent of the following algebraic expression? [a+(b-c)]*[(d-e)/(f+(g-h))]
A
abc-+de-fg+h-/*

B
*+a-bc/-de+f-gh

C
a+*b-/c-d-e+fgh

D
*+a-bc-/d+e-fgh

Note: Not available
1. Report
Question: In the linked representation of a sparse matrix, the head node for a column list stores_____
A
a pointer to the next column head node

B
a pointer to the first node in the column list

C
column number

D
All of the above

Note: Not available
1. Report
Question: The hashing function which dynamically adapts to changes in the table being accessed is called ________.
A
Real

B
Linear

C
Partial

D
Virtual

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

B
Underflow

C
Null

D
Garbage collection

Note: Not available
1. Report

First Prev 14 15 16 17 18 Next Last

Question: Which of the following data structures has a balanced condition?

Question: A matrix is called sparse when______

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

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

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

Question: A binary tree, all the levels of which except possibly the last have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as:

Question: What is the pre-order traversal equivalent of the following algebraic expression? [a+(b-c)]*[(d-e)/(f+(g-h))]

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

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

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