Question 1

A queue can naturally represent a real-life waiting line.

Accepted Answer

A) True 
 B)False  True

Question 2

A queue is a __________ data structure.

Accepted Answer

A)  FOFI 
B)  FIFO 
C)  OFIF 
D)  IFOF 
A)  FOFI 
B)  FIFO 
C)  OFIF 
D)  IFOF B

Question 3

A stack is a __________ data structure.

Accepted Answer

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

Question 4

A doubly linked list can be traversed both forwards and backwards.

Accepted Answer

A) True 
 B)False

Question 5

Which statement is false

Accepted Answer

A)  Linked lists are collections of data items "lined up in a row," insertions and deletions can be made anywhere in a linked list. 
B)  Insertions and deletions are made only at one end of a stack, its top. 
C)  Insertions and deletions are made only at one end of a queue, its tail. 
D)  Binary trees facilitate high-speed searching and sorting of data. 
A)  Linked lists are collections of data items "lined up in a row," insertions and deletions can be made anywhere in a linked list. 
B)  Insertions and deletions are made only at one end of a stack, its top. 
C)  Insertions and deletions are made only at one end of a queue, its tail. 
D)  Binary trees facilitate high-speed searching and sorting of data.

Question 6

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

Accepted Answer

A) True 
 B)False

Question 7

An array is a dynamic data structure.

Accepted Answer

A) True 
 B)False

Question 8

Which statement is false

Accepted Answer

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. 
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 9

If no memory is available,new throws an OutOfMemoryException.

Accepted Answer

A) True 
 B)False

Question 10

Which statement about trees is false

Accepted Answer

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

Question 11

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

Accepted Answer

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

Question 12

Unboxing can be either implicit or explicit.

Accepted Answer

A) True 
 B)False

Question 13

The insert and remove operations for a queue are known as dequeue and enqueue,respectively.

Accepted Answer

A) True 
 B)False

Question 14

Which statement is false

Accepted Answer

A)  A linked list is a linear collection of self-referential class objects called nodes connected by reference links. 
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 null to mark the end of the list. 
A)  A linked list is a linear collection of self-referential class objects called nodes connected by reference links. 
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 null to mark the end of the list.

Question 15

Which is not a typical application of queues

Accepted Answer

A)  Routing packets in a computer network 
B)  File server handling file access requests from many clients 
C)  High-speed sorting 
D)  Print spooling 
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 16

Which statement is false

Accepted Answer

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 20 comparisons need 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 tightly packed trees. 
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 20 comparisons need 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 tightly packed trees.

Question 17

Usually a _________ indicates to a program the end of a data structure.

Accepted Answer

A)  backslash character 
B)  forward slash character 
C)  null reference 
D)  null pointer 
A)  backslash character 
B)  forward slash character 
C)  null reference 
D)  null pointer

Question 18

An IsEmpty method you write to test whether a linked list is empty is called a __________ method.

Accepted Answer

A)  predefined 
B)  predicate 
C)  preemption 
D)  preorder 
A)  predefined 
B)  predicate 
C)  preemption 
D)  preorder

Question 19

Typecasting anything that's not an object into an object is known as _________.

Accepted Answer

A)  unboxing 
B)  converting 
C)  wrapping 
D)  boxing 
A)  unboxing 
B)  converting 
C)  wrapping 
D)  boxing

Question 20

Boxing can be either implicit or explicit.

Accepted Answer

A) True 
 B)False

Exam 19: Data Structures

A queue can naturally represent a real-life waiting line.

A queue is a __________ data structure.

A stack is a __________ data structure.

A doubly linked list can be traversed both forwards and backwards.

Which statement is false

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

An array is a dynamic data structure.

Which statement is false

If no memory is available,new throws an OutOfMemoryException.

Which statement about trees is false

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

Unboxing can be either implicit or explicit.

The insert and remove operations for a queue are known as dequeue and enqueue,respectively.

Which statement is false

Which is not a typical application of queues

Which statement is false

Usually a _________ indicates to a program the end of a data structure.

An IsEmpty method you write to test whether a linked list is empty is called a __________ method.

Typecasting anything that's not an object into an object is known as _________.

Boxing can be either implicit or explicit.

Introduction to Computers, the Internet and Visual C#

Dive Into Visual Studio Community

Introduction to C# Apps

Introduction to Classes,Objects,Methods and Strings

Control Statements: Part 1

Control Statements: Part 2

Methods: a Deeper Look

Arrays;Introduction to Exception Handling

Introduction to Linq and Generic Collections

Classes and Objects: A Deeper Look

Object-Oriented Programming: Inheritance

Object-Oriented Programming: Polymorphism

Exception Handling: A Deeper Look

GUI With Windows Forms: Part 1

GUI With Windows Forms: Part 2

Strings,Characters and Regular Expressions

Files and Streams

Searching and Sorting

Generics

Collections

Databases and LING

Asynchronous Programming With Async and Await

XML

GUI With Windows Presentation Foundation

Filters

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