C949 wgu Samenvattingen, Aantekeningen en Examens

WGU C949 DATA STRUCTURES AND ALGORITHMS I OBJECTIVE ASSESSMENT EXAM 300 QUESTIONS AND CORRECT DETAILED ANSWERS WITH RATIONALES (VERIFIED ANSWERS) |AGRADE

Algorithm efficiency typically measured by the algorithm's computational complexity Computational complexity the amount of resources used by the algorithm. The most common resources considered are the runtime and memory usage. runtime complexity a function, T(N), that represents the number of constant time operations performed by the algorithm on an input of size N Space-complexity (of an algorithm) a function, S(N), that represents the number of fixed-size memory units...

Which statement describes a queue data structure? 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. What are the official indexes for the list list01 given this declaration? int[ ] list01 = {0, 2, 4, 6, 8, 10}; 0, 1, 2, 3, 4, 5 Which abstract data type (ADT) has elements of the same type so that the elements can be retrieved based on the index or position? List Which category of data do...

Which statement describes a queue data structure? - Answer- 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. What are the official indexes for the list list01 given this declaration? int[ ] list01 = {0, 2, 4, 6, 8, 10}; - Answer- 0, 1, 2, 3, 4, 5 Which abstract data type (ADT) has elements of the same type so that the elements can be retrieved based on the index or position? - Answer- List Which cate...

inserting a new item at the beginning it causes no shift to the data what is an advantage of a linked list over an array?n N In the worst case, inserting a new node into a tree with N nodes requires how many comparisons? reference count A _____________is an integer counter that represents how many variables reference an object. When an object's reference count is 0, that object is no longer referenced. Branching directs a program to execute either one group of st...

inserting a new item at the beginning it causes no shift to the data - Answer- what is an advantage of a linked list over an array?n N - Answer- In the worst case, inserting a new node into a tree with N nodes requires how many comparisons? reference count - Answer- A _____________is an integer counter that represents how many variables reference an object. When an object's reference count is 0, that object is no longer referenced. Branching - Answer- directs a program to execute eithe...

Which statement describes a queue data structure? - Answer- 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. What are the official indexes for the list list01 given this declaration? int[ ] list01 = {0, 2, 4, 6, 8, 10}; - Answer- 0, 1, 2, 3, 4, 5 Which abstract data type (ADT) has elements of the same type so that the elements can be retrieved based on the index or position? - Answer- List Which cate...

inserting a new item at the beginning it causes no shift to the data - Answer- what is an advantage of a linked list over an array?n N - Answer- In the worst case, inserting a new node into a tree with N nodes requires how many comparisons? reference count - Answer- A _____________is an integer counter that represents how many variables reference an object. When an object's reference count is 0, that object is no longer referenced. Branching - Answer- directs a program to execute eithe...