Karteikarten
Data Structures review 1
Karten in diesem Stapel (15)
- 1How is a [non-circular], doubly-linked list different from a circular, doubly-linked list (which is true for a non-circular list)?The "next" of tail node is null, and the "previous" of the head node is null
- 2What term is used to describe a O(n^2) algorithm?quadratic
- 3Which of the following would be the Big-O function for the function (5x^2 + 4x^4 + 3)?O(x^4)
- 4For which of the following structures can a binary search be used?sorted- array-based lists
- 5How is a [circular], double-linked list different from a non-circular, doubly-linked list (which is true for a circular list)?The "next" of tail node points to the head node and the "previous" of the head node points to the tail node
- 6Which of the following describe a difference between a queue and a stack:Queue modify both ends of the structure; stacks only modify one
- 7Consider the following code segment where "n" was passed in as a parameter. for( int i = n; i >= 1; i = i / 2){ Sysout(i); } Which best characterizes the runing time of this code segment? (Big O)O(log n)
- 8When comparing the equations shown below, some equations will give you relatively larger values for smaller input values. However, as values of n become large enough, which of the following will give you the smallest value?20000*log2(n)
- 9Given an unsorted list of items, the selection sort algorithm complexity for [the number of assignments] (memory moves) is:O(n)
- 10Which of the following is NOT an example of empirical analysis?C^2 = A^2 + B^2 for all right triangles
- 11for( int i = 1; i <= 1; i++){ for( int j = n; j >= 1; j = j - 1){ Sysout(i + " " + j); } } Which best characterizes the running time of this code segment? (Big O)O(n^2)
- 12What term is used to describe a O(log n) algorithm?logarithmic
- 13If a SORTED, array based list has 1024 items, a [binary] search would take approximately how many comparison to do a search?10 (log n comparisons)
- 14The function ___ implies that the growth rate is exponential. g(n) = ?g(n) = 2^n
- 15In a [circular array] implementation of a Queue class, which operation would require linear time for the worst-case behavior?None of the operations require linear time.
Informationen
- Beschreibung
- Karteikarten am Data Structures review 1, erstellt von jshin13 am 09/03/2015.
- Erstellt von
- jshin13 · Mär 2015
- Aktualisiert
- 10 Sep 2016
- Aufrufe
- 4
- Bewertung