Question

QUESTION 1

1. In a tree, a ____ is a node with successor nodes.

   		root
   		child
   		descendent
   		parent
   		sibling

QUESTION 2

1. In a tree, the ____ is a measure of the distance from a node to the root.

   		count
   		degree
   		branch
   		height
   		level

QUESTION 3

1. Which of the following is not a characteristic of a binary search tree?

   		Each node has zero, one, or two successors.
   		The preorder traversal processes the node first, then the left subtree, and then the right subtree.
   		There are only six possible tree traversals.
   		Data are processed in key sequence when the tree is traversed using an inorder traversal.
   		The key of all nodes on the left subtree are greater than or equal to the key of the node.

QUESTION 4

1. Which of the following is not a characteristic of a general linear list?

   		Insertions and deletions can be done anywhere in the list.
   		An empty linear list is identified by a null link pointer.
   		A linked list must always have a head pointer.
   		For programming efficiency, a linked list may have a last-node pointer.
   		One basic operation required to maintain a linear list is a search.

QUESTION 5

1. Which of the following is not a step in inserting a node in a stack?

   		Allocate memory for the new node.
   		Search for the insertion location.
   		Update the top pointer.
   		Update the stack counter if implemented.

QUESTION 6

1. Which of the following is not a step in inserting a node into a linear list?

   		Allocate memory for the new node.
   		Determine the insertion point for the new node.
   		Set the new nodes link pointer to NULL.
   		Point the new node to its successor.
   		Point the predecessor to the new node.

QUESTION 7

1. Which of the following is not a step in queue deletion?

   		Search queue for data to be deleted.
   		Pass data from deleted node back to calling function.
   		Set front pointer to next item in queue.
   		Subtract one from queue counter if implemented.
   		If queue empty, set rear pointer to null.

QUESTION 8

1. Which of the following is not required in general-list insertion?

   		Insert into an empty list.
   		Insert at the beginning of the list.
   		Insert at the end of the list.
   		Insert a duplicate key.
   		Insert in the middle of the list.

QUESTION 9

1. Which of the following statements about general-list searches and traversals is false?

   		Searches must be done using a sequential search algorithm.
   		General list traversals start at the beginning and process each node until the last node has been processed.
   		The link field in the current node is used to determine which node is processed next.
   		The search algorithm uses a predecessor pointer.
   		The end of the search is identified by a null link node.

QUESTION 10

1. Which of the following statements about graph traversal is false?

   		Depth-first traversal of a graph requires a stack or a recursive algorithm.
   		The breadth-first traversal of a graph requires a queue.
   		A depth-first traversal processes the graph data in key sequence order.
   		Because a vertex can have multiple parents, logic is requires to ensure that each vertex is processed only once.
   		All traversals start at the first vertex of the graph.

Answer 1

(As per guildelines I am answering first 4 parts only)

Answer 1.

In a tree, Parent is a node with successor nodes.

Answer 2.

In a tree, level is measure of distance from node to root.

Answer 3.

option 1 is true, as a binary can have 0, 1 or 2 children only.

option 2 is true, the inorder traversal follows, root node first, left subtree, right subtree

option 4 is true, inorder travesal gives either increasing or decreasing order always.

option 5 is true, in binary tree , in every left subtree root is always greater or equal to its children.

Hence option 3 is false, we have only three type of tree travesal possible- inorder, preorder and postorder.

Answer 4.

Linear list is dynamic data structure, just like an array we can perform insertion and deletion at any position.

Option 1 is correct, as linear list is similar to array, so insertion and deletion can be done at any position.

option 2 is true, if list is empty it has null reference.

option 3 is true, a linked must have head pointer as a starting reference.

option 5 is true, search operation is performed on linear, it means we need traversal of list to maintain.

option 4 is false, we cannot ask directly for the last node pointer in linked list, it has to be traversed from strating node.