In: Computer Science
QUESTION 11
Which of the following statements about graphs is false?
A graph is a collection of nodes and a collection of segments connecting pairs of nodes. |
||
Graphs are a directed tree structure. |
||
A path is a sequence of vertices in which each vertex is adjacent to the next one. |
||
Graphs may be directed or undirected. |
||
The degree of a vertex is the number of lines incident to it. |
QUESTION 12
Which of the following statements about linked lists is false?
Linked list searches are highly efficient searches. |
||
Data insertion in a linked list is more efficient than insertion in an array. |
||
Nodes in a linked list contain data and links implemented as pointers. |
||
Linked list nodes are self-referential. |
||
Linked lists can be used to process a single field, multiple fields, or structures. |
QUESTION 13
Which of the following statements about queue design is false?
Queues are usually implemented using a linked list structure. |
||
The queue head structure normally contains a front, rear, and a count. |
||
Queue inserts are made at the rear of the queue. |
||
Queue deletes are made at the front of the queue. |
||
Queue traversals start at the head and proceed to the rear. |
QUESTION 14
Which of the following statements about queue insertion is true?
Queue insertion takes place at the front of the queue. |
||
If there is not enough room in memory for another node, the queue is in an overflow state. |
||
When a node is inserted, only the front pointer needs to be adjusted. |
||
Queue insertion requires a search algorithm to locate the insertion position within the list. |
||
Each node in a queue points to its predecessor. |
QUESTION 15
Which of the following statements about queues is false?
A queue is a linear list. |
||
Data are inserted at the rear of the queue. |
||
Data are deleted from the front of the queue. |
||
The basic queue operations are traditionally known as push and pop. |
||
The minimum fields in a queue head structure are a front pointer and a rear pointer. |
QUESTION 16
Which of the following statements about queues is true?
Queue insertion requires a search function and a delete function. |
||
Queues are a FIFO data structure. |
||
The queue header requires only a top; a common design also includes a node counter. |
||
Queue deletion takes place at the rear of the queue. |
||
Queues are usually implemented using arrays. |
QUESTION 17
Which of the following statements about stack deletion is false?
The deletion algorithm is traditionally referred to as pop. |
||
The deletion algorithm passes the deleted data to the calling function. |
||
After the node is deleted, its memory space is returned to the dynamic memory pool. |
||
Because data can be inserted and deleted only at the top, we don’t need to test for an empty stack. |
||
To logically delete a node, the top pointer is replaced with the link in the deleted node. |
QUESTION 18
Which of the following statements about stacks is false?
A stack is a linear list in which additions and deletions are restricted to the top. |
||
A stack is a LIFO data structure. |
||
Stack structures are usually implemented with a top pointer and a node counter. |
||
All stack nodes contain both data and next pointers. |
||
Stack insertion requires a search algorithm. |
QUESTION 19
Which of the following statements about stacks is false?
Stacks are LIFO data structures. |
||
Stack insertion is traditionally known as push; stack deletion as pop. |
||
Stacks are best implemented in arrays. |
||
Stacks cannot be traversed. |
||
Stacks do not require a search algorithm. |
QUESTION 20
Which of the following statements about trees is false?
Trees have their origins in the work of mathematician Gustav Kirchhoff. |
||
Tree applications range from artificial intelligence systems to efficient search algorithms for large, dynamic lists. |
||
The entry node in a tree is known as a leaf. |
||
Binary trees are implemented with two pointers, one to the left subtree and one to the right subtree. |
||
A tree is a hierarchical data structure. |
Solution:
11)
Graphs are a directed tree structure.
Explanation:
The given statement is false because the tree is a subset of a graph and a graph can be directed or undirected.
12)
Linked list searches are highly efficient searches.
Explanation:
No, in terms of the searching array will still perform better when the array is in sorted order then we can apply binary search algorithm to search for an element.
13)
Queues are usually implemented using a linked list structure.
Explanation:
Other data structures can also be used to implement a queue.
14)
If there is not enough room in memory for another node, the queue is in an overflow state.
Each node in a queue points to its predecessor.
15)
The basic queue operations are traditionally known as push and pop.
Explanation:
The basic queue operations enqueue and dequeue, push and pop are used for the stack data structures.
16)
Queues are a FIFO data structure.
17)
Because data can be inserted and deleted only at the top, we don’t need to test for an empty stack.
18)
Stack insertion requires a search algorithm.
19)
Stacks are best implemented in arrays.
20)
The entry node in a tree is known as a leaf.
Explanation:
Entry node is known as root
Hit the thumbs up if you liked the answer. :)