Upgrade to remove ads
Only $35.99/year

CSE12 Quiz 3

Terms in this set (178)

The efficiency of the Linked-List based Stack push function is big-O of:
O(1)
The efficiency of the Linked-List based Stack pop function is big-O of:
O(1)
The efficiency of the Linked-List based Stack top function is big-O of:
O(1)
The efficiency of the Linked-List based insert function to insert at the beginning of the list is big-O of
O(1)
The efficiency of the Linked-List based remove function to remove from the beginning of the list is big-O of
O(1)
The efficiency of the Linked-List based view function to view at the beginning of the list is big-O of
O(1)
The efficiency of the Linked-List based view function to view at a selected position in the list is big-O of
O(n)
The efficiency of the Linked-List based remove function to remove at a selected position in the list is big-O of
O(n)
The efficiency of the Linked-List based insert function to insert at a selected position in the list is big-O of
O(n)
The efficiency of the Linked-List based insert function to insert at the end of the list is big-O of
O(1)
The efficiency of the Linked-List based remove function to remove at the end of the list is big-O of
O(1)
The efficiency of the Linked-List based view function to view at the end of the list is big-O of
O(1)
In using a polymorphic generic container, the container changes its behavior based on i
The item it holds
When using polymorphic generic containers, an object _______ when inserted into a container.
loses its identity
When using polymorphic generic containers, an object _______ when removed from the container.
regains its identity
T or F:When using a polymorphic generic container, the container can manipulate objects only when knowing the types of those objects.
False
T or F:When using a polymorphic generic container, the container can manipulate objects without knowing the types of those objects.
True
T or F:The array based Stack of hw3 is an example of a polymorphic generic container
False
T or F:The calculator of hw4 is an example of a polymorphic generic container.
False
T or F:The List of hw5 is an example of a polymorphic generic container.
True
T or F:The linked-list based Stack of hw5 is an example of a polymorphic generic container.
True
T or F:The MyRec of hw5 is an example of a polymorphic generic container.
False
T or F: Any object can be inserted in a polymorphic generic container without any restrictions placed on that object.
False
Any object can be inserted in a polymorphic generic container only when the object satisfies certain constraints.
True
In a linked list, how many Nodes are needed to store an item in the list?
One node holds one item
T or F: A linked list is a container object made up of 0 or more Nodes.
True
In a linked list, which direction does the pre pointer point?
backwards
In a linked list, which direction does the next pointer point?
forwards
When using a non-circular singly linked list, what is the value of the next pointer in the Node at the end of the list?
NULL
When using a non-circular doubly linked list, what is the value of the next pointer in the Node at the end of the list?
NULL
When using a non-circular doubly linked list, what is the value of the pre pointer in the Node at the front of the list?
NULL
When using a circular doubly linked list, what is the value of the next pointer in the Node at the end of the list?
Node at the Front
When using a circular doubly linked list, what is the value of the pre pointer in the Node at the front of the list?
End Node
How many NULL pointers are there in a singly linked list with three elements?
1
How many NULL pointers are there in a doubly linked list with three elements?
2
How many NULL pointers are there in a circular doubly linked list with three elements?
0
T or F: When inserting into a doubly linked circular list, the code to insert at the front, end or anywhere in the list is achieved with the same lines of code.
True
T or F: When removing from a doubly linked circular list, the code to remove from the front, end or anywhere in the list is achieved with the same lines of code.
True
T or F:When inserting into a doubly linked circular list at the front or at the end of the list, insertion is done between the same two nodes
True
T or F: When inserting into a doubly linked circular list, the code to insert at the front, end or anywhere in the list is achieved with three distinct sets of lines of code.
False
T or F: When removing from a doubly linked circular list, the code to remove from the front, end or anywhere in the list is achieved through three distinct sets of lines of code.
False
T or F: When drawing linked lists, an arrow that points to the bottom of the Node really points to the data field of that Node.
False
T or F: When drawing linked lists, an arrow that points to the side of the Node really points to the middle field of that Node.
False
T or F: When drawing linked lists, an arrow that points to the top of the Node really points to the upper left corner of that Node
True
T or F: When drawing linked lists, all arrows that point to the any part of the same Node really point to the upper left corner of that Node
True
In our linked list of hw5, in what section of memory are all Nodes allocated?
Heap
In our linked list of hw5, in what section of memory are all List objects allocated?
Heap
In our linked list of hw5, in what section of memory are all objects stored in the list allocated?
Heap
T or F: In our linked list of hw5, the Node objects are all nameless allocated at locations in memory accessible only by starting with a named pointer.
True
In our linked list of hw5, list the two conditions either one of which indicates that the list is empty.
Front pointer points to Null
Occupancy == 0
What is the best one word to describe a list where all insertions and removals occur at the front of the list?
Stack
What is the best one word to describe a list where all insertions and removals occur at the end of the list?
Stack
What is the best one word to describe a list where all insertions occur at the end of the list and removals occur at the front of the list?
Queue
In our linked list of hw5, the data is stored using____
Void pointers
In our linked list of hw5, the manipulations are achieved through____
function pointers
What are the four specific manipulations possible on the items stored in our hw5 list?
Copy_fun
deallocate
write
is_greater_than
In inserting 10 items into the list of hw5 through driver1, how many different pointers to MyRec elements are passed to List's insert method?
10
In inserting 10 items into the list of hw5 through driver2, how many different pointers to MyRec elements are passed to List's insert method?
0
When inserting a MyRec into the list of hw5 through driver1, where is that MyRec object in memory?
Heap
When inserting a MyRec into the list of hw5 through driver2, where is that MyRec object in memory?
RTS
In hw5, which of driver1 or driver2 uses a reusable MyRec object allocated on the Run-Time Stack?
driver2
The MyRec object structure definition of hw5 was created with what two design goals mentioned in class?
Simple
Representative of any future object
What are the four constraint methods of MyRec in hw5?
copy_MyRec
delete_MyRec
is_greater_than_MyRec
write_MyRec
Which of the four constraint methods of MyRec in hw5 was not found in both driver1 and driver2?
copy_func
Name of method of MyRec in hw5 that was not a constraint method?
New_MyRec
List the 5 layers of the driver code for hw5 in order from outermost to innermost.
Driver
Stack
List
Node
Data Layer
When the list of hw5 is working correctly, what differences does the user see when running driver1 and driver2?
None
If a user runs driver2, inserts 5 items, and when displayed, the last item inserted is displayed 5 times, what is the likely cause?
Not copying the data- storing the original pointer
Which is a better test case to test your calc of hw4: A
A. 1+2 B. 1+1 C. Neither one is better
A
T or F: One arrow in the drawing of a linked list is achieved through one line of code in your program.
True
When insert_Node's Node pointer parameter is NULL, what does that imply about the item being inserted into the list in hw5?
It is the first one
What is the purpose of the MyRec object in hw5?
To test the list
What is the purpose of the MyRec methods in hw5?
To test the list
T or F. The MyRec methods of hw5 have void pointer parameters so these methods can be called passing in objects of different types.
False; to conform
For the void pointer parameter of MyRec methods of hw5, when will a MyRec pointer be passed to a MyRec method using that parameter:
A. Always B. Never C. Sometimes
A
What is the one method of MyRec from hw5 that is not called polymorphicaly
New_MyRec
In what three areas in the code for hw5 are the constraint methods determined?
new_stack
new_list
list definition
Describe the first lines of code in all constraint methods in hw5.
Declare a local variable and cast it to the true type that it really is
T or F: When called from the List or Node code in hw5, when a constraint method is called, it is called polymorphicly
True
T or F: When called from the driver1 or driver 2 code in hw5, when a constraint method is called, it is called polymorphicly.
False
T or F: When delete_Node is called is called from remove_Node, it should delete both the Node and the data it holds.
False
T or F: When delete_Node is called is called from remove_Node, it should delete the Node but not the data it holds.
True
T or F: When delete_Node is called is called from remove_Node, it should delete only the data it holds, but not the Node.
False
What are the two ways that delete_Node can be called such that the data it holds won't be deleted?
Set delete function to null
Set data pointer to null
T or F: Since the parameter to delete_MyRec is a void pointer, it will only deallocate the data but won't set the originating pointer to NULL.
False
Coding delete_List for hw5, which approach will execute more code, a loop of calls to : A. remove_List B. delete_Node. C. No difference.
A
In a test case of inserting 1 to 5 at the front and 6-10 at the end of the list, what is the best word to describe seeing the list displayed?
Familiar
What is the name of the design pattern used in hw5 when the linked-list based Stack was implemented via one line methods calling List methods to perform the underlying implementation?
Facade
What is the best word to describe the algorithm used by each method of the linked-list based Stack of hw5?
Delegation
To implement a Queue container using the linked-list of hw5, items are inserted at the ____ of the list and are removed at the ___.
End, Front
To implement a Stack container using the linked-list of hw5, items are inserted at the ____ of the list and are removed at the ___.
Front, End
Considering a tiered or layered design, Stack methods called ____ methods, and Stack methods were called by _____ methods.
List ,Driver
Considering a tiered or layered design, List methods called ____ methods, and List methods were called by ____ methods.
Node, Stack
Considering a tiered or layered design, Node methods called ____ methods, and Node methods were called by ____ methods.
My_Rec, List
Not considering validity checks or other error checking, write the one line of linked list based Stack code to implement Push assuming Pop removes from the FRONT of the List.
insert(this_list, item, FRONT);
Not considering validity checks or other error checking, write the one line of linked list based Stack code to implement Pop assuming Push inserts at the FRONT of the List.
remove(this_list, FRONT);
Not considering validity checks or other error checking, write the one line of linked list based Stack code to implement Top assuming Push inserts at the FRONT of the List.
view(this_list, FRONT);
Not considering validity checks or other error checking, write the one line of linked list based Stack code to implement Push assuming Pop removes from the END of the List.
insert(this_list, item, END);
Not considering validity checks or other error checking, write the one line of linked list based Stack code to implement Pop assuming Push inserts at the END of the List.
remove(this_list, END);
Not considering validity checks or other error checking, write the one line of linked list based Stack code to implement Top assuming Push inserts at the END of the List.
view(this_list, END);
What is the name of the first parameter to most Stack methods of hw5?
this_Stack
What is the name of the first parameter to most List methods of hw5?
this_List
What is the name of the first parameter to most Node methods of hw5?
this_Node
T or F: a struct in C defines an object containing only data fields and is similar to a class without methods in Java or C++.
True
Considering the line of code:
this_node->data=(copy_func) ? (*copy_func) (element) : element;
What was needed to store the item allocated by main?
copy_func needed to be 0
Considering the line of code:
this_node->data=(copy_func) ? (*copy_func) (element) : element;
What was needed to store an item allocated by the List/Node?
copy_func needed to have a value
T or F: If calling delete_Node from delete_List, the caller wants to delete both the Node and the data.
True
T or F: If calling delete_Node from delete_List, the caller wants to delete the Node but not the data.
False
T or F: If calling delete_Node from delete_List, the caller wants to delete the data but not the Node.
False
Considering the line of code: if (delete_func && (*npp)->data)
(delete_func) (&((npp)->data));
List one condition that results in the data not being deleted.
Passing 0 for the delete_func
In the algorithm discussed in class for inserting a Node before the parameter Node in insert_Node of hw5, the first two lines of code attached the Node to the List. What did the next two lines of code do?
Integrate the node onto the list
In the algorithm discussed in class for inserting a Node before the parameter Node in insert_Node of hw5, what did the first two lines of code do?
Attach
When calling free, is the caller giving up access to or authority to access memory or both?
Giving up Authority
When assigning a pointer to null, is the caller giving up access to or authority to access memory or both?
Giving up Access
In your calculator of hw4, what is the best word to describe the character that decin will "unget"?
Non-Digit
In your intopost code of hw4, the values pushed to a stack originate from what two functions?
Decin and setUpWord
The arrow operator in C and C++ is formed from what two symbols?
dash and a greater than ->
If you have a pointer called "stup" that points to a Student object, in one line write the code to assign its "number" data field to 123;
stup->number = 123;
Rewrite the following line of code using preferred syntax:
(*pointer).field = 0;
pointer->field = 0;
Rewrite the following line of code using preferred syntax:
(&object)->field = 0;
object.field = 0;
Considering a tiered or layered design, each method need to work based on its ________ and ______ values.
Paramaters, Return
T or F: Considering a tier or layered design, methods of outer tiers are called by methods of inner tiers
False
T or F: Considering a tier or layered design, methods of inner tiers are called by methods of outer tiers.
True
T or F: Assuming the below is from correctly compiling code, the following code in Java creates a Student object:
void someMethod () { Student stu; }
False
T or F: Assuming the below is from correctly compiling code, the following code in C creates a Student object:
void someMethod () { Student stu; }
True
In the line, "typedef newtype oldtype;" what is the name of the type being defined?
oldtype
In the following code, is the "tag" mandatory or optional?

typedef struct Student { char name[20]; int number; } Student;
optional (no pointer)
In the following code, is the "tag" mandatory or optional?

typedef struct Student { char name[20]; int number; struct Student * stup;} Student;
mandatory (pointer is present)
The efficiency of the HashTable to insert in an empty or nearly empty table is big-O of:
O(1)
The efficiency of the HashTable to lookup in an empty or nearly empty table is big-O of:
O(1)
The efficiency of the HashTable to insert in a nearly full table is big-O of:
O(n)
The efficiency of the HashTable to lookup in a nearly full table is big-O of
O(n)
T or F: The UCSDStudent of hw6 is an example of a polymorphic generic container.
False
T or F: The HashTable of hw6 is an example of a polymorphic generic container.
True
T or F: The Variable of hw6 is an example of a polymorphic generic container.
False
T or F: The SymTab of hw6 is an example of a polymorphic generic container.
True
Considering the main idea of a hash table, where is an item inserted?
Where it belongs
Considering the main idea of a hash table, where do you search for an item?
Where you expect to find it
T or F: Hash Tables are often array based.
True
What is the one word to best describe the number that represents the size of a HashTable?
Prime
T or F: Hash Tables sizes are often prime so that each space is reachable.
True
What is the word in English to describe the field of an object that is known regardless of whether the operation is lookup or insert?
Key field
In a typical database, which is the more common operation, insert or lookup?
Lookup
In your HashTable of hw6, what is the formula for determining the index of the first location for an item?
Sum of ASCII % table size
In your HashTable of hw6, what is the formula for determining the increment step for an item?
(Sum of ASCII % (table size-1) +1)
In your HashTable of hw6, what is the formula for determining the next location for an item?
(current_index + increment) % table size
What is the hashing term for the sum of the ASCII codes for the name of an object to insert in the table?
Hash Value
What is the hashing term for the list of array indices used to search for an location for an item?
Probe Sequence
Assume a hash table size of 5, what is the probe sequence for an item with an ASCII sum of 122?
20314
Assume a hash table size of 5, what is the probe sequence for an item with an original location of 3 and an increment of 3?
31420
1. 3
2. (3+3) % 5 = 1
3. (1+3) % 5 = 4
4. (4+3) % 5 = 2
5. (2+3) % 5 = 0
For the case of duplicate insertion in a hash table, how should the programmer decide how duplicates should be processed?
Look at the application
If inserting into a fair share hash table, if Raul at his first choice is already in the same location that Sean as his second choice wants, who gets the space?
Sean
If inserting into a fair share hash table, if Sean at his second choice is already in the same location that Raul wants as his first choice, who gets the space?
Sean
If searching for Gary in a fair share hash table at his first choice, Raul is in the location searched at this first choice. From only that comparison, can you determine that Gary is in the table? A. Gary not there. B. Gary there. C. Cant Determine
C
If searching for Gary in a fair share table at this first choice, Sean is in the location searched at his third choice. From only that comparison, can you determine that Gary is in the table?A. Gary not there. B. Gary there. C. Cant Determine
C
If searching for Gary in a fair share hash table, null is in the location searched. From only that comparison, can you determine that Gary is in the table? A. Gary not there. B. Gary there. C. Can't determine.
A
In your hw6 Locate code in C++, assuming "element" is the Base pointer parameter, write the code to determine the hash value:
long hash value = *element
In your hw6 C++ Locate code, assuming "element" is the Base pointer parameter, write the code check if table[index] holds a matching item:
table[index] == element
T or F: In your hash table code for hw6, the probe sequence is not stored but is instead the values of "index" as hashing loop executes.
True
T or F: The Fair Share algorithm is an example of Ordered Hashing
True
T or F: The Fair Share algorithm is not an example of Ordered Hashing
False
T or F: When using the Fair Share hashing algorithm, an unsuccessful search ends either at an empty space or at an item with a probeCount smaller than the current item has been searching.
True
T or F: When using the Fair Share hashing algorithm, an unsuccessful search ends either at an empty space or at an item with a probeCount larger than the current item has been searching.
False
As we did in class, draw two non-detailed drawings of inserting into a circular linked list. One drawing inserts at the front and the other drawing inserts at the end.
[Look at Image]
The efficiency of the Stack push function is big-O of:
1
The efficiency of the Stack pop function is big-O of:
1
The efficiency of the Stack top function is big-O of:
1
If there are 0 instances of a class, how many instances are there of one of its static data fields?
1
If there are 1000 instances of a class, how many instances are there of one of its static data fields? 1
1
A static method is one called without
object
Is a static data field part of the "sizeof" an object?
NO
Is a static data field allocated in adjacent memory to objects of that class?
NO
In C, a static method not inside a class is one that can be called by what other methods?
Any method below its declaration
What is the value of xyz at the end of the fifth execution of the following function?
void func() {static int xyz = 10; xyz++;}
15
What is the value of xyz at the end of the fifth execution of the following function?
void func() {int xyz = 10; xyz++;} 11
11
In C and C++, unless otherwise initialized, what is the initial value of all static variables?
Zero
Can static methods be accessed by name outside the file in which they are declared?
No
T or F: An object should be responsible for changing its own data.
True
Sets found in the same folder