C949 Data Structures and Algorithms PreAssessment - Multiple Choice

D - Answer- Which statement describes a queue data structure? A.) It is a sequence of elements in which insertion and deletion takes place at one end. B.) It is a sequence of elements in which insertion and deletion takes place at both ends. C.) It is a sequence of elements in which insertion can take place anywhere in the sequence and deletion takes place only at the front. D.) It is a sequence of elements in which insertions can take place only at the back end and deletions can take place only at the front end. B - Answer- Which data structure allows inserting and deleting data elements at both the front and the rear? A.) Trees B.) Deques C.) Stacks D.) Queues C - Answer- Which data structure allows elements to be inserted and deleted from one end and provides no direct access to the other end? A.) List B.) Deque C.) Stack D.) Queue A - Answer- What are the official indexes for the list list01 given this declaration? int[ ] list01 = {0, 2, 4, 6, 8, 10}; A.) 0, 1, 2, 3, 4, 5 B.) 0, 2, 4, 6, 8, 10 C.) 1, 2, 3, 4, 5, 6 D.) 2, 4, 6, 8, 10, 12 A - Answer- Which abstract data type (ADT) has elements of the same type so that the elements can be retrieved based on the index or position? A.) List B.) Bag C.) Stack D.) Que