DSA21-Midterm-Reviewer.pdf

DSA21 – MIDTERM REVIEWER Prepared by: Dave Matthew Campillos Definition of Terms Data Structure Review 1. Doubly Linked List: It is a linked list in which every node has a next pointer and a back pointer. 2. Circular Linked List: A linked lis...

DSA21 – MIDTERM REVIEWER Prepared by: Dave Matthew Campillos Definition of Terms Data Structure Review 1. Doubly Linked List: It is a linked list in which every node has a next pointer and a back pointer. 2. Circular Linked List: A linked list in which the last node points to the first node. 3. Nodes: A linked list is a collection of components called ______. 4. Parallel: Two or more arrays are called ______________ if their corresponding components hold related information. 5. Two-dimensional Array: A collection of a fixed number of components arranged in rows and columns, wherein all components are of the same type. 6. Multidimensional Array: A collection of a fixed number of elements arranged in n- dimension. 7. One-dimensional Array: It is an array in which the components are arranged in a list form. 8. Data Structure: It deals with the study of methods, techniques, and tools to organize or structure data in computer memory. 9. Data Structure: It is the representation of the logical relationship between individual elements of data. 10. Primitive Data: These are defined that data can be manipulated or operated by the machine instruction. 11. Non-Primitive Data: Data structures that cannot be manipulated or operated directly by the machine instructions. 12. Linear Data Structure: Every data item is related to its previous and next data items. 13. Non-Linear Data Structure: Every data item attaches to many other data items in specific ways to reflect relationships. 14. Static Data Structure: It is a kind of data structure in which once memory space is allocated it cannot extend. 15. Dynamic Data Structure: It is another kind of data structure which can be extended or shrink during execution. 16. Abstract Data Type: It describes the data objects which constitute the data structure and the fundamental operations supported on them. 17. Array: It is a collection of the same type of data items which are stored in consecutive memory locations under a common name. 18. Stack: It is a collection of elements into which new elements may be inserted and from which elements may be deleted from the top of the stack. 19. Queue: It is a homogeneous collection of elements in which deletions can take place only at the front end, known as dequeue, and insertions can take place only at the rear end, known as enqueue. 20. Linked List: It is an ordered collection of finite homogeneous data elements called nodes where the linear order is maintained by means of links or pointers. 21. Posteriori Analysis: It means “from the latter”. The actual amount of space and time taken by the algorithms are recorded during execution. 22. Apriori Analysis: It means “from the earlier”. It is on a theoretical basis, independent of programming languages and machine structures. Part II. Binary to Decimal Conversion GUIDELINES: 1 - ON | 0 - OFF Read (compute) from right to left Link -> Link = 3000 3. Head -> Info = 75 4. Head -> Link -> Link -> Link = NULL 5. Head -> Link -> Link -> Info = 85 Part V. Defining the value of the given Circular Linked list diagram. 1. p_node -> Link -> Info = 31 2. head -> link -> link -> link -> info = 27 3. p_node -> info = 29 4. p_node -> link -> link -> link -> link -> link = 1100 5. head -> link -> link -> link -> info = 27