Data Structures & Algorithms

Transcription

1 A 1. What are the basic components of a linked list? A. Head and tail are the only important components B. Data members for the information to be stored and a link to the next item C. Generic class because without this linked list is not possible 2. What is a node used for in a linked list? A. To store the information and the link to the next item B. To check for the end of the list C. Not used in a linked list 3. A linked list class is defined with the following heading. public class UnorderedLinkedList<T> extends LinkedListClass<T> What is the proper syntax for creating an reference variable of the linked list to hold strings? A. LinkedListClass list; B. UnorderedLinkedList list; C. List = UnorderedLinkedList(String) 4. In addition to the info and link components, the linked list must also contain what other components? A. Sorting information about the list B. Head and tail pointers to the first and last nodes C. The current node that was last accessed 5. What is the proper code for accessing the information of the second item in a linked list? A. Head.info B. Head.link.info C. Head.link.link.info

2 A02 1. Given the fixed size of an array is not important, which class is more efficient at storing and retrieving information? A. A linked list because of the nodes B. An array because of the reduced code and efficient storage allocation C. Neither is more efficient over the other 2. What does the following fragment of code do with a linked list? current = head; while (current!= null) { current = current.link; } A. It initializes the list B. It counts the number of items in the list C. It traverses the list 3. Which of the following code fragements properly inserts 50 into the linked list at position after node p? A) newnode = new Node(); newnode.info = 50; p.link = newnode; newnode.link = p.link; B) newnode = new Node(50, p); C) newnopde = new Node(); newnode.info = 50; newnode.link = p.link; p.link = newnode; A. Code A B. Code B C. Code C D. Code B and C 4. Internally, a linked list is implemented with an array for the storage of the information? A. True B. False 5. A linked list is different from an array, because why? A. A linked list can handle more types of information than an array B. An array cannot be sorted but a linked list can be C. An array is fixed in size but a linked list is dynamically sizable

3 B 1. A linked list must contain a maximum size component to manage the last item? A. True B. False 2. What does ADT stand for? A. Automatic Data Template B. Anonomous Data Template C. Abstract Data Type 3. What is the purpose of using an ADT for the linked list class? A. To unnecessarily complicate the design B. Using an abstract data type is the only method for building linked lists C. To force a specific set of methods to be used for the subclasses 4. What does the following function do for a given Linked List with first node as head? void fun1(struct node* head) { if(head == NULL) return; fun1(head->next); cout<<head->data; } A. Prints all nodes of linked lists B. Prints all nodes of linked list in reverse order C. Prints alternate nodes of Linked List D. Prints alternate nodes in reverse order 5. Consider the following linked list What will be the value of following statement? Circle the node. start->next->next->next->data

4 B02 1. What value does function mystery return when called with a value of 4? A. 0 B. 1 C. 4 D. 24 int mystery ( int number ) { if ( number <= 1 ) return 1; else return number * mystery( number 1 ); } 2. What should the default constructor of the LinkedListClass perform? A. Nothing since the LinkedListNode class will take care of initialization B. Initialize the first and last (or head and tail) and set count to zero C. Initialize the array to store the information in the linked list 3. In general, linked lists allow: A. Insertions and removals anywhere. B. Insertions and removals only at one end. C. Insertions at the back and removals from the front. D. None of the above. 4. The code: LinkedList mylink; defines: A. A linked list B. A reference to a linked list C. A null pointer 5. If start is pointing to first node of the linked list then consider the following statement - start = start->next; current = start->next; What will be the value of address field of current? A B C D. 2184

5 C WRITE THE CODE FOR THE PROGRAMS 1. Using the array below, find the value on its 10 TH index. You are allowed to use loop ? Answer int n = 10; count << (2 pow n) + 1

6 C02 WRITE THE CODE FOR THE PROGRAMS 1. Using the array below, find the value on its 10 TH index. You are allowed to use loop ? Answer int n = 10; count << (2 * n) + 3