• 2022-06-04
    Consider an implementation of unsorted singly linked list. Suppose it has representation which a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time?(I). Insertion at the front of the linked list.(II). Insertion at the end of the linked list.(III). Deletion of the front node of the linked list.(IV). Deletion of the last node of the linked list.
    A: I, II, and IV
    B: I and II
    C: I, II, and III
    D: I and III
  • B,D

    内容

    • 0

      Which<br/>of the following operations is performed more efficiently by doubly<br/>linked list than by linear linked list? () A: Deleting<br/>a node whose location is given B: Searching<br/>an unsorted list for a given item C: Inserting<br/>a node after the node with a given location D: Traversing<br/>the list to process each node

    • 1

      Which of the following are features of an effective coding system? A: i), ii) and iii) B: i), ii), iii) and iv) C: i), iii) and iv) D: ii) and iv)

    • 2

      单选题 The () is a pointer that identifies the next element in the linked list. A: link B: node C: array D: a or b

    • 3

      Factory overhead can be absorbed by which of the following methods? (i) Machine hours (ii) direct labor hours (iii) unit quantity (ii) (iv) as a percentage of direct labor cost A: (i) ,(ii) ,(iii), (iv) B: Only (i) & (ii) C: Only (ii) & (iii)‍ D: only (i) ,(ii) & (iii)

    • 4

      若通过List<br/>list = new List(); 创建的列表框,如何获得该列表框中当前选中的列表项(<br/>)。 A: list.getSelectedIndex() B: list. getSelectedItem( ) C: list. getItem (i) D: list. select (i)