Test my Merit My Results Create Exam

Higher Study | Programming and Data Structure | Linked List

Which one of the following is not correct when we define either a class that does not implement either a mathematical entity like a matrix or a complex number or a low level type such as linked list?
Consider a single linked list where F and L are pointers to the first and last elements respectively of the linked list. The time for performing which of the given operations depends on the length of the linked list ?
Consider a singly linked list of the form where F is a pointer to the first element in the linked list and L is the pointer to the last element in the list. The time of which of the following operations depends on the length of the list?
A queue is implemented using a non-circular singly linked list. The queue has a head pointer and a tail pointer, as shown in the figure. Let n denote the number of nodes in the queue. Let enqueue be implemented by inserting a new node at the head, and dequeue be implemented by deletion of a node from the tail. Which one of the following is the time complexity of the most time-efficient implementation of enqueue and dequeue, respectively, for this data structure?
Following declaration of an array of struct, assumes size of byte, short, int and long are 1, 2, 3 and 4 respectively. Alignment rule stipulates that n-type field must be located at an address divisible by n. the fields in a struct are not rearranged, padding is used to ensure alignment. All elements of array should be of same size. Struct complx                 Short s                 Byte b                 Long l                 Int i End complx Complx C[10] Assuming C is located at an address divisible by 8, what is the total size of C, in bytes?
N items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is provided to the record on which the operation is to be performed. An algorithm performs the following operations on the list in this order: Θ(N) delete, O(log N) insert, O(log N) find, and Θ(N) decrease-key. What is the time complexity of all these operations put together?
Consider the problem of reversing a singly linked list. To take an example, given the linked list below, the reversed linked list should look like Which one of the following statements is TRUE about the time complexity of algorithms that solve the above problem in O(1) space?
Which type of linked list stores the address of the header node in the next field of the last node ? 
Which of the following is the correct declaration of linked list?
Which among the following is a unconditional control structure 
Ads