Brainscape's Knowledge GenomeTM


Top Flashcards (Certified)
All Flashcards

Advanced Programming > Mid-Term > Flashcards

Mid-Term Flashcards

(82 cards)

Start Studying
1
Q

What is an activation record?

A

An object that represents a method invocation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is a doubly linked list?

A

A linked list in which each mode has references to both the next node and the previous node in the list.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is a linked list?

A

A linked structure in which one object refers to the next, creating a linear ordering.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is a linked structure?

A

A data structure that uses object reference variables to create links between objects.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is a node?

A

A class that represents a single element in a linked structure.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is a program stack?

A

A stack of activation records used to keep track of method invocations during program execution.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is a sentinel node?

A

A node at the front or end of a linked list that serves as a marker and does not represent an element in the list.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

How do object references help us define data structures?

A

An object reference can be used as a link from one object to another. A group of linked objects can form a data structure, such as a linked list, on which a collection can be based.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Compare and contrast a linked list and an array.

A

A linked list has no capacity limitations, whereas an array does. However, arrays provide direct access to elements using indexes, whereas a linked list must be traversed one element at a time to reach a particular point in the list.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What special case exists when managing linked lists?

A

The primary special case in linked-list processing occurs when dealing with the first element in the list. A special reference variable is maintained that specifies the first element in the list. If that element is deleted, or if a new element is added in front of it, the FRONT reference must be carefully maintained.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Why should a linked list node be separate from the element stored on the list?

A

It is unreasonable to assume that every object that we may want to put in a collection can be designed to cooperate with the collection implementation. Furthermore, the implementation details are supposed to be kept distinct from the user of the collection, including the elements that the user chooses to add to the collection.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What do the “LinkedStack<T>" and "ArrayStack<T>" classes have in common?</T></T>

A

These classes implement the “StackADT<T>" interface. This means that they both represent a stack collection, providing the necessary operations needed to us a stack. Although they both have distinct approaches to managing the collection, they are functionally interchangeable from the user's point of view.</T>

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What would be the time complexity of the push operation if we chose to push at the end of the list instead of the front?

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is the difference between a doubly linked list and a singly linked list?

A

A singly linked list maintains a reference to the first element in the list and then a “next” reference from each node to the following node in the list. A doubly linked list maintains two references: “front” and “rear”. Each node in the doubly linked list stores both a “next” and a “previous” reference.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What impact would the use of sentinel nodes or dummy nodes have on a doubly linked list implementation?

A

It would take two dummy records in a doubly linked list, one at the front and one at the rear, to eliminate the special cases when dealing with the first and last nodes.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What are the advantages of using a linked implementation as opposed to an array implementation?

A

A linked implementation allocates space only as it is needed and has a theoretical limit on the size of the hardware.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

what are the advantages of using an array implementation as opposed to a linked implementation?

A

An array implementation uses less space per object since it only has to store the object and not an extra pointer. However, the array implementation will allocate much more space than it needs initially.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

what are the advantages of the “java.util.Stack” implementation of a stack?

A

It’s implementation is an extension of the “Vector” class, it can keep track of the positions of elements in the stack using an index and thus does not require each node to store and additional pointer. This implementation also allocates space only as it is needed, like the linked list implementation.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

What is the potential problem with the “java.util.Stack”?

A

It’s implementation is an extension of the “Vector” class and thus inherits a large number of operations that violate the basic assumption of a stack.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

What is a Caesar cipher?

A

A simple message encoding technique in which letters are shifted along the alphabet by a constant amount.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

What is a circular array?

A

An array that is treated as circular, meaning that incrementing the last index value in the array wraps around back to the first element.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

What does a dequeue do?

A

Removes an element from the front of the queue.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

What does an enqueue do?

A

Adds and element to the rear of the queue.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

What if FIFO?

A

First In First Out, a description of a collection in which the first element added will be the first element removed.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
What is a queue?
A linear collection whose elements are added on one end and removed from the other.
26
What is a repeating key?
A list of integer values used to shift letters by varying amounts in an improved version of a Caesar cipher.
27
what is the difference between a queue and a stack?
A queue is a FIFO collection, whereas a stack is a last in, first out (LIFO) collection.
28
What are the five basic operations on a queue?
enqueue - adds an element to the end of the queue dequeue - removes an element from the front of the queue first - returns a reference to the element at the front of the queue isEmpty - returns true if the queue is empty, returns false otherwise
29
What are some of the other operations that might be implemented for a queue?
makeEmpty() destroy() full()
30
Is it possible for the "head" and "tail" references in a linked implementation to be equal?
Yes, it happens when the queue is empty (both "head" and "tail" are null) and when there is only one element on the queue.
31
Is it possible for the "front" and "rear" references in a circular array implementation to be equal?
Yes, it can happen under two circumstances: when the queue is empty and the when the queue is full.
32
Which implementation has the worst time complexity?
The noncircular array implementation with and O(n) "dequeue" or "enqueue" operation has the worst time complexity.
33
Which implementation has the worst space complexity?
Both of the array implementations waste space for unfilled elements in the array. The linked implementation uses more space per element stored.
34
What is an indexed list?
A list whose elements can be referenced using a numeric index.
35
What is the Josephus problem?
A classic computing problem whose goal is to find the order in which elements are selected from a list by taking every inth element cyclically until none remains.
36
What is an ordered list?
A list whose elements are ordered in terms of some inherent characteristic of the elements.
37
What is erialization?
A technique for representing an object as a stream of binary digits, which allows objects to be read and written from files with their state maintained.
38
What is an unordered list?
A list whose elements have no inherent order but are ordered by their placement in the list.
39
What is the difference between and index list, and ordered list, and an unordered list?
An indexed list is a collection of objects with no inherent order that are ordered by index value. An ordered list is a collection of objects ordered by value. An unordered list is a collection of objects with no inherent order
40
What are the basic methods for accessing and indexed list?
One of three ways: Access a particular index position Access the ends Access and object in the list by value
41
what are the additional operations required of implementations that are part of the java Collections API framework?
All Java Collections API framework classes implement the "Collections" interface, the "Serializable" interface, and the "Cloneable" interface.
42
What are the trade-offs in space complexity between an ArrayList and a LinkedList?
The linked implementation requires more space per object to be inserted in the list simply because of the space allocated for the references. Keep in mind that the LinkedList class is actually a doubly linked list and thus requires twice as much space for references. the ArrayList class is more efficient at managing space because ArrayList collections are resizable and thus can dynamically allocate space as needed. Therefore there need not be a large amount of wasted space allocated all at once. Rather, the list can grow as needed.
43
What are the trade-offs in time complexity between and ArrayList and a LinkedList?
The major difference between the two is access to a particular index position of the list. The ArrayList implementation can access any element of the list in the same amount of time if the index value is known. the LInkedlist implementation requires the list to be traversed from one end or the other to reach a particular index position.
44
what is the time complexity of the "contains" operation and the "find" operation for both implementations?
The "contains" and "find" operations for both implementations are O(n) because they are simply linear searches.
45
Why is the time to increase the capacity of the array on an "add" operation considered negligible for the ArrayList implementation?
Averaged over the total number of insertions into the list, the time to enlarge the array has little effect on the total time.
46
What is a circular array implementation not as attractive as an implementation for a list as it was for a queue?
The circular array implementation of a queue improved the efficiency of the dequeue operation from O(n) to O(1) because it eliminated the need to shift elements in the array. That is not the case for a list because we can add or remove elements anywhere in the list, not just at the front or the rear.
47
What is a binary search?
A search that occurs on a sorted list and in which each comparison eliminates approximately half of the remaining viable candidates.
48
What is a bubble sort?
A sorting algorithm that sorts elements by repeatedly comparing adjacent values and swapping them.
49
What is a class method?
A method that is invoded through the calss name and that cannot refer to instance data. Also called a static method.
50
What is a generic method?
A method that includes the definition of a type parameter in the header of the method.
51
What is insertion sort?
A sorting algorithm that sorts elements by repetitively inserting a particular element into a previously sorted sublist.
52
What is a linear search?
A search that begins at one end of a list of items and continues linearly until the element is found or the end of the end of the list is reached.
53
What is a logarithmic algorithm?
An algorithm that has a time complexity of O(log2n), such as a binary search.
54
What is a logarithmic sort?
A sorting algorithm that requires approximately nlog2n comparisons to sort n elements.
55
What is merge sort?
A sorting algorithm that sorts elements by recursively dividing the list in half until each sublist has one element and then merges the sublists.
56
What is a partition in reference to sorting?
An element used by the quick sort algorithm to separate unsorted elements into two distinct partitions.
57
What is a partition element?
An element used by the quick sort algorithm to separate unsorted elements into two distinct partitions.
58
What is quick sort?
A sorting algorithm that sorts elements by partitioning the unsorted elements into two partitions and then recursively sorting each partition.
59
What is radix sort?
A sorting algorithm that sorts elements using a sort key instead of directly comparing elements.
60
What is searching?
the process of finding a designated target element within a group of elements or determining that the target is not in the group.
61
What is a search pool?
A group of items to be seardched.
62
What is selection sort?
A sorting algorithm that sorts elements by repetitively finding a particular element and putting git in its final position.
63
What is sequential sort?
A sorting algorithm that typically uses nested loops and requires approximately n^2 comparisons to sort n elements.
64
What is sorting?
the process of arranging a group of items into a particular order based on some criterion.
65
What is a static method?
A method that is invoked through the class name and that cannot refer to instance data. Also called a class method.
66
What is a target element?
the element that is being sought during a search oeprtaion.
67
What are viable candidates?
The elements in a search pool amoung which the target element may still be found.
68
When would a linear search be preferable to the logarithmic search?
A linear search would be preferable for relatively small, unsorted lists and in languages where recursion is not supported.
69
which searching method requires that the list be sorted?
Binary search
70
When would a sequential sort be preferable to a recursive sort?
A sequential sort would be preferable for relatively small data sets and in languages where recursion is not supported.
71
The insertion sort algorithm sorts using what technique?
The insertion sort algorithm sorts a list of values by repetitively insertinga particular value into a subset of the list that has already been sorted.
72
The bubble sort algorithm sorts using what technique?
The bubble sort algorithm sorts a list by repeatedly comparing adjacent elements in the list and swapping their positions if they are not already in order.
73
The selection sort algorithm sorts using what technique?
The selection sort algorithm, which is an O(n^2) sort algorithm, sorts a list of values by repetitively putting a particular value into its final sorted position.
74
The quick sort algorithm sorts using what technique?
The quick sort algorithm sorts a list by partitioning the list using an arbitrarily chosen partition element and then recursively sorting the sublists on either side of the partition element.
75
The merge sort algorithm sorts using what technique?
The merge sort algorithm sorts a list by recursively dividing the list in half until each sublist has one element and then recombining these sublists in order.
76
It woudlHow many queues would it take to use a radix sort to sort names stored as all lowercase?
It would require 27 queues, one for each of the 226 letters in the alphabet and one to store the whole list before, during, and after sorting.
77
What advantages can be gained by using "Comparator" objects instead of the natural ordering of objects?
The use of Comparator objects provides flexibility by providing multiple ways to sort a set of objects. Each "comparator" defines a unique set of criteria for the sort.
78
In regards to heaps, what is complete?
A balanced tree in which all of the leaves at level h (the lowest level of the tree) on the left side of the tree.
79
What is a heap?
A binary tree that is complete and is either a minheap or a maxheap.
80
What is a maxheap?
A binary tree with two added properties: It is a complete tree and for each node, the node is greater than or equal to both the left child and the right child.
81
What is a minheap?
A binary tree with two added properties: It is a complete tree and for each node, the node is less than or equal to both the left child and the right child.
82
What is a priority queue?
A collection that follows two ordering rules: Items with higher priority go first, and items with the same priority are ordered in accordance with the first in first out principle.

Advanced Programming (1 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2025 Bold Learning Solutions. Terms and Conditions