Finding the specific node\'schidoein F S. Which is the swhether the specifie nod

Question

Finding the specific node'schidoein F S. Which is the swhether the specifie node is leaf or not Foreif parent node 9. For the undirected graph f s the advantage of the pareets adjacent matrix, then the ma C/Finding the specific node's parent modees nodes Finding the specific nodes s brothers nodes DJudging whether the specifie G with n vertices, it it is represented by the size is od, which operation is easy to implement? which B Judge if the node is on the same level D Find the node position according to its value 10. If the binary tree Casored by the sequential A Preorder traversalB C Hievachical traversal 9 I Answer area II True or False ( 10 POINTS) . Abstractive data type is not re data type is not related to repres and deletion efficiency is lower for sequential storage, so it is worse than linked st entation and implementation in computer; lower Sequential storage is only used for Every node in linear list has one precu In the tree structure, there is one 3. 4. s. 6. There is at least one there is one precursor node for every node. the degree the directed loe node with the degree 2 in the n (n>2) nodes binary tree 8. If one directed sum of vertices in-degree equals to that of out-degree graph's adjacent matrix is symmetric, then it must be complete directed graph. with the degree m, there is at least one node with the degree m, and no no m degree over m. II Answer area , there is sibling relationship among every nodes in the same level. 2 9 Answer (70 POINTS) fine an integer array X[71[4]15], the first element address is 100. (10 points) e number of elements in the array X(7)14)15]? integer occupies 4 bytes. Then calculat

Explanation / Answer

1. Abstractive datatype is not related to representation and implementation in computer .

Abstract data type (ADT) is a numerical model for data types, where a data type is defined by its actions. It is basically a theoretical concept used in design and analysis of algorithm. It do not correspond to specific feature. So we can consider the statement true.

2. The insertion and deletion efficiency is lower for sequential storage so it is worse for linked storage

True, because It is difficult to maintain physical sequential order as records are inserted and deleted. Deletion can be managed with the pointer chains. Insertion poses problems if no space where new record should go. If space, use it, else put new record in an overflow block. Often arrays are preferred over linked lists in a lot of performance-critical fields for reasons that don't relate to algorithmic complexity.

3. Sequential storage is only used for linear structure.

True, because a group of data in a memory array or a disk file or on magnetic tape data storage is accessed in a predetermined, ordered sequence. Sequential access is sometimes the only way of accessing the data, for example if it is on a tape. It may also be the access method of choice.

4. Every node in linear list has one precursor and successor.

True, elements of the table lined up, reflecting the logical characteristics of one to one i.e. each element has only one precursor and one successor. These storage structures can infer all remaining nodes in the case of knowing only one of the node addresses in the linked list .But still does not support random access.

5.In the tree structure, there is one precursor node for every node.

Every node N in a binary tree T except the root has a unique parent called the precursor of N. If we don’t consider the root node then its true.

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.