1) What is the Big O runtime of the addLast() method of a Singly Linked List, when the list has a tail reference? a) O(1) b) O(logn) c) O(n^2) d) None of these answers. e) O(n) 2) Why does retrieving a value from an array have a runtime of O(1)? (Select all that reasons that make this possible.) a) Arrays use simple math calculations to compute the requested index location. b) Arrays have to search through all the data to find the requested value. c) Arrays are allocated consecutive blocks of memory. d) None of these answers. 3) How can the size() method of a Dynamic List be implement such that its big O runtime is O(1)? a) By keeping track of the size as a data field whose value is updated its with each successful insertion and deletion. b) By counting and returning the number of all non-null values in the internal array. c) Simply returning the length of the internal array. d) None of these answers.
1) What is the Big O runtime of the addLast() method of a Singly Linked List, when the list has a tail reference? a) O(1) b) O(logn) c) O(n^2) d) None of these answers. e) O(n) 2) Why does retrieving a value from an array have a runtime of O(1)? (Select all that reasons that make this possible.) a) Arrays use simple math calculations to compute the requested index location. b) Arrays have to search through all the data to find the requested value. c) Arrays are allocated consecutive blocks of memory. d) None of these answers. 3) How can the size() method of a Dynamic List be implement such that its big O runtime is O(1)? a) By keeping track of the size as a data field whose value is updated its with each successful insertion and deletion. b) By counting and returning the number of all non-null values in the internal array. c) Simply returning the length of the internal array. d) None of these answers.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Concept explainers
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
Question
1) What is the Big O runtime of the addLast() method of a Singly Linked List, when the list has a tail reference?
a) O(1)
b) O(logn)
c) O(n^2)
d) None of these answers.
e) O(n)
2) Why does retrieving a value from an array have a runtime of O(1)? (Select all that reasons that make this possible.)
a) Arrays use simple math calculations to compute the requested index location.
b) Arrays have to search through all the data to find the requested value.
c) Arrays are allocated consecutive blocks of memory.
d) None of these answers.
3) How can the size() method of a Dynamic List be implement such that its big O runtime is O(1)?
a) By keeping track of the size as a data field whose value is updated its with each successful insertion and deletion.
b) By counting and returning the number of all non-null values in the internal array.
c) Simply returning the length of the internal array.
d) None of these answers.
4) Which of the following statements are true about ADTs (abstract data types). (Select all true statements.)
a) They are a way to model data structures.
b) They are a high level view of data structures.
c) ADTs show the specific implementation details of each method.
d) "Abstract Data Type" is just another term we use for Abstract Classes.
e) None of these answers.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education