Question 1

A stack is a __________ data structure.
A)FILO
B)FOLI
C)LOFI
D)LIFO

Accepted Answer

A stack is a LIFO (Last In First Out) data structure, meaning that the last element added to the stack is the first one to be removed. This concept is often visualized as a literal stack of objects where the top object added is the one that can be accessed or removed first.

Question 2

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

Accepted Answer

A linked list allows for the easy addition and removal of elements without needing to allocate a fixed amount of memory beforehand, making it a flexible option for unpredictable data sizes.

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

Accepted Answer

Queue operations follow the First-In-First-Out (FIFO) principle, meaning elements are added at the tail and removed from the head.

Question 4

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

Accepted Answer

The nodes of a linked list are not stored contiguously in memory;they are logically contiguous through the references that each node contains to the nodes before and after it.

Question 5

A doubly linked list allows traversals both forward and backward.

Accepted Answer

A doubly linked list consists of nodes that contain both a reference to the next node and a reference to the previous node, allowing for traversals in both directions.

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.

Accepted Answer

The correct namespace for the LinkedList class in .NET is System.Collections.Generic, not System.LL.

Question 7

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

Accepted Answer

Nodes can also include references from other classes.

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.

Accepted Answer

Queue follows the First-In, First-Out (FIFO) principle, where the element that is added first will be removed first. This is also known as a linear data structure.Option A and C describe Stack data structure, which is First-In-Last-Out (FILO) and Last-In-First-Out (LIFO), respectively. Therefore, option B is the correct answer.

Question 9

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

Accepted Answer

The program execution stack does indeed contain the space created for local variables on each invocation of a method during program execution.

Question 10

Stack methods Peek and Pop basically do the same thing.

Accepted Answer

Peek returns the value of the top stack element but does not remove that element from the stack.

Question 11

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

Accepted Answer

This statement is true. In many programming languages, setting the link member of the bottommost node in a stack to Nothing or null is a common convention to indicate the end of the stack.

Question 12

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

Accepted Answer

Compilers use stacks to evaluate arithmetic expressions and store intermediate results during code generation.

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.

Accepted Answer

Option A is true as the return address is pushed onto the program execution stack when a method call is made. 
Option B is true as stacks support both recursive and nonrecursive method calls. 
Option D is true as when a method returns to its caller, the memory for that method's local variables is popped off the stack.

Option C is false because the program execution stack only contains the space created for a method's local variables on each invocation of that method during a program's execution, not global variables. Global variables are stored in a separate memory location known as the heap.

Question 14

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

Accepted Answer

This is true because a stack follows the Last-In-First-Out (LIFO) principle, where items can only be added or removed from the top of the stack. Similarly, a linked list has nodes linked in a linear manner, but a stack adds the constraint that new items can only be added or removed from the front.

Question 15

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

Accepted Answer

An object can be inserted anywhere in a linked list by resetting the

Question 16

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

Accepted Answer

A linked list requires traversing through each element in order to access a particular object, which can take time proportional to the length of the list. In contrast, a conventional array allows for direct access to any object by using its index.

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

Accepted Answer

Routing packets in a computer network, File server handling file access requests from many clients, and Print spooling are all common examples of queue applications. High-speed sorting, on the other hand, may involve queuing as part of the process, but it is not typically referred to as a queue app.

Question 18

A node can contain any data type.

Accepted Answer

A node can contain any data type, including integers, strings, booleans, arrays, objects, or even other nodes.

Question 19

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

Accepted Answer

In a circular linked list,each node points to the next and the last node points back to the first node.

Question 20

The primary operations to manipulate a stack are:
A)put,pull
B)push,top
C)push,pop
D)push,pull

Accepted Answer

The two primary operations to manipulate a stack are pushing elements onto the stack (using push) and removing elements from the top of the stack (using pop). Therefore, the correct choice is C) push, pop.

Quiz 29: Data Structures and Generic Collections

A stack is a __________ data structure.

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

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