Deck 29: Data Structures and Generic Collections

Question 1

A stack is a __________ data structure.

A)FILO
B)FOLI
C)LOFI
D)LIFO

Answer 1

D

Question 2

A linked list is particularly useful when the number of data elements to be represented in the data structure is unpredictable.

Answer 2

True

Question 3

Queue nodes are removed only from the __________ of the queue,and are inserted only at the __________ of the queue.

A)tail,tail
B)tail,head
C)head,tail
D)head,head

Answer 3

C

Question 4

Nodes in a linked list are stored contiguously in actual memory.

Question 5

A doubly linked list allows traversals both forward and backward.

Question 6

Which statement is false?

A)A linked list is a linear collection of self-referential class objects called nodes.
B)A linked list is appropriate when the number of data elements to be represented in the data structure is unpredictable.
C)The System.LL namespace contains class LinkedList.
D)By convention,the link reference in the last node of a list is set to Nothing.

Question 7

A node can include references to objects only from the same class.

Question 8

Which of the following correctly describes a queue data structure?

A)first-in,last-out
B)first-in,first-out
C)last-in,first-out
D)None of the above.

Question 9

A program execution stack contains the space created for local variables on each invocation of a method during a program's execution.

Question 10

Stack methods Peek and Pop basically do the same thing.

Question 11

The link member at the bottom of the stack is commonly set to Nothing to indicate the bottom of the stack.

Question 12

Compilers use stacks to evaluate arithmetic expressions and to generate machine language code to process the expressions.

Question 13

Which statement is false?

A)When a method call is made,the called method must know how to return to its caller,so the return address is pushed onto the program execution stack.
B)Stacks support recursive method calls in the same manner as conventional,nonrecursive method calls.
C)The program execution stack contains the space created for a method's global variables on each invocation of that method during a program's execution.
D)When a method returns to its caller,the memory for that method's local variables is popped off the stack and those variables are no longer known to the program.

Question 14

A stack can be thought of as a constrained linked list.

Question 15

A new object in a linked list must be inserted at the end of the list.

Question 16

A linked list does not provide the advantage of immediate access to an object
in the way that a conventional array does.

Question 17

Which is not a typical queue app?

A)Routing packets in a computer network
B)File server handling file access requests from many clients
C)High-speed sorting
D)Print spooling

Question 18

A node can contain any data type.

Question 19

In a circular linked list,each node is connected to every other node.

Question 20

The primary operations to manipulate a stack are:

A)put,pull
B)push,top
C)push,pop
D)push,pull

Question 21

Which of the following is not a property of LinkedListNode?

A)Value
B)Reference
C)Previous
D)Next

Question 22

Which statement is false?

A)The shape of a binary search tree that corresponds to a set of data can vary,depending on the order in which the values are inserted into the tree.
B)A node can be inserted at any point in a binary search tree.
C)The process of creating a binary search tree actually sorts the data,and thus this process is often called a binary tree sort.
D)The binary search tree facilitates duplicate elimination.

Question 23

When using the collection classes,___________.

A)you can code faster
B)you expect excellent performance and maximize execution speed
C)you expect efficient memory utilization
D)All of the above

Question 24

A leaf node's child reference refers to its parent,to indicate the end of the tree.

Question 25

Storing everything as Objects in a collection provides a performance boost.

Question 26

The LinkedList class provided by Visual Basic is a doubly-linked list.

Question 27

A ______ tree is a tree whose nodes each contain two links.

A)dynamic
B)double linked
C)subtree
D)binary

Question 28

Prepackaged data-structure classes provided by the .NET Framework are called ___________.

A)DS classes
B)data classes
C)collection classes
D)data structural classes

Question 29

To make a regular numbered binary tree more robust and polymorphic,programmers should manipulate objects comparisons through the IComparable interface.

Question 30

Stacks and queues can be implemented as constrained versions of linked lists.

Question 31

The .NET Framework provides only one namespace dedicated to collections.

Question 32

To determine the number of elements in a List use the property ________.

A)Size
B)Count
C)Capacity
D)Items

Question 33

Like linked lists,stacks,and queues,trees are also linear data structures.

Question 34

Which statement is false?

A)In a tightly packed binary tree,each level contains about twice as many elements as the previous level.
B)When searching a tightly packed 1,000,000-element binary search tree,a maximum of approximately 40 comparisons needs to be made.
C)The level-order traversal of a binary tree visits the nodes of the tree row-by-row starting at the root node level.
D)Searching a binary tree for a value that matches a key value is slow for loosely packed trees compared to tightly packed trees.

Question 35

All collection classes in the .NET Framework implement some combination of collection interfaces.

Question 36

A binary search tree facilitates duplicate elimination.

Question 37

To place a new item in a List at a specific index use the method ________.

A)Add
B)Insert
C)IndexOf
D)InsertAt

Question 38

FIFO stands for First-In-Fastest-Out.

Question 39

A queue is similar to a real-world waiting line.

Question 40

Which statement about trees is false?

A)A tree is a nonlinear,two-dimensional data structure.
B)Each node in a tree must contain two links.
C)The children of a node are called siblings.
D)A node with no children is called a leaf node.

Question 41

When a method is called,the compiler tries to find a method that matches the _________ of the method call.

A)name
B)argument types
C)return type
D)a and b
E)All of the above

Question 42

When two different keys "hash into" the same cell in an array,this is known as a ________.

A)error
B)collision
C)problem
D)crash

Question 43

When converting a key into an array subscript,the hash number has a great deal of information about the object.

Question 44

Generic methods are often used to perform similar operations on different types of data.

Question 45

Any value can be stored as an Object.

Question 46

A ____________ performs a calculation that determines where to place data in the hash table.

A)converter
B)hash function
C)calculator
D)definition

Question 47

The generic class SortedDictionary takes two type arguments: the first is _______ and the second is ________.

A)the type of value,the type of key
B)the type of key,the type of value
C)the type of the lookup,the type of key
D)the type of value,the type of the lookup

Question 48

Which statement is false?

A)Each type parameter list contains one or more type parameters,separated by commas.
B)A type parameter name needs to be unique among different generic methods.
C)The type parameters act as placeholders for the types of the arguments passed to a method.
D)The type parameter names throughout the method declaration must match those declared in the type parameter list.

Question 49

Generics make writing a program more __________.

A)elegant
B)cumbersome
C)concise
D)a and c

Question 50

When the compiler encounters a method call,it attempts to locate a method declaration that has the same signature as in the method call.

Question 51

The load factor affects the performance of hashing schemes.As this value gets higher,the chance of collisions tends to increase.

Question 52

One LinkedListNode can be a member of more than one LinkedList.

Question 53

Generics provide __________ that allows the compiler to catch invalid.

A)compile-time type safety
B)compile-time exception check
C)compile-time error check
D)run-time type safety

Question 54

Generics provide run-time type safety.

Question 55

A _______ is the general term for a collection of key-value pairs.

A)book
B)glossary
C)dictionary
D)lexicon

Question 56

All generic method declarations have a type parameter section delimited by __________.

A)curly brackets { and }
B)angle brackets < and >
C)square brackets [ and ]
D)parentheses ( and )

Question 57

Most classes that are used as keys in a hash table should override the GetHashCode to provide one that performs efficient hash code calculations for a specific type.

Question 58

SortedDictionary uses a hash table to store its key-value pairs.

Question 59

The class of the key in a SortedDictionary must implement the IComparable interface to sort the keys correctly.

Question 60

__________ enable you to specify,with a single class declaration,a set of related classes.

A)Overloaded classes
B)Overridden classes
C)Generic classes
D)Generics

Question 61

Which of the following is not a type constraint of Visual Basic?

A)class
B)interface
C)reference
D)constructor
E)None of the above

Question 62

The ________ clause specifies the type constraint for type parameter T.

A)As
B)Constraint
C)Where
D)Cnst

Question 63

A class can provide two or more generic methods that specify the same method name but with different number of method parameters and/or type parameters.

Question 64

If there is a constructor restraint,the type argument's class must provide a default constructor.

Question 65

A ________ provides a means for describing a class in a type-independent manner.

A)subclass
B)generic class
C)concrete class
D)parameterized class

Question 66

A generic method's body is declared differently than that of any other method.

Question 67

A generic method can be overloaded by ________ method.

A)a non-generic method
B)generic method
C)a and b
D)None of the above

Question 68

A generic method _______ be overloaded.

A)may
B)may not
C)must
D)depends on the method's functionality

Question 69

Once you have a generic class,you must use a hard,complex notation to indicate the actual type that should be used in place of the class's type parameter(s).

Question 70

During a method call,a compiler generates an error only when there are no matching methods.

Question 71

At compilation time,the runtime system replaces type parameters with the arguments' types.

Question 72

The constraints determine the operations that can be performed on the type parameters.

Question 73

As with generic methods,the type parameter list of a generic is separated by __________.

A)curly braces { }
B)parenthesis ( )
C)angle brackets < >
D)commas ,

Question 74

Generic methods can also be overloaded by non-generic methods that have the same method name and the same or different number of method parameters.

Question 75

Type parameters _____________.

A)are identifiers that are used in place of actual type names
B)can be used to declare the return type
C)act as placeholders for the types of the argument passed to the generic method
D)All of the above

Question 76

Type constraint restricts the type of the argument supplied to a particular type parameter.

Question 77

You can use explicit type arguments to indicate the exact type that should be used to call a generic function.Ex: (Of Integer)